Estimativas a priori para problemas não lineares de condução de calor, com o uso da transformada de Kirchhoff.

Este trabalho apresenta uma estimativa a priori para o limite superior da distribuição de temperatura considerando um problema em regime permanente em um corpo com uma condutividade térmica dependente da temperatura. A discussão é realizada supondo que as condições de contorno são lineares (lei de Newton do resfriamento) e que a condutividade térmica é constante por partes (quando considerada como uma função da temperatura). Estas estimativas consistem em uma ferramenta poderosa que pode prescindir da necessidade de uma simulação numérica cara de um problema de transferência de calor não linear, sempre que for suficiente conhecer o valor mais alto de temperatura. Nestes casos, a metodologia proposta neste trabalho é mais eficaz do que as aproximações usuais que assumem tanto a condutividade térmica quanto as fontes de calor como constantes.

Some new bounds on eigenvalues of the Hadamard product and the Fan product of matrices

Let A and B be nonsingular M-matrices. A lower bound on the minimum eigenvalue q(B circle A(-1)) for the Hadamard product of A(-1) and B, and a lower bound on the minimum eigenvalue q(A star B) for the Fan product of A and B are given. In addition, an upper bound on the spectral radius rho(A circle B) of nonnegative matrices A and B is also obtained. These bounds improve several existing results in some cases and the estimating formulas are easier to calculate for they are only depending on the entries of matrices A and B. (C) 2009 Elsevier Inc. All rights reserved.

Closing the gap: Improved bounds on optimal POMDP solutions

POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most approaches (including point-based and policy iteration techniques) operate by refining a lower bound of the optimal value function. Several approaches (e.g., HSVI2, SARSOP, grid-based approaches and online forward search) also refine an upper bound. However, approximating the optimal value function by an upper bound is computationally expensive and therefore tightness is often sacrificed to improve efficiency (e.g., sawtooth approximation). In this paper, we describe a new approach to efficiently compute tighter bounds by i) conducting a prioritized breadth first search over the reachable beliefs, ii) propagating upper bound improvements with an augmented POMDP and iii) using exact linear programming (instead of the sawtooth approximation) for upper bound interpolation. As a result, we can represent the bounds more compactly and significantly reduce the gap between upper and lower bounds on several benchmark problems. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

Achieving Csiszár's source-channel coding exponent with product distributions

We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár's error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset. © 2012 IEEE.

Numerical analysis of shallow foundations under combined horizontal and torsional loading

Foundations of subsea infrastructure in deep water subjected to asymmetric environmental loads have underscored the importance of combined torsional and horizontal loading effects on the bearing capacity of rectangular shallow foundations. The purpose of this study is to investigate the undrained sliding and torsional bearing capacity of rectangular and square shallow foundations together with the interaction response under combined loading using three-dimensional finite element (3D-FE) analysis. Upper bound plastic limit analysis is employed to establish a reference value for horizontal and torsional bearing capacity, and an interaction relationship for the combined loading condition. Satisfactory agreement of plastic limit analysis (PLA) and 3D-FE results for ultimate capacity and interaction curves ensures that simple PLA solution could be used to evaluate the bearing capacity problem of foundation under combined sliding and torsion.

A general mass law for broadband energy harvesting

It is well known that the power absorbed by a linear oscillator when excited by white noise base acceleration depends only on the mass of the oscillator and the spectral density of the base motion. This places an upper bound on the energy that can be harvested from a linear oscillator under broadband excitation, regardless of the stiffness of the system or the damping factor. It is shown here that the same result applies to any multi-degree-of-freedom nonlinear system that is subjected to white noise base acceleration: for a given spectral density of base motion the total power absorbed is proportional to the total mass of the system. The only restriction to this result is that the internal forces are assumed to be a function of the instantaneous value of the state vector. The result is derived analytically by several different approaches, and numerical results are presented for an example two-degree-of-freedom-system with various combinations of linear and nonlinear damping and stiffness. © 2013 The Author.

Enhanced robotic body extension with modular units

The adaptation of robots to changing tasks has been explored in modular self-reconfigurable robot research, where the robot structure is altered by adapting the connectivity of its constituent modules. As these modules are generally complex and large, an upper bound is imposed on the resolution of the built structures. Inspired by growth of plants or animals, robotic body extension (RBE) based on hot melt adhesives allows a robot to additively fabricate and assemble tools, and integrate them into its own body. This enables the robot to achieve tasks which it could not achieve otherwise. The RBE tools are constructed from hot melt adhesives and therefore generally small and only passive. In this paper, we seek to show physical extension of a robotic system in the order of magnitude of the robot, with actuation of integrated body parts, while maintaining the ability of RBE to construct parts with high resolution. Therefore, we present an enhancement of RBE based on hot melt adhesives with modular units, combining the flexibility of RBE with the advantages of simple modular units. We explain the concept of this new approach and demonstrate with two simple unit types, one fully passive and the other containing a single motor, how the physical range of a robot arm can be extended and additional actuation can be added to the robot body. © 2012 IEEE.

