219,331 research outputs found
Cultural conceptions of morality: examining laypeople’s associations of moral character
Whether moral conceptions are universal or culture-specific is controversial in moral psychology. One option is to refrain from imposing theoretical constraints and to ask laypeople from different cultures how they conceptualize morality. Our article adopts this approach by examining laypeople's associations of moral character in individualistic- and collectivistic-oriented cultures. Using correspondence analysis we found that the concept of moral character yielded widely shared associations with justice and welfare concerns. Yet, there were also clear cultural differences with individualistic-oriented samples associating more frequently rights-based features and collectivistic-oriented samples more frequently associating duty-based attributes. When matching freelisted trait categories with Schwartz's value types, moral value hierarchies were similar across cultures and correlated significantly with explicit moral value ratings. We conclude that imposing constraints through an expert-designed category system can narrow the scope of inquiry to common moral aspects related to problem-solving, promotion of prosocial actions and control of antisocial behaviour.info:eu-repo/semantics/acceptedVersio
Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions
Counting problems, determining the number of possible states of a large
system under certain constraints, play an important role in many areas of
science. They naturally arise for complex disordered systems in physics and
chemistry, in mathematical graph theory, and in computer science. Counting
problems, however, are among the hardest problems to access computationally.
Here, we suggest a novel method to access a benchmark counting problem, finding
chromatic polynomials of graphs. We develop a vertex-oriented symbolic pattern
matching algorithm that exploits the equivalence between the chromatic
polynomial and the zero-temperature partition function of the Potts
antiferromagnet on the same graph. Implementing this bottom-up algorithm using
appropriate computer algebra, the new method outperforms standard top-down
methods by several orders of magnitude, already for moderately sized graphs. As
a first application, we compute chromatic polynomials of samples of the simple
cubic lattice, for the first time computationally accessing three-dimensional
lattices of physical relevance. The method offers straightforward
generalizations to several other counting problems.Comment: 7 pages, 4 figure
Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks
Millimeter-wave (mmWave) communication is a promising technology to cope with
the expected exponential increase in data traffic in 5G networks. mmWave
networks typically require a very dense deployment of mmWave base stations
(mmBS). To reduce cost and increase flexibility, wireless backhauling is needed
to connect the mmBSs. The characteristics of mmWave communication, and
specifically its high directional- ity, imply new requirements for efficient
routing and scheduling paradigms. We propose an efficient scheduling method,
so-called schedule-oriented optimization, based on matching theory that
optimizes QoS metrics jointly with routing. It is capable of solving any
scheduling problem that can be formulated as a linear program whose variables
are link times and QoS metrics. As an example of the schedule-oriented
optimization, we show the optimal solution of the maximum throughput fair
scheduling (MTFS). Practically, the optimal scheduling can be obtained even for
networks with over 200 mmBSs. To further increase the runtime performance, we
propose an efficient edge-coloring based approximation algorithm with provable
performance bound. It achieves over 80% of the optimal max-min throughput and
runs 5 to 100 times faster than the optimal algorithm in practice. Finally, we
extend the optimal and approximation algorithms for the cases of multi-RF-chain
mmBSs and integrated backhaul and access networks.Comment: To appear in Proceedings of INFOCOM '1
Incorporating Security Behaviour into Business Models Using a Model Driven Approach
There has, in recent years, been growing interest in Model Driven Engineering (MDE), in which models are the primary design artifacts and transformations are applied to these models to generate refinements leading to usable implementations over specific platforms. There is also interest in factoring out a number of non-functional aspects, such as security, to provide reusable solutions applicable to a number of different applications. This paper brings these two approaches together, investigating, in particular, the way behaviour from the different sources can be combined and integrated into a single design model. Doing so involves transformations that weave together the constraints from the various aspects and are, as a result, more complex to specify than the linear pipelines of transformations used in most MDE work to date. The approach taken here involves using an aspect model as a template for refining particular patterns in the business model, and the transformations are expressed as graph rewriting rules for both static and behaviour elements of the models
Recommended from our members
A monitoring approach for runtime service discovery
Effective runtime service discovery requires identification of services based on different service characteristics such as structural, behavioural, quality, and contextual characteristics. However, current service registries guarantee services described in terms of structural and sometimes quality characteristics and, therefore, it is not always possible to assume that services in them will have all the characteristics required for effective service discovery. In this paper, we describe a monitor-based runtime service discovery framework called MoRSeD. The framework supports service discovery in both push and pull modes of query execution. The push mode of query execution is performed in parallel to the execution of a service-based system, in a proactive way. Both types of queries are specified in a query language called SerDiQueL that allows the representation of structural, behavioral, quality, and contextual conditions of services to be identified. The framework uses a monitor component to verify if behavioral and contextual conditions in the queries can be satisfied by services, based on translations of these conditions into properties represented in event calculus, and verification of the satisfiability of these properties against services. The monitor is also used to support identification that services participating in a service-based system are unavailable, and identification of changes in the behavioral and contextual characteristics of the services. A prototype implementation of the framework has been developed. The framework has been evaluated in terms of comparison of its performance when using and when not using the monitor component
Service discovery and negotiation with COWS
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider
Multiple Shape Registration using Constrained Optimal Control
Lagrangian particle formulations of the large deformation diffeomorphic
metric mapping algorithm (LDDMM) only allow for the study of a single shape. In
this paper, we introduce and discuss both a theoretical and practical setting
for the simultaneous study of multiple shapes that are either stitched to one
another or slide along a submanifold. The method is described within the
optimal control formalism, and optimality conditions are given, together with
the equations that are needed to implement augmented Lagrangian methods.
Experimental results are provided for stitched and sliding surfaces
A Calculus for Orchestration of Web Services
Service-oriented computing, an emerging paradigm for distributed computing based on the use of services, is calling for the development of tools and techniques to build safe and trustworthy systems, and to analyse their behaviour. Therefore, many researchers have proposed to use process calculi, a cornerstone of current foundational research on specification and analysis of concurrent, reactive, and distributed systems. In this paper, we follow this approach and introduce CWS, a process calculus expressly designed for specifying and combining service-oriented applications, while modelling their dynamic behaviour. We show that CWS can model all the phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, orchestration, deployment, reconfiguration and execution. We illustrate the specification style that CWS supports by means of a large case study from the automotive domain and a number of more specific examples drawn from it
- …