Toward more localized local algorithms: removing assumptions concerning global knowledge

Numerous sophisticated local algorithm were suggested in the literature for various fundamental problems. Notable examples are the MIS and $(\Delta +1)$ -coloring algorithms by Barenboim and Elkin (Distrib Comput 22(5–6):363–379, 2010), by Kuhn (2009), and by Panconesi and Srinivasan (J Algorithms 20(2):356–374, 1996), as well as the $O\mathopen {}(\Delta ^2)$ -coloring algorithm by Linial (J Comput 21:193, 1992). Unfortunately, most known local algorithms (including, in particular, the aforementioned algorithms) are non-uniform, that is, local algorithms generally use good estimations of one or more global parameters of the network, e.g., the maximum degree $\Delta $ or the number of nodes $n$ . This paper provides a method for transforming a non-uniform local algorithm into a uniform one. Furthermore, the resulting algorithm enjoys the same asymptotic running time as the original non-uniform algorithm. Our method applies to a wide family of both deterministic and randomized algorithms. Specifically, it applies to almost all state of the art non-uniform algorithms for MIS and Maximal Matching, as well as to many results concerning the coloring problem (In particular, it applies to all aforementioned algorithms). To obtain our transformations we introduce a new distributed tool called pruning algorithms, which we believe may be of independent interest.     

Piecewise regression model construction with sample efficient regression tree (SERT) and applications to semiconductor yield analysis

Forward stepwise regression analysis selects critical attributes all the way with the same set of data. Regression analysis is, however, not capable of splitting data to construct piecewise regression models. Regression trees have been known to be an effective data mining tool for constructing piecewise models by iteratively splitting data set and selecting attributes into a hierarchical tree model. However, the sample size reduces sharply after few levels of data splitting causing unreliable attribute selection. In this research, we propose a method to effectively construct a piecewise regression model by extending the sample-efficient regression tree (SERT) approach that combines the forward selection in regression analysis and the regression tree methodologies. The proposed method attempts to maximize the usage of the dataset's degree of freedom and to attain unbiased model estimates at the same time. Hypothetical and actual semiconductor yield-analysis cases are used to illustrate the method and its effective search for critical factors to be included in the dataset's underlying model.     

Labeling Schemes for Dynamic Tree Networks

Distance labeling schemes are composed of a marker algorithm for labeling the vertices of a graph with short labels, coupled with a decoder algorithm allowing one to compute the distance between any two vertices directly from their labels (without using any additional information). As applications for distance labeling schemes concern mainly large and dynamically changing networks, it is of interest to study distributed dynamic labeling schemes. The current paper considers the problem on dynamic trees, and proposes efficient distributed schemes for it. The paper first presents a labeling scheme for distances in the dynamic tree model, with amortized message complexity O(log² n) per operation, where n is the size of the tree at the time the operation takes place. The protocol maintains O(log² n) bit labels. This label size is known to be optimal even in the static scenario. A more general labeling scheme is then introduced for the dynamic tree model, based on extending an existing static tree labeling scheme to the dynamic setting. The approach fits a number of natural tree functions, such as distance, separation level, and flow. The main resulting scheme incurs an overhead of an O(log n) multiplicative factor in both the label size and amortized message complexity in the case of dynamically growing trees (with no vertex deletions). If an upper bound on n is known in advance, this method yields a different tradeoff, with an O(log² n/log log n) multiplicative overhead on the label size but only an O(log n/log log n) overhead on the amortized message complexity. In the fully dynamic model the scheme also incurs an increased additive overhead in amortized communication, of O(log² n) messages per operation.     

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G’s diameter. On the other hand, we show that any MST verification algorithm must send $\tilde{\varOmega}(m)$ messages and incur $\tilde{\varOmega}(\sqrt{n} + D)$ time in worst case. Our upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of $\tilde{\varOmega}(m)$ messages and $\tilde{\varOmega}(\sqrt{n} + D)$ time hold, but at the moment there is no known distributed algorithm that constructs an MST and achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time. Specifically, the best known time-optimal algorithm (using ${\tilde{O}}(\sqrt {n} + D)$ time) requires O(m+n ^3/2) messages, and the best known message-optimal algorithm (using ${\tilde{O}}(m)$ messages) requires O(n) time. On the other hand, our lower bound results indicate that the verification of an MST is not significantly easier than its construction.     

