Posters versus lurkers: Improving participation in enterprise social networks through promotional messages

Enterprise social networks (ESNs) often fail if there are few or no contributors of content. Promotional messages are among the common interventions used to improve participation. While most users only read others’ content (i.e. lurk), contributors who create content (i.e. post) account for only 1% of the users. Research on interventions to improve participation across dissimilar groups is scarce especially in work settings. We develop a model that examines four key motivations of posting and lurking. We employ the elaboration likelihood model to understand how promotional messages influence lurkers’ and posters’ beliefs and participation. We test our model with data collected from 366 members in two corporate Google⁺ communities in a large Australian retail organization. We find that posters and lurkers are motivated and hindered by different factors. Promotional messages do not – always – yield the hoped-for results among lurkers; however, they do make posters more enthusiastic to participate.

Fractal and multifractal properties of a family of fractal networks

In this work, we study the fractal and multifractal properties of a family of fractal networks introduced by Gallos et al (2007 Proc. Nat. Acad. Sci. USA 104 7746). In this fractal network model, there is a parameter e which is between 0 and 1, and allows for tuning the level of fractality in the network. Here we examine the multifractal behavior of these networks, the dependence relationship of the fractal dimension and the multifractal parameters on parameter e. First, we find that the empirical fractal dimensions of these networks obtained by our program coincide with the theoretical formula given by Song et al (2006 Nature Phys. 2 275). Then from the shape of the τ(q) and D(q) curves, we find the existence of multifractality in these networks. Last, we find that there exists a linear relationship between the average information dimension 〈D(1)〉 and the parameter e.

“It’s in the syllabus”: Identifying information literacy and data information literacy opportunities using a grounded theory approach

Developing innovative library services requires a real world understanding of faculty members' desired curricular goals. This study aimed to develop a comprehensive and deeper understanding of Purdue's nutrition science and political science faculties' expectations for student learning related to information and data information literacies. Course syllabi were examined using grounded theory techniques that allowed us to identify how faculty were addressing information and data information literacies in their courses, but it also enabled us to understand the interconnectedness of these literacies to other departmental intentions for student learning, such as developing a professional identity or learning to conduct original research. The holistic understanding developed through this research provides the necessary information for designing and suggesting information literacy and data information literacy services to departmental faculty in ways supportive of curricular learning outcomes.

LibVM: An architecture for shared library sandboxing

Many software applications extend their functionality by dynamically loading libraries into their allocated address space. However, shared libraries are also often of unknown provenance and quality and may contain accidental bugs or, in some cases, deliberately malicious code. Most sandboxing techniques which address these issues require recompilation of the libraries using custom tool chains, require significant modifications to the libraries, do not retain the benefits of single address-space programming, do not completely isolate guest code, or incur substantial performance overheads. In this paper we present LibVM, a sandboxing architecture for isolating libraries within a host application without requiring any modifications to the shared libraries themselves, while still retaining the benefits of a single address space and also introducing a system call inter-positioning layer that allows complete arbitration over a shared library’s functionality. We show how to utilize contemporary hardware virtualization support towards this end with reasonable performance overheads and, in the absence of such hardware support, our model can also be implemented using a software-based mechanism. We ensure that our implementation conforms as closely as possible to existing shared library manipulation functions, minimizing the amount of effort needed to apply such isolation to existing programs. Our experimental results show that it is easy to gain immediate benefits in scenarios where the goal is to guard the host application against unintentional programming errors when using shared libraries, as well as in more complex scenarios, where a shared library is suspected of being actively hostile. In both cases, no changes are required to the shared libraries themselves.

Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays;and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for T >= 4R, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multidimensional signal set.

Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of all the channels and the relays have only the phase information of the source-to-relay channels. In this paper, first, a new set of necessary and sufficient conditions for a space-time block code (STBC) to be single-symbol decodable (SSD) for colocated multiple antenna communication is obtained. Then, this is extended to a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for. a PCRC. Using this, several SSD DSTBCs for PCRC are identified. It is proved that even if a SSD STBC for a co-located MIMO channel does not satisfy the additional conditions for the code to be SSD for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property for PCRC. Finally, it is shown that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from (2)/(N) when the relays do not have CSI to(1)/(2), which is independent of N.

A thermometer for interdependence: Exploring patterns of interdependence using networks of affordances

Interdependence is a central concept in systems and organizations, yet our methods for measuring it are not well developed. Here, we report on a novel method for transforming digital trace data into networks of events that can be used to visualize and measure interdependence. The edges in the network represent sequential flow and the vertices represent actors, actions and artifacts. We refer to this representation as an affordance network. As with conventional approaches such as process mining, our method uses input from a stream of time-stamped occurrences, but the representation is simpler and more appropriate for exploration and theory building. As digital trace data becomes more widely available, this method may become more useful in information systems research and practice. Like a thermometer, it helps us measure a basic property of a system that would otherwise be difficult to see.

Two unidentified women working in the Library of the ZFA (Zentrum für Antisemitismusforschung; Center for Research on Antisemitism); Berlin Portraits Women

Digital Image

Two unidentified women working in the Library of the ZFA (Zentrum für Antisemitismusforschung; Center for Research on Antisemitism); Berlin Portraits Women

Digital Image

Study and library; Mosse family residence; Berlin Architecture; Residences; Interior

Digital Image

Library; Mosse family residence; Berlin Architecture; Residences; Interior

Digital Image

Heb. (Hebrew) University Library

Digital image

Jerusalem - Nurses' School - Library

Digital image

From workplace to profession: New focus for the information literacy discourse

The present paper suggests articulating the general context of workplace in information literacy research. The paper considers distinguishing between information literacy research in workplaces and professions. Referring to the results of a phenomenographic enquiry into web professionals’ information literacy as an example, it is indicated that work-related information literacy in particular contexts and depending on the nature of the context, is experienced beyond physical workspaces and at professional level. This involves people interacting with each other and with information at a broader level in comparison to a physically bounded workspace. Regarding the example case discussed in the paper, virtuality is identified as the dominant feature of the profession that causes information literacy to be experienced at a professional level. It is anticipated that pursuing the direction proposed in the paper will result in a more segmented image of work-related information literacy.