938 resultados para Macro Partitioning


Relevância:

60.00% 60.00%

Publicador:

Resumo:

Content Addressable Memory (CAM) is a special type of Complementary Metal-Oxide-Semiconductor (CMOS) storage element that allows for a parallel search operation on a memory stack in addition to the read and write operations yielded by a conventional SRAM storage array. In practice, it is often desirable to be able to store a “don’t care” state for faster searching operation. However, commercially available CAM chips are forced to accomplish this functionality by having to include two binary memory storage elements per CAM cell,which is a waste of precious area and power resources. This research presents a novel CAM circuit that achieves the “don’t care” functionality with a single ternary memory storage element. Using the recent development of multiple-voltage-threshold (MVT) CMOS transistors, the functionality of the proposed circuit is validated and characteristics for performance, power consumption, noise immunity, and silicon area are presented. This workpresents the following contributions to the field of CAM and ternary-valued logic:• We present a novel Simple Ternary Inverter (STI) transistor geometry scheme for achieving ternary-valued functionality in existing SOI-CMOS 0.18µm processes.• We present a novel Ternary Content Addressable Memory based on Three-Valued Logic (3CAM) as a single-storage-element CAM cell with “don’t care” functionality.• We explore the application of macro partitioning schemes to our proposed 3CAM array to observe the benefits and tradeoffs of architecture design in the context of power, delay, and area.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

