Dispositional Hardiness and Women’s Well-Being Relating to Gender Discrimination: The Role of Minimization

Three studies examined whether personality-based hardiness would be associated with mental health benefits in contexts of gender discrimination. Hardy women encountering both a laboratory simulation and a hypothetical scenario of discrimination showed greater self-esteem and less negative affect than low hardy women. However, these benefits were mediated by the use of specific attributions, suggesting that the well-being in hardy women may have been achieved through minimizing the pervasiveness of discrimination. Study three showed this mediation pattern occurred only for participants exposed to higher threat scenarios versus lower threat scenarios of discrimination. Thus, minimizing the pervasiveness of discrimination may have been a threat-reducing tool for high hardy women. Bandura’s (1997) self-efficacy theory was used as a possible explanation for this finding

The Role of Hardiness in Moderating the Relationship between Global/Specific Attributions and Actions against Discrimination

In this study, we proposed that individual differences in hardiness may moderate the relationship between global attributions and actions against discrimination. Specifically, global attributions were expected to predict decreased endorsement of actions to combat discrimination among low hardy women. In contrast, global attributions were expected to predict increased endorsement of actions among high hardy women. High and low hardy women were exposed to a laboratory situation of discrimination, and their attributions for, and responses to, discrimination were then assessed. Results showed the expected interaction, but in the opposite direction: among low hardy women, global attributions predicted stronger endorsement of action.Among high hardy women, specific attributions predicted stronger endorsement of action. Theoretical and practical implications are discussed

A simple implementation of the Viterbi algorithm on the Motorola DSP56001

As systems designers design communication systems with digital rather than analog components to reduce noise and increase channel capacity, they must have the ability to perform traditional communication algorithms digitally. The use of trellis coded modulation as well as the extensive use of convolutional encoding for error detection and correction requires an efficient digital implementation of the Viterbi Algorithm for real time demodulation and decoding. Digital signal processors are now fast enough to implement Viterbi decoding in conjunction with the normal receiver/transmitter functions for lower speed channels on a single chip as well as performing fast decoding for higher speed channels, if the algorithm is implemented efficiently. The purpose of this paper is to identify a good way to implement the Viterbi Algorithm (VA) on the Motorola DSP56001, balancing performance considerations with speed and memory efficiency

Acoustic echo cancellation for full-duplex voice transmission on fading channels

This paper discusses the implementation of an adaptive acoustic echo canceler for a hands-free cellular phone operating on a fading channel. The adaptive lattice structure, which is particularly known for faster convergence relative to the conventional tapped-delay-line (TDL) structure, is used in the initialization stage. After convergence, the lattice coefficients are converted into the coefficients for the TDL structure which can accommodate a larger number of taps in real-time operation due to its computational simplicity. The conversion method of the TDL coefficients from the lattice coefficients is derived and the DSP56001 assembly code for the lattice and TDL structure is included, as well as simulation results and the schematic diagram for the hardware implementation

Pemodelan Farmakokinetika Berbasis Populasi dengan R: Model Dua Kompartemen Ekstravaskuler: Population-Based Pharmacokinetics Modeling With R: Two Compartment Extravascular Model

A Tutorial of two-compartment extravascular population-based pharmacokinetics modeling was performed by differential equations and non-linear mixed effect model approach. First, three-level differential equations of two-compartment pharmacokinetics were generated. Then, covariate and non-covariate models were developed by nlmeODE and nlme packages installed in R. The best model was selected according to AIC, BIC, and LogLik value. A model without covariates model was selected as the best model. The selected model showed a goodness of fit with experimental dataset and residual plot of the model revealed that no violations of model assumtions.  In conclusion, nlme and nlmeODE is capable to generate an adequate predictive model of two-compartment population-based pharmacokinetics for extravascular rout

Bilepton Production at Hadron Colliders

We examine, as model-independently as possible, the production of bileptons at hadron colliders. When a particular model is necessary or useful, we choose the 3-3-1 model. We consider a variety of processes: q anti-q -> Y^{++} Y^{--}, u anti-d -> Y^{++} Y^{-}, anti-u d -> Y^+ Y^{--}, q anti-q -> Y^{++} e^{-} e^{-}, q anti-q -> phi^{++} phi^{--}, u anti-d -> -> phi^{++} phi^{-}, and anti-u d -> phi^{+} phi^{--}, where Y and phi are vector and scalar bileptons, respectively. Given the present low-energy constraints, we find that at the Tevatron, vector bileptons are unobservable, while light scalar bileptons (M_phi <= 300 GeV) are just barely observable. At the LHC, the reach is extended considerably: vector bileptons of mass M_Y <= 1 TeV are observable, as are scalar bileptons of mass M_phi <= 850 GeV.Comment: 20 pages (LATEX), 7 figures, minor modification

The role of bipartite structure in R&D collaboration networks

A number of real-world networks are, in fact, one-mode projections of bipartite networks comprised of two types of nodes. For institutions engaging in collaboration for technological innovation, the underlying network is bipartite with institutions (agents) linked to the patents they have filed (artifacts), while the projection is the co-patenting network. Projected network topology is highly affected by the underlying bipartite structure, hence a lack of understanding of the bipartite network has consequences for the information that might be drawn from the one-mode co-patenting network. Here, we create an empirical bipartite network using data from 2.7 million patents. We project this network onto the agents (institutions) and look at properties of both the bipartite and projected networks that may play a role in knowledge sharing and collaboration. We compare these empirical properties to those of synthetic bipartite networks and their projections in order to understand the processes that might operate in the network formation. A good understanding of the topology is critical for investigating the potential flow of technological knowledge. We show how degree distributions and small cycles affect the topology of the one-mode projected network - specifically degree and clustering distributions, and assortativity. We propose new network-based metrics to quantify how collaborative agents are in the co-patenting network. We find that several large corporations that are the most collaborative agents in the network, however such organisations tend to have a low diversity of collaborators. In contrast, the most prolific institutions tend to collaborate relatively little but with a diverse set of collaborators. This indicates that they concentrate the knowledge of their core technical research, while seeking specific complementary knowledge via collaboration with smaller companies.Comment: 23 pages, 12 figures, 2 table

Semidefinite code bounds based on quadruple distances

Let $A(n,d)$ be the maximum number of $0,1$ words of length $n$, any two having Hamming distance at least $d$. We prove $A(20,8)=256$, which implies that the quadruply shortened Golay code is optimal. Moreover, we show $A(18,6)\leq 673$, $A(19,6)\leq 1237$, $A(20,6)\leq 2279$, $A(23,6)\leq 13674$, $A(19,8)\leq 135$, $A(25,8)\leq 5421$, $A(26,8)\leq 9275$, $A(21,10)\leq 47$, $A(22,10)\leq 84$, $A(24,10)\leq 268$, $A(25,10)\leq 466$, $A(26,10)\leq 836$, $A(27,10)\leq 1585$, $A(25,12)\leq 55$, and $A(26,12)\leq 96$. The method is based on the positive semidefiniteness of matrices derived from quadruples of words. This can be put as constraint in a semidefinite program, whose optimum value is an upper bound for $A(n,d)$. The order of the matrices involved is huge. However, the semidefinite program is highly symmetric, by which its feasible region can be restricted to the algebra of matrices invariant under this symmetry. By block diagonalizing this algebra, the order of the matrices will be reduced so as to make the program solvable with semidefinite programming software in the above range of values of $n$ and $d$.Comment: 15 page

New partitioning perturbation theory. 2 - Example of almost degeneracy

Degeneracy applications to partitioning perturbation theory - Part