Humanizing the self: Moderators of the attribution of lesser humanness to others

Three studies investigated moderators of the tendency to attribute greater humanness to the self than to others, an interpersonal counterpart of outgroup infra-humanization. Study 1 demonstrated that this self-humanizing effect is reduced when the other is the focus of comparison. Study 2 showed that the effect is reduced when the other is individuated. Study 3 indicated that empathy does not moderate self-humanizing: Self-humanizing failed to correlate negatively with dispositional empathy or perspective-taking. Study 3 also indicated that abstract construal moderates the self-humanizing effect using a temporal comparison. Participants rated their future self, but not their past self, as less human than their present self. Studies 1 and 3 also showed that selfhumanizing is greater for undesirable traits: People may view their failings as “only human.” All findings were distinct from those attributable to self-enhancement. Self-humanizing may reflect a combination of egocentrism, focalism, abstract representation of others, and motivated processes.

Design and evaluation of intentionally enriched awareness

In this chapter we introduce and explore the notion of “intentionally enriched awareness”. Intentional enrichment refers to the process of actively engaging users in the awareness process by enabling them to express intentions. We initially look at the phenomenon if sharing intentional information in related collaborative systems. We then explore the concept of intentional enrichment through designing and evaluating the AnyBiff system which allows users to freely create, share and use a variety of biff applications. Biffs are simple representation of pre-defined activities. Users can select biffs to indicate that they are engaged in an activity. We summarise the results of a trial which allowed us to gain insights into the potential of the AnyBiff prototype and the underlying biff concept to implement intentionally enriched awareness. Our findings show that intentional disclosure mechanisms in the form of biffs were successfully used in a variety of contexts. Users actively engaged in the design of a large variety of biffs and explored many different uses of the concept. The study revealed a whole host of issues with regard to intentionally enriched awareness which give valuable insight into the conception and design of future applications in this area.

Design of a tangible data visualization (extended)

In this paper we describe the design of DNA Jewelry, which is a wearable tangible data representation of personal DNA profile data. An iterative design process was followed to develop a 3D form-language that could be mapped to standard DNA profile data, with the aim of retaining readability of data while also producing an aesthetically pleasing and unique result in the area of personalised design. The work explores design issues with the production of data tangibles, contributes to a growing body of research exploring tangible representations of data and highlights the importance of approaches that move between technology, art and design.

Automatic clustering and population analysis of white matter tracts using maximum density paths

We introduce a framework for population analysis of white matter tracts based on diffusion-weighted images of the brain. The framework enables extraction of fibers from high angular resolution diffusion images (HARDI); clustering of the fibers based partly on prior knowledge from an atlas; representation of the fiber bundles compactly using a path following points of highest density (maximum density path; MDP); and registration of these paths together using geodesic curve matching to find local correspondences across a population. We demonstrate our method on 4-Tesla HARDI scans from 565 young adults to compute localized statistics across 50 white matter tracts based on fractional anisotropy (FA). Experimental results show increased sensitivity in the determination of genetic influences on principal fiber tracts compared to the tract-based spatial statistics (TBSS) method. Our results show that the MDP representation reveals important parts of the white matter structure and considerably reduces the dimensionality over comparable fiber matching approaches.

Endogenous and exogenous effects in self-exciting process models of terrorist activity

A model based on the cluster process representation of the self-exciting process model in White and Porter 2013 and Ruggeri and Soyer 2008is derived to allow for variation in the excitation effects for terrorist events in a self-exciting or cluster process model. The details of the model derivation and implementation are given and applied to data from the Global Terrorism Database from 2000–2012. Results are discussed in terms of practical interpretation along with implications for a theoretical model paralleling existing criminological theory.

Genetics of ankylosing spondylitis and rheumatoid arthritis: Where are we at currently, and how do they compare?

