A comparison of stage-specific all-cause mortality between testicular sex cord stromal tumors and germ cell tumors: results from the National Cancer Database.

BackgroundTesticular sex cord stromal tumors (SCSTs) are managed similarly to germ cell tumors (GCTs); however, few studies have directly compared outcomes between these tumor types. Using the National Cancer Database (NCDB), we sought to compare overall and stage-specific all-cause mortality (ACM) between SCSTs versus GCTs.MethodsNCDB was queried for patients diagnosed with SCSTs and GCTs between 2004 and 2013. Descriptive statistics were used to compare sociodemographic and clinical characteristics between groups. Univariable and multivariable Cox proportional hazards regression analyses were used to assess associations with ACM.ResultsWe identified 42,192 patients diagnosed with testicular cancer between 2004 and 2013, with 280 having SCSTs and 41,912 patients having GCTs. Median age for SCSTs and GCTs was 45 (interquartile range [IQR] 34-59) and 34 (IQR 27-43), respectively (p < 0.001). Median follow-up was 39 and 52 months, respectively. Overall, patients with SCSTs had greater risk of ACM compared to those with GCTs (HR 1.69, 95% CI 1.14-2.50). Private insurance, greater education, and fewer comorbidities were associated with reduced risk of ACM (p < 0.05 for all). Among those with stage I disease, tumor type was not associated with ACM on multivariable analysis. Among those with stage II/III disease, patients with SCSTs had increased risk of ACM compared to patients with GCTs (HR 3.29, 95% CI 1.89-5.72).ConclusionsPatients with advanced SCSTs had worse survival outcomes compared to those with advanced GCTs. These data suggest a need for further investigation to ascertain effective management recommendations for SCSTs

Tandem Fan Applications in Advanced STOVL Fighter Configurations

The series/parallel tandem fan engine is evaluated for application in advanced STOVL supersonic fighter aircraft. Options in engine cycle parameters and design of the front fan flow diverter are examined for their effects on engine weight, dimensions, and other factors in integration of the engine with the aircraft. Operation of the engine in high-bypass flow mode during cruise and loiter flight is considered as a means of minimizizng fuel consumption. Engine thrust augmentation by burning in the front fan exhaust is discussed. Achievement of very sort takeoff with vectored thrust in briefly reviewed for tandem fan engine configurations with vectorable front fan nozzles. Examples are given of two aircraft configuration planforms, a delta-canard, and a forward-swept wing, to illustrate the major features. design considerations, and potential performance of the tandem fan installation in each. Full realization of the advantages of tandem fan propulsion are found to depend on careful selection of the aircraft configuration, since integration requirements can strongly influence the engine performance

GravEn: Software for the simulation of gravitational wave detector network response

Physically motivated gravitational wave signals are needed in order to study the behaviour and efficacy of different data analysis methods seeking their detection. GravEn, short for Gravitational-wave Engine, is a MATLAB software package that simulates the sampled response of a gravitational wave detector to incident gravitational waves. Incident waves can be specified in a data file or chosen from among a group of pre-programmed types commonly used for establishing the detection efficiency of analysis methods used for LIGO data analysis. Every aspect of a desired signal can be specified, such as start time of the simulation (including inter-sample start times), wave amplitude, source orientation to line of sight, location of the source in the sky, etc. Supported interferometric detectors include LIGO, GEO, Virgo and TAMA.Comment: 10 Pages, 3 Figures, Presented at the 10th Gravitational Wave Data Analysis Workshop (GWDAW-10), 14-17 December 2005 at the University of Texas, Brownsvill

Trellis decoding complexity of linear block codes

In this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimension/length profile (DLP) bounds. Codes meeting these bounds minimize all the complexity measures simultaneously; conversely, a code attaining the bound for total span length, vertices, or edges, must likewise attain it for all the others. We define a notion of “uniform” optimality that embraces different domains of optimization, such as different permutations of a code or different codes with the same parameters, and we give examples of uniformly optimal codes and permutations. We also give some conditions that identify certain cases when no code or permutation can meet the bounds. In addition to DLP-based bounds, we derive new inequalities relating one complexity measure to another, which can be used in conjunction with known bounds on one measure to imply bounds on the others. As an application, we infer new bounds on maximum state and edge complexity and on total vertices and edges from bounds on span lengths

Side-channel-free quantum key distribution

Quantum key distribution (QKD) offers the promise of absolutely secure communications. However, proofs of absolute security often assume perfect implementation from theory to experiment. Thus, existing systems may be prone to insidious side-channel attacks that rely on flaws in experimental implementation. Here we replace all real channels with virtual channels in a QKD protocol, making the relevant detectors and settings inside private spaces inaccessible while simultaneously acting as a Hilbert space filter to eliminate side-channel attacks. By using a quantum memory we find that we are able to bound the secret-key rate below by the entanglement-distillation rate computed over the distributed states.Comment: Considering general quantum systems, we extended QKD to the presence of an untrusted relay, whose measurement creates secret correlations in remote stations (achievable rate lower-bounded by the coherent information). This key ingredient, i.e., the use of a measurement-based untrusted relay, has been called 'measurement-device independence' in another arXiv submission (arXiv:1109.1473