Differential weighting of common and distinctive components.

We investigated possible explanations of the finding that the relative weight (W) of common components in similarity judgments is higher for verbal than for pictorial stimuli. A serial presentation of stimulus components had no effect on verbal stimuli; it increased the impact of both common and distinctive components of pictorial stimuli but did not affect their relative weight. On the other hand, W was increased by manipulations that reduced the cohesiveness of composite pictures, such as separating, scrambling, and mixing their components. Furthermore, W was decreased by manipulations that enhanced the cohesiveness of composite verbal stimuli by imposing structure on their components. Verbal and pictorial representations of the same stimuli yielded no systematic differences in W. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Fluid flow phenomena in the electromagnetic stirring of continuous casting systems,part 1: the behaviour of a cylindrically shaped laboratory scale installation

A model is developed to calculate the flow field produced by electromagnetic stirring generated by a rotating magnetic field. This study has considerable importance due to its applicability to continuous casting systems. Three cases are considered, the first, in which steady continuous stirring is studied, and the numerical results are found to agree well with the experimental observations by other workers. In the second case, alternating stirring is examined, and the critical role of switching frequencies is discussed. Finally, a preliminary allowance is made for free surface deformation for the continuous stirring situation. The effective viscosity is deduced from the transport equations for K, the turbulence kinetic energy, and for ?, the rate of viscous dissipation. The transport equation for K is modified to account for turbulence enhancement due to electromagnetic effects.     

Three-dimensional numerical modelling of a fast fluidized bed biomass gasifier to generate energy from wastes

The modelling of a biomass fluidized bed gasification system, one of the most effective ways to produce energy from biomass resources and wastes, has been performed in this study. The effect of the turbulence phenomena, including calculations relating to flow turbulence, chemical fuel reactions, and energy and momentum exchange between multiple solid and gas phases, has been taken into account in the current research as a novel approach. A computational fluid dynamics case study model that combines equations with comprehensive geometry has been considered. Results have been compared with published operational records of an existing power plant to validate the model. The solid particle distribution, the velocity of the mixture and gas phase, the turbulent flow viscosity ratio, and the temperature distribution in the model indicated the accuracy of the simulation performance compared with the experimental studies. The production of the molar fraction of the constituent elements of the synthesis gas has been evaluated in transient conditions. Additionally, 35 s after the process began, the system's performance was estimated, and the results indicated the average molecular weights of hydrogen, carbon monoxide, carbon dioxide, and methane are 26%, 23%, 12.5%, and 3.3%, respectively, which presented high precision with the experimental results.     

Potential of using floating solar photovoltaic and wind farms for sustainable energy generation in an existing hydropower station in Nigeria

Clean Technologies and Environmental Policy - Energy poverty, insecurity and vulnerability are issues facing energy accessibility in Sub-Saharan Africa, SSA. These among other things have been...     

LATE CENOZOIC THERMAL GRADIENTS IN DEAD SEA TRANSFORM SYSTEM BASINS

Coal-rank measurements and heat-flow data from three rhomb-shaped grabens along the continental portion of the Dead Sea Transform—the Hula Depression, the Sea of Galilee and the Dead Sea Graben—reveal contrasting thermal regimes. The coalification profile the Hula Depression indicates a relatively high thermal gradient, averaging 40C/km, throughout the Late Cenozoic. Similarly, a relatively high heat flow, approx 1.77 HFU, was reported in the Sea of Galilee, 35 km to the south. Coalfieation profile, heat flow data and BHT measurements on the Dead Sea Graben (200 km to the south) reveal a considerably lower thermal regime (approx 0.7 HFU, 2OC/km) that has prevailed since the mid-Miocene.
However, the differences in the thermal regime do not represent different mechanisms of basin formation. With the corroboration of hydrological and geophysical data, it is suggested that the high thermal regime in the two northern basins reflects a regional phenomenon associated with the nearby extensive Golan-Jeble Druze young volcanic terrain. Therefore, it has no relationship to the mechanism of rhomb-shaped graben formation, and should not be cited in support of kinematic models requiring a high thermal regime.