Both ankylosing spondylitis (AS) and rheumatoid arthritis (RA) are common, highly heritable conditions, the pathogenesis of which are incompletely understood. Gene-mapping studies in both conditions have over the last couple of years made major breakthroughs in identifying the mechanisms by which these diseases occur. Considering RA, there is an over-representation of genes involved in TNF signalling and the NFκB pathway that have been shown to influence the disease risk. There is also considerable sharing of susceptibility genes between RA and other autoimmune diseases such as systemic lupus erythematosus, type 1 diabetes, autoimmune thyroid disease and celiac disease, with thus far little overlap with AS. In AS, genes involved in response to IL12/IL23, and in endoplasmic reticulum peptide presentation, have been identified, but a full genomewide association study has not yet been reported.

Predominant association of HLA-B*2704 with ankylosing spondylitis in Chinese Han patients

The HLA-B27 subtypes have a varied racial and ethnic prevalence throughout the world. However, the association of B27-subtypes with ankylosing spondylitis (AS) in the mainland China is unknown. To determine the association of B27-subtypes with AS in the Mainland Chinese Han population, a total of unrelated 153 patients with AS were enrolled in a large case-control association study, and 1545 unrelated, healthy, ethnically matched blood donors were included as controls. The genotyping of B27 and its subtypes was performed using the polymerase chain reaction with sequence specific primers (PCR-SSP). A total of 130 (84.97%) AS patients and 61 (3.95%) healthy controls were B27 positive. Three B27-subtypes, B*2704, B*2705 and B*2710, were further identified, of which both B*2704 and B*2705 were strongly AS associated. B*2710 was only detected in one AS patient and two other healthy controls. Considering only B27-positive cases and controls, a statistically different frequency of B27-subtypes was observed, with an over-representation of B*2704 (P = 0.018). B*2704 was clearly more strongly associated than B*2705 with AS [odds ratio (OR) = 2.4, P = 0.011]. Furthermore, a combined analysis including three previous studies of B27-subtype distributions in Chinese AS cases confirmed the stronger association of B*2704 with AS than B*2705 (OR = 2.5, P = 0.00094).

Boundary element analysis of reinforced concrete structural elements

A simple and practical technique for the discrete representation of reinforcement in two-dimensional boundary element analysis of reinforced concrete structural elements is presented. The bond developed over the surface of contact between the reinforcing steel and concrete is represented using fictitious one-dimensional spring elements. Potentials of the model developed are demonstrated using a number of numerical examples. The results are seen to be in good agreement with the results obtained using standard finite element software.

Approximate solution of u'=-A2u using a relation between exp(-tA2) and exp(itA)

Let A be a positive definite operator in a Hilbert space and consider the initial value problem for u(t) = -A(2)u. Using a representation of the semigroup exp(-A(2)t) in terms of the group exp(iAt) we express u in terms of the solution of the standard heat equation w(t) = W-yy, with initial values v solving the initial value problem for v(y) = iAv. This representation is used to construct a method for approximating u in terms of approximations of v. In the case that A is a 2(nd) order elliptic operator the method is combined with finite elements in the spatial variable and then reduces the solution of the 4(th) order equation for u to that of the 2(nd) order equation for v, followed by the solution of the heat equation in one space variable.

Programming an FPGA to Emulate the Dynamics of DC Machines

This paper presents the programming an FPGA (Field Programmable Gate Array) to emulate the dynamics of DC machines. FPGA allows high speed real time simulation with high precision. The described design includes block diagram representation of DC machine, which contain all arithmetic and logical operations. The real time simulation of the machine in FPGA is controlled by user interfaces they are Keypad interface, LCD display on-line and digital to analog converter. This approach provides emulation of electrical machine by changing the parameters. Separately Exited DC machine implemented and experimental results are presented.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

Socio-environmental impact of idol immersion: dimensions and directions

