bluuebunny/crossref_metadata_2025_split huggingface dataset:
Effect of Penile-Extender Device in Increasing Penile Size in Men with Shortened Penis: Preliminary Results
Authors: Nikoobakht Mohammadreza , Shahnazari Alireza , Rezaeidanesh Maedeh , Mehrsai Abdolrasoul , Pourmand Gholamreza 
Published: January 2010

ABSTRACT

Introduction
It has been suggested that the application of penile-extender devices increases penile length and circumference. However, there are a few scientific studies in this field.

Aims
The aim of this study was to assess the efficacy of a penile-extender (Golden Erect®, Ronas Tajhiz Teb, Tehran, Iran) in increasing penile size.

Methods
This prospective study was performed on subjects complaining about “short penis” who were presented to our clinic between September 15, 2008 and December 15, 2008. After measuring the penile length in flaccid and stretched forms and penile circumference, patients were instructed to wear Golden Erect®, 4–6 hours per day during the first 2 weeks and then 9 hours per day until the end of the third month. The subjects were also trained how to increase the force of the device during determined intervals. The patients were visited at the end of the first and third months, and penile length and circumference were measured and compared with baseline.

Main Outcome Measures
The primary end point of the study was changes in flaccid and stretched penile lengths compared with the baseline size during the 3 months follow-up.

Results
Twenty-three cases with a mean age of 26.5 ± 8.1 years entered the study. The mean flaccid penile length increased from 8.8 ± 1.2 cm to 10.1 ± 1.2 cm and 10.5 ± 1.2 cm, respectively, in the first and third months of follow-up, which was statistically significant (P &lt; 0.05). Mean stretched penile length also significantly increased from 11.5 ± 1.0 cm to, respectively, 12.4 ± 1.3 cm and 13.2 ± 1.4 cm during the first and second follow-up (P &lt; 0.05). No significant difference was found regarding proximal penile girth. However, it was not the same regarding the circumference of the glans penis (9.3 ± 0.86 cm vs. 8.8 ± 0.66 cm, P &lt; 0.05).

Conclusion
Our findings supported the efficacy of the device in increasing penile length. Our result also suggested the possibility of glans penis girth enhancement using penile extender. Performing more studies is recommended.
Impact of Dry Ejaculation Caused by Highly Selective α1A-blocker: Randomized, Double-blind, Placebo-controlled Crossover Pilot Study in Healthy Volunteer Men
Authors: Shimizu Fumitaka , Taguri Masataka , Harada Yoshiko , Matsuyama Yutaka , Sase Kazuhiro , Fujime Makoto 
Published: January 2010

ABSTRACTIntroductionDry ejaculation with loss of seminal emission is reported in patients who have been administered silodosin, an alpha1A-adrenoceptor antagonist.AimWe investigated the impact of dry ejaculation caused by orally administered silodosin on orgasmic function.MethodsIn a double-blind crossover study, 50 healthy volunteer men were randomly assigned to receive either a single dose of 4-mg silodosin or placebo with 3 days of washout before crossover. Subjects masturbated 4 hours after administering agents.Main Outcome MeasuresNumerical rating scale (NRS) score from 0 (highest) to 10 (lowest) for subjective quality of orgasm, the subjective number of contractions of the bulbocavernosus/pelvic floor muscles, and the amount of semen were examined.ResultsAfter the administration of silodosin, the NRS score worsened by 1.3 points (P = 0.003), the number of contractions of the bulbocavernosus/pelvic floor muscles decreased by about 1 (P = 0.003), and there was a decrease of 1.8 mL in the amount of semen produced (P &lt;0.0001). Eleven men overall (22%) on silodosin administration had less than a 50% decrease from baseline in the amount of semen.ConclusionsSilodosin may adversely affect the subjective orgasmic function by causing an abnormal ejaculation with decreased (or no) semen discharge and a decrease in the number of bulbocavernosus/pelvic floor muscle contractions. Semen passing through the urethra and sufficient rhythmic contraction of the muscle of the pelvic floor may contribute to the subjective pleasure of orgasm.
The Relaxation Induced by Uroguanylin and the Expression of Natriuretic Peptide Receptors in Human Corpora Cavernosa
Authors: Sousa Clauber M. , Havt Alexandre , Santos Cláudia F. , Arnaud-Batista F.J. , Cunha Karina M.A. , Cerqueira João Batista G. , Fonteles Manassés C. , Nascimento Nilberto R.F. 
Published: January 2010

