A fast semi-implicit difference method for a nonlinear two-sided space-fractional diffusion equation with variable diffusivity coefficients

In this paper, we derive a new nonlinear two-sided space-fractional diffusion equation with variable coefficients from the fractional Fick’s law. A semi-implicit difference method (SIDM) for this equation is proposed. The stability and convergence of the SIDM are discussed. For the implementation, we develop a fast accurate iterative method for the SIDM by decomposing the dense coefficient matrix into a combination of Toeplitz-like matrices. This fast iterative method significantly reduces the storage requirement of O(n2)O(n2) and computational cost of O(n3)O(n3) down to n and O(nlogn)O(nlogn), where n is the number of grid points. The method retains the same accuracy as the underlying SIDM solved with Gaussian elimination. Finally, some numerical results are shown to verify the accuracy and efficiency of the new method.

Psychological essentialism, implicit theories, and intergroup relations

Research on implicit person theories shows that beliefs about the malleability of human attributes have important implications for social cognition, interpersonal behavior, and intergroup relations. We argue that these implications can be understood within the framework of psychological essentialism, which extends work on implicit theories in promising directions. We review evidence that immutability beliefs covary with a broader set of essentialist beliefs, and that these essentialist beliefs are associated with stereotyping and prejudice. We then present recent studies indicating that associations between implicit person theories and stereotyping may be explained in terms of essentialist beliefs, implying a significant role for these beliefs in the psychology of group perception. Finally, we propose ways in which research and theory on essentialist beliefs might clarify and advance research on implicit person theories.

The implicit structure of positive characteristics

The implicit structure of positive character traits was examined in two studies of 190 and 100 undergraduates. Participants judged the pairwise covariation or semantic similarity of 42 positive characteristics using a sorting or a rating task. Characteristics were drawn from a new classification of strengths and virtues, the Five-Factor Model, and a taxonomy of values. Participants showed consistent patterns of perceived association among the characteristics across the study conditions. Multidimensional scaling yielded three consistent dimensions underlying these judgments (“warmth vs. self-control,” “vivacity vs. decency,” and “wisdom vs. power”). Cluster analyses yielded six consistent groupings—“self-control,” “love,” “wisdom,” “drive,” “vivacity,” and “collaboration”—that corresponded only moderately to the virtue classification. All three taxonomies were systematically related to this implicit structure, but none captured it satisfactorily on its own. Revisions to positive psychology’s classification of strengths are proposed.

Bank guarantees and the reasonable expectations of beneficiaries

A bank guarantee has traditionally been viewed as a cash equivalent. This view is supported by the operation of the autonomy principle. However, the autonomy principle is subject to certain recognised exceptions both at common law and under statute. One of these exceptions is commonly referred to as the negative stipulation or underlying contract exception. In recent times the operation of this particular exception has given rise to a wealth of case law. This article examines whether this recent case law appropriately recognises the reasonable expectations of the beneficiary of a bank guarantee that a bank guarantee should function not only as a security but as a risk allocation device.

Implicit and multigrid procedures for steady-state computations with upwind algorithms

A computational study for the convergence acceleration of Euler and Navier-Stokes computations with upwind schemes has been conducted in a unified framework. It involves the flux-vector splitting algorithms due to Steger-Warming and Van Leer, the flux-difference splitting algorithms due to Roe and Osher and the hybrid algorithms, AUSM (Advection Upstream Splitting Method) and HUS (Hybrid Upwind Splitting). Implicit time integration with line Gauss-Seidel relaxation and multigrid are among the procedures which have been systematically investigated on an individual as well as cumulative basis. The upwind schemes have been tested in various implicit-explicit operator combinations such that the optimal among them can be determined based on extensive computations for two-dimensional flows in subsonic, transonic, supersonic and hypersonic flow regimes. In this study, the performance of these implicit time-integration procedures has been systematically compared with those corresponding to a multigrid accelerated explicit Runge-Kutta method. It has been demonstrated that a multigrid method employed in conjunction with an implicit time-integration scheme yields distinctly superior convergence as compared to those associated with either of the acceleration procedures provided that effective smoothers, which have been identified in this investigation, are prescribed in the implicit operator.

