Introduction. In accordance with the Bucharest Declaration of Ethical Values and Principles Higher Education (2004), modern universities cannot be considered only as scientific technical “factories” in isolation from values ethical norms. their mission society, they should “contribute every possible way to establishment inculcation highest moral standards”. this article, problem training future...

RESUME The author reviews the problems encountered by Native businessmen in raising capital for their enterprises. One major problem is the difficulty posed by the inability of Bands to mortgage land and buildings on reserves. The author concludes with suggestions for increasing capital procurement for Native business. L'auteur examine les problèmes que se posent aux hommes d'affaires autochton...

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.