Concrete Domain Research Articles

Experimental Study of the Soundness and Compatibility of Baosteel Steel-Slag Powder Applied in Cement Concrete

To reduce the cost and improve concrete performance, massive admixtures were needed to be added to the concrete. With the research going, the high quality mixture is increasingly becoming the indispensable concrete component. The steel slag powder is the steel-slag comprehensive utilization technical commanding point compared with the level of the steel slag application nowadays in the world. In order to develop the application of the steel slag fine powder in cement concrete domain, this article analyzes autoclaved soundness of the Baosteel steel-slag fine powder as well as the compatibility of it with the cement and the concrete admixtures.

Software Generic Measurement Framework Based on MDA

Currently, in order to obtain high quality software products it is necessary to carry out a good software processes management in which measurement is a fundamental factor. Due to the great diversity of entities involved in software measurement, a consistent framework to integrate the different entities in the measurement process is required. In this paper the Software Measurement Framework (SMF) is presented, which supports the measurement of any type of software entity through the metamodels which depict them. In this framework, any software entity in any domain could be measured with a common Software Measurement metamodel and by means of QVT transformations. This work explains the three fundamental elements of the Software Measurement Framework (conceptual architecture, technological aspects and method). These elements have all been adapted to the MDE paradigm and to MDA technology, taking advantage of their benefits within the field of software measurement. Furthermore an example which illustrates the framework's application to a concrete domain is furthermore shown.

Formalizing interactive staged feature model configuration

SUMMARYFeature modeling an attractive technique for capturing commonality as well as variability within an application domain for generative programming and software product line engineering. Feature models symbolize an overarching representation of the possible application configuration space, and can hence be customized based on specific domain requirements and stakeholder goals. Most interactive or semi‐automated feature model customization processes neglect the need to have a holistic approach towards the integration and satisfaction of the stakeholder's soft and hard constraints, and the application‐domain integrity constraints. In this paper, we will show how the structure and constraints of a feature model can be modeled uniformly through Propositional Logic extended with concrete domains, called Pscr(𝒩). Furthermore, we formalize the representation of soft constraints in fuzzy 𝒫(𝒩) and explain how semi‐automated feature model customization is performed in this setting. The model configuration derivation process that we propose respects the soundness and completeness properties. Copyright © 2011 John Wiley & Sons, Ltd.

From perceptual rags to metaphoric riches—Bodily, social, and cultural constraints on sociocognitive metaphors: Comment on Landau, Meier, and Keefer (2010).

What leads people to describe some of their interpersonal relationships as "close" and "warm" and others as "distant" and "cold"? Landau, Meier, and Keefer (2010) proposed that conceptual metaphors facilitate social cognition by allowing people to use knowledge from a relatively concrete (source) domain (e.g., physical distance) in understanding a different, usually more abstract (target) concept (e.g., love). We concur that such a notion of metaphors can greatly enrich the field of social cognition. At the same time, we believe it is important to devote greater theoretical attention to the nature of metaphorical representations in social cognition. We believe that Landau et al. place too much emphasis on sociocognitive metaphors as top-down knowledge structures and pay too little attention to the constraints that shape metaphors from the bottom up. In the present contribution, we highlight important bottom-up constraints, imposed through bodily constraints and social scaffolds. Sociocognitive metaphors do not exist just for mental representation but for action as well. We discuss the relevance of grounding sociocognitive metaphors for broader motivational purposes.

Software Generic Measurement Framework Based on MDA

Currently, in order to obtain high quality software products it is necessary to carry out a good software processes management in which measurement is a fundamental factor. Due to the great diversity of entities involved in software measurement, a consistent framework to integrate the different entities in the measurement process is required. In this paper the Software Measurement Framework (SMF) is presented, which supports the measurement of any type of software entity through the metamodels which depict them. In this framework, any software entity in any domain could be measured with a common Software Measurement metamodel and by means of QVT transformations. This work explains the three fundamental elements of the Software Measurement Framework (conceptual architecture, technological aspects and method). These elements have all been adapted to the MDE paradigm and to MDA technology, taking advantage of their benefits within the field of software measurement. Furthermore an example which illustrates the framework's application to a concrete domain is furthermore shown.