A strategy called macro-(affinity ligand) facilitated three-phase partitioning (MLFTPP) is described for refolding of a diverse set of recombinant proteins starting from the solubilized inclusion bodies. It essentially consists of: (i) binding of the protein with a suitable smart polymer and (ii) precipitating the polymer-protein complex as an interfacial layer by mixing in a suitable amount of ammonium sulfate and t-butanol. Smart polymers are stimuli-responsive polymers that become insoluble on the application of a suitable stimulus (e.g., a change in the temperature, pH, or concentration of a chemical species such as Ca 2+ or K +). The MLFTPP process required approximately 10min, and the refolded proteins were found to be homogeneous on sodium dodecyl sulfate-polyacrylamide gel electrophoresis. The folded proteins were characterized by fluorescence emission spectroscopy, circular dichroism spectroscopy, biological activity, melting temperature, and surface hydrophobicity measurements by 8-anilino-1-naphthalenesulfonate fluorescence. Two refolded antibody fragments were also characterized by measuring K D by Biacore by using immobilized HIV-1 gp120. The data demonstrate that MLFTPP is a rapid and convenient procedure for refolding a variety of proteins from inclusion bodies at high concentration. Although establishing the generic nature of the approach would require wider trials by different groups, its success with the diverse kinds of proteins tried so far appears to be promising.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The impact of relations between an organization and its workers and the relations among workers on individual knowledge generation and sharing practices has not, to date, been addressed in an integrated way. This paper discusses the findings of a study analyzing issues at macro, locally-constructed and micro levels in a public sector organization, to identify and integrate the complex sets of mediators. Key factors were found to include (a) the contested nature of the process of knowledge construction, (b) the worker’s experience of the organization’s internal environment, (c) how the organization is understood to value knowledge sharing, (d) relations with colleagues, and (e) the perceived outcomes of knowledge sharing behaviors. Implications for practice are discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a novel approach for preprocessing systems of polynomial equations via graph partitioning. The variable-sharing graph of a system of polynomial equations is defined. If such graph is disconnected, then the corresponding system of equations can be split into smaller ones that can be solved individually. This can provide a tremendous speed-up in computing the solution to the system, but is unlikely to occur either randomly or in applications. However, by deleting certain vertices on the graph, the variable-sharing graph could be disconnected in a balanced fashion, and in turn the system of polynomial equations would be separated into smaller systems of near-equal sizes. In graph theory terms, this process is equivalent to finding balanced vertex partitions with minimum-weight vertex separators. The techniques of finding these vertex partitions are discussed, and experiments are performed to evaluate its practicality for general graphs and systems of polynomial equations. Applications of this approach in algebraic cryptanalysis on symmetric ciphers are presented: For the QUAD family of stream ciphers, we show how a malicious party can manufacture conforming systems that can be easily broken. For the stream ciphers Bivium and Trivium, we nachieve significant speedups in algebraic attacks against them, mainly in a partial key guess scenario. In each of these cases, the systems of polynomial equations involved are well-suited to our graph partitioning method. These results may open a new avenue for evaluating the security of symmetric ciphers against algebraic attacks.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Composite web services comprise several component web services. When a composite web service is executed centrally, a single web service engine is responsible for coordinating the execution of the components, which may create a bottleneck and degrade the overall throughput of the composite service when there are a large number of service requests. Potentially this problem can be handled by decentralizing execution of the composite web service, but this raises the issue of how to partition a composite service into groups of component services such that each group can be orchestrated by its own execution engine while ensuring acceptable overall throughput of the composite service. Here we present a novel penalty-based genetic algorithm to solve the composite web service partitioning problem. Empirical results show that our new algorithm outperforms existing heuristic-based solutions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Equilibrium Partitioning of an Ionic Contrast agent with microcomputed tomography (EPIC-[mu]CT) is a non-invasive technique to quantify and visualize the three-dimensional distribution of glycosaminoglycans (GAGs) in fresh cartilage tissue. However, it is unclear whether this technique is applicable to already fixed tissues. Therefore, this study aimed at investigating whether formalin fixation of bovine cartilage affects X-ray attenuation, and thus the interpretation of EPIC-[mu]CT data.Design Osteochondral samples (n = 24) were incubated with ioxaglate, an ionic contrast agent, for 22 h prior to [mu]CT scanning. The samples were scanned in both formalin-fixed and fresh conditions. GAG content was measured using a biochemical assay and normalized to wet weight, dry weight, and water content to determine potential reasons for differences in X-ray attenuation.Results The expected zonal distribution of contrast agent/GAGs was observed for both fixed and fresh cartilage specimens. However, despite no significant differences in GAG concentrations or physical properties between fixed and fresh samples, the average attenuation levels of formalin-fixed cartilage were 14.3% lower than in fresh samples.Conclusions EPIC-[mu]CT is useful for three-dimensional visualization of GAGs in formalin-fixed cartilage. However, a significant reduction in X-ray attenuation for fixed (compared to fresh) cartilage must be taken into account and adjusted for accordingly when quantifying GAG concentrations using EPIC-[mu]CT.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Road surface macro-texture is an indicator used to determine the skid resistance levels in pavements. Existing methods of quantifying macro-texture include the sand patch test and the laser profilometer. These methods utilise the 3D information of the pavement surface to extract the average texture depth. Recently, interest in image processing techniques as a quantifier of macro-texture has arisen, mainly using the Fast Fourier Transform (FFT). This paper reviews the FFT method, and then proposes two new methods, one using the autocorrelation function and the other using wavelets. The methods are tested on pictures obtained from a pavement surface extending more than 2km's. About 200 images were acquired from the surface at approx. 10m intervals from a height 80cm above ground. The results obtained from image analysis methods using the FFT, the autocorrelation function and wavelets are compared with sensor measured texture depth (SMTD) data obtained from the same paved surface. The results indicate that coefficients of determination (R2) exceeding 0.8 are obtained when up to 10% of outliers are removed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper analyses the Australian Values Education Program (VEP) within the framework of late-classical political economy. using analytical methods from systemic functional linguistics and critical discourse analysis, we demonstrate that the VEP is an unwitting restatement of the principles of ideology as developed by the likes of Destutt de Tracy and the Young Hegelians. We conclude that the sudden shock of globalisation and the post-national cultures this has entailed is in many ways similar to the shock of formal nationalism that emerged in the late-Seventeenth and early- Eighteenth centuries. The overall result of the VEP for the Australian school system is a massive procedural burden that is unlikely to produce the results at which the program is aimed.