bluuebunny/crossref_metadata_2025_split huggingface dataset:
The Effectiveness of the Latarjet Procedure in Patients with Chronic Locked Anterior Shoulder Dislocation
Authors: Li Yue , Jiang Chunyan 
Published: May 2016

Background:Chronic locked anterior shoulder dislocation is a difficult clinical problem for patients and surgeons. Prior studies have proposed a variety of surgical techniques to address this problem; however, the failure rate is high. To our knowledge, there have been no previously published studies on the clinical outcome of the Latarjet procedure for the treatment of chronic locked anterior shoulder dislocation. The purpose of this study was to evaluate the short-term subjective, objective, and radiographic outcomes of patients with chronic locked anterior shoulder dislocation after a Latarjet procedure.Methods:From January 2005 to January 2013, 43 patients with chronic locked anterior shoulder dislocation were treated surgically in our institution. Open Latarjet procedures were performed in 35 patients. A subscapularis tenotomy or split was chosen on the basis of the ability to achieve open reduction. Outcomes were assessed preoperatively and postoperatively with the American Shoulder and Elbow Surgeons (ASES) score, the visual analog scale (VAS) for pain, the University of California Los Angeles (UCLA) shoulder rating scale, and the Constant-Murley rating scale. A comparison of the clinical outcomes among the patients who underwent subscapularis tenotomy and repair, those who underwent a procedure that used the subscapularis-splitting technique, and those who underwent a concomitant humeral head replacement was performed.Results:Twenty-five shoulders of 25 patients were available for a mean follow-up of 31.6 months. At the time of the latest follow-up, the range of motion and the shoulder functional evaluations (VAS [p = 0.02], ASES [p = 0.01], Constant score [p = 0.01], and UCLA score [p = 0.04]) were significantly improved. The overall redislocation or subluxation rate was 48% (12 of 25): 0% (0 of 5) for the subscapularis-splitting group, 53% (8 of 15) for the subscapularis tenotomy and repair group, and 80% (4 of 5) for the humeral head replacement group. The ASES score (p = 0.006), UCLA score (p = 0.014), Constant score (p = 0.046), and external rotation (p = 0.048) were significantly better, and less severe glenohumeral osteoarthritis was found in patients who had undergone a Latarjet procedure with subscapularis-splitting compared with those who had undergone subscapularis tenotomy and repair.Conclusions:The Latarjet procedure for the treatment of chronic locked anterior shoulder dislocation can be successful if the shoulder reduction can be performed without requiring a subscapularis tenotomy. If this reduction is not possible, then other surgical reconstruction should be considered.Level of Evidence:TherapeuticLevel IV. See Instructions for Authors for a complete description of levels of evidence.
Performance of Hybrid and Single-frequency Impulse GPR Antennas on USGA Sporting Greens
Authors: Freeland Robert S. , Allred Barry J , Martinez Luis R , Gamble Debra L , Jones Brian R , McCoy Edward L 
Published: May 2016

The utility of employing ground-penetrating radar (GPR) technologies for environmental surveys can vary, depending upon the physical properties of the site. Environmental conditions can fluctuate, altering soil properties. Operator proficiency and survey methodology will also influence GPR findings. Therefore, GPR equipment performance evaluation involves standardized tests that are frequently conducted indoors within laboratory-controlled environments. This study uses outdoor United States Golf Association (USGA) putting greens as a structure for GPR testing for surveying practitioners. These USGA putting greens provide a tightly controlled environment because many golf courses and sports turf fields adhere to strict USGA construction and irrigation guidelines. Past studies on several USGA greens show that GPR provided precise and accurate profiles of root-mixture depth, gravel-blanket thickness, and drain-tile layout. Results are independent of locale, as all USGA putting greens are virtually identical. In this project, the performance of various GPR antenna frequencies on USGA greens was assessed. This research determined that an efficient antenna for routine profiling of turf putting greens is in the 400- to 800-MHz range. Other frequencies also performed well for a particular target or task, such as for profiling sub-grade depths. The study also compared the performance of a hybrid antenna design with the performance of fixed-frequency antennas and found that the hybrid frequencies fit well for profiling turf greens. Greens management staff may have concerns regarding damage to high-value turf from geophysical survey trafficking. Proposed surveying practices and procedures can help lessen these concerns.
Et le comité de direction a ri
Authors: Ayache Magali , Dumez Hervé 
Published: May 2016

