11,734 research outputs found

    Productivity, Machinery and Skills in a Sample of British and German Manufacturing Plants : Results of a Pilot Inquiry

    Get PDF
    Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.On the basis of interviews with management and factory floor employees at 45 matched firms in Britain and West Germany, this article examines the roles of machinery and workforce skills in explaining comparative produc tivity performance. The average age of British machinery was not very different from that found in German plants, but it was less technically advanced, was subject to more frequent breakdowns and breakdowns took longer to correct. Productivity was higher in Germany in each of our matched product groups and the importance of skills at all levels was apparent

    Mission Data System Java Edition Version 7

    Get PDF
    The Mission Data System framework defines closed-loop control system abstractions from State Analysis including interfaces for state variables, goals, estimators, and controllers that can be adapted to implement a goal-oriented control system. The framework further provides an execution environment that includes a goal scheduler, execution engine, and fault monitor that support the expression of goal network activity plans. Using these frameworks, adapters can build a goal-oriented control system where activity coordination is verified before execution begins (plan time), and continually during execution. Plan failures including violations of safety constraints expressed in the plan can be handled through automatic re-planning. This version optimizes a number of key interfaces and features to minimize dependencies, performance overhead, and improve reliability. Fault diagnosis and real-time projection capabilities are incorporated. This version enhances earlier versions primarily through optimizations and quality improvements that raise the technology readiness level. Goals explicitly constrain system states over explicit time intervals to eliminate ambiguity about intent, as compared to command-oriented control that only implies persistent intent until another command is sent. A goal network scheduling and verification process ensures that all goals in the plan are achievable before starting execution. Goal failures at runtime can be detected (including predicted failures) and handled by adapted response logic. Responses can include plan repairs (try an alternate tactic to achieve the same goal), goal shedding, ignoring the fault, cancelling the plan, or safing the system

    Mixing of Supersonic Streams

    Get PDF
    The Strutjet approach to Rocket Based Combined Cycle (RBCC) propulsion depends upon fuel-rich flows from the rocket nozzles and turbine exhaust products mixing with the ingested air for successful operation in the ramjet and scramjet modes. A model of the Strutjet device has been built and is undergoing test to investigate the mixing of the streams as a function of distance from the Strutjet exit plane. Initial cold flow testing of the model is underway to determine both, the behavior of the ingested air in the duct and to validate the mixing diagnostics. During the tests, each of the two rocket nozzles ejected up to two pounds mass per second into the 13.6 square inch duct. The tests showed that the mass flow of the rockets was great enough to cause the entrained air to go sonic at the strut, which is the location of the rocket nozzles. More tests are necessary to determine whether the entrained air chokes due to the reduction in the area of the duct at the strut (a physical choke), or because of the addition of mass inside the duct at the nozzle exit (a Fabri choke). The initial tests of the mixing diagnostics are showing promise

    Psychometric Evaluation and Design of Patient-Centered Communication Measures for Cancer Care Settings

    Get PDF
    Objective To evaluate the psychometric properties of questions that assess patient perceptions of patient-provider communication and design measures of patient-centered communication (PCC). Methods Participants (adults with colon or rectal cancer living in North Carolina) completed a survey at 2 to 3 months post-diagnosis. The survey included 87 questions in six PCC Functions: Exchanging Information, Fostering Health Relationships, Making Decisions, Responding to Emotions, Enabling Patient Self-Management, and Managing Uncertainty. For each Function we conducted factor analyses, item response theory modeling, and tests for differential item functioning, and assessed reliability and construct validity. Results Participants included 501 respondents; 46% had a high school education or less. Reliability within each Function ranged from 0.90 to 0.96. The PCC-Ca-36 (36-question survey; reliability=0.94) and PCC-Ca-6 (6-question survey; reliability=0.92) measures differentiated between individuals with poor and good health (i.e., known-groups validity) and were highly correlated with the HINTS communication scale (i.e., convergent validity). Conclusion This study provides theory-grounded PCC measures found to be reliable and valid in colorectal cancer patients in North Carolina. Future work should evaluate measure validity over time and in other cancer populations. Practice implications The PCC-Ca-36 and PCC-Ca-6 measures may be used for surveillance, intervention research, and quality improvement initiatives

    A polynomial bound for untangling geometric planar graphs

    Get PDF
    To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n^\epsilon vertices fixed. We answer this question in the affirmative with \epsilon=1/4. The previous best known bound was \Omega((\log n / \log\log n)^{1/2}). We also consider untangling geometric trees. It is known that every n-vertex geometric tree can be untangled while keeping at least (n/3)^{1/2} vertices fixed, while the best upper bound was O(n\log n)^{2/3}. We answer a question of Spillner and Wolff [arXiv:0709.0170 2007] by closing this gap for untangling trees. In particular, we show that for infinitely many values of n, there is an n-vertex geometric tree that cannot be untangled while keeping more than 3(n^{1/2}-1) vertices fixed. Moreover, we improve the lower bound to (n/2)^{1/2}.Comment: 14 pages, 7 figure

    Receptor Tyrosine Kinases Fall into Distinct Classes Based on Their Inferred Signaling Networks

    Get PDF
    Although many anticancer drugs that target receptor tyrosine kinases (RTKs) provide clinical benefit, their long-term use is limited by resistance that is often attributed to increased abundance or activation of another RTK that compensates for the inhibited receptor. To uncover common and unique features in the signaling networks of RTKs, we measured time-dependent signaling in six isogenic cell lines, each expressing a different RTK as downstream proteins were systematically perturbed by RNA interference. Network models inferred from the data revealed a conserved set of signaling pathways and RTK-specific features that grouped the RTKs into three distinct classes: (i) an EGFR/FGFR1/c-Met class constituting epidermal growth factor receptor, fibroblast growth factor receptor 1, and the hepatocyte growth factor receptor c-Met; (ii) an IGF-1R/NTRK2 class constituting insulin-like growth factor 1 receptor and neurotrophic tyrosine receptor kinase 2; and (iii) a PDGFRβ class constituting platelet-derived growth factor receptor β. Analysis of cancer cell line data showed that many RTKs of the same class were coexpressed and that increased abundance of an RTK or its cognate ligand frequently correlated with resistance to a drug targeting another RTK of the same class. In contrast, abundance of an RTK or ligand of one class generally did not affect sensitivity to a drug targeting an RTK of a different class. Thus, classifying RTKs by their inferred networks and then therapeutically targeting multiple receptors within a class may delay or prevent the onset of resistance.W. M. Keck FoundationNational Institutes of Health (U.S.) (R21 CA126720)National Institutes of Health (U.S.) (P50 GM068762)National Institutes of Health (U.S.) (RC1 HG005354)National Institutes of Health (U.S.) (U54-CA112967)National Institutes of Health (U.S.) (R01-CA096504)Alfred and Isabel Bader (Fellowship)Jacques-Emile Dubois (fellowship

    Fast and flexible selection with a single switch

    Get PDF
    Selection methods that require only a single-switch input, such as a button click or blink, are potentially useful for individuals with motor impairments, mobile technology users, and individuals wishing to transmit information securely. We present a single-switch selection method, "Nomon," that is general and efficient. Existing single-switch selection methods require selectable options to be arranged in ways that limit potential applications. By contrast, traditional operating systems, web browsers, and free-form applications (such as drawing) place options at arbitrary points on the screen. Nomon, however, has the flexibility to select any point on a screen. Nomon adapts automatically to an individual's clicking ability; it allows a person who clicks precisely to make a selection quickly and allows a person who clicks imprecisely more time to make a selection without error. Nomon reaps gains in information rate by allowing the specification of beliefs (priors) about option selection probabilities and by avoiding tree-based selection schemes in favor of direct (posterior) inference. We have developed both a Nomon-based writing application and a drawing application. To evaluate Nomon's performance, we compared the writing application with a popular existing method for single-switch writing (row-column scanning). Novice users wrote 35% faster with the Nomon interface than with the scanning interface. An experienced user (author TB, with > 10 hours practice) wrote at speeds of 9.3 words per minute with Nomon, using 1.2 clicks per character and making no errors in the final text.Comment: 14 pages, 5 figures, 1 table, presented at NIPS 2009 Mini-symposi
    • …
    corecore