Defining friendworks : communication perspective on social networks types

This paper introduces friendwork as a new term in social networks studies. A friendwork is a network of friends. It is a specific case of an interpersonal social network. Naming this seemingly well known and familiar group of people as a friendwork facilitates its differentiation from the overall social network, while highlighting this subgroup's specific attributes and dynamics. The focus on one segment within social networks stimulates a wider discussion regarding the different subgroups within social networks. Other subgroups also discussed in this paper are: family dependent, work related, location based and virtual acquaintances networks. This discussion informs a larger study of social media, specifically addressing interactive communication modes that are in use within friendworks: direct (face-to-face) and mediated (mainly fixed telephone, internet and mobile phone). It explores the role of social media within friendworks while providing a communication perspective on social networks.

New Media and Public Communication: Mapping Australian User-Created Content in Online Social Networks

Presentation describling a project in data intensive research in the humanities. Measuring activity of publically available data in social networks such as Blogosphere, Twitter, Flickr, YouTube

Communication patterns within social networks : a case study of Australian women

Based on the perception that “individual bonds to one another is the essence of society” (Fischer, 1982a, p. 2), this paper examines contemporary networks of friends: friendworks, of adult women in an Australian sea change community. Communication patterns are examined drawing on findings from a case study of 26 women aged 35-76 years. Among the case study participants, many have undertaken a ‘sea change’ as adults, which in most cases has led to a significant reconstruction of their friendworks. Location and lifestyle are identified as impacting factors on communication patterns with friends; face-to-face interactions are by far the most frequent and preferred method of communication among the participants. The landline telephone and internet are the main communication methods used to maintain friendships with distant loved ones, while the mobile phone is reported as the communication method employed the least. The infrequency of mobile phone use can be attributed to cost issues, highlighting a discrepancy between these women’s social and communication needs and the current Australian mobile phone policy.

Communication and organizational social networks : a simulation model

Recent management research has evidenced the significance of organizational social networks, and communication is believed to impact the interpersonal relationships. However, we have little knowledge on how communication affects organizational social networks. This paper studies the dynamics between organizational communication patterns and the growth of organizational social networks. We propose an organizational social network growth model, and then collect empirical data to test model validity. The simulation results agree well with the empirical data. The results of simulation experiments enrich our knowledge on communication with the findings that organizational management practices that discourage employees from communicating within and across group boundaries have disparate and significant negative effect on the social network’s density, scalar assortativity and discrete assortativity, each of which correlates with the organization’s performance. These findings also suggest concrete measures for management to construct and develop the organizational social network.

Slotted cooperative communication in half duplex relay networks

In cooperative communication systems, several wireless communication terminals collaborate to form a virtual-multiple antenna array system and exploit the spatial diversity to achieve a better performance. This thesis proposes a practical slotted protocol for cooperative communication systems with half-duplex single antennas. The performance of the proposed slotted cooperative communication protocol is evaluated in terms of the pairwise error probability and the bit error rate. The proposed protocol achieves the multiple-input single-output performance bound with a novel relay ordering and scheduling strategy.

Second language social networks and communication-related acculturative stress: The role of interconnectedness

Although a substantial amount of cross-cultural psychology research has investigated acculturative stress in general, little attention has been devoted specifically to communication-related acculturative stress (CRAS). In line with the view that cross-cultural adaptation and second language (L2) learning are social and interpersonal phenomena, the present study examines the hypothesis that migrants’ L2 social network size and interconnectedness predict CRAS. The main idea underlying this hypothesis is that L2 social networks play an important role in fostering social and cultural aspects of communicative competence. Specifically, higher interconnectedness may reflect greater access to unmodified natural cultural representations and L2 communication practices, thus fostering communicative competence through observational learning. As such, structural aspects of migrants’ L2 social networks may be protective against acculturative stress arising from chronic communication difficulties. Results from a study of first generation migrant students (N = 100) support this idea by showing that both inclusiveness and density of the participants’ L2 network account for unique variance in CRAS but not in general acculturative stress. These results support the idea that research on cross-cultural adaptation would benefit from disentangling the various facets of acculturative stress and that the structure of migrants’ L2 network matters for language related outcomes. Finally, this study contributes to an emerging body of work that attempts to integrate cultural/cross-cultural research on acculturation and research on intercultural communication and second language learning.

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Ligand dependent intra and inter subunit communication in human tryptophanyl tRNA synthetase as deduced from the dynamics of structure networks

Homodimeric protein tryptophanyl tRNA synthetase (TrpRS) has a Rossmann fold domain and belongs to the 1c subclass of aminoacyl tRNA synthetases. This enzyme performs the function of acylating the cognate tRNA. This process involves a number of molecules (2 protein subunits, 2 tRNAs and 2 activated Trps) and thus it is difficult to follow the complex steps in this process. Structures of human TrpRS complexed with certain ligands are available. Based on structural and biochemical data, mechanism of activation of Trp has been speculated. However, no structure has yet been solved in the presence of both the tRNA(Trp) and the activated Trp (TrpAMP). In this study, we have modeled the structure of human TrpRS bound to the activated ligand and the cognate tRNA. In addition, we have performed molecular dynamics (MD) simulations on these models as well as other complexes to capture the dynamical process of ligand induced conformational changes. We have analyzed both the local and global changes in the protein conformation from the protein structure network (PSN) of MD snapshots, by a method which was recently developed in our laboratory in the context of the functionally monomeric protein, methionyl tRNA synthetase. From these investigations, we obtain important information such as the ligand induced correlation between different residues of this protein, asymmetric binding of the ligands to the two subunits of the protein as seen in the crystal structure analysis, and the path of communication between the anticodon region and the aminoacylation site. Here we are able to elucidate the role of dimer interface at a level of detail, which has not been captured so far.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.

Designing tools that enhance communication and understanding between multiple stakeholders: the case of mobile payment value networks

The pervasive use of mobile technologies has provided new opportunities for organisations to achieve competitive advantage by using a value network of partners to create value for multiple users. The delivery of a mobile payment (m-payment) system is an example of a value network as it requires the collaboration of multiple partners from diverse industries, each bringing their own expertise, motivations and expectations. Consequently, managing partnerships has been identified as a core competence required by organisations to form viable partnerships in an m-payment value network and an important factor in determining the sustainability of an m-payment business model. However, there is evidence that organisations lack this competence which has been witnessed in the m-payment domain where it has been attributed as an influencing factor in a number of failed m-payment initiatives since 2000. In response to this organisational deficiency, this research project leverages the use of design thinking and visualisation tools to enhance communication and understanding between managers who are responsible for managing partnerships within the m-payment domain. By adopting a design science research approach, which is a problem solving paradigm, the research builds and evaluates a visualisation tool in the form of a Partnership Management Canvas. In doing so, this study demonstrates that when organisations encourage their managers to adopt design thinking, as a way to balance their analytical thinking and intuitive thinking, communication and understanding between the partners increases. This can lead to a shared understanding and a shared commitment between the partners. In addition, the research identifies a number of key business model design issues that need to be considered by researchers and practitioners when designing an m-payment business model. As an applied research project, the study makes valuable contributions to the knowledge base and to the practice of management.