Beaucoup de projets de changement organisationnel échouent. L’explication traditionnelle repose sur les jeux d’acteurs (résistance au changement). Cet article propose une interprétation alternative fondée sur l’analyse de la matérialité des projets de changement (notamment les Powerpoint)vial’identification d’un mécanisme de non-changement. Le mécanisme identifié met l’accent sur le phasage des projets combiné avec la recherche dequick wins, et sur la triple tension qui caractérise les Powerpoint : les tensions descriptif/normatif, expansion/contraction, oubli/rétention.
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design
Authors: Kolesnikov Vladimir , Sadeghi Ahmad-Reza , Schneider Thomas 
Published: May 2016

General two-party Secure Function Evaluation (SFE) allows mutually distrusting parties to correctly compute any function on their private input data, without revealing the inputs. Two-party SFE can benefit almost any client-server interaction where privacy is required, such as privacy-preserving credit checking, medical classification, or face recognition. Today, SFE is a subject of immense amount of research in a variety of directions and is not easy to navigate. In this article, we systematize the most practically important works of the vast research knowledge on general SFE. We argue that in many cases the most efficient SFE protocols are obtained by combining several basic techniques, e.g., garbled circuits and (additively) homomorphic encryption. As a valuable methodological contribution, we present a framework in which today's most efficient techniques for general SFE can be viewed as building blocks with well-defined interfaces that can be easily combined into a complete efficient solution. Further, our approach naturally allows automated protocol generation (compilation) and has been implemented partially in the TASTY framework. In summary, we provide a comprehensive guide in state-of-the-art SFE, with the additional goal of extracting, systematizing and unifying the most relevant and promising general SFE techniques. Our target audience are graduate students wishing to enter the SFE field and advanced engineers seeking to develop SFE solutions. We hope our guide paints a high-level picture of the field, including most common approaches and their trade-offs and gives precise and numerous pointers to formal treatment of its specific aspects.
Relations between secrets: two formal analyses of the Yahalom protocol
Authors: Paulson Lawrence C. 
Published: May 2016

The Yahalom protocol is one of those analyzed by Burrows et al. [5]. Based upon their analysis, they have proposed modifications to make the protocol easier to understand and to analyze. Both versions of Yahalom have now been analyzed using Isabelle/HOL. Modified Yahalom satisfies strong security goals, and the original version is adequate. The mathematical reasoning behind these machine proofs is presented informally. An Appendix gives extracts from a formal proof. Yahalom presents special difficulties because the compromise of one session key compromises other secrets. The proofs show that the resulting losses are limited. They rely on a new proof technique, which involves reasoning about the relationship between keys and the secrets encrypted by them. This technique is applicable to other difficult protocols, such as Kerberos IV [2]. The new proofs do not rely on a belief logic. They use a fundamentally different formal model: the inductive method. They confirm the BAN analysis and the advantages of the proposed modifications. The new proof methods detect more flaws than BAN and analyze protocols in finer detail, while remaining broadly consistent with the BAN principles. In particular, the proofs confirm the explicitness principle of Abadi and Needham [1]. The proofs also suggest that any realistic model of security must admit that secrets can become compromised over time.
Distributed credential chain discovery in trust management
Authors: Li Ninghui , Winsborough William H. , Mitchell John C. 
Published: May 2016

