BACKGROUND There is conflicting evidence concerning the magnitude of genetic and shared environmental influences on juvenile antisocial behaviour (AB). The use of more than one assessment of AB may yield more accurate estimates of these influences. METHODS Retrospective reports of antisocial behaviour prior to age 18 were obtained on two occasions from a population-based sample of 3522 adult ...

The designer of a model to solve decision making problems usually have to face different aspects to finally be able to obtain the solution for a problem. Many of this aspects directly depend on the representation format and semantics of the information provided by the experts. In many occasions experts can not easily represent their preferences using artificial preference structures as fuzzy pr...

Theories of interorganizational coordination propose that that the fit between information processing capabilities (structure, process and technology) and information processing needs (environmental, partnership and task uncertainty) is a strong determinant of IOS performance. Recently, electronic marketplaces have replaced many traditional interorganizational systems (IOS). While traditional I...

Different auction-based approaches have been used to allocate resources in Grids, but none of them provide the design choice for a specific economic model while considering the interest of all participants in the market. In this paper, we implement an auction-based framework for producer and consumer matchmaking in an ad-hoc Grid. In ad-hoc Grids, where the availability of resources and tasks i...

The ambiguity of natural language can be an important source of creative concepts. In compositional languages, a many-to-many network of associations exists linking concepts by the polysemy and synonymy of utterances. This network allows utterances to represent the combination of concepts, forming new and potentially interesting compound meanings. At the same time, new experiences of external a...

Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} with s+r = n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem.