Development and Validation of a Spontaneous Smile Assay

IMPORTANCE Smiling can be a voluntary or involuntarymovement. Facial reanimation procedures differ in their ability to restore a spontaneous smile, and an assay designed to evoke and evaluate a spontaneous smile is not available. OBJECTIVE To develop and validate an assay to assess the spontaneous smile of patients with facial paralysis. DESIGN, SETTING, AND PARTICIPANTS Thiswas an exploratory cohort study. A series of short video clips were administered to laypersons via an online survey service from January 1, 2014, to March 31, 2014. Respondents rated how funny each video was on a visual analog scale from 0 to 100. The 4 funniest videos were selected to generate a 11/2-minute spontaneous smile assay. The assay was then administered from July 1, 2014, to December 31, 2014, to 2 different study groups: the first was composed of 100 healthy individuals (control group) and the second was composed of 30 patients with facial paralysis.We analyzed the capability of this assay to provoke at least 1 spontaneous smile and calculated smile excursion in both groups. Statistical analysis was performed using analysis of variance. INTERVENTION Spontaneous smile assay administered to both healthy and diseased groups. MAIN OUTCOMES AND MEASURES Ability of the assay to elicit smiles, as defined by an oral commissure excursion greater than 3 mm, as well as difference in commissure excursion. RESULTS Ninety-five (95.0%) participants in the control group and 29 (96.7%) patients with facial paralysis experienced at least 1 oral commissure excursion that appeared to be a spontaneous smile while viewing the assay. Mean oral commissure excursion with spontaneous smile was 9.08mm(95%CI, 2.77-15.39) in controls, 6.72mm(95%CI, 3.13-10.31) on the healthy side in patients with flaccid facial paralysis (P=.004 vs controls), and 9.64mm(95%CI, 3.52-15.76) on the healthy side in patients with nonflaccid facial paralysis (P=.74). Among patients with flaccid facial paralysis, a statistically significant difference was found between smile excursion of the affected and the unaffected sides (P = .03). There was no statistically significant difference in the measurement between sides for the control group (P = .67). CONCLUSIONS AND RELEVANCE Although humor is a challenging construct to universalize, our assay was able to elicit a smile in almost all individuals in the group with facial paralysis and the control group. The spontaneous smile assay will facilitate future research on the ability of facial reanimation procedures and other interventions to restore a spontaneous smile

Approximation Algorithms for Connected Maximum Cut and Related Problems

An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S $\subseteq$ V that maximizes the number of edges in the cut \delta(S) such that the induced graph G[S] is connected. We present the first non-trivial \Omega(1/log n) approximation algorithm for the connected maximum cut problem in general graphs using novel techniques. We then extend our algorithm to an edge weighted case and obtain a poly-logarithmic approximation algorithm. Interestingly, in stark contrast to the classical max-cut problem, we show that the connected maximum cut problem remains NP-hard even on unweighted, planar graphs. On the positive side, we obtain a polynomial time approximation scheme for the connected maximum cut problem on planar graphs and more generally on graphs with bounded genus.Comment: 17 pages, Conference version to appear in ESA 201

Consumption and Convicts: Faunal Analysis from the Port Arthur Prisoner Barracks

This thesis will present a zooarchaeological analysis of the faunal remains excavated from the Port Arthur Prisoner Barracks in 1977. Originally constructed in 1830 following the establishment of the Port Arthur Penal Settlement, the Prisoner Barracks were continually occupied throughout the convict period, spanning 1830 – 1877. This thesis will examine both the faunal remains and the historical record to examine the evolution of subsistence practices at Port Arthur and within the broader network of probation stations upon Tasman’s Peninsula

Fast Distributed Approximation for Max-Cut

Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the $\mathcal{LOCAL}$ or $\mathcal{CONGEST}$ models. We amend this by obtaining almost optimal algorithms for Max-Cut on a wide class of graphs in these models. In particular, for any $\epsilon > 0$, we develop randomized approximation algorithms achieving a ratio of $(1-\epsilon)$ to the optimum for Max-Cut on bipartite graphs in the $\mathcal{CONGEST}$ model, and on general graphs in the $\mathcal{LOCAL}$ model. We further present efficient deterministic algorithms, including a $1/3$-approximation for Max-Dicut in our models, thus improving the best known (randomized) ratio of $1/4$. Our algorithms make non-trivial use of the greedy approach of Buchbinder et al. (SIAM Journal on Computing, 2015) for maximizing an unconstrained (non-monotone) submodular function, which may be of independent interest