ABSTRACT

Introduction
Receptors for natriuretic peptides have been demonstrated as potential targets for the treatment of male erectile dysfunction.

Aim
This study investigates the relaxant effects of the atrial natriuretic peptide (ANP) and uroguanylin (UGN), and expression of natriuretic peptide receptors on strips of human corpora cavernosa (HCC).

Main Outcome Measures
Quantitative analysis of natriuretic receptor expression and relaxation of precontracted strips were used to assess the membrane-bound guanylate cyclase–cyclic guanosine monophosphate (cGMP) pathway in HCC strips.

Methods
HCC was obtained from a cadaver donor at the time of collection of organs for transplantation (14–47 years) and strips were mounted in organ baths for isometric studies.

Results
ANP and UGN both induced concentration-dependent relaxation on HCC strips with a maximal response attained at 300 nM, corresponding to 45.4 ± 4.0% and 49 ± 4.8%, respectively. The relaxation is not affected by 30 µM 1H-[1,2,4]oxaolodiazolo[4,3-a]quinoxalin-1-one (ODQ) (a soluble guanylate cyclase inhibitor), but it is significantly blocked by 10 µM isatin, a nonspecific particulate guanylate cyclase (pGC) inhibitor. UGN was unable to potentiate electrical field stimulation (EFS) or acetylcholine-induced relaxations. The potential role of pGC activation and cGMP generation in this effect is reinforced by the potentiation of this effect by phosphodiesterase-5 inhibitor vardenafil (55.0 ± 7.5-UGN vs. 98.6 ± 1.4%-UGN+vardenafil; P &lt;0.05). The relaxant effect was also partially (37.6%) blocked by the combination iberitoxin-apamin but was insensitive to glybenclamide. The expression of guanylate cyclase receptors (GC-A, GC-B, GC-C) and the expression of the natriuretic peptide “clearance” receptor (NPR-C) were confirmed by real-time polymerase chain reaction. The exposure of HCC strips to ANP (1 µM) and UGN (10 µM) significantly increased cGMP, but not cyclic adenosine monophosphate (cAMP) levels.

Conclusions
UGN relaxes HCC strips by a guanylate cyclase and Kca-channel-dependent mechanism. These findings obtained in HCC reveal that the natriuretic peptide receptors are potential targets for the development of new drugs for the treatment of erectile dysfunction.
Nurse Anesthetist Follow‐up of an Adolescent Female With Gunshot Trauma: A Case Study
Authors: Johnson Carolyn , Lunney Margaret 
Published: January 2010

PURPOSE.  This case study was written to demonstrate the usefulness of standardized nursing diagnoses, outcomes, and interventions in nurse anesthetist care of an adolescent trauma patient.DATA SOURCES.  Literature reviews using Academic Premier, Google Scholar, and CINAHL databases were done to find current, relevant articles concerning evaluation and support of female African‐American adolescents living in socially vulnerable and economically exploited environments.DATA SYNTHESIS.  A case is presented and evidence from current publications is analyzed to support the diagnosis, outcomes, and interventions.CONCLUSION.  The investment in extra time, care, and effort sometimes required for the full development of a treatment plan for teenagers who live where they are at high risk for violence and other consequences of stressful environments is a worthwhile one, even if results may require contact over an extended time period.PRACTICE IMPLICATIONS.  Nurses of all specialty backgrounds need to be concerned with the progress of their patients. Sometimes nurses can best serve their patients by stepping away from the physiological event and focusing instead on responses in the domain of coping and stress tolerance as the root of difficulties.
The Frequency and Functional Impact of Overlapping Hypertension on Hypertrophic Cardiomyopathy: A Single‐Center Experience
Authors: Aslam Farhan , Haque Attiya , Foody JoAnne , Shirani Jamshid 
Published: January 2010