Implicit and explicit interactions in video mediated collaboration

In this paper we report the results of a study comparing implicit-only and explicit-only interactions in a collaborative, video-mediated task with shared content. Expanding on earlier work which has typically only evaluated how implicit interaction can augment primarily explicit systems, we report issues surrounding control, anxiousness and negotiation in the context of video mediated collaboration. We conclude that implicit interaction has the potential to improve collaborative work, but that there are a multitude of issues that must first be negotiated.

The fully implicit stochastic-alpha method for stiff stochastic differential equations

A fully implicit integration method for stochastic differential equations with significant multiplicative noise and stiffness in both the drift and diffusion coefficients has been constructed, analyzed and illustrated with numerical examples in this work. The method has strong order 1.0 consistency and has user-selectable parameters that allow the user to expand the stability region of the method to cover almost the entire drift-diffusion stability plane. The large stability region enables the method to take computationally efficient time steps. A system of chemical Langevin equations simulated with the method illustrates its computational efficiency.

Activation and persistence of implicit causality information in spoken language comprehension

A visual world eye-tracking study investigated the activation and persistence of implicit causality information in spoken language comprehension. We showed that people infer the implicit causality of verbs as soon as they encounter such verbs in discourse, as is predicted by proponents of the immediate focusing account (Greene & McKoon, 1995; Koornneef & Van Berkum, 2006; Van Berkum, Koornneef, Otten, & Nieuwland, 2007). Interestingly, we observed activation of implicit causality information even before people encountered the causal conjunction. However, while implicit causality information was persistent as the discourse unfolded, it did not have a privileged role as a focusing cue immediately at the ambiguous pronoun when people were resolving its antecedent. Instead, our study indicated that implicit causality does not affect all referents to the same extent, rather it interacts with other cues in the discourse, especially when one of the referents is already prominently in focus.

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.

The approximate parametrization of the curve of intersection of implicit surfaces

A clear definition of an approximate parametrization of the curve of intersection of (n-1) implicit surfaces in Rn is given. It is justified that marching methods yield such an approximation.

Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs

We consider a problem of providing mean delay and average throughput guarantees in random access fading wireless channels using CSMA/CA algorithm. This problem becomes much more challenging when the scheduling is distributed as is the case in a typical local area wireless network. We model the CSMA network using a novel queueing network based approach. The optimal throughput per device and throughput optimal policy in an M device network is obtained. We provide a simple contention control algorithm that adapts the attempt probability based on the network load and obtain bounds for the packet transmission delay. The information we make use of is the number of devices in the network and the queue length (delayed) at each device. The proposed algorithms stay within the requirements of the IEEE 802.11 standard.

Implicit scheme for meshless compressible Euler solver

In this paper, an implicit scheme is presented for a meshless compressible Euler solver based on the Least Square Kinetic Upwind Method (LSKUM). The Jameson and Yoon's split flux Jacobians formulation is very popular in finite volume methodology, which leads to a scalar diagonal dominant matrix for an efficient implicit procedure (Jameson & Yoon, 1987). However, this approach leads to a block diagonal matrix when applied to the LSKUM meshless method. The above split flux Jacobian formulation, along with a matrix-free approach, has been adopted to obtain a diagonally dominant, robust and cheap implicit time integration scheme. The efficacy of the scheme is demonstrated by computing 2D flow past a NACA 0012 airfoil under subsonic, transonic and supersonic flow conditions. The results obtained are compared with available experiments and other reliable computational fluid dynamics (CFD) results. The present implicit formulation shows good convergence acceleration over the RK4 explicit procedure. Further, the accuracy and robustness of the scheme in 3D is demonstrated by computing the flow past an ONERA M6 wing and a clipped delta wing with aileron deflection. The computed results show good agreement with wind tunnel experiments and other CFD computations.

Rigorous finite-time guarantees for optimization on continuous domains by simulated annealing

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.