Solid-state qubit measurement with single electron transistors

In this paper we consider the continuous weak measurement of a solid-state qubit by single electron transistors (SET). For single-dot SET, we find that in nonlinear response regime the signal-to-noise ratio can violate the universal upper bound imposed quantum mechanically on any linear response detectors. We understand the violation by means of the cross-correlation of the detector currents. For double-dot SET, we discuss its robustness against wider range of temperatures, quantum efficiency, and the relevant open issues unresolved.

Stability shear stress and equilibrium cross-sectional geometry of sheltered tidal channels

This study relates tidal channel cross-sectional area (A) to peak spring discharge (Q) via a physical mechanism, namely the stability shear stress ( tau sub(S)) just necessary to maintain a zero gradient in net along-channel sediment transport. It is assumed that if bed shear stress ( tau ) is greater than tau sub(S), net erosion will occur, increasing A, and reducing tau similar to (Q/A) super(2) back toward tau sub(S). If tau < tau sub(S) there will be net deposition, reducing A and increasing tau toward tau sub(S). A survey of the literature allows estimates of Q and A at 242 sections in 26 separate sheltered tidal systems. Assuming a single value of tau sub(S) characterizes the entire length of a given tidal channel, it is predicted that along-channel geometry will follow the relation Ah sub(R) super(1) super(/) super(6) similar to Q. Along-channel regressions of the form Ah sub(R) super(1) super(/) super(6) similar to Q super( beta ) give a mean observed value for beta of 1.00 plus or minus 0.06, which is consistent with this concept. Results indicate that a lower bound on tau sub(S) (and an upper bound on A) for stable channels is provided by the critical shear stress ( tau sub(C)) just capable of initiating sediment motion. Observed tau sub(S) is found to vary among all systems as a function of spring tidal range (R sub(sp)) according to the relation tau sub(S) approximately 2.3 R sub(sp) super(0.79) tau sub(C). Observed deviations from uniform tau sub(S) along individual channels are associated with along-channel variation in the direction of maximum discharge (i.e., flood-versus ebb-dominance).

Gas permeability and permselectivity of polyimides prepared from phenylenediamines with methyl substitution at the ortho position

Polyimides were prepared from diamines: 2,4,6-trimethyl-1,3-phenylenediamine (3MPDA) and 2,3,4,5-tetramethyl-1,4-phenylenediamine (4MPDA). 1,4-Bis(3,4-dicarboxyphenoxy)benzene dianhydride (HQDPA), 3,3',4,4'-benzophenone tetracarboxylic dianhydride (BTDA), 3,3'-4,4'-diphenylsulphone tetracarboxylic dianhydride (SO(2)PDA), 3,3',4,4'-diphenylsulphide tetracarboxylic dianhydride (SPDA), pyromellitic dianhydride (PMDA), and 2,2'-bis(3,4-dicarboxyphenyl)hexa-fluoroisopropane dianhydride (6FDA) were used as dianhydride. The gas permeabilities of H-2, O-2 and N-2 through the polyimides were measured at temperatures from 30 degrees C to 90 degrees C. The results show that as methyl and trifluoromethyl substitution groups densities increase from 7.73 x 10(-3) molcm(-3) to 13.50 x 10(-3)molcm(-3), the peameability of H-2 increases 10-fold at 60% loss of permselectivity of H-2/N-2 however, the permeability of O-2 increases 20-fold at 20% loss of permselectivity of O-2/N-2. For O-2/N-2 separation, PMDA-3MPDA has similar performance to 6FDA-3MPDA and 6FDA-4MPDA; all have higher permeabilities for O-2 than normal polyimides, and the P(O-2)/alpha(O-2/N-2) trade-off relationships lie on the upper bound line for polymers. (C) 1999 Society of Chemical Industry.

Influence of mean water depth and a subsurface sandbar on the onset and strength of wave breaking

