Search results for "CPU"
showing 10 items of 19 documents
Large differences in catch per unit of effort between two minnow trap models
2013
Background: Little is known about variation in catch per unit of effort (CPUE) in stickleback fisheries, or the factors explaining this variation. We investigated how nine-spined stickleback (Pungitius pungitius) CPUE was influenced by trap model by comparing the CPUEs of two very similar minnow trap models fished side-by-side in a paired experimental design. Results: The galvanized trap type (mean CPUE = 1.31 fish h–1) out-fished the black trap type (mean CPUE = 0.20 fish h–1) consistently, and yielded on average 81% more fish. Conclusions: The results demonstrate that small differences in trap appearance can have large impacts on CPUE. This has implications for studies designed to investi…
Efficient Protection for VDI Workstations
2019
Many enterprises migrate to a private cloud VDI environment. In such an environment multiple workstations are served by a single powerful server. On such an environment each VDI workstation receives only a limited CPU power. An average of less than a quarter of a core per planned VDI workstation is a common setup. Under such cases, anti-virus and application control software load is multiplied by the number of VDI workstation running on each server. These security applications take merely a few percentages of a single core on a normal desktop. However, on a VDI server where the multiple VDI workstations run on a single server, they may consume 20-25 percent the load. Naturally, such an incr…
Approximate Lax–Wendroff discontinuous Galerkin methods for hyperbolic conservation laws
2017
Abstract The Lax–Wendroff time discretization is an alternative method to the popular total variation diminishing Runge–Kutta time discretization of discontinuous Galerkin schemes for the numerical solution of hyperbolic conservation laws. The resulting fully discrete schemes are known as LWDG and RKDG methods, respectively. Although LWDG methods are in general more compact and efficient than RKDG methods of comparable order of accuracy, the formulation of LWDG methods involves the successive computation of exact flux derivatives. This procedure allows one to construct schemes of arbitrary formal order of accuracy in space and time. A new approximation procedure avoids the computation of ex…
Kriptovalūtu rakšana, tās risinājumi un realizācija mājas apstākļos
2019
Bakalaura darba mērķis ir pilnveidot zināšanas par kriptovalūtu rakšanu, to veidiem, saistītajām izmaksām, iesaistītajiem dalībniekiem, ietekmi uz vidi, viedokļus par tām. Lai noteiktu efektīvākās rakšanas iespējas, darba autors portatīvajā datorā ieviesa kriptovalūtu rakšanu un veica pētījumu par iegūtajiem datiem. Darbā tiek apskatīta kriptovalūtu rakšanas iespējas ar videokaršu, centrālā procesora, ASIC un FPGA iekārtu palīdzību. Tiek izvērtētas to priekšrocības un trūkumi, kurus izmanto reālos apstākļos, kurus vairs nē, kā arī iedalījums pēc iesaistīto dalībnieku skaita. Uzskaitīti galvenie izdevumi ar kuriem ir jārēķinās apsverot domu nodarboties ar rakšanu. Darba rezultātā tika izvērt…
Branch and bound for the cutwidth minimization problem
2013
The cutwidth minimization problem consists of finding a linear arrangement of the vertices of a graph where the maximum number of cuts between the edges of the graph and a line separating consecutive vertices is minimized. We first review previous approaches for special classes of graphs, followed by lower bounds and then a linear integer formulation for the general problem. We then propose a branch-and-bound algorithm based on different lower bounds on the cutwidth of partial solutions. Additionally, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic to obtain good initial solutions. The combination of the branch-and-bound and GRASP methods results in optimal solu…
Modelling Aspects in Accumulative Roll Bonding Process by Explicit Finite Element Analysis
2013
Accumulative Roll-Bonding (ARB) process is a severe plastic deformation (SPD) process, capable of developing grains below 1 μm in diameter and improving mechanical properties of the material. In this study, the authors compared two different FE-codes with respect of its applicability for numerical analysis of the ARB process. Modelling this process was achieved using the explicit code for Abaqus/CAE both in 2D and 3D. The proposed model was used to assess the impact of ARB cycles on the final material properties. The numerical results in 2D and 3D were compared and contrasted. The research work presented in this paper is focused on the simulation optimization based on CPU time minimization.…
Optimization of Application-Specific L1 Cache Translation Functions of the LEON3 Processor
2020
Reconfigurable caches offer an intriguing opportunity to tailor cache behavior to applications for better run-times and energy consumptions. While one may adapt structural cache parameters such as cache and block sizes, we adapt the memory-address-to-cache-index mapping function to the needs of an application. Using a LEON3 embedded multi-core processor with reconfigurable cache mappings, a metaheuristic search procedure, and Mibench applications, we show in this work how to accurately compare non-deterministic performances of applications and how to use this information to implement an optimization procedure that evolves application-specific cache mappings.
Architecture-Driven Level Set Optimization: From Clustering to Sub-pixel Image Segmentation
2016
Thanks to their effectiveness, active contour models (ACMs) are of great interest for computer vision scientists. The level set methods (LSMs) refer to the class of geometric active contours. Comparing with the other ACMs, in addition to subpixel accuracy, it has the intrinsic ability to automatically handle topological changes. Nevertheless, the LSMs are computationally expensive. A solution for their time consumption problem can be hardware acceleration using some massively parallel devices such as graphics processing units (GPUs). But the question is: which accuracy can we reach while still maintaining an adequate algorithm to massively parallel architecture? In this paper, we attempt to…
Docosahexaenoic acid, but not eicosapentaenoic acid, lowers ambulatory blood pressure and shortens interval QT in spontaneously hypertensive rats in …
2009
International audience; This study was designed to evaluate the effects of individual dietary long-chain n-3 polyunsaturated fatty acids (LCPUFA) on hypertension and cardiac consecutive disorders in spontaneously hypertensive rats (SHR) as compared to Wistar-Kyoto rats (WKY). Rats were fed for 2 months an eicosapentaenoic (EPA)- or docosahexaenoic acid (DHA)-rich diet (240 mg/day) or an n-3 PUFA-free diet. Male SHR (n=6), implanted with cardiovascular telemetry devices, were housed in individual cages for continuous measurements of cardiovascular parameters (blood pressure (BP) and heart rate (HR)) during either activity or rest periods, ECG were recorded during the quiet period. The n-6 PU…
Spim-Cache: A Pedagogical Tool for Teaching Cache Memories Through Code-Based Exercises
2007
Cache memories represent a core topic in all computer organization and architecture courses offered at universities around the world. As a consequence, educational proposals and textbooks address important efforts to this topic. A valuable pedagogical help when studying cache memories is to perform exercises based on simple algorithms, which allow the identification of cache accesses, for instance, a program accessing the elements of an array. These exercises, referred to as code-based exercises, have a good acceptance among instructors of computer organization courses. Nevertheless, no tool (e.g., simulator) has been developed to be used in undergraduate courses working with this kind of e…