We introduce a simple Role-based Trust-management language [Formula: see text] and a set-theoretic semantics for it. We also introduce credential graphs as a searchable representation of credentials in [Formula: see text] and prove that reachability in credential graphs is sound and complete with respect to the semantics of [Formula: see text]. Based on credential graphs, we give goal-directed algorithms to do credential chain discovery in [Formula: see text], both when credential storage is centralized and when credential storage is distributed. A goal-directed algorithm begins with an access-control query and searches for credentials relevant to the query, while avoiding considering the potentially very large number of credentials that are unrelated to the access-control decision at hand. This approach provides better expected-case performance than bottom-up algorithms. We show how our algorithms can be applied to SDSI 2.0 (the ‘SDSI’ part of SPKI/SDSI 2.0). Our goal-directed, distributed chain discovery algorithm finds and retrieves credentials as needed. We prove that the algorithm is correct by proving that the algorithm is sound and complete with respect to the credential graph composed of the credentials it retrieves, and that the algorithm retrieves all credentials that constitute a traversable chain. We further introduce a storage type system for [Formula: see text], which guarantees traversability of chains when credentials are well typed. This type system can also help improve search efficiency by guiding search in the right direction, making distributed chain discovery with large number of credentials feasible.
A policy-based methodology for security evaluation: A Security Metric for Public Key Infrastructures
Authors: Casola Valentina , Mazzeo Antonino , Mazzocca Nicola , Vittorini Valeria 
Published: May 2016

The security of complex infrastructures depends on many technical and organizational issues that need to be properly addressed by a security policy. For purpose of our discussion, we define a security policy as a document that states what is and what is not allowed in a system during normal operation; it consists of a set of rules that could be expressed in formal, semi-formal or very informal language. In many contexts, a system can be considered secure and trustworthy if the policy enforced by its security administrator is trustworthy too; from this standpoint it is possible to evaluate the system security by evaluating its policy. In this paper we present a policy-based methodology to formalize and compare policies, and a Security Metric to evaluate the security level that a system is able to grant. All the steps of the methodology will be illustrated with an operative approach, by directly applying it to a real case study: the semi-automated Cross Certification among Public Key Infrastructures.
Certificate revocation release policies
Authors: Hu Nan , Tayi Giri K. , Ma Chengyu , Li Yingjiu 
Published: May 2016

Public key infrastructure provides a promising foundation for verifying the authenticity of communicating parties and transferring trust over the Internet. The key issue in public key infrastructure is how to process certificate revocations. Previous research in this area has concentrated on the tradeoffs that can be made among different revocation options. No rigorous efforts have been made to understand the probability distribution of certificate revocation requests based on real empirical data. In this study, we first collect real data from VeriSign and suggest a functional form for the probability density function of certificate revocation requests. Exponential distribution function is chosen as it adequately approximates the real data. We then provide an economic model based on which a certificate authority can choose the optimal Certificate Revocation List (CRL) release interval considering the intrinsic properties among different types of certificate services. To conclude we draw some insights by comparing the performance of four different CRL strategies.
Static analysis for detecting taint-style vulnerabilities in web applications
Authors: Jovanovic Nenad , Kruegel Christopher , Kirda Engin 
Published: May 2016

The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applications have grown as well. Since manual code reviews are time-consuming, error-prone and costly, the need for automated solutions has become evident. In this paper, we address the problem of vulnerable web applications by means of static source code analysis. More precisely, we use flow-sensitive, interprocedural and context-sensitive data flow analysis to discover vulnerable points in a program. In addition to the taint analysis at the core of our engine, we employ a precise alias analysis targeted at the unique reference semantics commonly found in scripting languages. Moreover, we enhance the quality and quantity of the generated vulnerability reports by employing an iterative two-phase algorithm for fast and precise resolution of file inclusions. The presented concepts are targeted at the general class of taint-style vulnerabilities and can be easily applied to the detection of vulnerability types such as SQL injection, cross-site scripting (XSS), and command injection. We implemented the presented concepts in Pixy, a high-precision static analysis tool aimed at detecting cross-site scripting and SQL injection vulnerabilities in PHP programs. To demonstrate the effectiveness of our techniques, we analyzed a number of popular, open-source web applications and discovered hundreds of previously unknown vulnerabilities. Both the high analysis speed as well as the low number of generated false positives show that our techniques can be used for conducting effective security audits.
A profile anonymization model for location-based services
Authors: Shin Heechang , Vaidya Jaideep , Atluri Vijayalakshmi 
Published: May 2016

Location-based services (LBS) aim at delivering point of need information. Personalization and customization of such services, based on the profiles of mobile users, would significantly increase the value of such services. Since profiles may include sensitive information of mobile users and moreover can help identify a person, such customization is allowable only when the security and privacy policies dictated by them are respected. While LBS providers are presumed to be untrusted entities, the location services that capture and maintain mobile users' location to enable communication are considered trusted, and therefore can capture and manage the profile information. The question then is, how to enable the use of location based services while protecting privacy? In this paper, we address the problem of privacy preservation via anonymization. Prior research in this area attempts to ensure k-anonymity by generalizing the location. However, a person may still be identified based on his/her profile if the profiles of all k people in the generalized region are not the same. We extend the notion of k-anonymity by proposing a profile based k-anonymization model that guarantees anonymity even when profiles of mobile users are revealed to untrusted entities. Specifically, our anonymization methods generalize both location and profiles to the extent specified by the user. We propose a novel unified index structure, called the PTPR-tree to enhance the performance during anonymization. PTPR-tree is an extension of the TPR-tree [in: SIGMOD'00: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, ACM, 2000, pp. 331–342] which organizes both the locations of mobile users as well as their profiles using a single index, and therefore can efficiently find candidate users for the proposed profile based anonymization models.
Using Electronic Case Summaries to Elicit Multi-Disciplinary Expert Knowledge about Referrals to Post-Acute Care
Authors: Ratcliffe Sarah , Potashnik Sheryl , Topaz Maxim , Holmes John , Shih Nai-Wei , Naylor Mary , Bowles Kathryn 
Published: May 2016

SummaryEliciting knowledge from geographically dispersed experts given their time and scheduling constraints, while maintaining anonymity among them, presents multiple challenges.Describe an innovative, Internet based method to acquire knowledge from experts regarding patients who need post-acute referrals. Compare, 1) the percentage of patients referred by experts to percentage of patients actually referred by hospital clinicians, 2) experts’ referral decisions by disciplines and geographic regions, and 3) most common factors deemed important by discipline.De-identified case studies, developed from electronic health records (EHR), contained a comprehensive description of 1,496 acute care inpatients. In teams of three, physicians, nurses, social workers, and physical therapists reviewed case studies and assessed the need for post-acute care referrals; Delphi rounds followed when team members did not agree. Generalized estimating equations (GEEs) compared experts’ decisions by discipline, region of the country and to the decisions made by study hospital clinicians, adjusting for the repeated observations from each expert and case. Frequencies determined the most common case characteristics chosen as important by the experts.The experts recommended referral for 80% of the cases; the actual discharge disposition of the patients showed referrals for 67%. Experts from the Northeast and Midwest referred 5% more cases than experts from the West. Physicians and nurses referred patients at similar rates while both referred more often than social workers. Differences by discipline were seen in the factors identified as important to the decision.The method for eliciting expert knowledge enabled national dispersed expert clinicians to anonymously review case summaries and make decisions about post-acute care referrals. Having time and a comprehensive case summary may have assisted experts to identify more patients in need of post-acute care than the hospital clinicians. The methodology produced the data needed to develop an expert decision support system for discharge planning.Citation: Bowles KH, Ratcliffe S, Potashnik S, Topaz M, Holmes J, Shih N-W, Naylor MD. Using electronic case summaries to elicit multi-disciplinary expert knowledge about referrals to post-acute care.
The significance of nitrogen regeneration for new production within a filament of the Mauritanian upwelling system
Authors: Clark Darren R. , Widdicombe Claire E. , Rees Andrew P. , Woodward E. Malcolm S. 
Published: May 2016

