979 resultados para Morse decompositions


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Koopman et al. (2014) developed a method to consistently decompose gross exports in value-added terms that accommodate infinite repercussions of international and inter-sector transactions. This provides a better understanding of trade in value added in global value chains than does the conventional gross exports method, which is affected by double-counting problems. However, the new framework is based on monetary input--output (IO) tables and cannot distinguish prices from quantities; thus, it is unable to consider financial adjustments through the exchange market. In this paper, we propose a framework based on a physical IO system, characterized by its linear programming equivalent that can clarify the various complexities relevant to the existing indicators and is proved to be consistent with Koopman's results when the physical decompositions are evaluated in monetary terms. While international monetary tables are typically described in current U.S. dollars, the physical framework can elucidate the impact of price adjustments through the exchange market. An iterative procedure to calculate the exchange rates is proposed, and we also show that the physical framework is also convenient for considering indicators associated with greenhouse gas (GHG) emissions.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The appearance of radix-$2^{2}$ was a milestone in the design of pipelined FFT hardware architectures. Later, radix-$2^{2}$ was extended to radix-$2^{k}$ . However, radix-$2^{k}$ was only proposed for single-path delay feedback (SDF) architectures, but not for feedforward ones, also called multi-path delay commutator (MDC). This paper presents the radix-$2^{k}$ feedforward (MDC) FFT architectures. In feedforward architectures radix-$2^{k}$ can be used for any number of parallel samples which is a power of two. Furthermore, both decimation in frequency (DIF) and decimation in time (DIT) decompositions can be used. In addition to this, the designs can achieve very high throughputs, which makes them suitable for the most demanding applications. Indeed, the proposed radix-$2^{k}$ feedforward architectures require fewer hardware resources than parallel feedback ones, also called multi-path delay feedback (MDF), when several samples in parallel must be processed. As a result, the proposed radix-$2^{k}$ feedforward architectures not only offer an attractive solution for current applications, but also open up a new research line on feedforward structures.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Applications that operate on meshes are very popular in High Performance Computing (HPC) environments. In the past, many techniques have been developed in order to optimize the memory accesses for these datasets. Different loop transformations and domain decompositions are com- monly used for structured meshes. However, unstructured grids are more challenging. The memory accesses, based on the mesh connectivity, do not map well to the usual lin- ear memory model. This work presents a method to improve the memory performance which is suitable for HPC codes that operate on meshes. We develop a method to adjust the sequence in which the data are used inside the algorithm, by means of traversing and sorting the mesh. This sorted mesh can be transferred sequentially to the lower memory levels and allows for minimum data transfer requirements. The method also reduces the lower memory requirements dra- matically: up to 63% of the L1 cache misses are removed in a traditional cache system. We have obtained speedups of up to 2.58 on memory operations as measured in a general- purpose CPU. An improvement is also observed with se- quential access memories, where we have observed reduc- tions of up to 99% in the required low-level memory size.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Quizás el Código Morse, inventado en 1838 para su uso en la telegrafía, es uno de los primeros ejemplos de la utilización práctica de la compresión de datos [1], donde las letras más comunes del alfabeto son codificadas con códigos más cortos que las demás. A partir de 1940 y tras el desarrollo de la teoría de la información y la creación de los primeros ordenadores, la compresión de la información ha sido un reto constante y fundamental entre los campos de trabajo de investigadores de todo tipo. Cuanto mayor es nuestra comprensión sobre el significado de la información, mayor es nuestro éxito comprimiéndola. En el caso de la información multimedia, su naturaleza permite la compresión con pérdidas, alcanzando así cotas de compresión imposibles para los algoritmos sin pérdidas. Estos “recientes” algoritmos con pérdidas han estado mayoritariamente basados en transformación de la información al dominio de la frecuencia y en la eliminación de parte de la información en dicho dominio. Transformar al dominio de la frecuencia posee ventajas pero también involucra unos costes computacionales inevitables. Esta tesis presenta un nuevo algoritmo de compresión multimedia llamado “LHE” (Logarithmical Hopping Encoding) que no requiere transformación al dominio de la frecuencia, sino que trabaja en el dominio del espacio. Esto lo convierte en un algoritmo lineal de reducida complejidad computacional. Los resultados del algoritmo son prometedores, superando al estándar JPEG en calidad y velocidad. Para ello el algoritmo utiliza como base la respuesta fisiológica del ojo humano ante el estímulo luminoso. El ojo, al igual que el resto de los sentidos, responde al logaritmo de la señal de acuerdo a la ley de Weber. El algoritmo se compone de varias etapas. Una de ellas es la medición de la “Relevancia Perceptual”, una nueva métrica que nos va a permitir medir la relevancia que tiene la información en la mente del sujeto y en base a la misma, degradar en mayor o menor medida su contenido, a través de lo que he llamado “sub-muestreado elástico”. La etapa de sub-muestreado elástico constituye una nueva técnica sin precedentes en el tratamiento digital de imágenes. Permite tomar más o menos muestras en diferentes áreas de una imagen en función de su relevancia perceptual. En esta tesis se dan los primeros pasos para la elaboración de lo que puede llegar a ser un nuevo formato estándar de compresión multimedia (imagen, video y audio) libre de patentes y de alto rendimiento tanto en velocidad como en calidad. ABSTRACT The Morse code, invented in 1838 for use in telegraphy, is one of the first examples of the practical use of data compression [1], where the most common letters of the alphabet are coded shorter than the rest of codes. From 1940 and after the development of the theory of information and the creation of the first computers, compression of information has been a constant and fundamental challenge among any type of researchers. The greater our understanding of the meaning of information, the greater our success at compressing. In the case of multimedia information, its nature allows lossy compression, reaching impossible compression rates compared with lossless algorithms. These "recent" lossy algorithms have been mainly based on information transformation to frequency domain and elimination of some of the information in that domain. Transforming the frequency domain has advantages but also involves inevitable computational costs. This thesis introduces a new multimedia compression algorithm called "LHE" (logarithmical Hopping Encoding) that does not require transformation to frequency domain, but works in the space domain. This feature makes LHE a linear algorithm of reduced computational complexity. The results of the algorithm are promising, outperforming the JPEG standard in quality and speed. The basis of the algorithm is the physiological response of the human eye to the light stimulus. The eye, like other senses, responds to the logarithm of the signal according with Weber law. The algorithm consists of several stages. One is the measurement of "perceptual relevance," a new metric that will allow us to measure the relevance of information in the subject's mind and based on it; degrade accordingly their contents, through what I have called "elastic downsampling". Elastic downsampling stage is an unprecedented new technique in digital image processing. It lets take more or less samples in different areas of an image based on their perceptual relevance. This thesis introduces the first steps for the development of what may become a new standard multimedia compression format (image, video and audio) free of patents and high performance in both speed and quality.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Tendo como pano de fundo a confessionalidade da rede adventista de educação presente de maneira marcante no espaço escolar e a intensa diversidade religiosa discente, esta pesquisa analisa a relação de possíveis tensões entre a confessionalidade escolar e a diversidade religiosa presente neste espaço. Leva em consideração o processo de modernidade causadora de importantes transformações na educação, na religião e na forma dos dois institutos se relacionarem. Levou-se em consideração o perfil socioeconômico e religioso dos alunos e possíveis tensões na recepção do religioso no espaço escolar adventista por parte dos discentes, inclusive por aqueles que se declaram adventistas. O espaço escolhido para esta pesquisa foi o de colégios adventistas localizadas no contexto do ABCD Paulista, que ofertam o Ensino Médio. Estas unidades escolares estão situadas nas cidades de Diadema, Santo André e São Caetano do Sul, cidades localizadas na mesma microrregião, mas com distintas realidades socioeconômicas

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The MDR1 P-glycoprotein (Pgp), a member of the ATP-binding cassette family of transporters, is a transmembrane ATPase efflux pump for various lipophilic compounds, including many anti-cancer drugs. mAb UIC2, reactive with the extracellular moiety of Pgp, inhibits Pgp-mediated efflux. UIC2 reactivity with Pgp was increased by the addition of several Pgp-transported compounds or ATP-depleting agents, and by mutational inactivation of both nucleotide-binding domains (NBDs) of Pgp. UIC2 binding to Pgp mutated in both NBDs was unaffected in the presence of Pgp transport substrates or in ATP-depleted cells, whereas the reactivities of the wild-type Pgp and Pgps mutated in a single NBD were increased by these treatments to the level of the double mutant. These results indicate the existence of different Pgp conformations associated with different stages of transport-associated ATP hydrolysis and suggest trapping in a transient conformation as a mechanism for antibody-mediated inhibition of Pgp.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

