The evidence base for social support interventions in child and family practice: Emerging issues for research and practice

This paper examines the evidence base for interventions which seek to enhance social support resources for families with children at risk of adverse developmental outcomes. Substantive and methodological issues related to the implementation of social support interventions are discussed and a research agenda for the development, testing and evaluation of such interventions is presented.     

On the Compatibility of Organizational Behavior Management and BACB Certification

The number of practicing behavior analysts who hold Behavior Analyst Certification Board (BACB) certification has substantially increased in the past decade. Some have mistakenly interpreted the BACB’s certification requirements as being specific to the autism and intellectual disabilities practice area. We present key BACB requirements, describe how they are practice-area neutral, and provide specific examples of their relevance to organizational behavior management.     

An Evaluation of Staff Preference for Graphic Characteristics

The purpose of the current study was to assess staff preference for how data were displayed on graphs. Specifically, preference for line versus bar graphs was assessed, as well as preference for data displayed as one date in time versus multiple dates showing performance trends. A secondary purpose of the study was to assess staff comprehension of the data presented across different graphic displays. Participants included 60 entry-level direct care staff and 25 seasoned therapists. Therapists had more advanced training in applied behavior analysis than the direct care staff. The vast majority of direct care staff preferred data depicted as a bar graph versus data depicted as a line graph, even preferring a single bar graph over a time-series line graph. The therapists preferred time-series line graphs to bar graphs. Most staff demonstrated understanding of the data, regardless of how it was depicted.     

Benevolence-dominant,authoritarianism-dominant,and classical paternalistic leadership: Testing their relationships with subordinate performance

We propose a new typology of paternalistic leadership styles based on how leaders demonstrate authoritarianism and benevolence, the two essential components of this type of leadership. Benevolence-dominant paternalistic leadership refers to leaders' sole dependence on the use of benevolence without their strong assertion of authority, whereas authoritarianism-dominant paternalistic leadership is based mainly on authoritarianism itself; classical paternalistic leadership, which best fits early observations of paternalistic leaders, refers to the salient combination of both leadership components. We used two distinct samples and methods to test this typology and the association with subordinate performance. Across the two studies, a field investigation with Taiwanese military supervisor-subordinate dyads and a hypothetical scenario experiment with U.S. working adults, we found a positive relationship between classical paternalistic leadership and subordinate performance as strong as that between benevolence-dominant paternalistic leadership and performance. Our findings echo the phenomenon that paternalistic leaders tend to combine benevolence with authoritarianism to affect subordinate performance.     

Leader-employee congruence of expected contributions in the employee-organization relationship

Employees' expected contributions can be incongruent with those of their leader. We examine the congruence effect of leaders' and employees' expected contributions on job satisfaction. Results of cross-level polynomial regressions on 947 employees and 224 leaders support the congruence effect. When expected contributions are congruent, employees are more satisfied with their job. Our findings suggest that employees enjoy high challenges, as long as these challenges are in harmony with the expected contributions of their leaders. Employees are less satisfied with their jobs both when their expected contributions were higher than their leaders' and when their expected contributions were lower than those of their leaders. Beyond the relevance of having high expected contributions, the findings highlight the crucial role played by the congruence of expected contributions of leaders and employees.     

On the <Emphasis Type="Italic">m</Emphasis>-clique free interval subgraphs polytope: polyhedral analysis and applications

In this paper we study the m-clique free interval subgraphs. We investigate the facial structure of the polytope defined as the convex hull of the incidence vectors associated with these subgraphs. We also present some facet-defining inequalities to strengthen the associated linear relaxation. As an application, the generalized open-shop problem with disjunctive constraints (GOSDC) is considered. Indeed, by a projection on a set of variables, the m-clique free interval subgraphs represent the solution of an integer linear program solving the GOSDC presented in this paper. Moreover, we propose exact and heuristic separation algorithms, which are exploited into a Branch-and-cut algorithm for solving the GOSDC. Finally, we present and discuss some computational results.     

New lower bounds for the second variable Zagreb index

The aim of this paper is to obtain new sharp inequalities for a large family of topological indices, including the second variable Zagreb index \(M_2^{\alpha }\), and to characterize the set of extremal graphs with respect to them. Our main results provide lower bounds on this family of topological indices involving just the minimum and the maximum degree of the graph. These inequalities are new even for the Randi?, the second Zagreb and the modified Zagreb indices.     

The matching extension problem in general graphs is co-NP-complete

A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete.     

Reliability evaluation of a multicast over coded packet networks

Network coding is a generalization of conventional routing methods that allows a network node to code information flows before forwarding them. While it has been theoretically proved that network coding can achieve maximum network throughput, theoretical results usually do not consider the stochastic nature in information processing and transmission, especially when the capacity of each arc becomes stochastic due to failure, attacks, or maintenance. Hence, the reliability measurement of network coding becomes an important issue to evaluate the performance of the network under various system settings. In this paper, we present analytical expressions to measure the reliability of multicast communications in coded networks, where network coding is most promising. We define the probability that a multicast rate can be transmitted through a coded packet network under a total transmission cost constraint as the reliability metric. To do this, we first introduce an exact mathematical formulation to construct multicast connections over coded packet networks under a limited transmission cost. We then propose an algorithm based on minimal paths to calculate the reliability measurement of multicast connections and analyze the complexity of the algorithm. Our results show that the reliability of multicast routing with network coding improved significantly compared to the case of multicast routing without network coding.     

FPT-algorithms for some problems related to integer programming

This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem, where one of the centers must be in P, and we solve it in \(O(n^2\log n)\) time. Second, we consider the mixed k-center problem, where m of the centers are in P, and we solve it in \(O(n^{m+O(\sqrt{k-m})})\) time. Motivated by two practical constraints, we propose two variations of the problem. Third, we present a 2-approximation algorithm and three heuristics solving the mixed k-center problem (\(k>2\)).