Short lists with short programs in short time - a short proof

Bauwens, Mahklin, Vereshchagin and Zimand [ECCC TR13-007] and Teutsch [arxiv:1212.6104] have shown that given a string x it is possible to construct in polynomial time a list containing a short description of it. We simplify their technique and present a shorter proof of this result

Mapping Functions in Health-Related Quality of Life: Mapping From Two Cancer-Specific Health-Related Quality-of-Life Instruments to EQ-5D-3L.

BACKGROUND: Clinical trials in cancer frequently include cancer-specific measures of health but not preference-based measures such as the EQ-5D that are suitable for economic evaluation. Mapping functions have been developed to predict EQ-5D values from these measures, but there is considerable uncertainty about the most appropriate model to use, and many existing models are poor at predicting EQ-5D values. This study aims to investigate a range of potential models to develop mapping functions from 2 widely used cancer-specific measures (FACT-G and EORTC-QLQ-C30) and to identify the best model. METHODS: Mapping models are fitted to predict EQ-5D-3L values using ordinary least squares (OLS), tobit, 2-part models, splining, and to EQ-5D item-level responses using response mapping from the FACT-G and QLQ-C30. A variety of model specifications are estimated. Model performance and predictive ability are compared. Analysis is based on 530 patients with various cancers for the FACT-G and 771 patients with multiple myeloma, breast cancer, and lung cancer for the QLQ-C30. RESULTS: For FACT-G, OLS models most accurately predict mean EQ-5D values with the best predicting model using FACT-G items with similar results using tobit. Response mapping has low predictive ability. In contrast, for the QLQ-C30, response mapping has the most accurate predictions using QLQ-C30 dimensions. The QLQ-C30 has better predicted EQ-5D values across the range of possible values; however, few respondents in the FACT-G data set have low EQ-5D values, which reduces the accuracy at the severe end. CONCLUSIONS: OLS and tobit mapping functions perform well for both instruments. Response mapping gives the best model predictions for QLQ-C30. The generalizability of the FACT-G mapping function is limited to populations in moderate to good health

Concept Validation for Selective Heating and Press Hardening of Automotive Safety Components with Tailored Properties

© (2014) Trans Tech Publications, Switzerland.A new strategy termed selective heating and press hardening, for hot stamping of boron steel parts with tailored properties is proposed in this paper. Feasibility studies were carried out through a specially designed experimental programme. The main aim was to validate the strategy and demonstrate its potential for structural optimisation. In the work, a lab-scale demonstrator part was designed, and relevant manufacturing and property-assessment processes were defined. A heating technique and selective-heating rigs were designed to enable certain microstructural distributions in blanks to be obtained. A hot stamping tool set was designed for forming and quenching the parts. Demonstrator parts of full martensite phase, full initial phase, and differentially graded microstructures have been formed with high dimensional quality. Hardness testing and three point bending tests were conducted to assess the microstructure distribution and load bearing performance of the as-formed parts, respectively. The feasibility of the concept has been validated by the testing results

A Complete Year of User Retrieval Sessions in a Social Sciences Academic Search Engine