Similarity is closeness: Metaphorical mapping in a conceptual task

The conceptual metaphor theory states that abstract concepts are represented by image schemas from concrete domains. In the present study we investigated the mapping for SIMILARITY IS CLOSENESS using tasks with nonlinguistic materials. In Experiments 1 and 2 participants decided whether two squares were similar or dissimilar in colour. The spatial distance between the squares was varied. Performance to similar colours was better at shorter distances, whereas performance to dissimilar colours was better at longer distances. In Experiments 3 and 4 participants made distance decisions to similar and dissimilar colours squares. Performance was not affected by similarity. These results show that metaphorical mappings can be found even beyond the context of linguistic metaphors and that the mapping between SIMILARITY and CLOSENESS is asymmetrical.

Vérification de propriétés quantitatives sur des automates à contraintes

We define a general framework for the extension of temporal logics with constraints induced by a concrete domain, made of an interpretation domain and a set of relations. The extensions we consider allow to compare values of the variables at different states of an execution. We establish decidability and complexity results for several model-checking problems involving several instances of such extensions. We mainly use automata-based techniques that combine some usual constructions for temporal logics with finite abstraction methods for infinite datas. For instance, we consider several fragments of (linear and branching-time) temporal logics extended with constraints on counters induced by Presburger arithmetic.

Explaining the institutional foundations of European Union negotiations

European Union (EU) negotiations take place within the framework of a set of formal and informal institutions. Member states negotiate in the organizational context of the Council and the European Council, take decisions through alternative procedures and decision rules, and sustain a set of norms for the conduct of negotiations. While the effects of these institutions on negotiation behaviour and outcomes have received extensive attention, the question of why these particular institutions have been established or evolved remains underexplored. This contribution makes an argument in favour of systematic attention to the design of negotiation institutions in the EU, and suggests that we should draw on general theoretical approaches to institutional design for these purposes. Moreover, rather than engaging in the exercise of trying to prove or falsify theoretical approaches, we should exploit the potential for explanatory complementarities in concrete empirical domains. To this end, the paper advances a domain-of-application approach to institutional design and illustrates its applicability to EU negotiation institutions through four empirical illustrations.

From Utopia to Science: Challenges of Personalised Genomics Information for Health Management and Health Enhancement

From 1900 onwards, scientists and novelists have explored the contours of a future society based on the use of “anthropotechnologies” (techniques applicable to human beings for the purpose of performance enhancement ranging from training and education to genome-based biotechnologies). Gradually but steadily, the technologies involved migrated from (science) fiction into scholarly publications, and from “utopia” (or “dystopia”) into science. Building on seminal ideas borrowed from Nietzsche, Peter Sloterdijk has outlined the challenges inherent in this development. Since time immemorial, and at least since the days of Plato’s Academy, human beings have been interested in possibilities for (physical or mental) performance enhancement. We are constantly trying to improve ourselves, both collectively and individually, for better or for worse. At present, however, new genomics-based technologies are opening up new avenues for self-amelioration. Developments in research facilities using animal models may to a certain extent be seen as expeditions into our own future. Are we able to address the bioethical and biopolitical issues awaiting us? After analyzing and assessing Sloterdijk’s views, attention will shift to a concrete domain of application, namely sport genomics. For various reasons, top athletes are likely to play the role of genomics pioneers by using personalized genomics information to adjust diet, life-style, training schedules and doping intake to the strengths and weaknesses of their personalized genome information. Thus, sport genomics may be regarded as a test bed where the contours of genomics-based self-management are tried out.

Studies on the interactions of kaempferol to calcineurin by spectroscopic methods and docking

Kaempferol, in our previous study, was a new immunosuppressant on calcineurin (CN), the Ca 2+/calmodulin (CaM)-dependent protein phosphatase. Here, we examined the interactions of kaempferol with CN by fluorescence spectroscopy (FS), circular dichroism spectroscopy (CD) and docking. Data of kaempferol with CN catalytic subunit (CN A) and its truncated mutant CNAa obtained by FS method showed that the binding stoichiometry of kaempferol/CN A was 1:1, catalytic domain of CN A was the concrete domain for kaempferol binding while other domains contributed a lot to this binding. Distances from kaempferol to each tryptophan (Trp) in CN A by energy transfer experiments and the subsequent docking study interestingly provided the same binding sites for kaempferol, which all located in the non-active site area of CN A catalytic domain, also consisted with our previous conclusion from CN activity assay. Furthermore, CD results showed a much tighter structure of CN A for the inhibitor binding; on the other hand, presence of Ca 2+ and Mn 2+ decreased kaempferol binding on CN A.

Scaffolded learning with mixed reality

Scaffolding is a widely used educational practice in which directed instruction gradually decreases as student competence increases-resulting in increased independent learning. This research introduces and evaluates an MR-based system for technology-mediated scaffolding in anesthesia education. Through merging real and virtual objects, the system addresses a vital problem in merging abstract and concrete knowledge. To evaluate the system, a user study was conducted (n=130). Results suggest that MR's merging of real and virtual spaces can offer (1) a unique level of educational scaffolding, and (2) an improved learning-transfer from abstract to concrete domains. To classify the presented system, the virtuality continuum is extended to include scaffolding. The presented scaffolding-space continuum classifies technology-mediated scaffolding tools along three orthogonal continuums: (1) virtuality, (2) information (e.g. abstract, concrete), and (3) interaction. Using these 3 orthogonal continuums, effective engineering approaches for technology-mediated educational scaffolding are described.

Event valence and spatial metaphors of time

Recent research suggests that people's understanding of the abstract domain of time is dependent on the more concrete domain of space. Boroditsky and Ramscar (2002) found that spatial context influences whether people see themselves as moving through time (ego-moving perspective) or as time moving towards them (time-moving perspective). Based on studies of the embodiment of affective experience, we examined whether affect might also influence which spatial metaphor of time people adopt. The results of Experiments 1 and 2 showed that participants who imagined a negative event were more likely to report that the event was approaching them, whereas those who imagined a positive event were more likely to report that they were approaching the event. Experiments 3a and 3b showed that participants judge an event to be more positive if it is described from the ego-moving perspective than if it is described from the time-moving perspective. Results from these studies provide initial evidence that positive and negative events are associated with different spatial metaphors of time.

Motion Verbs and the Development of Aspect in Russian

There are two reasons to believe that motion verbs are prototypical in the Russian aspectual system: 1) motion events and situations provide a concrete source domain experience for the metaphorical understanding of abstract concepts such as progress, result, process, and repetition; 2) motion verbs form the maximum number of types of Perfectives, including Natural Perfective (pojti 'walk'), Specialized Perfective (prijti 'arrive on foot'), Complex Act Perfective (pochodit' 'walk for a while'), and Single Act Perfective (schodit' 'walk someplace and back once'). It is possible that the privileged status of the motion verbs may have played a role in the grammaticalization of aspect in Russian. Determinacy may have been generalized to the entire verbal lexicon as a distinction between Completability and Non-Completability. Evidence in support of this hypothesis comes from both synchronic and diachronic studies showing the distribution of Perfectives, their order of grammaticalization, and changes in the way in which Determinacy/Completability is expressed in Russian.

Software generic measurement framework based on MDA

Currently, in order to obtain high quality software products it is necessary to carry out a good software processes management in which measurement is a fundamental factor. Due to the great diversity of entities involved in software measurement, a consistent framework to integrate the different entities in the measurement process is required. In this paper the software measurement framework (SMF) is presented, which supports the measurement of any type of software entity through the metamodels which depict them. In this framework, any software entity in any domain could be measured with a common software Measurement metamodel and by means of QVT transformations. This work explains the three fundamental elements of the software measurement framework (conceptual architecture, technological aspects and method). These elements have all been adapted to the MDE paradigm and to MDA technology, taking advantage of their benefits within the field of software measurement. Furthermore an example which illustrates the framework's application to a concrete domain is furthermore shown.

Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces

We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among agents, and optimization techniques in order to find Pareto-efficient agreements. We introduce $${\mathcal{P}}({\mathcal{N}})$$ , a propositional logic extended with concrete domains, which allows one to model relations among issues (both numerical and non-numerical ones) via logical entailment, differently from well-known approaches that describe issues as uncorrelated. Through $${\mathcal{P}}({\mathcal{N}})$$ it is possible to represent buyer's request, seller's supply and their respective preferences as formulas endowed with a formal semantics, e.g., if I spend more than 30000 � for a sedan then I want more than a two-years warranty and a GPS system included. We mix logic and utility theory in order to express preferences in a qualitative and quantitative way. We illustrate the theoretical framework, the logical language, the one-shot negotiation protocol we adopt, and show we are able to compute Pareto-efficient outcomes, using a mediator to solve an optimization problem. We prove the computational adequacy of our method by studying the complexity of the problem of finding Pareto-efficient solutions in our setting.

Compact decoupling for thermoelasticity in irregular domains

In this paper, we prove the compactness of the difference between the thermoelasticity semigroup and its decoupled one on some irregular domains. This will be achieved by proving the norm continuity of this difference and the compactness of the difference between the resolvent of their generators and using Theorem 2.3 in Semigroup Forum 65 (2002), 58-70. An application to a thermoelastic system on a concrete irregular domain is given.

Non-isomorphism of some algebras of holomorphic functions

Suppose that $\mathcal X$ is a family of spaces of holomorphic functions such that each $X=X(D) \in \mathcal X$ can be defined on a domain $D$ belonging to some class $\mathcal D$ of domains. Then for any two concrete domains $D_1$ and $D_2 \in \mathcal D$ and $X \in \mathcal X$ one can ask the following natural question if corresponding spaces $X(D_1)$ and $X(D_2)$ are isomorphic as topological vector spaces. Similarly, for a fixed $D \in \mathcal D$ and two different spaces $X_1, X_2 \in \mathcal X$ one can consider the existence of an isomorphism between $X_1(D)$ and $X_2(D)$. We answer these questions when $\mathcal X$ consists of Hardy $N^p_*(D)$, maximal Hardy $MN^p_*(D)$, Bergman ${\mathbb N}^p(D)$, and Lumer's Hardy $LN^p_*(D)$ algebras, $p \geq 1$, and $\mathcal D = \{\mathbb B_n, \mathbb U^n, n \in \mathbb N\}$ is the family of the unit balls and the unit polydiscs in ${C}^n$.

A proposition of knowledge management methodology for the purpose of reasoning with the use of an upper-ontology

This article describes a proposition of knowledge organization for the purpose of reasoningusing an upper-ontology. It presents a model of integrated ontologies architecture whichconsists of a domain ontologies layer with instances, a shared upper-ontology layer withadditional rules and a layer of ontologies mapping concrete domain ontologies with the upperontology.Thanks to the upper-ontology, new facts were concluded from domain ontologiesduring the reasoning process. A practical realization proposition is given as well. It is basedon some popular SemanticWeb technologies and tools, such as OWL, SWRL, nRQL, Prot´eg´eand Racer.

A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes

In order to use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but for which reasoning is still decidable. Two means of expressivity required by many modern applications of DLs are concrete domains and general TBoxes. The former are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extension. The purpose of the latter is to capture background knowledge by stating that the extension of a concept is included in the extension of another concept. Unfortunately, combining concrete domains with general TBoxes often leads to DLs for which reasoning is undecidable. In this paper, we identify a general property of concrete domains that is sufficient for proving decidability of DLs with both concrete domains and general TBoxes. We exhibit some useful concrete domains, most notably a spatial one based on the RCC-8 relations that have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with concrete domains and general TBoxes.

An automata-theoretic approach to constraint LTL

We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show PSPACE decidability of the logic for the constraint systems ( Z , < , = ) and ( N , < , = ). Along the way, we give an automata-theoretic proof of a result of Balbiani and Condotta when the constraint system satisfies the completion property. Our decision procedures extend easily to handle extensions of the logic with past-time operators and constants, as well as an extension of the temporal language itself to monadic second order logic. Finally we show that the logic becomes undecidable when one considers constraint systems that allow a counting mechanism.