oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 2 )

2019 ( 209 )

2018 ( 320 )

2017 ( 296 )

Custom range...

Search Results: 1 - 10 of 297531 matches for " Dujmovi? Jozo J. "
All listed articles are free for downloading (OA Articles)
Page 1 /297531
Display every page Item
Optimizing computer system configurations
DujmoviJozo J.
Journal of Automatic Control , 2003, DOI: 10.2298/jac0302023d
Abstract: We present a quantitative method for selecting optimum configurations of computer systems. For each configuration we specify a set of requirements reflecting user's needs. The level of satisfaction of requirements is called the global preference score. Using this indicator and the total cost of each configuration we solve the following optimization problems: (1) select a configuration which maximizes the global preference score for a constrained cost of computer system, (2) select a configuration which attains a given level of global preference for a minimum cost, and (3) select a configuration which attains the maximum global preference/cost ratio. We first present the optimization method and then a complete case study of computer optimization.
Zabrana djelovanja sportskih udruga
Jozo ?izmi?
Zbornik Radova Pravnog Fakulteta u Splitu , 2012,
Abstract: O temi koju autor obra uje u ovom lanku – zabrana djelovanja sportskih udruga – u doma oj pravnoj publicistici nema obuhvatnijih i sustavnijih radova, a iznimno je rijetka i sudska praksa.U radu, pored osnovnih naznaka o pojmu (sportske) udruge, autor ukazuje na modalitete prestanka postojanja sportskih udruga, a potom podrobno obra uje razne aspekte instituta zabrane djelovanja sportske udruge - razloge za zabranu djelovanja sportske udruge, pokretanje postupka i postupak pred sudom prvog stupnja povodom prijedloga za zabranu, alba protiv presude o zabrani djelovanja sportske udruge, ste aj i likvidacija sportske udruge na temelju pravomo ne odluke suda.
Za tita olimpijskog znaka (simbola)
Jozo ?izmi?
Zbornik Radova Pravnog Fakulteta u Splitu , 2010,
Abstract: Olimpijski pokret koristi brojna znamenja i simbole. Olimpijski simboli sve vi e postaju predmetom marketin kog i tr i nog interesa, esto na na in da se koriste suprotno odredbama Olimpijske povelje, Nairobijskog ugovora o za titi olimpijskog simbola, te drugih me unarodnih i nacionalnih propisa kojima se tite olimpijski simboli i ure uju dogo aji koji se vezuju uz odr avanje olimpijskih igara. Zbog toga je za sve olimpijske simbole zajedni ko da u ivaju ve i ili manji stupanj gra anskopravne, kaznenopravne i upravnopravne za tite. U radu je autor, nakon pojmovnog odre enja pojedinih vrsta olimpijskih simbola, prikazao neke modalitete za tite olimpijskog simbola u me unarodnom i hrvatskom pravu.
The Utility of Untangling
Vida Dujmovi
Computer Science , 2015,
Abstract: In this note we show how techniques developed for untangling planar graphs by Bose et al. [Discrete & Computational Geometry 42(4): 570-585 (2009)] and Goaoc et al. [Discrete & Com- putational Geometry 42(4): 542-569 (2009)] imply new results about some recent graph drawing models. These include column planarity, universal point subsets, and partial simultaneous geometric embeddings (with or without mappings). Some of these results answer open problems posed in previous papers.
SUPPLEMENTAL ACTIVATED CHARCOAL AND ENERGY INCREASE INTAKE OF MEDITERRANEAN SHRUBS BY SHEEP AND GOATS
Jozo Rogo?i?
Poljoprivreda (Osijek) , 2008,
Abstract: Utilization of the Mediterranean shrubby vegetation is often limited by secondary compounds, such as terpenes, which at too high concentrations can adversely affect forage intake and animal health. Ingesting compounds such as activated charcoal and energy can ameliorate the negative effects of secondary compounds and enable animals to eat more shrubs. Thus, our objectives were to determine if supplemental charcoal, energy and numbers of shrub species offered influenced intake of shrubs by sheep and goats. We conducted three experiments each with 12 lambs and 12 kids (6 activated charcoal vs. 6 controls). In the first experiment, we initially offered three shrubs (Juniperus phoenicea, Helichrysum italicum and Juniperus oxicedrus),) then in the second one, two shrubs (Juniperus phoenicea and Helichrysum italicum), and finally one shrub (Juniperus phoenicea) in the third experiment. In all three experiments (Exp. 1, P<0.001; Exp. 2, P < 0.0003 and Exp. 3, P < 0.03), supplemental charcoal and energy had a positive effect on total shrub intake for both lambs and kids. Kids ate more shrubs than lambs did in all three experiments (P<0.01). Regardless of experiment, both species of animals showed a numerical decrease in total shrub intake, with or without supplemental charcoal and energy, as the number of shrub species on offer decreased. Our findings support the hypothesis that biochemical diversity plays an important role in diet selection, thus enabling animals to better meet their nutritional needs and avoid toxicity.
In memoriam professor emeritus dr. sc. Fedor Rocco (1924.-2011.)
Jozo Previ?i?
Tr?i?te/Market , 2011,
Abstract:
A linear-time algorithm for finding a complete graph minor in a dense graph
Vida Dujmovi,Daniel J. Harvey,Gwena?l Joret,Bruce Reed,David R. Wood
Computer Science , 2012, DOI: 10.1137/120866725
Abstract: Let g(t) be the minimum number such that every graph G with average degree d(G) \geq g(t) contains a K_{t}-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) \in \Theta(t*sqrt{log t}). This article shows that for all fixed \epsilon > 0 and fixed sufficiently large t \geq t(\epsilon), if d(G) \geq (2+\epsilon)g(t) then we can find this K_{t}-minor in linear time. This improves a previous result by Reed and Wood who gave a linear-time algorithm when d(G) \geq 2^{t-2}.
Track Layouts, Layered Path Decompositions, and Leveled Planarity
Michael J. Bannister,William E. Devanny,Vida Dujmovi,David Eppstein,David R. Wood
Computer Science , 2015,
Abstract: We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth. We use these two types of layouts to characterize leveled planar graphs, the graphs with planar layered drawings with no dummy vertices. It follows from the known NP-completeness of leveled planarity that track-number and layered pathwidth are also NP-complete, even for the smallest constant parameter values that make these parameters nontrivial. We prove that the graphs with bounded layered pathwidth include outerplanar graphs, Halin graphs, and squaregraphs, but that (despite having bounded track-number) series-parallel graphs do not have bounded layered pathwidth. Finally, we investigate the parameterized complexity of these layouts, showing that past methods used for book layouts don't work to parameterize the problem by treewidth or almost-tree number but that the problem is (non-uniformly) fixed-parameter tractable for tree-depth.
On Obstacle Numbers
Vida Dujmovi,Pat Morin
Computer Science , 2013,
Abstract: The obstacle number is a new graph parameter introduced by Alpert, Koch, and Laison (2010). Mukkamala etal (2012) show that there exist graphs with n vertices having obstacle number in Omega(n/\log n). In this note, we up this lower bound to Omega(n/(\log\log n)^2. Our proof makes use of an upper bound of Mukkamala etal on the number of graphs having obstacle number at most h in such a way that any subsequent improvements to their upper bound will improve our lower bound.
portsko arbitra no sudi te HOO - organizacijske i postupovne odredbe
Jozo ?izmi?,Hrvoje Mom?inovi?
Zbornik Radova Pravnog Fakulteta u Splitu , 2011,
Abstract: Danas se ve ina portskih sporova rje ava pred arbitra nim sudovima. Sve prednosti arbitra nog sudovanja odavno su prepoznate u portu, pa je danas rijetkost da se spor vezan uz odre eni port na e pred dr avnim sudom. Dr avni sudovi te ko mogu pratiti razvitak i slo enost odnosa koji nastaju u portu, pa su specijalizirane arbitra e sa stru nim i educiranim arbitrima idealno rje enje za ove vrste sporova. portske arbitra e esto imaju i obilje ja tzv. prisilnih arbitra a (arbitrage obligatore, compulspry arbitration, Zwangsshiedsgericht), kojima se stranke moraju obratiti radi rje avanja odre enih sporova. U radu se, nakon kratkog pojmovnog obja njenja instituta arbitra nog sudovanja i portske arbitra e, daje prikaz postupka pred portskim arbitra nim sudi tem Hrvatskog olimpijskog odbora prema Arbitra nim pravilima portskog arbitra nog sudi ta pri Hrvatskom olimpijskom odboru.
Page 1 /297531
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.