Abstract. The Lagrangian progression of a biological community was followed in a filament of the Mauritanian upwelling system, north-west Africa, during offshore advection. The inert dual tracers sulfur hexafluoride and helium-3 labelled a freshly upwelled patch of water that was mapped for 8 days. Changes in biological, physical, and chemical characteristics were measured, including phytoplankton productivity, nitrogen assimilation, and regeneration. Freshly upwelled water contained high nutrient concentrations but was depleted in N compared to Redfield stoichiometry. The highest rate of primary productivity was measured on the continental shelf, associated with high rates of nitrogen assimilation and a phytoplankton community dominated by diatoms and flagellates. Indicators of phytoplankton abundance and activity decreased as the labelled water mass transited the continental shelf slope into deeper water, possibly linked to the mixed layer depth exceeding the light penetration depth. By the end of the study, the primary productivity rate decreased and was associated with lower rates of nitrogen assimilation and lower nutrient concentrations. Nitrogen regeneration and assimilation took place simultaneously. Results highlighted the importance of regenerated NH4+ in sustaining phytoplankton productivity and indicate that the upwelled NO3− pool contained an increasing fraction of regenerated NO3− as it advected offshore. By calculating this fraction and incorporating it into an f ratio formulation, we estimated that of the 12.38 Tg C of annual regional production, 4.73 Tg C was exportable.
Carbon budgets for an irrigated intensively grazed dairy pasture and an unirrigated winter-grazed pasture
Authors: Hunt John E. , Laubach Johannes , Barthel Matti , Fraser Anitra , Phillips Rebecca L. 
Published: May 2016

Abstract. Intensification of pastoral agriculture is occurring rapidly across New Zealand, including increasing use of irrigation and fertiliser application in some regions. While this enables greater gross primary production (GPP) and livestock grazing intensity, the consequences for the net ecosystem carbon budget (NECB) of the pastures are poorly known. Here, we determined the NECB over one year for an irrigated, fertilised and rotationally grazed dairy pasture and a neighbouring unirrigated, unfertilised, winter-grazed pasture. Primary terms in the NECB calculation were: net ecosystem production (NEP), biomass carbon removed by grazing cows and carbon (C) input from their excreta. Annual NEP was measured using the eddy-covariance method. Carbon removal was estimated with plate-meter measurements calibrated against biomass collections, pre- and post-grazing. Excreta deposition was calculated from animal feed intake. The intensively managed pasture gained C (NECB  =  103 ± 42 g C m−2 yr−1) but would have been subject to a non-significant C loss if cattle excreta had not been returned to the pasture. The unirrigated pasture was C-neutral (NECB  =  −13 ± 23 g C m−2 yr−1). While annual GPP of the former was almost twice that of the latter (2679 vs. 1372 g C m−2 yr−1), ecosystem respiration differed by only 68 % between the two pastures (2271 vs. 1352 g C m−2 yr−1). The ratio of GPP to the total annual water input of the irrigated pasture was 37 % greater than that of the unirrigated pasture, i.e. the former used the water input more efficiently than the latter to produce biomass. The NECB results agree qualitatively with those from many other eddy-covariance studies of grazed grasslands, but they seem to be at odds with long-term carbon-stock studies of other New Zealand pastures.
A new cyanobacterial species of Anabaena genus (Nostocales, Cyanobacteria) from Bulgaria
Authors: Kirjakov Ivan Kirilov , Velichkova Katya Naneva 
Published: May 2016

Se describe una nueva especie del género de Cyanobacterias, Anabaena Bory ex Born. et Flah. (Nostocales) de las montañas Ródope de Bulgaria. Anabaena rhodopensis sp. nova. tiene acinetas con paredes celulares esculpidas. Se dan los datos biométricos para el tamaño de las células vegetativas, heterocistos y acinetos.A new species of cyanobacterial genus Anabaena Bory ex Born. et Flah. (Nostocales) from Rhodope Mountains in Bulgaria is described. Anabaena rhodopensis sp. nova. has akinetes with sculptured cell walls. Biometrical data for size of vegetative cells, heterocytes and akinetes are given.