A Calculus of Evolving Objects

The demands of developing modern, highly dynamic applications have led to an increasing interest in dynamic programming languages and mechanisms. Not only applications must evolve over time, but the object models themselves may need to be adapted to the requirements of different run-time contexts. Class-based models and prototype-based models, for example, may need to co-exist to meet the demands of dynamically evolving applications. Multi-dimensional dispatch, fine-grained and dynamic software composition, and run-time evolution of behaviour are further examples of diverse mechanisms which may need to co-exist in a dynamically evolving run-time environment How can we model the semantics of these highly dynamic features, yet still offer some reasonable safety guarantees? To this end we present an original calculus in which objects can adapt their behaviour at run-time to changing contexts. Both objects and environments are represented by first-class mappings between variables and values. Message sends are dynamically resolved to method calls. Variables may be dynamically bound, making it possible to model a variety of dynamic mechanisms within the same calculus. Despite the highly dynamic nature of the calculus, safety properties are assured by a type assignment system.

A Calculus of Evolving Objects

The demands of developing modern, highly dynamic applications have led to an increasing interest in dynamic programming languages and mechanisms. Not only must applications evolve over time, but the object models themselves may need to be adapted to the requirements of different run-time contexts. Class-based models and prototype-based models, for example, may need to co-exist to meet the demands of dynamically evolving applications. Multi-dimensional dispatch, fine-grained and dynamic software composition, and run-time evolution of behaviour are further examples of diverse mechanisms which may need to co-exist in a dynamically evolving run-time environment. How can we model the semantics of these highly dynamic features, yet still offer some reasonable safety guarantees? To this end we present an original calculus in which objects can adapt their behaviour at run-time. Both objects and environments are represented by first-class mappings between variables and values. Message sends are dynamically resolved to method calls. Variables may be dynamically bound, making it possible to model a variety of dynamic mechanisms within the same calculus. Despite the highly dynamic nature of the calculus, safety properties are assured by a type assignment system.

Recovery and Analysis of Transaction Scope from Scattered Information in Java Enterprise Applications

Java Enterprise Applications (JEAs) are large systems that integrate multiple technologies and programming languages. Transactions in JEAs simplify the development of code that deals with failure recovery and multi-user coordination by guaranteeing atomicity of sets of operations. The heterogeneous nature of JEAs, however, can obfuscate conceptual errors in the application code, and in particular can hide incorrect declarations of transaction scope. In this paper we present a technique to expose and analyze the application transaction scope in JEAs by merging and analyzing information from multiple sources. We also present several novel visualizations that aid in the analysis of transaction scope by highlighting anomalies in the specification of transactions and violations of architectural constraints. We have validated our approach on two versions of a large commercial case study.

A hybrid method for large-scale short-term scheduling of make-and-pack production processes

Due to the ongoing trend towards increased product variety, fast-moving consumer goods such as food and beverages, pharmaceuticals, and chemicals are typically manufactured through so-called make-and-pack processes. These processes consist of a make stage, a pack stage, and intermediate storage facilities that decouple these two stages. In operations scheduling, complex technological constraints must be considered, e.g., non-identical parallel processing units, sequence-dependent changeovers, batch splitting, no-wait restrictions, material transfer times, minimum storage times, and finite storage capacity. The short-term scheduling problem is to compute a production schedule such that a given demand for products is fulfilled, all technological constraints are met, and the production makespan is minimised. A production schedule typically comprises 500–1500 operations. Due to the problem size and complexity of the technological constraints, the performance of known mixed-integer linear programming (MILP) formulations and heuristic approaches is often insufficient. We present a hybrid method consisting of three phases. First, the set of operations is divided into several subsets. Second, these subsets are iteratively scheduled using a generic and flexible MILP formulation. Third, a novel critical path-based improvement procedure is applied to the resulting schedule. We develop several strategies for the integration of the MILP model into this heuristic framework. Using these strategies, high-quality feasible solutions to large-scale instances can be obtained within reasonable CPU times using standard optimisation software. We have applied the proposed hybrid method to a set of industrial problem instances and found that the method outperforms state-of-the-art methods.

Granular computing as a tool of human data interaction - a cognitive cities use case

The article proposes granular computing as a theoretical, formal and methodological basis for the newly emerging research field of human–data interaction (HDI). We argue that the ability to represent and reason with information granules is a prerequisite for data legibility. As such, it allows for extending the research agenda of HDI to encompass the topic of collective intelligence amplification, which is seen as an opportunity of today’s increasingly pervasive computing environments. As an example of collective intelligence amplification in HDI, we introduce a collaborative urban planning use case in a cognitive city environment and show how an iterative process of user input and human-oriented automated data processing can support collective decision making. As a basis for automated human-oriented data processing, we use the spatial granular calculus of granular geometry.