J Clin Hypertens (Greenwich)Between 1995 and 2005, 196 adults with hypertrophic cardiomyopathy (HCM) were evaluated. Among these, 122 (62%, group 1) patients also had systemic hypertension. The clinical presentation, management, outcome, and echocardiographic findings of these patients were compared with 74 (38%, group 2) patients without systemic hypertension. Patients in group 1 were older at the time of HCM diagnosis and had a higher prevalence of diabetes (28% vs 9%; P=.02) and coronary artery disease (40% vs 25%; P=.03). In addition, echocardiography showed a significantly higher prevalence of systolic anterior motion of the anterior mitral valve in association with dynamic left ventricular outflow obstruction (52% vs 19%; P=.02) and mitral annular calcification (27% vs 13%; P=.03) in group 1 patients. Left ventricular wall thickness (17 mm vs 19 mm), end‐diastolic diameter (42 mm vs 42 mm), resting outflow tract gradient >30 mm Hg (17% vs 16%), and ejection fraction (65% vs 64%) were similar in the two groups. HCM frequently coexists with systemic hypertension in the adult population. Presence of systemic hypertension in HCM patients is associated with older age and higher risk of diabetes, coronary artery disease, and noncardiac death.
Cardiac Rehabilitation Programs Improve Metabolic Parameters in Patients With the Metabolic Syndrome and Coronary Heart Disease
Authors: Pérez Ignacio P. , Zapata Maria Á. , Cervantes Carlos E. , Jarabo Rosario M. , Grande Cristina , Plaza Rose , Garcia Sara , Rodriguez Miriam L. , Crespo Silvia , Perea Jesús 
Published: January 2010

J Clin Hypertens (Greenwich).This study was performed to determine the effectiveness of a cardiac rehabilitation and exercise training program on metabolic parameters and coronary risk factors in patients with the metabolic syndrome and coronary heart disease. The study involved 642 patients with coronary heart disease. Of them, 171 (26.7%) fulfilled criteria for the metabolic syndrome. Clinical data, laboratory tests, and exercise testing were performed before and after the program, which lasted 2 to 3 months. Except for waist circumference, there were no significant differences between groups; blood pressure, high‐density lipoprotein cholesterol, triglycerides, and fasting glucose improvements during the follow‐up were higher in patients with the metabolic syndrome (all P<.001). At study end, in patients with the metabolic syndrome, functional capacity increased by 26.45% ( P<.001), as measured by metabolic equivalents, with a slight increase of 1.25% ( P=not significant) in the double product. Patients with the metabolic syndrome who took part in this secondary prevention program reported improvements in cardiovascular risk profile and functional capacity.
On the verification problem for weak memory models
Authors: Atig Mohamed Faouzi , Bouajjani Ahmed , Burckhardt Sebastian , Musuvathi Madanlal 
Published: January 2010

We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operations done by modern multi-processor architectures for performance. The verification problem we study is crucial for the correctness of concurrency libraries and other performance-critical system services employing lock-free synchronization, as well as for the correctness of compiler backends that generate code targeted to run on such architectures.
We consider in this paper combinations of three well-known program order relaxations. We consider first the "write to read" relaxation, which corresponds to the TSO (Total Store Ordering) model. This relaxation is used in most hardware architectures available today. Then, we consider models obtained by adding either (1) the "write to write" relaxation, leading to a model which is essentially PSO (Partial Store Ordering), or (2) the "read to read/write" relaxation, or (3) both of them, as it is done in the RMO (Relaxed Memory Ordering) model for instance.
We define abstract operational models for these weak memory models based on state machines with (potentially unbounded) FIFO buffers, and we investigate the decidability of their reachability and their repeated reachability problems.
We prove that the reachability problem is decidable for the TSO model, as well as for its extension with "write to write" relaxation (PSO). Furthermore, we prove that the reachability problem becomes undecidable when the "read to read/write" relaxation is added to either of these two memory models, and we give a condition under which this addition preserves the decidability of the reachability problem. We show also that the repeated reachability problem is undecidable for all the considered memory models.
Continuity analysis of programs
Authors: Chaudhuri Swarat , Gulwani Sumit , Lublinerman Roberto 
Published: January 2010

