960 resultados para Graph partitioning


Relevância:

20.00% 20.00%

Publicador:

Resumo:

6th International Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Inspired in dynamic systems theory and Brewer’s contributions to apply it to economics, this paper establishes a bond graph model. Two main variables, a set of inter-connectivities based on nodes and links (bonds) and a fractional order dynamical perspective, prove to be a good macro-economic representation of countries’ potential performance in nowadays globalization. The estimations based on time series for 50 countries throughout the last 50 decades confirm the accuracy of the model and the importance of scale for economic performance.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a preliminary acoustic study concerning the development of the first prototype of a patented removable module for interior partitioning. It is a prefabricated, vertical element for division of interior spaces that does not require the use of gutters or technical support. A set of such modules, linearly disposed, will create a division, allowing the personalization of any indoor area, including open office spaces, rooms, among others. The main characteristic that distinguishes this element from the existing solutions available on the market is that its mobility relies exclusively on a set of integrated bearings at the base of each module. Through an incorporated elevation system, the user can lower the module, move it to the desired position and re-elevate it until pressed against the ledge of the ceiling, making it stable. In this sense, and taking into account its acoustic behavior, several tests were made in the LNEC acoustics lab. Airborne sound insulation tests for different typologies of the prototype were conducted, according to the applicable standards EN ISO 354:2003, EN ISO 717-1:2013 and EN ISO 10140-2:2010. Some important conclusions and analysis of the prototype viability were extracted.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

When assessing investment options, investors focus on the graphs of annual reports, despite lack of auditing. If poorly constructed, graphs distort perceptions and lead to inaccurate decisions. This study examines graph usage in all the companies listed on Euronext Lisbon in 2013. The findings suggest that graphs are common in the annual reports of Portuguese companies and that, while there is no evidence of Selectivity Distortion, both Measurement and Orientation Distortions are pervasive. The study recommends the auditing of financial graphs, and urges preparers and users of annual reports to be wary of the possibility of graph distortion.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As investors and other users of annual reports often focus their attention on graphs, it is important that they portray accurate and reliable information. However, previous studies show that graphs often distort information and mislead users. This study analyses graph usage in annual reports from the 52 most traded Norwegian companies. The findings suggest that Norwegian companies commonly use graphs, and that the graph distortions, presentational enhancement and measurement distortion, are present. No evidence of selectivity was found. This study recommends development of guidelines for graphical disclosure, and advises preparers and users of annual reports to be aware of misleading graphs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

ABSTRACTResource partitioning is important for species coexistence. Species with similar ecomorphology are potential competitors, especially when phylogenetically close, due to niche conservatism. The aim of this study was to investigate the resource partitioning among populations of two species of lebiasinids (Copella nigrofasciata and Pyrrhulina aff. brevis) that co-occur in a first-order Amazonian stream, analyzing the trophic ecology, feeding strategies and ecomorphological attributes related to the use of food and space by these species. Fish were captured in May and September 2010. The stomach contents of 60 individuals were analyzed and quantified volumetrically to characterize the feeding ecology of both species. Eleven morphological attributes were measured in 20 specimens and combined in nine ecomorphological indices. Both species had an omnivorous-invertivorous diet and consumed predominantly allochthonous items. Both showed a tendency to a generalist diet, but intrapopulational variation in resource use was also detected. Overall feeding niche overlap was high, but differed between seasons: low during the rainy season and high in the dry season. In the latter, the food niche overlap was asymmetric because C. nigrofasciata consumed several prey of P. aff. brevis, which reduced its food spectrum. The ecomorphological analysis suggests that C. nigrofasciatahas greater swimming capacity (greater relative length of caudal peduncle) than P. aff. brevis, which has greater maneuverability and tendency to inhabit lentic environments (greater relative depth of the body). Our results demonstrate that these species have similar trophic ecology and suggest a spatial segregation, given by morphological differences related to locomotion and occupation of habitat, favoring their coexistence.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Hardware-Software Co-Design, Simulated Annealing, Real-Time Image Processing, Automated Hardware-Software Partitioning

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, different dynamic graph models of MANETs, and finally we give detailed summaries of a few selected articles. In particular, we focus on articles dealing with connectivity of mobile networks, and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances, and thus saving energy.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A key feature differentiating cooperative animal societies Is the apportionment of reproduction among individuals. Only recently have studies started to focus on intraspecific variability in the distribution of reproduction within animal societies, and the available data suggest that this variability might be greater than previously suspected. How can one account for intra-and interspecific variability in partitioning of reproduction? This Is one of the most intriguing problems in the study of social behaviour, and understanding the factors underlying this variability is one of the keys to understanding the properties of complex animal societies.