Lack of fifth anchoring point and violation of the insertion of the rotator cuff during antegrade humeral nailing: pitfalls in straight antegrade humeral nailing.

Antegrade nailing of proximal humeral fractures using a straight nail can damage the bony insertion of the supraspinatus tendon and may lead to varus failure of the construct. In order to establish the ideal anatomical landmarks for insertion of the nail and their clinical relevance we analysed CT scans of bilateral proximal humeri in 200 patients (mean age 45.1 years (sd 19.6; 18 to 97) without humeral fractures. The entry point of the nail was defined by the point of intersection of the anteroposterior and lateral vertical axes with the cortex of the humeral head. The critical point was defined as the intersection of the sagittal axis with the medial limit of the insertion of the supraspinatus tendon on the greater tuberosity. The region of interest, i.e. the biggest entry hole that would not encroach on the insertion of the supraspinatus tendon, was calculated setting a 3 mm minimal distance from the critical point. This identified that 38.5% of the humeral heads were categorised as 'critical types', due to morphology in which the predicted offset of the entry point would encroach on the insertion of the supraspinatus tendon that may damage the tendon and reduce the stability of fixation. We therefore emphasise the need for 'fastidious' pre-operative planning to minimise this risk.

Promising anchoring groups for single-molecule conductance measurements

The understanding of the charge transport through single molecule junctions is a prerequisite for the design and building of electronic circuits based on single molecule junctions. However, reliable and robust formation of such junctions is a challenging task to achieve. In this topical review, we present a systematic investigation of the anchoring group effect on single molecule junction conductance by employing two complementary techniques, namely scanning tunneling microscopy break junction (STM-BJ) and mechanically controllable break junction (MCBJ) techniques, based on the studies published in the literature and important results from our own work. We compared conductance studies for conventional anchoring groups described earlier with the molecular junctions formed through π-interactions with the electrode surface (Au, Pt, Ag) and we also summarized recent developments in the formation of highly conducting covalent Au–C σ-bonds using oligophenyleneethynylene (OPE) and an alkane molecular backbone. Specifically, we focus on the electron transport properties of diaryloligoyne, oligophenyleneethynylene (OPE) and/or alkane molecular junctions composed of several traditional anchoring groups, (dihydrobenzo[b]thiophene (BT), 5-benzothienyl analogue (BTh), thiol (SH), pyridyl (PY), amine (NH2), cyano (CN), methyl sulphide (SMe), nitro (NO2)) and other anchoring groups at the solid/liquid interface. The qualitative and quantitative comparison of the results obtained with different anchoring groups reveals structural and mechanistic details of the different types of single molecular junctions. The results reported in this prospective may serve as a guideline for the design and synthesis of molecular systems to be used in molecule-based electronic devices.

Associating optical measurements and estimating orbits of geocentric objects through population-based meta-heuristic methods

Currently several thousands of objects are being tracked in the MEO and GEO regions through optical means. The problem faced in this framework is that of Multiple Target Tracking (MTT). In this context both, the correct associations among the observations and the orbits of the objects have to be determined. The complexity of the MTT problem is defined by its dimension S. The number S corresponds to the number of fences involved in the problem. Each fence consists of a set of observations where each observation belongs to a different object. The S ≥ 3 MTT problem is an NP-hard combinatorial optimization problem. There are two general ways to solve this. One way is to seek the optimum solution, this can be achieved by applying a branch-and- bound algorithm. When using these algorithms the problem has to be greatly simplified to keep the computational cost at a reasonable level. Another option is to approximate the solution by using meta-heuristic methods. These methods aim to efficiently explore the different possible combinations so that a reasonable result can be obtained with a reasonable computational effort. To this end several population-based meta-heuristic methods are implemented and tested on simulated optical measurements. With the advent of improved sensors and a heightened interest in the problem of space debris, it is expected that the number of tracked objects will grow by an order of magnitude in the near future. This research aims to provide a method that can treat the correlation and orbit determination problems simultaneously, and is able to efficiently process large data sets with minimal manual intervention.

An MILP-based heuristic for staff scheduling problems with acceptance levels

We present a real-world staff-assignment problem that was reported to us by a provider of an online workforce scheduling software. The problem consists of assigning employees to work shifts subject to a large variety of requirements related to work laws, work shift compatibility, workload balancing, and personal preferences of employees. A target value is given for each requirement, and all possible deviations from these values are associated with acceptance levels. The objective is to minimize the total number of deviations in ascending order of the acceptance levels. We present an exact lexicographic goal programming MILP formulation and an MILP-based heuristic. The heuristic consists of two phases: in the first phase a feasible schedule is built and in the second phase parts of the schedule are iteratively re-optimized by applying an exact MILP model. A major advantage of such MILP-based approaches is the flexibility to account for additional constraints or modified planning objectives, which is important as the requirements may vary depending on the company or planning period. The applicability of the heuristic is demonstrated for a test set derived from real-world data. Our computational results indicate that the heuristic is able to devise optimal solutions to non-trivial problem instances, and outperforms the exact lexicographic goal programming formulation on medium- and large-sized problem instances.

A heuristic approach for scheduling assessment centers

Human resources managers often use assessment centers to evaluate candidates for a job position. During an assessment center, the candidates perform a series of exercises. The exercises require one or two assessors (e.g., managers or psychologists) that observe and evaluate the candidate. If an exercise is designed as a role-play, an actor is required as well which plays, e.g., an unhappy customer with whom the candidate has to deal with. Besides performing the exercises, the candidates have a lunch break within a prescribed time window. Each candidate should be observed by approximately half the number of the assessors. Moreover, an assessor cannot be assigned to a candidate if they personally know each other. The planning problem consists of determining (1) resource-feasible start times of all exercises and lunch breaks and (2) a feasible assignment of assessors to candidates, such that the assessment center duration is minimized. We propose a list-scheduling heuristic that generates feasible schedules for such assessment centers. We develop novel procedures for devising an appropriate scheduling list and for incorporating the problem-specific constraints. Our computational results indicate that our approach is capable of devising optimal or near-optimal solutions to real-world instances within short CPU time.

Scaffolding of adenylyl cyclase by A Kinase Anchoring Proteins

Adenylyl cyclase (AC) converts ATP into cAMP, which activates protein kinase A (PKA). Activation of PKA leads to the phosphorylation of specific substrates. The mechanism of specificity of PKA phosphorylation baffled researchers for many years. The discovery of A Kinase Anchoring Proteins (AKAPs) has helped to unravel this mystery. AKAPs function to target PKA to specific regions within the cell. They also anchor other enzymes, receptors, or channels leading to tightly regulated signaling modules. Several studies have suggested an important role for activated PKA in these complexes, including the AKAPs yotiao and muscle AKAP (mAKAP). Yotiao, a plasma membrane AKAP, anchors PP1, NMDA receptors, IP3 receptors, and heart potassium channel subunit KCNQI. PKA phosphorylation of NMDA receptors as well as KCNQI leads to increased channel activity. Patients with mutations in KCNQI or yotiao that cause loss of targeting of KCNQI develop long QT syndrome, which can be fatal. mAKAP anchors several CAMP/PKA-regulated pathways to the nuclear envelope in cardiac myocytes. The necessity of activated PKA in these complexes led to the hypothesis that AC is also anchored. The results indicate that AC does associate with yotiao in brain and heart, specifically with AC types I-III, and IX. Co-expression of AC II or III with yotiao leads to inhibition of each isoform's activity. Binding assays revealed that yotiao binds to the N-terminus of AC II and that this region can reverse the inhibition of AC II, but not AC III, indicating unique binding sites on yotiao. AC II binds directly to as 808-957 of yotiao. Y808-957 acts as a dominant negative as the addition of it to rat brain membranes results in a ∼40% increase in AC activity. Additionally, AC was also found to associate with mAKAP in heart, specifically with AC types II and V. The binding site of AC was mapped to 275-340 of mAKAP, while mAKAP binds to the soluble domains of AC V as a complex. These results indicate that interactions between AC and AKAPs are specific and that AC plays an important role in AKAP-targeted signaling. ^