132 resultados para distributed organization
em CentAUR: Central Archive University of Reading - UK
Resumo:
In order to organize distributed educational resources efficiently, to provide active learners an integrated, extendible and cohesive interface to share the dynamically growing multimedia learning materials on the Internet, this paper proposes a generic resource organization model with semantic structures to improve expressiveness, scalability and cohesiveness. We developed an active learning system with semantic support for learners to access and navigate through efficient and flexible manner. We learning resources in an efficient and flexible manner. We provide facilities for instructors to manipulate the structured educational resources via a convenient visual interface. We also developed a resource discovering and gathering engine based on complex semantic associations for several specific topics.
Resumo:
The Neolithic chambered tombs of Bohuslan on the west coast of Sweden were built out of locally occurring raw materials. These exhibit a wide variety of colours, textures and mineral inclusions, and all were used to contrive a series of striking visual effects. Certain of these would have been apparent to the casual observer but others would only have been apparent to someone inside the passage or the burial chamber. There is no evidence that the materials were organized according to a single scheme. Rather, they permitted a series of improvisations, so that no two monuments were exactly alike. The effects that they created are compared with those found in megalithic art where the design elements were painted or carved, but in Bohuslan all the designs were created using the natural properties of the rock.
Resumo:
Phosphorite-filled crustacean burrows associated with a Campanian-age omission surface in the north-western Negev are described. The phosphatic burrow casts weather out displaying scratches (bioglyphs) and two types of local swellings (chambers), which are flattened normal to the course of the burrow. The more abundant chamber type is a flattened spheroid (diameter 45-50 mm) or a flattened, highly prolate ellipsoid of larger dimensions, with bioglyphs. The other type is a flattened spheroid (diameter 45 mm), gently rounded on the upper side and flat on the base. Rings of elevations on the cast (representing moats) form interconnected circlets, each capped by about eight rounded hemispherical tubercles (4 x 4 mm) (pits on original), the whole forming a discrete network. The first type of chamber may have hosted the young (nursery chamber) and/or stored food. The second type of cast replicates a chamber with a pitted floor, which may have formed a brood chamber for 60-70 spherical eggs, each about 3 mm in diameter. Brood chambers in crustacean burrow systems were previously suspected, but only at burrow terminations. The interpreted K-type breeding strategy, brood care and associated functions require a high degree of social organization, none of which has been observed in extant crustaceans, but all occur within social insects.
Resumo:
In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.
Resumo:
We present a general Multi-Agent System framework for distributed data mining based on a Peer-to-Peer model. Agent protocols are implemented through message-based asynchronous communication. The framework adopts a dynamic load balancing policy that is particularly suitable for irregular search algorithms. A modular design allows a separation of the general-purpose system protocols and software components from the specific data mining algorithm. The experimental evaluation has been carried out on a parallel frequent subgraph mining algorithm, which has shown good scalability performances.
Resumo:
Recently, two approaches have been introduced that distribute the molecular fragment mining problem. The first approach applies a master/worker topology, the second approach, a completely distributed peer-to-peer system, solves the scalability problem due to the bottleneck at the master node. However, in many real world scenarios the participating computing nodes cannot communicate directly due to administrative policies such as security restrictions. Thus, potential computing power is not accessible to accelerate the mining run. To solve this shortcoming, this work introduces a hierarchical topology of computing resources, which distributes the management over several levels and adapts to the natural structure of those multi-domain architectures. The most important aspect is the load balancing scheme, which has been designed and optimized for the hierarchical structure. The approach allows dynamic aggregation of heterogenous computing resources and is applied to wide area network scenarios.
Resumo:
This paper focuses on improving computer network management by the adoption of artificial intelligence techniques. A logical inference system has being devised to enable automated isolation, diagnosis, and even repair of network problems, thus enhancing the reliability, performance, and security of networks. We propose a distributed multi-agent architecture for network management, where a logical reasoner acts as an external managing entity capable of directing, coordinating, and stimulating actions in an active management architecture. The active networks technology represents the lower level layer which makes possible the deployment of code which implement teleo-reactive agents, distributed across the whole network. We adopt the Situation Calculus to define a network model and the Reactive Golog language to implement the logical reasoner. An active network management architecture is used by the reasoner to inject and execute operational tasks in the network. The integrated system collects the advantages coming from logical reasoning and network programmability, and provides a powerful system capable of performing high-level management tasks in order to deal with network fault.
Resumo:
In real world applications sequential algorithms of data mining and data exploration are often unsuitable for datasets with enormous size, high-dimensionality and complex data structure. Grid computing promises unprecedented opportunities for unlimited computing and storage resources. In this context there is the necessity to develop high performance distributed data mining algorithms. However, the computational complexity of the problem and the large amount of data to be explored often make the design of large scale applications particularly challenging. In this paper we present the first distributed formulation of a frequent subgraph mining algorithm for discriminative fragments of molecular compounds. Two distributed approaches have been developed and compared on the well known National Cancer Institute’s HIV-screening dataset. We present experimental results on a small-scale computing environment.
Resumo:
Generally poor productivity, delays, low profitability and exceeded budgets are Common problems in modern construction management, however it seems that a basic obstacle lies far deeper in the understanding of a firm's fundamental mission, its existence. The main objective of this paper therefore is to examine the operational living of a construction firm and by doing that to reveal the key problem or the solution for a construction firm - its organization. A firm as a social system in which interactions between its constitutive components (employees) are surordinated to its maintenance (keeping a system alive) is an autopoietic social system. Two domains of external perturbations are uncovered to which a construction firm has to adapt (market driven and project driven perturbations). Constructed conceptual model of an autopoietic organization is based upon two necessary and sufficient operational domains that a firm has to create in order to become an autopoietic, adaptive social system. The first one is a domain of interactions between employees and other operationally external systems, which is representing an idea-generating domain of interactions. The second is employee's autonomous operational domain, which embodies employee's autonomy and individuality and represents a necessary condition for the establishment of an idea-generating domain. Finally, it is recognized that interactions within these four domains keep a construction firm alive.
Resumo:
The member countries of the World Health Organization have endorsed its Global Strategy on Diet, Physical Activity, and Health. We assess the potential consumption impacts of these norms in the United States, France, and the United Kingdom using a mathematical programming approach. We find that adherence would involve large reductions in the consumption of fats and oils accompanying large rises in the consumption of fruits, vegetables, and cereal. Further, in the United Kingdom and the United States, but not France, sugar intakes would have to shrink considerably. Focusing on sub-populations within each country, we find that the least educated, not necessarily the poorest, would have to bear the highest burden of adjustment.