975 research outputs found
Efficient hardware architectures for MPEG-4 core profile
No full textEfficient hardware acceleration architectures are proposed for the most demandingMPEG-4 core profile algorithms, namely; texture motion estimation (TME), binary motion estimation (BME)and the shape adaptive discrete cosine transform (SA-DCT). The proposed ME designs may also be used for H.264, since both architectures can handle variable block sizes. Both ME architectures employ early termination techniques that reduce latency and save needless memory accesses and power consumption. They also use a pixel subsampling technique to facilitate parallelism,
while balancing the computational load. The BME datapath also saves operations by using Run Length Coded (RLC) pixel addressing. The SA-DCT module has a re-configuring multiplier-less serial datapath using adders and multiplexers only to improve area and power. The SA-DCT packing steps are done using a minimal switching addressing scheme with guarded evaluation. All three modules have been synthesised targeting the WildCard-II FPGA benchmarking platform adopted by the MPEG-4 Part9 reference hardware group
Power-constrained block-test list scheduling
No full textA list scheduling approach is proposed in this paper to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is also used in combination with the list scheduling algorithm in order to improve the test concurrency, having assigned power dissipation limits. Moreover, the algorithm features a power dissipation balancing provision. Test scheduling examples are discussed, highlighting further research steps towards an efficient system-level test scheduling algorith
A comparison of classical scheduling approaches in power-constrained block-test scheduling
No full textClassical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned problem. Then, distribution-graph based approaches are described in order to achieve balanced test concurrency and test power dissipation. An extended tree growing technique is also used in combination with these classical approaches in order to improve the test concurrency having assigned power dissipation limits. A comparison between the results of the test scheduling experiments highlights the advantages and disadvantages of applying different classical scheduling algorithms to the power-constrained test scheduling proble
A combined tree growing technique for block-test scheduling under power constraints
No full textA tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits. First of all, the problem of unequal-length block-test scheduling under power dissipation constraints is modeled as a tree growing problem. Then a combination of list and force-directed scheduling algorithms is adapted to tackle it. The goal of this approach is to achieve rapidly a test scheduling solution with a near-optimal test application time. This is initially achieved with the list approach. Then the power dissipation distribution of this solution is balanced by using a force-directed global priority function. The force-directed priority function is a distribution-graph based global priority function. A constant additive model is employed for power dissipation analysis and estimation. Based on test scheduling examples, the efficiency of this approach is discussed as compared to the other approaches
Alf Nilsen-Børsskog — The Author Chosen by the Language
No full textThis article discusses Alf Nilsen-Børsskog’s four-volume series of novels Elämän jatko [Continuation of life, 2004–2015], seen as the first literary works treating the Kven culture from a native perspective. Nilsen-Børsskog’s novels are analysed as constituting a “counterstory”, a term coined in the postcolonial cultural research paradigm to refer to self-representation. The Kvens have been considered a national minority in Norway since 1999, and their language has been an official minority language since 2005. The present author scrutinizes how Nilsen-Børsskog’s work differs from previous literary descriptions of this minority, often marked by the frequent use of stereotypes of the Kven language and culture
LIBS and LA-SD-OES Analysis of Minor and Trace Elements in Steel Samples
No full textAuthor Valentin Ehrentraut, BScMasterarbeit Universität Linz 2022Arbeit nach Ablauf der Sperre auf den öffentlichen PCs in den Bibliotheken der JKU+Medizin abrufba
Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling
No full textA distribution-graph based scheduling algorithm is proposed together with an extended tree growing technique to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. The extended tree growing technique is used in combination with the classical scheduling approach in order to improve the test concurrency having assigned power dissipation limits. Its goal is to achieve a balanced test power dissipation by employing a least mean square error function. The least mean square error function is a distribution-graph based global priority function. Test scheduling examples and experiments highlight in the end the efficiency of this approach towards a system-level test scheduling algorithm
Johann Siegmund Valentin Popowitsch (Janez Žiga Valentin Popovič), Vocabula Austriaca et Stiriaca 1-2 (Frankfurt am Main 2004)
No full textThe Austrian dictionary composed by the Slovenian scho-lar Janez Žiga Valentin Popovič (1705-1774) in the third quarter of the 18th century was only published in 2004, and edited by Richard Reutner, who wrote an extensive introduction to it. The dictionary comprises many language-geographical data for the German language, excellent explanations and many comparisons with much information provided regarding Popovic's mother tongue. The author broad horizon is admirable, especially with regard to the German language area and the linguistic literature of that time.Avstrijski slovar, ki ga je v tretji četrtini 18. stoletja sestavil slovenski učenjak Janez Žiga Valentin Popovič (1705-1774), je izšel šele leta 2004 v uredništvu Richarda Reutnerja, kije k njemu napisal obsežen uvod. Slovar vsebuje mnogo jezikovnogeografskih podatkov za nemščino, odlične razlage in marsikaj primerjalnega, veliko pa se najde tudi v zvezi s Popovičevo materinščino. Občudovanja vredna je avtorjeva razgledanost predvsem po nemškem jezikoslovnem prostoru in po takratni jezikoslovni literaturi
Optimisation of constant matrix multiplication operation hardware using a genetic algorithm
No full textThe efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Previous approaches tend to use hill-climbing algorithms risking sub-optimal results. The three-stage algorithm proposed in this paper partitions the global constant matrix multiplier into its constituent dot products, and all possible solutions are derived for each dot product in the first two stages. The third stage leverages the effective search capability of genetic programming to search for global solutions created by combining dot product partial solutions. A bonus feature of the algorithm is that the modelling is amenable to hardware acceleration. Another bonus feature is a search space reduction early exit mechanism, made possible by the way the algorithm is modelled. Results show an improvement on state of the art algorithms with future potential for even greater savings
An Embarrassingly Simple Method to Mitigate Undesirable Properties of Pretrained Language Model Tokenizers
No full textWe introduce FLOTA (Few Longest Token Approximation), a simple yet effective method to improve the tokenization of pretrained language models (PLMs). FLOTA uses the vocabulary of a standard tokenizer but tries to preserve the morphological structure of words during tokenization. We evaluate FLOTA on morphological gold segmentations as well as a text classification task, using BERT, GPT-2, and XLNet as example PLMs. FLOTA leads to performance gains, makes inference more efficient, and enhances the robustness of PLMs with respect to whitespace noise
- …
