On the first place antitonicity in QL-implications

To obtain a demanded fuzzy implication in fuzzy systems, a number of desired properties have been proposed, among which the first place antitonicity, the second place isotonicity and the boundary conditions are the most important ones. The three classes of fuzzy implications derived from the implication in binary logic, S-, R- and QL-implications all satisfy the second place isotonicity and the boundary conditions. However, not all the QL-implications satisfy the first place antitonicity as S- and R-implications do. In this paper we study the QL-implications satisfying the first place antitonicity. First we establish the relationship between the first place antitonicity and other required properties of QL-implications. Second we work on the conditions under which a QL-implication generated by different combinations of a t-conorm S, a t-norm T and a strong fuzzy negation N satisfy the first place antitonicity, especially in the cases that both S and T are continuous. We further investigate the interrelationships between S- and R-implications generated by left-continuous t-norms on one hand and QL-implications satisfying the first place antitonicity on the other

Detecting abrupt changes in the spectra of high-energy astrophysical sources

Variable-intensity astronomical sources are the result of complex and often extreme physical processes. Abrupt changes in source intensity are typically accompanied by equally sudden spectral shifts, that is, sudden changes in the wavelength distribution of the emission. This article develops a method for modeling photon counts collected from observation of such sources. We embed change points into a marked Poisson process, where photon wavelengths are regarded as marks and both the Poisson intensity parameter and the distribution of the marks are allowed to change. To the best of our knowledge, this is the first effort to embed change points into a marked Poisson process. Between the change points, the spectrum is modeled nonparametrically using a mixture of a smooth radial basis expansion and a number of local deviations from the smooth term representing spectral emission lines. Because the model is over-parameterized, we employ an ℓ1ℓ1 penalty. The tuning parameter in the penalty and the number of change points are determined via the minimum description length principle. Our method is validated via a series of simulation studies and its practical utility is illustrated in the analysis of the ultra-fast rotating yellow giant star known as FK Com

The N N -> NN pi+ Reaction near Threshold in a Chiral Power Counting Approach

Power-counting arguments are used to organize the interactions contributing to the N N -> d pi, p n pi reactions near threshold. We estimate the contributions from the three formally leading mechanisms: the Weinberg-Tomozawa (WT) term, the impulse term, and the $\Delta$-excitation mechanism. Sub-leading but potentially large mechanisms, including $S$-wave pion-rescattering, the Galilean correction to the WT term, and short-ranged contributions are also examined. The WT term is shown to be numerically the largest, and the other contributions are found to approximately cancel. Similarly to the reaction p p -> p p pi0, the computed cross sections are considerably smaller than the data. We discuss possible origins of this discrepancy.Comment: 31 pages, 17 figure

Towards runtime discovery, selection and composition of semantic services

Service-orientation is gaining momentum in distributed software applications, mainly because it facilitates interoperability and allows application designers to abstract from underlying implementation technologies. Service composition has been acknowledged as a promising approach to create composite services that are capable of supporting service user needs, possibly by personalising the service delivery through the use of context information or user preferences. In this paper we discuss the challenges of automatic service composition, and present DynamiCoS, which is a novel framework that aims at supporting service composition on demand and at runtime for the benefit of service end-users. We define the DynamiCoS framework based on a service composition life-cycle. Framework mechanisms are introduced to tackle each of the phases and requirements of this life-cycle. Semantic services are used in our framework to enable reasoning on the service requests issued by end users, making it possible to automate service discovery, selection and composition. We validate our framework with a prototype that we have built in order to experiment with the mechanisms we have designed. The prototype was evaluated in a testing environment using some use case scenarios. The results of our evaluation give evidences of the feasibility of our approach to support runtime service composition. We also show the benefits of semantic-based frameworks for service composition, particularly for end-users who will be able to have more control on the service composition process

Adaptive SPECT: personalizing medical imaging

We develop modern techniques for image quality evaluation and optimization of imaging systems, and use them to control adaptive SPECT systems. Our results should contribute to the development of more personalized and efficient medical imaging

Evidence for exercise training in autonomic function modulation in patients with chronic obstructive pulmonary disease (COPD) : a systematic review

C

An Algorithm for Automatic Service Composition

Telecommunication companies are struggling to provide their users with value-added services. These services are expected to be context-aware, attentive and personalized. Since it is not economically feasible to build services separately by hand for each individual user, service providers are searching for alternatives to automate service creation. The IST-SPICE project aims at developing a platform for the development and deployment of innovative value-added services. In this paper we introduce our algorithm to cope with the task of automatic composition of services. The algorithm considers that every available service is semantically annotated. Based on a user/developer service request a matching service is composed in terms of component services. The composition follows a semantic graph-based approach, on which atomic services are iteratively composed based on services' functional and non-functional properties