We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesimal changes to its outputs. The analysis can be used to verify the
robustness
of programs whose inputs can have small amounts of error and uncertainty---e.g., embedded controllers processing slightly unreliable sensor data, or handheld devices using slightly stale satellite data.

Continuity is a fundamental notion in mathematics. However, it is difficult to apply continuity proofs from real analysis to functions that are coded as imperative programs, especially when they use diverse data types and features such as assignments, branches, and loops. We associate data types with metric spaces as opposed to just sets of values, and continuity of typed programs is phrased in terms of these spaces. Our analysis reduces questions about continuity to verification conditions that do not refer to infinitesimal changes and can be discharged using off-the-shelf SMT solvers. Challenges arise in proving continuity of programs with branches and loops, as a small perturbation in the value of a variable often leads to divergent control-flow that can lead to large changes in values of variables. Our proof rules identify appropriate ``synchronization points'' between executions and their perturbed counterparts, and establish that values of certain variables converge back to the original results in spite of temporary divergence.
We prove our analysis sound with respect to the traditional epsilon-delta definition of continuity. We demonstrate the precision of our analysis by applying it to a range of classic algorithms, including algorithms for array sorting, shortest paths in graphs, minimum spanning trees, and combinatorial optimization. A prototype implementation based on the Z3 SMT-solver is also presented.
A verified compiler for an impure functional language
Authors: Chlipala Adam 
Published: January 2010

We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in the Coq proof assistant and has a proof of total correctness with respect to big-step operational semantics for the source and target languages. Compilation is staged and includes standard phases like translation to continuation-passing style and closure conversion, as well as a common subexpression elimination optimization. In this work, our focus has been on discovering and using techniques that make our proofs easy to engineer and maintain. While most programming language work with proof assistants uses very manual proof styles, all of our proofs are implemented as adaptive programs in Coq's tactic language, making it possible to reuse proofs unchanged as new language features are added.
In this paper, we focus especially on phases of compilation that rearrange the structure of syntax with nested variable binders. That aspect has been a key challenge area in past compiler verification projects, with much more effort expended in the statement and proof of binder-related lemmas than is found in standard pencil-and-paper proofs. We show how to exploit the representation technique of parametric higher-order abstract syntax to avoid the need to prove any of the usual lemmas about binder manipulation, often leading to proofs that are actually shorter than their pencil-and-paper analogues. Our strategy is based on a new approach to encoding operational semantics which delegates all concerns about substitution to the meta language, without using features incompatible with general-purpose type theories like Coq's logic.
Dependent types from counterexamples
Authors: Terauchi Tachio 
Published: January 2010

Motivated by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on programmers to supply the candidate (or the correct) types for the recursive functions and instead does counterexample-guided refinement to automatically generate the set of candidate dependent types. The main idea is to extend the classical fixed-point type inference routine to return a counterexample if the program is found untypable with the current set of candidate types. Then, an interpolating theorem prover is used to validate the counterexample as a real type error or generate additional candidate dependent types to refute the spurious counterexample. The process is repeated until either a real type error is found or sufficient candidates are generated to prove the program typable. Our system makes non-trivial use of "linear" intersection types in the refinement phase.
The paper presents the type inference system and reports on the experience with a prototype implementation that infers dependent types for a subset of the Ocaml language. The implementation infers dependent types containing predicates from the quantifier-free theory of linear arithmetic and equality with uninterpreted function symbols.
Type inference for datalog with complex type hierarchies
Authors: Schäfer Max , de Moor Oege 
Published: January 2010