Granular computing as a basis of human–data interaction: a cognitive cities use case

The article proposes granular computing as a theoretical, formal and methodological basis for the newly emerging research field of human–data interaction (HDI). We argue that the ability to represent and reason with information granules is a prerequisite for data legibility. As such, it allows for extending the research agenda of HDI to encompass the topic of collective intelligence amplification, which is seen as an opportunity of today’s increasingly pervasive computing environments. As an example of collective intelligence amplification in HDI, we introduce a collaborative urban planning use case in a cognitive city environment and show how an iterative process of user input and human-oriented automated data processing can support collective decision making. As a basis for automated human-oriented data processing, we use the spatial granular calculus of granular geometry.

Gender and the relationship between traumatic childhood experiences and pain in adulthood

OBJECTIVES AND METHODS: Gender differences regarding 17 childhood experiences, thought to have traumatising potential (Traumatic Childhood Experiences = TCE), and pain behaviour in adulthood were assessed using a self-administered, anonymously filled-out questionnaire. Patients were consecutively accrued in the offices of practicing physicians. Three research questions were formulated: 1) Are specific TCE reported more frequently in male and female patients with the diagnosis "Pain Associated with Psychological Factors" (PP), compared to patients with "Pain, explained by Organic Processes" (OP), and "Patients with Diseases without Pain" (OD)? 2) Do PP-men and PP-women differ in reporting TCE?; 3) Are specific TCE correlated with Pain Duration, -Intensity and Number of Operations? RESULTS: 1). TCE occurred more frequently in PP-men and PP-women compared to OP- and OD-patients. 2). The PP-women reported much more TCE-items than the PP-men. 3). Duration and Intensity of adult pain associated with psychological factors correlated with certain TCE-items. CONCLUSIONS: The three research questions can be answered by "yes". In patients with pain which has been impossible to diagnose and/or has resisted conventional forms of therapy, TCE (verbal, physical and sexually abusive) have to be looked for, because they often explain adult pain. Unnecessary examinations and surgery can be avoided and therapies can be tailored for the individual patient.

Extended resection for thyroid disease has less operative morbidity than limited resection

