Home About us Contact
|
Home About us Contact | ||
|
|
||
Present Context (present + context)
Selected AbstractsBlushing after a moral transgression in a prisoner's dilemma game: appeasing or revealing?EUROPEAN JOURNAL OF SOCIAL PSYCHOLOGY, Issue 5 2002Peter J. de Jong This study investigated the alleged remedial effects of blushing in the context of real-time interactions. Therefore, 30 pairs of prosocial individuals participated in a prisoner's dilemma ,game'. The experiment was framed as an objective test of moral behaviour. To elicit a shameful moral transgression, one individual of each pair was instructed to select the non-habitual cheat-option on a pre-defined target trial. Supporting the idea that violation of shared rules elicits blushing, the defectors displayed a blush on the target trial. Yet, unexpectedly, there was a negative relationship between the observed blush intensity and the trustworthiness attributed to the defectors. One explanation might be that the ,victims' used the blush response to deduce and interpret the defector's motive. As the antecedent behaviour involved in the present context was not completely unambiguous with respect to the perpetrators' motive (e.g. innocent playing around vs. maximizing outcomes) the observers might have interpreted blushing as signaling that the situation should be interpreted as an intentional violation of a social standard. Together the available evidence suggests that only in the context of unambiguous antecedent behaviours blushing has remedial effects, whereas in ambiguous situations blushing has undesirable revealing effects. Copyright © 2002 John Wiley & Sons, Ltd. [source] A-scalability and an integrated computational technology and framework for non-linear structural dynamics.INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 15 2003Part 1: Theoretical developments, parallel formulations Abstract For large-scale problems and large processor counts, the accuracy and efficiency with reduced solution times and attaining optimal parallel scalability of the entire transient duration of the simulation for general non-linear structural dynamics problems poses many computational challenges. For transient analysis, explicit time operators readily inherit algorithmic scalability and consequently enable parallel scalability. However, the key issues concerning parallel simulations via implicit time operators within the framework and encompassing the class of linear multistep methods include the totality of the following considerations to foster the proposed notion of A-scalability: (a) selection of robust scalable optimal time discretized operators that foster stabilized non-linear dynamic implicit computations both in terms of convergence and the number of non-linear iterations for completion of large-scale analysis of the highly non-linear dynamic responses, (b) selecting an appropriate scalable spatial domain decomposition method for solving the resulting linearized system of equations during the implicit phase of the non-linear computations, (c) scalable implementation models and solver technology for the interface and coarse problems for attaining parallel scalability of the computations, and (d) scalable parallel graph partitioning techniques. These latter issues related to parallel implicit formulations are of interest and focus in this paper. The former involving parallel explicit formulations are also a natural subset of the present framework and have been addressed previously in Reference 1 (Advances in Engineering Software 2000; 31: 639,647). In the present context, of the key issues, although a particular aspect or a solver as related to the spatial domain decomposition may be designed to be numerically scalable, the totality of the aforementioned issues simultaneously play an important and integral role to attain A-scalability of the parallel formulations for the entire transient duration of the simulation and is desirable for transient problems. As such, the theoretical developments of the parallel formulations are first detailed in Part 1 of this paper, and the subsequent practical applications and performance results of general non-linear structural dynamics problems are described in Part 2 of this paper to foster the proposed notion of A-scalability. Copyright © 2003 John Wiley & Sons, Ltd. [source] Numerical approximation of optimal control of unsteady flows using SQP and time decompositionINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 1 2004S. S. RavindranArticle first published online: 1 APR 200 Abstract In this paper, we present numerical approximations of optimal control of unsteady flow problems using sequential quadratic programming method (SQP) and time domain decomposition. The SQP method is considered superior due to its fast convergence and its ability to take advantage of existing numerical techniques for fluid flow problems. It iteratively solves a sequence of linear quadratic optimal control problems converging to the solution of the non-linear optimal control problem. The solution to the linear quadratic problem is characterized by the Karush,Kuhn,Tucker (KKT) optimality system which in the present context is a formidable system to solve. As a remedy various time domain decompositions, inexact SQP implementations and block iterative methods to solve the KKT systems are examined. Numerical results are presented showing the efficiency and feasibility of the algorithms. Copyright © 2004 John Wiley & Sons, Ltd. [source] Estimation of origin,destination trip rates in LeicesterJOURNAL OF THE ROYAL STATISTICAL SOCIETY: SERIES C (APPLIED STATISTICS), Issue 4 2001Martin L. Hazelton The road system in region RA of Leicester has vehicle detectors embedded in many of the network's road links. Vehicle counts from these detectors can provide transportation researchers with a rich source of data. However, for many projects it is necessary for researchers to have an estimate of origin-to-destination vehicle flow rates. Obtaining such estimates from data observed on individual road links is a non-trivial statistical problem, made more difficult in the present context by non-negligible measurement errors in the vehicle counts collected. The paper uses road link traffic count data from April 1994 to estimate the origin,destination flow rates for region RA. A model for the error prone traffic counts is developed, but the resulting likelihood is not available in closed form. Nevertheless, it can be smoothly approximated by using Monte Carlo integration. The approximate likelihood is combined with prior information from a May 1991 survey in a Bayesian framework. The posterior is explored using the Hastings,Metropolis algorithm, since its normalizing constant is not available. Preliminary findings suggest that the data are overdispersed according to the original model. Results for a revised model indicate that a degree of overdispersion exists, but that the estimates of origin,destination flow rates are quite insensitive to the change in model specification. [source] A New Look at Gender Effects in Participation and Occupation ChoiceLABOUR, Issue 3 2001Didier Soopramanien In this paper we evaluate the extent to which changes over time in women's labour market destinations are due to characteristics, on the one hand, and prices, on the other. Multinomial and nested logit methods are used to analyse US data for 1970 and 1990, and the results are compared. The latter method, which has not previously been employed in the present context, alleviates problems due to the strong assumption in simpler models of the independence of irrelevant alternatives, and provides much additional useful information. [source] Optimal portion control using variable cutter-blade spacing in can-fillingPACKAGING TECHNOLOGY AND SCIENCE, Issue 4 2001F. Omar Abstract In the present context, optimal portion control refers to the process of preparing can-filling portions so that the deviation of the portion weight from a specified target weight is minimized. An approach has been developed for achieving this where a batch of objects is placed in a linearly overlapped optimal arrangement and then cut into portions using a series of parallel blades. The parameters of optimization are the arrangement order, orientation and degree of overlap of the objects. The approach has been demonstrated to produce impressive improvements in the application of fish canning. For this application, two approaches of optimal cutting are compared in the present paper. In one approach, the blade spacing is kept fixed and constant at a predetermined value. In the second approach, the blade spacing is varied for each portion after the objects are placed according to the optimal arrangement, where the target weight distribution is allowed to vary within a tolerance interval. The results presented in this paper indicate that the second approach produces a significantly higher percentage of acceptable portions than the first approach. What is presented are results from computer simulations, utilizing true data as measured from actual batches of fish. The paper demonstrates the potential benefit of the optimal portion control approach when applied in an industrial fish-canning process. Copyright © 2001 John Wiley & Sons, Ltd. [source] | ||||||||||