Intra-organizational Networks and Performance: A Review

Intra-organizational network research had its first heyday during the empirical revolution in social sciences before World War II when it discovered the informal group within the formal organization. These studies comment on the classic sociological idea of bureaucracy being the optimal organization. Later relational interest within organizational studies gave way to comparative studies on the quantifiable formal features of organizations. There has been a resurgence in intra-organizational networks studies recently as the conviction grows that they are critical to organizational and individual performance. Along with methodological improvements, the theoretical emphasis has shifted from networks as a constraining force to a conceptualization that sees them as providing opportunities and finally, as social capital. Because of this shift it has become necessary not only to explain the differences between networks but also their outcomes, that is, their performance. It also implies that internal and external networks should no longer be treated separately.Research on differences between intra-organizational networks centers on the influence of the formal organization, organizational demography, technology and environment. Studies on outcomes deal with diffusion and adaptation of innovation; the utilization of human capital; recruitment, absenteeism and turnover; work stress and job satisfaction; equity; power; information efficiency; collective decision making; mobilization for and outcomes of conflicts; social control; profit and survival of firms and individual performance.Of all the difficulties that are associated with intra-organizational network research, problems of access to organizations and incomparability of research findings seem to be the most serious. Nevertheless, future research should concentrate on mechanisms that make networks productive, while taking into account the difficulties of measuring performance within organizations, such as the performance paradox and the halo-effect.     

Building nonredundant adaptive wavelets by update lifting

In this paper, we propose a technique for building adaptive wavelets by means of an extension of the lifting scheme. Our scheme comprises an adaptive update lifting step and a fixed prediction lifting step. The adaptivity consists hereof that the system can choose between two different update filters, and that this choice is triggered by the local gradient of the original signal. If the gradient is large (in some seminorm sense) it chooses one filter, if it is small the other. We derive necessary and sufficient conditions for the invertibility of such an adaptive system for various scenarios. Furthermore, we present some examples to illustrate our theoretical results.     

An index formula for the product of linear relations

Let , and be linear spaces and let A and B be linear relations from to and from to , respectively. The main result of this note is a formula which relates the nullities and the defects of the relations A and B with those of the product relation BA.     

On Kre?n's formula

Kre?n's formula provides a parametrization of the generalized resolvents and Štraus extensions of a closed symmetric operator with equal possibly infinite defect numbers in a Hilbert space in terms of Nevanlinna families in a parameter space. The aim of this note is to give a simple complete analytical proof of Kre?n's formula.     

Tiling Hamming Space with Few Spheres

We show that if the collection of all binary vectors of lengthnis partitioned intokspheres, then eitherk2 orkn+2. Moreover, such partitions withk=n+2 are essentially unique.     

Using genetic programming to evolve action selection rules in traversal-based automated software testing: results obtained with the TESTAR tool

Traversal-based automated software testing involves testing an application via its graphical user interface (GUI) and thereby taking the user’s point of view and executing actions in a human-like manner. These actions are decided on the fly, as the software under test (SUT) is being run, as opposed to being set up in the form of a sequence prior to the testing, a sequence that is then used to exercise the SUT. In practice, random choice is commonly used to decide which action to execute at each state (a procedure commonly referred to as monkey testing), but a number of alternative mechanisms have also been proposed in the literature. Here we propose using genetic programming (GP) to evolve such an action selection strategy, defined as a list of IF-THEN rules. Genetic programming has proved to be suited for evolving all sorts of programs, and rules in particular, provided adequate primitives (functions and terminals) are defined. These primitives must aim to extract the most relevant information from the SUT and the dynamics of the testing process. We introduce a number of such primitives suited to the problem at hand and evaluate their usefulness based on various metrics. We carry out experiments and compare the results with those obtained by random selection and also by Q-learning, a reinforcement learning technique. Three applications are used as Software Under Test (SUT) in the experiments. The analysis shows the potential of GP to evolve action selection strategies.     

A generic framework for time-stepping partial differential equations (PDEs): general linear methods,object-oriented implementation and application to fluid problems

Time-stepping algorithms and their implementations are a critical component within the solution of time-dependent partial differential equations (PDEs). In this article, we present a generic framework – both in terms of algorithms and implementations – that allows an almost seamless switch between various explicit, implicit and implicit–explicit (IMEX) time-stepping methods. We put particular emphasis on how to incorporate time-dependent boundary conditions, an issue that goes beyond classical ODE theory but which plays an important role in the time-stepping of the PDEs arising in computational fluid dynamics. Our algorithm is based upon J.C. Butcher's unifying concept of general linear methods that we have extended to accommodate the family of IMEX schemes that are often used in engineering practice. In the article, we discuss design considerations and present an object-oriented implementation. Finally, we illustrate the use of the framework by applications to a model problem as well as to more complex fluid problems.     

Commutative and noncommutative representations of matrix-valued herglotz-nevanlinna functions

Operator realizations of matrix-valued Herglotz-Nevanlinna functions play an important and essential role in system theory, in the spectral theory of bounded nonselfadjoint operators, and in interpolation problems. Here, a generalization for realization results of the Brodskiǐ-Livsic type is given for Herglotz-Nevanlinna functions whose spectral measures are compactly supported.