India possesses a diverse and rich cultural heritage and is renowned as a 'land of festivals'. These festivals attract massive community involvement paving way to new materials such as 'Plaster of Paris' being used for 'modernizing' the representation of idols with very little thought given to the issues of toxicity and environmental impacts. Another dimension to the whole issue is the plight of the artisans and the workers involved in the trade. Owing to the unorganized nature of the industry there is minimal or no guidelines pertaining-to the worker safety and health risks of the people involved. This paper attempts to address the complexities of the inherent hazards as a consequence of these socio-environmental issues and trace the scientific rationale in addressing them in a practical and pragmatic way.

On optimum stratification with proportional allocation for a class of pareto distributions

Cum ./LSTA_A_8828879_O_XML_IMAGES/LSTA_A_8828879_O_ILM0001.gif rule [Singh (1975)] has been suggested in the literature for finding approximately optimum strata boundaries for proportional allocation, when the stratification is done on the study variable. This paper shows that for the class of density functions arising from the Wang and Aggarwal (1984) representation of the Lorenz Curve (or DBV curves in case of inventory theory), the cum ./LSTA_A_8828879_O_XML_IMAGES/LSTA_A_8828879_O_ILM0002.gif rule in place of giving approximately optimum strata boundaries, yields exactly optimum boundaries. It is also shown that the conjecture of Mahalanobis (1952) “. . .an optimum or nearly optimum solutions will be obtained when the expected contribution of each stratum to the total aggregate value of Y is made equal for all strata” yields exactly optimum strata boundaries for the case considered in the paper.

Software simulation of the EEG

The literature contains many examples of digital procedures for the analytical treatment of electroencephalograms, but there is as yet no standard by which those techniques may be judged or compared. This paper proposes one method of generating an EEG, based on a computer program for Zetterberg's simulation. It is assumed that the statistical properties of an EEG may be represented by stationary processes having rational transfer functions and achieved by a system of software fillers and random number generators.The model represents neither the neurological mechanism response for generating the EEG, nor any particular type of EEG record; transient phenomena such as spikes, sharp waves and alpha bursts also are excluded. The basis of the program is a valid ‘partial’ statistical description of the EEG; that description is then used to produce a digital representation of a signal which if plotted sequentially, might or might not by chance resemble an EEG, that is unimportant. What is important is that the statistical properties of the series remain those of a real EEG; it is in this sense that the output is a simulation of the EEG. There is considerable flexibility in the form of the output, i.e. its alpha, beta and delta content, which may be selected by the user, the same selected parameters always producing the same statistical output. The filtered outputs from the random number sequences may be scaled to provide realistic power distributions in the accepted EEG frequency bands and then summed to create a digital output signal, the ‘stationary EEG’. It is suggested that the simulator might act as a test input to digital analytical techniques for the EEG, a simulator which would enable at least a substantial part of those techniques to be compared and assessed in an objective manner. The equations necessary to implement the model are given. The program has been run on a DEC1090 computer but is suitable for any microcomputer having more than 32 kBytes of memory; the execution time required to generate a 25 s simulated EEG is in the region of 15 s.

An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables

Abstract-To detect errors in decision tables one needs to decide whether a given set of constraints is feasible or not. This paper describes an algorithm to do so when the constraints are linear in variables that take only integer values. Decision tables with such constraints occur frequently in business data processing and in nonnumeric applications. The aim of the algorithm is to exploit. the abundance of very simple constraints that occur in typical decision table contexts. Essentially, the algorithm is a backtrack procedure where the the solution space is pruned by using the set of simple constrains. After some simplications, the simple constraints are captured in an acyclic directed graph with weighted edges. Further, only those partial vectors are considered from extension which can be extended to assignments that will at least satisfy the simple constraints. This is how pruning of the solution space is achieved. For every partial assignment considered, the graph representation of the simple constraints provides a lower bound for each variable which is not yet assigned a value. These lower bounds play a vital role in the algorithm and they are obtained in an efficient manner by updating older lower bounds. Our present algorithm also incorporates an idea by which it can be checked whether or not an (m - 2)-ary vector can be extended to a solution vector of m components, thereby backtracking is reduced by one component.