Although there is a growing interest toward the topic of leader humility, extant research has largely failed to consider the underlying mechanisms through which leader humility influences team outcomes. In this research, we integrate the emerging literature of leader humility and social information processing theory to theorize how leader humility facilitates the development of collective team psychological capital, leading to higher team task allocation effectiveness and team performance. While Owens and Hekman (2016) suggest that leader humility has homogeneous effects on followers, we propose a potential heterogeneous effect based on the complementarity literature (e.g., Tiedens, Unzueta, & Young, 2007) and the principle of equifinality (leaders may influence team outcomes through multiple pathways; Morgeson, DeRue, & Karam, 2010). In three studies conducted in China, Singapore, and Portugal, including an experiment, a multisource field study, and a three-wave multisource field study, we find support for our hypotheses that leader humility enhances team performance serially through increased team psychological capital and team task allocation effectiveness. We discuss the theoretical implications of our work to the leader humility, psychological capital, and team effectiveness literatures; and offer suggestions for future research.

a b s t r a c tIn this paper we introduce the notion of distance k-guarding applied to triangulation graphs, and associate it with distance k-domination and distance k-covering. We obtain results for maximal outerplanar graphs when k = 2. A set S of vertices in a triangulation graph T is a distance 2-guarding set (or 2d-guarding set for short) if every face of T has a vertex adjacent to a vertex of S. We show that ⌊ n 5 ⌋ (respectively, ⌊ n 4 ⌋) vertices are sufficient to 2d-guard and 2d-dominate (respectively, 2d-cover) any n-vertex maximal outerplanar graph. We also show that these bounds are tight.

BackgroundProtein cavities play a key role in biomolecular recognition and function, particularly in protein-ligand interactions, as usual in drug discovery and design. Grid-based cavity detection methods aim at finding cavities as aggregates of grid nodes outside the molecule, under the condition that such cavities are bracketed by nodes on the molecule surface along a set of directions (not necessarily aligned with coordinate axes). Therefore, these methods are sensitive to scanning directions, a problem that we call cavity ground-and-walls ambiguity, i.e., they depend on the position and orientation of the protein in the discretized domain. Also, it is hard to distinguish grid nodes belonging to protein cavities amongst all those outside the protein, a problem that we call cavity ceiling ambiguity.ResultsWe solve those two ambiguity problems using two implicit isosurfaces of the protein, the protein surface itself (called inner isosurface) that excludes all its interior nodes from any cavity, and the outer isosurface that excludes most of its exterior nodes from any cavity. Summing up, the cavities are formed from nodes located between these two isosurfaces. It is worth noting that these two surfaces do not need to be evaluated (i.e., sampled), triangulated, and rendered on the screen to find the cavities in between; their defining analytic functions are enough to determine which grid nodes are in the empty space between them.ConclusionThis article introduces a novel geometric algorithm to detect cavities on the protein surface that takes advantage of the real analytic functions describing two Gaussian surfaces of a given protein.

A b stractIn this article we study some variants of the domination concept attending to the connectivity of the subgraph generated by the dominant set. This study is restricted to maximal outerplanar graphs. We establish tight combinatorial bounds for con nected domination, semitotal domination, independent domination and weakly con nected domination for any n-vertex maximal outerplaner graph.

Extensive research has been applied to discover new techniques and methods to model protein-ligand interactions. In particular, considerable efforts focused on identifying candidate binding sites, which quite often are active sites that correspond to protein pockets or cavities. Thus, these cavities play an important role in molecular docking. However, there is no established benchmark to assess the accuracy of new cavity detection methods. In practice, each new technique is evaluated using a small set of proteins with known binding sites as ground-truth. However, studies supported by large datasets of known cavities and/or binding sites and statistical classification (i.e., false positives, false negatives, true positives, and true negatives) would yield much stronger and reliable assessments. To this end, we propose CavBench, a generic and extensible benchmark to compare different cavity detection methods relative to diverse ground truth datasets (e.g., PDBsum) using statistical classification methods.

No abstract

In outpatient surgery, post-discharge follow-up calls are essential for identifying complications and are considered a cost-effective intervention. Currently, there is a lack of scientific evidence to support the development and validation of standardized protocols adjusted to patients' specificities. Our aim is to develop a personalized model for our outpatient surgery unit (OSU) to create an individualized follow-up strategy in the future. Material and methodsWe performed a retrospective, cohort, single-center study, including patients undergoing surgery at an OSU of a tertiary hospital in Portugal, for three months. Follow-up calls were performed on the seventh and fourteenth days after discharge. The variables analyzed included: sex, age, surgical specialty, anesthetic technique, American Society of Anesthesiologists (ASA) physical status classification, surgery duration, and complications. A binary logistic regression was adjusted for the complications detected in each call. ResultsNine-hundred eighty-four (984) patients were included, of which 79.8% (n=785) and 75.3% (n=741) answered the follow-up calls on the seventh and fourteenth days after discharge, respectively. Complications were reported in 47.1% (n=370) and 29.8% (n=221) of these calls, respectively, with pain having the highest incidence rate (44.7% in the first call; 26.6% in the second). The type of anesthesia and surgical specialty were independent risk factors for complications (p<0.001). Each minute increase in surgery duration increased by 1.1% the odds of complications (95% confidence interval 1.003-1.018) in the first call. Compared with no anesthesiology involvement, general anesthesia, regional anesthesia, and monitored anesthetic care are 2.52, 2.04, and 1.75 times more likely to have complications detected in the first call and 3.21, 2.36, and 3.11 times more likely to have complications on the second (p<0.05 for all). A model that predicts the detection of complications in each call was created. DiscussionOutpatient surgery may allow procedures to be carried out safely, efficiently, and cost-effectively. To optimize the outcomes, it is important to quantify results as a tool for honing our strategies. The present study recognized the influence of several variables in the incidence of post-discharge complications. Also, considering the complications reported, pain was the most frequent among the reports and should not be neglected. In our reality, no follow-up calls are routinely performed after the seventh day, and complications were reported in that period, meaning some patients probably should be accompanied for a longer period. ConclusionsTo ensure the quality of care and patient safety and satisfaction, it is essential to identify and manage postoperative complications. Despite not being a routine contact, the incidence rate of complications on the seventh and fourteenth postoperative days is noted. According to our investigation, the type of anesthesia, surgical specialty, and duration of surgery should be carefully considered wh...

A grid n-ogon is a n-vertex orthogonal polygon that may be placed in a n 2 × n 2 unit square grid and that does not have collinear edges. Given a grid n-ogon P , let |Π(P)| be the number of rectangles that results when we partition P by extending the edges incident to reflex vertices towards its interior. P is called Fat if |Π(P)| is maximal for all grid n-ogons; P is called Thin if |Π(P)| is minimal for all grid n-ogons. Thins with area 2r + 1 are called Min-Area. We will show that n 6 vertex guards are necessary to guard a Min-Area grid n-ogon and present some problems related to Thins. Partially funded by Fundação para Ciência e Tecnologia (FCT) and by CEOC (Univ. of Aveiro) through Programa POCTI, FCT, co-financed by EC fund FEDER.