Type inference for Datalog can be understood as the problem of mapping programs to a sublanguage for which containment is decidable. To wit, given a program in Datalog, a schema describing the types of extensional relations, and a user-supplied set of facts about the basic types (stating conditions such as disjointness, implication or equivalence), we aim to infer an over-approximation of the semantics of the program, which should be expressible in a suitable sublanguage of Datalog.
We argue that Datalog with monadic extensionals is an appropriate choice for that sublanguage of types, and we present an inference algorithm. The inference algorithm is proved sound, and we also show that it infers the tightest possible over-approximation for a large class of Datalog programs. Furthermore, we present a practical containment check for a large subset of our type language. The crux of that containment check is a novel generalisation of Quine's procedure for computing prime implicants. The type system has been implemented in a state-of-the-art industrial database system, and we report on experiments with this implementation.
A theory of indirection via approximation
Authors: Hobor Aquinas , Dockins Robert , Appel Andrew W. 
Published: January 2010

Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as heap pointers, higher-order functions, object references, and shared-memory mutexes.
We give a general method to construct models containing indirect reference by presenting a "theory of indirection". Our method can be applied in a wide variety of settings and uses only simple, elementary mathematics. In addition to various forms of indirect reference, the resulting models support powerful features such as impredicative quantification and equirecursion; moreover they are compatible with the kind of powerful substructural accounting required to model (higher-order) separation logic. In contrast to previous work, our model is easy to apply to new settings and has a simple axiomatization, which is complete in the sense that all models of it are isomorphic. Our proofs are machine-checked in Coq.
A relational modal logic for higher-order stateful ADTs
Authors: Dreyer Derek , Neis Georg , Rossberg Andreas , Birkedal Lars 
Published: January 2010

The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different internal data representations. Although it was originally studied for pure, strongly normalizing languages like System F, it has been extended over the past two decades to reason about increasingly realistic languages. In particular, Appel and McAllester's idea of step-indexing has been used recently to develop syntactic Kripke logical relations for ML-like languages that mix functional and imperative forms of data abstraction. However, while step-indexed models are powerful tools, reasoning with them directly is quite painful, as one is forced to engage in tedious step-index arithmetic to derive even simple results.
In this paper, we propose a logic LADR for equational reasoning about higher-order programs in the presence of existential type abstraction, general recursive types, and higher-order mutable state. LADR exhibits a novel synthesis of features from Plotkin-Abadi logic, Gödel-Löb logic, S4 modal logic, and relational separation logic. Our model of LADR is based on Ahmed, Dreyer, and Rossberg's state-of-the-art step-indexed Kripke logical relation, which was designed to facilitate proofs of representation independence for "state-dependent" ADTs. LADR enables one to express such proofs at a much higher level, without counting steps or reasoning about the subtle, step-stratified construction of possible worlds.
Dependent types and program equivalence
Authors: Jia Limin , Zhao Jianzhou , Sjöberg Vilhelm , Weirich Stephanie 
Published: January 2010

The definition of type equivalence is one of the most important design issues for any typed language. In dependently typed languages, because terms appear in types, this definition must rely on a definition of term equivalence. In that case, decidability of type checking requires decidability for the term equivalence relation.
Almost all dependently-typed languages require this relation to be decidable. Some, such as Coq, Epigram or Agda, do so by employing analyses to force all programs to terminate. Conversely, others, such as DML, ATS, Ωmega, or Haskell, allow nonterminating computation, but do not allow those terms to appear in types. Instead, they identify a terminating index language and use singleton types to connect indices to computation. In both cases, decidable type checking comes at a cost, in terms of complexity and expressiveness.
Conversely, the benefits to be gained by decidable type checking are modest. Termination analyses allow dependently typed programs to verify total correctness properties. However, decidable type checking is not a prerequisite for type safety. Furthermore, decidability does not imply tractability. A decidable approximation of program equivalence may not be useful in practice.
Therefore, we take a different approach: instead of a fixed notion for term equivalence, we parameterize our type system with an abstract relation that is not necessarily decidable. We then design a novel set of typing rules that require only weak properties of this abstract relation in the proof of the preservation and progress lemmas. This design provides flexibility: we compare valid instantiations of term equivalence which range from beta-equivalence, to contextual equivalence, to some exotic equivalences.