Wave breaking in the open ocean and coastal zones remains an intriguing yet incompletely understood process, with a strong observed association with wave groups. Recent numerical study of the evolution of fully nonlinear, two-dimensional deep water wave groups identified a robust threshold of a diagnostic growth-rate parameter that separated nonlinear wave groups that evolved to breaking from those that evolved with recurrence. This paper investigates whether these deep water wave-breaking results apply more generally, particularly in finite-water-depth conditions. For unforced nonlinear wave groups in intermediate water depths over a flat bottom, it was found that the upper bound of the diagnostic growth-rate threshold parameter established for deep water wave groups is also applicable in intermediate water depths, given by k(0) h greater than or equal to 2, where k(0) is the mean carrier wavenumber and h is the mean depth. For breaking onset over an idealized circular arc sandbar located on an otherwise flat, intermediate-depth (k(0) h greater than or equal to 2) environment, the deep water breaking diagnostic growth rate was found to be applicable provided that the height of the sandbar is less than one-quarter of the ambient mean water depth. Thus, for this range of intermediate-depth conditions, these two classes of bottom topography modify only marginally the diagnostic growth rate found for deep water waves. However, when intermediate-depth wave groups ( k(0) h greater than or equal to 2) shoal over a sandbar whose height exceeds one-half of the ambient water depth, the waves can steepen significantly without breaking. In such cases, the breaking threshold level and the maximum of the diagnostic growth rate increase systematically with the height of the sandbar. Also, the dimensions and position of the sandbar influenced the evolution and breaking threshold of wave groups. For sufficiently high sandbars, the effects of bottom topography can induce additional nonlinearity into the wave field geometry and associated dynamics that modifies the otherwise robust deep water breaking-threshold results.

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer

Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and communicate locally via wireless broadcast. Aggregating the processors into groups is a useful paradigm for programming an amorphous computer because groups can be used for specialization, increased robustness, and efficient resource allocation. This paper presents a new algorithm, called the clubs algorithm, for efficiently aggregating processors into groups in an amorphous computer, in time proportional to the local density of processors. The clubs algorithm is well-suited to the unique characteristics of an amorphous computer. In addition, the algorithm derives two properties from the physical embedding of the amorphous computer: an upper bound on the number of groups formed and a constant upper bound on the density of groups. The clubs algorithm can also be extended to find the maximal independent set (MIS) and $Delta + 1$ vertex coloring in an amorphous computer in $O(log N)$ rounds, where $N$ is the total number of elements and $Delta$ is the maximum degree.

Learning World Models in Environments with Manifest Causal Structure

This thesis examines the problem of an autonomous agent learning a causal world model of its environment. Previous approaches to learning causal world models have concentrated on environments that are too "easy" (deterministic finite state machines) or too "hard" (containing much hidden state). We describe a new domain --- environments with manifest causal structure --- for learning. In such environments the agent has an abundance of perceptions of its environment. Specifically, it perceives almost all the relevant information it needs to understand the environment. Many environments of interest have manifest causal structure and we show that an agent can learn the manifest aspects of these environments quickly using straightforward learning techniques. We present a new algorithm to learn a rule-based causal world model from observations in the environment. The learning algorithm includes (1) a low level rule-learning algorithm that converges on a good set of specific rules, (2) a concept learning algorithm that learns concepts by finding completely correlated perceptions, and (3) an algorithm that learns general rules. In addition this thesis examines the problem of finding a good expert from a sequence of experts. Each expert has an "error rate"; we wish to find an expert with a low error rate. However, each expert's error rate and the distribution of error rates are unknown. A new expert-finding algorithm is presented and an upper bound on the expected error rate of the expert is derived.

Slack Stealing Job Admission Control Scheduling

In this paper, we present Slack Stealing Job Admission Control (SSJAC)---a methodology for scheduling periodic firm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments the slack stealing algorithm of Thuel et al with an admission control policy to manage the variability in the resource requirements of the periodic tasks. This enables SSJAC to take advantage of the 31\% of utilization that RMS cannot use, as well as any utilization unclaimed by jobs that are not admitted into the system. Using SSJAC, each task in the system is assigned a resource utilization threshold that guarantees the minimal acceptable QoS for that task (expressed as an upper bound on the rate of missed deadlines). Job admission control is used to ensure that (1) only those jobs that will complete by their deadlines are admitted, and (2) tasks do not interfere with each other, thus a job can only monopolize the slack in the system, but not the time guaranteed to jobs of other tasks. We have evaluated SSJAC against RMS and Statistical RMS (SRMS). Ignoring overhead issues, SSJAC consistently provides better performance than RMS in overload, and, in certain conditions, better performance than SRMS. In addition, to evaluate optimality of SSJAC in an absolute sense, we have characterized the performance of SSJAC by comparing it to an inefficient, yet optimal scheduler for task sets with harmonic periods.

An Omniscient Scheduling Oracle for Systems with Harmonic Periods

Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides schedules for periodic task sets with harmonic periods and variable resource requirements. Three different job value functions are described and implemented. Each corresponds to a different system goal. The oracle is used to examine the performance of different on-line schedulers under varying loads, including overload. We have compared the oracle against Rate Monotonic Scheduling, Statistical Rate Monotonic Scheduling, and Slack Stealing Job Admission Control Scheduling. Consistently, the oracle provides an upper bound on performance for the metric under consideration.