Inside the competences evaluation, the stress tolerance of students. An empirical study based on conservation of resources theory

Competence development is considered a preventive strategy of burnout. At an organizational context some competences could be linked as precursors or consequences. In self-assessment of competence development, students perceive stress tolerance as a priority competence to ameliorate. Moreover employers and recruitment consultants agree that this is a new authentic challenge for organizations. The main reasons of this result are debated, this study should consider the importance of competence development from a holistic point of view. In addition it considers the exploration of the relationship between stress tolerance and competence development, according to Conservation Resources (COR) theory (Hobfoll 1988, 1989, 1998, 2004) where the resource loss is considered the principal component in the stress process

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

One- and two-center energy components in the atoms in molecules theory

The energy decomposition scheme proposed in a recent paper has been realized by performing numerical integrations. The sample calculations carried out for some simple molecules show excellent agreement with the chemical picture of molecules, indicating that such an energy decomposition analysis can be useful from the point of view of connecting quantum mechanics with the genuine chemical concepts