A heat-flux based “building block” approach for solving heat conduction problems

A numerical approximation of the Green’s function equation based on a heat-flux formulation is given. It is derived by assuming as a functional form of the surface heat flux a stepwise variation with space and time. The obtained approximation is very important in investigation of the inverse heat conduction problems (IHCPs) because it gives a convenient expression for the temperature in terms of the heat flux components. Additionally, it is very important for the unsteady surface element (USE) method which is a modern boundary discretization method. Green’s function approximate solution equation (GFASE) also creates ‘naturally’ fixed groups or modules of work elements called “building blocks” that may be added together to obtain space and time values of temperature. In the current case, they are subject to a partial heating by an applied surface heat flux. The “building block” solution can be derived by using the various analytical and numerical approaches available in heat conduction literature though the exact analysis is preferable, as discussed in the text. Poorly-convergent series deriving from Green’s functions approach are replaced by closed-form algebraic solutions.     

SECULAR SEASONS: LONG-RUN TRENDS IN SPATIAL-TEMPORAL SOCIOECONOMIC BEHAVIOR

ABSTRACT This paper proposes an explanation of unbalanced regional growth and regional inequalities based on the view that human behaviour is motivated either to reduce the physiological state of arousal or to increase it. While arousal reduction is the basis of conventional economic analysis arousal augmentation is seldom considered. This paper argues that arousal augmentation motivates society to seek technological and socioeconomic innovations that trigger economic progress. The mechanism for this progress is seen as a synthesis of spatial growth poles and temporal long waves.     

Vacuum Interruption-A Review of the Vacuum Arc and Contact Functions

The growing use of vacuum interruption devices by the power and control industry in the last decade introduces these devices to many people for whom the area of vacuum interruption is somewhat new. It is felt that a review of the subject of vacuum interruption from a scientific and technological viewpoint, is needed. This summary will present an overall view of the topic and will facilitate its understanding. This paper will also provide the most complete chronological bibliography available today on this subject.     

Affect, generalization, and the perception of risk.

Investigated the role of affect in judgments of risk in 4 experiments. 557 Ss were recruited on college campuses and read paragraphs modeled after newspaper reports that described fatal or nonfatal accidents or (Exp III) positive events. Ss were later asked to estimate the chances of specific fatal or nonfatal accidents happening to them and/or to the population in general. Experimental manipulations of affect induced by report of a tragic event produced a pervasive increase in Ss' estimates of the frequency of many risks and other undesirable events. Contrary to expectation, the effect was independent of the similarity between the report and the estimated risk: An account of a fatal stabbing did not increase the frequency estimate of homicide more than the estimates of unrelated risks such as natural hazards. An account of a happy event that created positive affect produced a comparable global decrease in judged frequency of risks. (12 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

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.     

General compact labeling schemes for dynamic trees

Let F be a function on pairs of vertices. An F-labeling scheme is composed of a marker algorithm for labeling the vertices of a graph with short labels, coupled with a decoder algorithm allowing one to compute F(u, v) for any two vertices u and v directly from their labels. As applications for labeling schemes concern mainly large and dynamically changing networks, it is of interest to study distributed dynamic labeling schemes. This paper investigates labeling schemes for dynamic trees. We consider two dynamic tree models, namely, the leaf-dynamic tree model in which at each step a leaf can be added to or removed from the tree and the leaf-increasing tree model in which the only topological event that may occur is that a leaf joins the tree. A general method for constructing labeling schemes for dynamic trees (under the above mentioned dynamic tree models) was previously developed in Korman et al. (Theory Comput Syst 37:49–75, 2004). This method is based on extending an existing static tree labeling scheme to the dynamic setting. This approach fits many natural functions on trees, such as distance, separation level, ancestry relation, routing (in both the adversary and the designer port models), nearest common ancestor etc.. Their resulting dynamic schemes incur overheads (over the static scheme) on the label size and on the communication complexity. In particular, all their schemes yield a multiplicative overhead factor of Ω(log n) on the label sizes of the static schemes. Following (Korman et al., Theory Comput Syst 37:49–75, 2004), we develop a different general method for extending static labeling schemes to the dynamic tree settings. Our method fits the same class of tree functions. In contrast to the above paper, our trade-off is designed to minimize the label size, sometimes at the expense of communication. Informally, for any function k(n) and any static F-labeling scheme on trees, we present an F-labeling scheme on dynamic trees incurring multiplicative overhead factors (over the static scheme) of on the label size and on the amortized message complexity. In particular, by setting for any , we obtain dynamic labeling schemes with asymptotically optimal label sizes and sublinear amortized message complexity for the ancestry relation, the id-based and label-based nearest common ancestor relation and the routing function. Supported in part at the Technion by an Aly Kaufman fellowship.     

Automated Meta-Control for Adaptable Real-Time Software

The software meta-controller is an online agent responsible for dynamically adapting an application's software configuration, e.g. altering operational modes and migrating tasks, to best accommodate varying runtime circumstances. In distributed real-time applications such adaptations must be carried out in a manner which maintains the schedulability of all critical tasks while maximizing some notion of system value for all other tasks. For large-scale real-time applications, considering all possible adaptations at the task-level is computationally intractable. This paper presents an automated aggregate approach to software meta-control, appropriate for large-scale distributed real-time systems. The aggregate automated meta-control problem is still NP-hard, but it has very practical approximate solutions. Introduced, here, are two very-effective approximation algorithms, QDP and GG, with very reasonable polynomial time complexity. Both algorithms also provide us with upper bounds for optimum system values, useful for deriving absolute, albeit somewhat pessimistic, measures of actual performance. Extensive Monte Carlo analysis is used to illustrate that expected performance for both algorithms is generally suboptimal by no more than a few percent. Our flexible software meta-control model is also shown to be readily applied to a wide range of time-sensitive applications.     

Development of adolescent reading comprehension in language 1 and language 2: A longitudinal analysis of constituent components.

This study investigated the relationship between reading comprehension development of 389 adolescents in their dominant language (Language 1 [L1], Dutch) and a foreign language (Language 2 [L2], English). In each consecutive year from Grades 8 through 10, a number of measurements were taken. Students' reading comprehension, their linguistic knowledge (vocabulary and grammar knowledge) and processing efficiency (speed of word recognition and sentence comprehension) in both languages, and their metacognitive knowledge about reading were assessed. The relative strengths of the effects of these components of reading were analyzed to distinguish among 3 hypotheses about the relationship between L1 and L2 reading comprehension: the transfer hypothesis, the threshold hypothesis, and the processing efficiency hypothesis. The transfer hypothesis predicts a strong relationship between L1 and L2 reading comprehension and a strong effect of metacognitive knowledge on L2 reading comprehension, whereas the threshold and processing efficiency hypotheses predict a more important role of language-specific knowledge and processing skills. Results support the transfer hypothesis, although language-specific knowledge and fluency also contribute to L2 reading performance. (PsycINFO Database Record (c) 2010 APA, all rights reserved)