Recommended Radiation Protection Practices for Low-Level Waste Disposal Sites

The United States Nuclear Regulatory Commission contracted with Pacific Northwest Laboratory (PNL) to provide technical assistance in estsblishing operational guidelines, with respect to radiation control programs and methods of minimizing occupational radiation exposure, at Low-Level Waste (LLW) dis- posal sites. The PNL, through site visits, evaluated operations at LLW dis- posal sites to determine the adequacy of current practices in maintaining occupational exposures as low as is reasonably achievable (ALARA). The data sought included the specifics of: ALARA programs, training programs, external exposure control , internal exposure control , respiratory protection, survei 1 - lance, radioactive waste management, facilities and equipment, and external dose analysis. The results of the study indicated the following: The Radiation Protection and ALARA programs at the three commercial LLW disposal sites were observed to be adequate in scope and content compared to similar programs at other types of nuclear facilities. However, it should be noted that there were many areas that could be improved upon to help ensure the health and safety of the occupa- tionally exposed individuals. As a result, radiation protection practices were recommended with related rationales in order to reduce occupational exposures as far below specified radiation limits as is reasonably achievable. In addition, recommendations were developed for achieving occupational exposure ALARA under the Regulatory Requirements issued in 10 CFR Part 61

Iptakalim attenuates self-administration and acquired goal-tracking behavior controlled by nicotine

Iptakalim is an ATP-sensitive potassium channel opener, as well as an a4b2-containing nicotinic acetylcholine receptor (nAChR) antagonist. Pretreatment with iptakalim diminishes nicotine-induced dopamine (DA) and glutamate release in the nucleus accumbens. This neuropharmacological profile suggests that iptakalim may be useful for treatment of nicotine dependence. Thus, we examined the effects of iptakalim in two preclinical models. First, the impact of iptakalim on the interoceptive stimulus effect of nicotine was evaluated by training rats in a discriminated goal-tracking task that included intermixed nicotine (0.4 mg/kg, SC) and saline sessions. Sucrose was intermittently presented in a responseindependent manner only on nicotine sessions. On intervening test days, rats were pretreated with iptakalim (10, 30, 60 mg/kg, IP). Results revealed that iptakalim attenuated nicotine-evoked responding controlled by the nicotine stimulus in a dose-dependent manner. In a separate study, the impact of iptakalim on the reinforcing effects of nicotine was investigated by training rats to lever-press to selfadminister nicotine (0.03 mg/kg/infusion). Results revealed that pretreatment with iptakalim (1, 3, 6 mg/kg, IV) decreased nicotine intake (i.e., less active lever responding). Neither behavioral effect was due to a non-specific motor effect of iptakalim, nor to an ability of iptakalim to inhibit DA transporter (DAT) or serotonin transporter (SERT) function. Together, these finding support the notion that iptakalim may be an effective pharmacotherapy for increasing smoking cessation and a better understanding of its action could contribute to medication development

Clinical Data: Sources and Types, Regulatory Constraints, Applications.

Access to clinical data is critical for the advancement of translational research. However, the numerous regulations and policies that surround the use of clinical data, although critical to ensure patient privacy and protect against misuse, often present challenges to data access and sharing. In this article, we provide an overview of clinical data types and associated regulatory constraints and inferential limitations. We highlight several novel approaches that our team has developed for openly exposing clinical data

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs

We propose a fixed-parameter tractable algorithm for the \textsc{Max-Cut} problem on embedded 1-planar graphs parameterized by the crossing number $k$ of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithm recursively reduces a 1-planar graph to at most $3^k$ planar graphs, using edge removal and node contraction. The \textsc{Max-Cut} problem is then solved on the planar graphs using established polynomial-time algorithms. We show that a maximum cut in the given 1-planar graph can be derived from the solutions for the planar graphs. Our algorithm computes a maximum cut in an embedded 1-planar graph with $n$ nodes and $k$ edge crossings in time $\mathcal{O}(3^k \cdot n^{3/2} \log n)$.Comment: conference version from IWOCA 201