IFNγ, once called the macrophage-activating factor, stimulates many genes in macrophages, ultimately leading to the elicitation of innate immunity. IFNγ's functions depend on the activation of STAT1, which stimulates transcription of IFNγ-inducible genes through the GAS element. The IFN consensus sequence binding protein (icsbγ or IFN regulatory factor 8), encoding a transcription factor of the IFN regulatory factor family, is one of such IFNγ-inducible genes in macrophages. We found that macrophages from ICSBP−/− mice were defective in inducing some IFNγ-responsive genes, even though they were capable of activating STAT1 in response to IFNγ. Accordingly, IFNγ activation of luciferase reporters fused to the GAS element was severely impaired in ICSBP−/− macrophages, but transfection of ICSBP resulted in marked stimulation of these reporters. Consistent with its role in activating IFNγ-responsive promoters, ICSBP stimulated reporter activity in a GAS-specific manner, even in the absence of IFNγ treatment, and in STAT1 negative cells. Indicative of a mechanism for this stimulation, DNA affinity binding assays revealed that endogenous ICSBP was recruited to a multiprotein complex that bound to GAS. These results suggest that ICSBP, when induced by IFNγ through STAT1, in turn generates a second wave of transcription from GAS-containing promoters, thereby contributing to the elicitation of IFNγ's unique activities in immune cells.