Computer Science

Résumé Cet article vise à illustrer empiriquement un modèle d’articulation des attitudes des enseignants face aux nouvelles technologies, inspiré de la théorie des représentations sociales. Tout d’abord, les auteurs présentent des éléments qui, au gré des époques et des approches théoriques, illustrent l’évidence des débats et des conflits qui ont accompagné l’introduction de toute nouvelle technologie dans les milieux scolaires. Ces éléments de débat constituent, à notre avis, des conditions favorables pour l’élaboration des représentations sociales chez un corps social, tel celui des enseignants. En deuxième partie, les chercheurs donnent une illustration empirique de la façon dont des enseignantes italiennes organisent leurs attitudes face aux nouvelles technologies de l’information et de la communication selon les prévisions de la théorie des représentations sociales.

Advances in VLSI fabrication technology have made it possible to use niore than two routing layers for interconnections. In this paper: we shall study the niultilayer topological planar routin problem. Tlhe objective is to choose a niaximum keighted) set of nets so that each net in the set can be topologicdy routed entirely on one of the given layers without crossing other nets. The classical two-layer topological planar routing problem has been studied extensively by CAD researchers because of its practical and theoretical importance. Unfortunately, solving the niultilayer topological planar routing problem is NPconiplete [l]. The problem remains NP-complete even when the routing region is restricted to a two-layer switchbox [3]. Polynoniial time optimal solutions to the multilayer topological planar routing problem were developed for a special type of channels: called CTOSSing channels. The general weighted case for crossing channels were solved by Cong and Liu [l]. In this paper: we consider multilayer topological planar routing (k-TPR) problem from a global perspective. We show that the topological planar routing problem for different routing regions can be modeled as a topological planar routing problem in a simple closed routing region: hence can be efficiently solved by solving the problem for a simple closed routing region. We present provably good approximation algorithm: iterative-peeling algorithm: for k-TPR problem in different routing regions. The iterative-peeling algorithm approximates a maximum k-planar subset by taking k niaxiniuni planar subsets one at time. Following theorem shows the performance bound of the iterative-peeling algorithm: Theorem 1 Let pk be the performance ratio of Me iterative-peeling algorithm for k-planar subset problem. Then.

ABSTRACT In this paper, we present an original approach for the design and execution of distributed applications that require numerous tasks of variable grain. The approach is based on the concept of task cluster which is an entity that groups tasks with strong logical interaction and that guarantees efficient communications between them. We describe the implementation of the model, that mainly relies on the use of lightweight processes as support for the distributed tasks. We also illustrate the use of the proposed approach on real size applications where it has improved both the ease of design and the performance

In this paper, we present an original approach for the design and execution of distributed applications that require numerous tasks of variable grain. The approach is based on the concept of task cluster which is an entity that groups tasks with strong logical interaction and that guarantees efficient communications between them. We describe the implementation of the model, that mainly relies on the use of lightweight processes as support for the distributed tasks. We also illustrate the use of the proposed approach on real size applications where it has improved both the ease of design and the performance

Abstract. The objectives of this study were to assess land suitability and to monitor the spatial and temporal changes in land use types (LUTs) by using GIS. The study was conducted in an irrigated area of 920 ha, located in the East Mediterranean region of Turkey. Archived ...

... Robert Brazile University of North Texas brazile@cs.unt.edu Fatma Cemile Serce Atlim University cemileserce@gmail.com George Dafoulas Middlesex University G.Dafoulas@mdx.ac.uk Ferda Nur Alpaslan Middle East Tech. University alpaslan@ceng.metu.edu.tr ...

... Robert Brazile University of North Texas brazile@cs.unt.edu Fatma Cemile Serce Atlim University cemileserce@gmail.com George Dafoulas Middlesex University G.Dafoulas@mdx.ac.uk Ferda Nur Alpaslan Middle East Tech. University alpaslan@ceng.metu.edu.tr ...

There has been significant recent interest in Agent Based Modeling in many social sciences including economics, sociology, anthropology, political science, and game theory. This article describes three problems that need to be addressed in order for such models to become effective tools for formulating new social theory and informing policy debates and suggests approaches to meeting them. These issues are computational epistemology, research methodology, and software technology. These innovations augment Agent Based Modeling to create an effective new tool base to help better understand complex social systems.