BACKGROUND: Theodor Kocher, surgeon and Nobel laureate, has influenced thyroid surgery all over the world: his treatment for multinodular goiter-subtotal thyroidectomy-has been the "Gold Standard" for more than a century. However, based on a new understanding of molecular growth mechanisms in goitrogenesis, we set out to evaluate if a more extended resection yields better results. METHODS: Four thousand three hundred and ninety-four thyroid gland operations with 5,785 "nerves at risk" were prospectively analyzed between 1972 and 2002. From 1972 to 1990, the limited Kocher resections were performed, and from 1991 to 2002 a more radical resection involving at least a hemithyroidectomy was performed. RESULTS: The incidence of postoperative nerve palsy was 3.6%; in the first study period and 0.9%; in the second (P < 0.001, Fisher's exact). Postoperative hypoparathyroidism decreased from 3.2%; in the first period to 0.64%; in the second (P < 0.01). The rate of reoperation for recurrent disease was 11.1%; from 1972 to 1990 and 8.5%; from 1991 to 2002 (P < 0.01). CONCLUSIONS: Extended resection for multinodular goiter not only significantly reduced morbidity, but also decreased the incidence of operations for recurrent disease. Our findings in a large cohort corroborate the suggestions that Kocher's approach should be replaced by a more radical resection, which actually was his original intention more than 130 years ago.

Portfolio-optimization models for small investors

Since 2010, the client base of online-trading service providers has grown significantly. Such companies enable small investors to access the stock market at advantageous rates. Because small investors buy and sell stocks in moderate amounts, they should consider fixed transaction costs, integral transaction units, and dividends when selecting their portfolio. In this paper, we consider the small investor’s problem of investing capital in stocks in a way that maximizes the expected portfolio return and guarantees that the portfolio risk does not exceed a prescribed risk level. Portfolio-optimization models known from the literature are in general designed for institutional investors and do not consider the specific constraints of small investors. We therefore extend four well-known portfolio-optimization models to make them applicable for small investors. We consider one nonlinear model that uses variance as a risk measure and three linear models that use the mean absolute deviation from the portfolio return, the maximum loss, and the conditional value-at-risk as risk measures. We extend all models to consider piecewise-constant transaction costs, integral transaction units, and dividends. In an out-of-sample experiment based on Swiss stock-market data and the cost structure of the online-trading service provider Swissquote, we apply both the basic models and the extended models; the former represent the perspective of an institutional investor, and the latter the perspective of a small investor. The basic models compute portfolios that yield on average a slightly higher return than the portfolios computed with the extended models. However, all generated portfolios yield on average a higher return than the Swiss performance index. There are considerable differences between the four risk measures with respect to the mean realized portfolio return and the standard deviation of the realized portfolio return.

Lions-type compactness and Rubik actions on the Heisenberg group

In this paper we prove a Lions-type compactness embedding result for symmetric unbounded domains of the Heisenberg group. The natural group action on the Heisenberg group TeX is provided by the unitary group U(n) × {1} and its appropriate subgroups, which will be used to construct subspaces with specific symmetry and compactness properties in the Folland-Stein’s horizontal Sobolev space TeX. As an application, we study the multiplicity of solutions for a singular subelliptic problem by exploiting a technique of solving the Rubik-cube applied to subgroups of U(n) × {1}. In our approach we employ concentration compactness, group-theoretical arguments, and variational methods.

Canonical proof nets for classical logic

Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs. By convincing, we mean that (a) there should be a canonical function from sequent proofs to proof nets, (b) it should be possible to check the correctness of a net in polynomial time, (c) every correct net should be obtainable from a sequent calculus proof, and (d) there should be a cut-elimination procedure which preserves correctness. Previous attempts to give proof-net-like objects for propositional classical logic have failed at least one of the above conditions. In Richard McKinley (2010) [22], the author presented a calculus of proof nets (expansion nets) satisfying (a) and (b); the paper defined a sequent calculus corresponding to expansion nets but gave no explicit demonstration of (c). That sequent calculus, called LK∗ in this paper, is a novel one-sided sequent calculus with both additively and multiplicatively formulated disjunction rules. In this paper (a self-contained extended version of Richard McKinley (2010) [22]), we give a full proof of (c) for expansion nets with respect to LK∗, and in addition give a cut-elimination procedure internal to expansion nets – this makes expansion nets the first notion of proof-net for classical logic satisfying all four criteria.

Heuristic decomposition and LP-based scheduling in make-and-pack production

In this paper, we are concerned about the short-term scheduling of industrial make-and-pack production processes. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Sequence-dependent changeover times, multi-purpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, material transfer times, and a large number of operations contribute to the complexity of the problem. Known MILP formulations cover all technological constraints of such production processes, but only small problem instances can be solved in reasonable CPU times. In this paper, we develop a heuristic in order to tackle large instances. Under this heuristic, groups of batches are scheduled iteratively using a novel MILP formulation; the assignment of the batches to the groups and the scheduling sequence of the groups are determined using a priority rule. We demonstrate the applicability by means of a real-world production process.

Explicit mathematics and operational set theory: some ontological comparisons

We discuss several ontological properties of explicit mathematics and operational set theory: global choice, decidable classes, totality and extensionality of operations, function spaces, class and set formation via formulas that contain the definedness predicate and applications.

Paediatric thyroid surgery is safe - experiences at a tertiary surgical centre.

PRINCIPLES Thyroidectomy in children is rare and mostly performed because of thyroid neoplasms. The aim of this study based on prospective data acquisition was to evaluate whether thyroid surgery in children can be performed as safely as in adults when undertaken by a team of adult endocrine surgeons and paediatric surgeons. METHODS Between 2002 and 2012, 36 patients younger than 18 years underwent surgery for thyroid gland pathologies. All surgical procedures were performed by an experienced endocrine surgeon and a paediatric surgeon. Baseline demographic data, surgical procedure, duration of operation, length of hospital stay, and postoperative morbidity and mortality were analysed. RESULTS The median age of all patients was 13 years (range 2-17 years), with predominantly female gender (n = 30, 83%). The majority of operations were performed because of benign thyroid disease (n = 27, 75%) and only a minority because of malignancy or genetic abnormality with predisposition for malignant transformation (MEN) (n = 9, 25%). Total thyroidectomy was performed in the majority of the patients (n = 24, 67%). The median duration of the surgical procedure was 153 minutes (range 90-310 minutes). The median hospital stay was 5 days (3-1 days). One patient developed persistent hypoparathyroidism after neck dissection due to cancer. One persistent and two temporary recurrent nerve palsies occurred. CONCLUSION This study demonstrated that paediatric thyroidectomy is safe as performed by this team of endocrine and paediatric surgeons, with acceptable morbidity even when total thyroidectomy was performed in the case of benign disease.