In this paper, we present an open data set extracted from the transaction log of the social sciences academic search engine sowiport. The data set includes a filtered set of 484,449 retrieval sessions which have been carried out by sowiport users in the period from April 2014 to April 2015. We propose a description of interactions performed by the academic search engine users that can be used in different applications such as result ranking improvement, user modeling, query reformulation analysis, search pattern recognition.Comment: 6 pages, 2 figures, accepted short paper at the 21st International Conference on Theory and Practice of Digital Libraries (TPDL 2017

A unified approach on Springer fibers in the hook, two-row and two-column cases

We consider the Springer fiber over a nilpotent endomorphism. Fix a Jordan basis and consider the standard torus relative to this. We deal with the problem to describe the flags fixed by the torus which belong to a given component of the Springer fiber. We solve the problem in the hook, two-row and two-column cases. We provide two main characterizations which are common to the three cases, and which involve dominance relations between Young diagrams and combinatorial algorithms. Then, for these three cases, we deduce topological properties of the components and their intersections.Comment: 42 page

The Labour Government, the Treasury and the £6 pay policy of July 1975

The 1974-79 Labour Government was elected in a climate of opinion that was fiercely opposed to government intervention in the wage determination process, and was committed to the principles of free collective bargaining in its manifestoes. However, by December 1974 the Treasury was advocating a formal incomes policy, and by July 1975 the government had introduced a £6 flat rate pay norm. With reference to archival sources, the paper demonstrates that TUC and Labour Party opposition to incomes policy was reconciled with the Treasury's advocacy by limiting the Bank of England‟s intervention in the foreign exchange market when sterling came under pressure. This both helped to achieve the Treasury's objective of improving the competitiveness of British industry, and acted as a catalyst for the introduction of incomes policy because the slide could be attributed to a lack of market confidence in British counter-inflation policy

Lazy Abstraction-Based Controller Synthesis

We present lazy abstraction-based controller synthesis (ABCS) for continuous-time nonlinear dynamical systems against reach-avoid and safety specifications. State-of-the-art multi-layered ABCS pre-computes multiple finite-state abstractions of varying granularity and applies reactive synthesis to the coarsest abstraction whenever feasible, but adaptively considers finer abstractions when necessary. Lazy ABCS improves this technique by constructing abstractions on demand. Our insight is that the abstract transition relation only needs to be locally computed for a small set of frontier states at the precision currently required by the synthesis algorithm. We show that lazy ABCS can significantly outperform previous multi-layered ABCS algorithms: on standard benchmarks, lazy ABCS is more than 4 times faster

Probing electron acceleration and X-ray emission in laser-plasma accelerator

While laser-plasma accelerators have demonstrated a strong potential in the acceleration of electrons up to giga-electronvolt energies, few experimental tools for studying the acceleration physics have been developed. In this paper, we demonstrate a method for probing the acceleration process. A second laser beam, propagating perpendicular to the main beam is focused in the gas jet few nanosecond before the main beam creates the accelerating plasma wave. This second beam is intense enough to ionize the gas and form a density depletion which will locally inhibit the acceleration. The position of the density depletion is scanned along the interaction length to probe the electron injection and acceleration, and the betatron X-ray emission. To illustrate the potential of the method, the variation of the injection position with the plasma density is studied

TrustShadow: Secure Execution of Unmodified Applications with ARM TrustZone

The rapid evolution of Internet-of-Things (IoT) technologies has led to an emerging need to make it smarter. A variety of applications now run simultaneously on an ARM-based processor. For example, devices on the edge of the Internet are provided with higher horsepower to be entrusted with storing, processing and analyzing data collected from IoT devices. This significantly improves efficiency and reduces the amount of data that needs to be transported to the cloud for data processing, analysis and storage. However, commodity OSes are prone to compromise. Once they are exploited, attackers can access the data on these devices. Since the data stored and processed on the devices can be sensitive, left untackled, this is particularly disconcerting. In this paper, we propose a new system, TrustShadow that shields legacy applications from untrusted OSes. TrustShadow takes advantage of ARM TrustZone technology and partitions resources into the secure and normal worlds. In the secure world, TrustShadow constructs a trusted execution environment for security-critical applications. This trusted environment is maintained by a lightweight runtime system that coordinates the communication between applications and the ordinary OS running in the normal world. The runtime system does not provide system services itself. Rather, it forwards requests for system services to the ordinary OS, and verifies the correctness of the responses. To demonstrate the efficiency of this design, we prototyped TrustShadow on a real chip board with ARM TrustZone support, and evaluated its performance using both microbenchmarks and real-world applications. We showed TrustShadow introduces only negligible overhead to real-world applications.Comment: MobiSys 201

A General Geometric Fourier Transform

The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature. We show which constraints are additionally necessary to obtain certain features like linearity or a shift theorem. As a result, we provide guidelines for the target-oriented design of yet unconsidered transforms that fulfill requirements in a specific application context. Furthermore, the standard theorems do not need to be shown in a slightly different form every time a new geometric Fourier transform is developed since they are proved here once and for all.Comment: First presented in Proc. of The 9th Int. Conf. on Clifford Algebras and their Applications, (2011