When the Line is Crossed... : Paths to Control and Sanction Behaviour Necessitating a State Reaction

The article presents a special form of a European comparative synopsis. For this case examples have been chosen ranging from administrative or minor (criminal) offences to increasingly serious offences and offenders. In this way it can be comparatively demonstrated how the criminal justice systems studied handle specific cases and whether they do so in a similar or different way.

Desire and the paths of recognation [sic] in Hegel's intersubjectivity

This thesis poses two fundamental issues regarding Hegel's philosophy of intersubjectivity. Firstly, it examines Kojeve's problematic interpretation of Hegelian intersubjectivity as being solely rooted in the dialectic of lordship and bondage. It is my contention that Kojeve conflates the concepts of recognition {Anerkennung) with that of desire (Begierde), thereby reducing Hegel's philosophy of intersubjectivity to a violent reduction of the other to the same. This is so despite the plenary of examples Hegel uses to define intersubjectivity as the mutual (reciprocal) recognition between the self and the other. Secondly, it examines Hegel's use of Sophocles' Antigone to demonstrate the notion of the individual par excellence. I contend that Hegel's use of Antigone opens a new methodological framework through which to view his philosophy of intersubjectivity. It is Antigone that demonstrates the upheaval of an economy of exchange between the self and the other, whereby the alterity of the other transcends the self Ultimately, Hegel's philosophy of intersubjectivity must be reexamined, not only to dismiss Kojeve's problematic interpretation, but also to pose the possibility that Hegel's philosophy of intersubjectivity can viably account for a philosophy of the other that has a voice in contemporary philosophical debate.

Career paths of educational administrators

Ten superintendents~ 5 male and 5 female~ were randomly selected from a possible 33 males and 9 females in the Niagara and Hamilton regions. The participants were interviewed through a guided interview process coupled with an accounting of their educational and career histories. They were asked to discuss significant aspects of their careers such as the support they had received from families, from mentors and from involvement in networks. The data collected were then analyzed for similarities and differences both within and between the two gender cohorts. Upon analysis, it was found that the female and male administrators possessed differences in their personal backgrounds as well as their career and educational histories. Differences were also found in the perceived role of mentors, and networks. The ways in which the female administrators experienced their careers were found to be quite different from the ways in which the male administrators experienced their careers.

Tarification logit dans un réseau

Le problème de tarification qui nous intéresse ici consiste à maximiser le revenu généré par les usagers d'un réseau de transport. Pour se rendre à leurs destinations, les usagers font un choix de route et utilisent des arcs sur lesquels nous imposons des tarifs. Chaque route est caractérisée (aux yeux de l'usager) par sa "désutilité", une mesure de longueur généralisée tenant compte à la fois des tarifs et des autres coûts associés à son utilisation. Ce problème a surtout été abordé sous une modélisation déterministe de la demande selon laquelle seules des routes de désutilité minimale se voient attribuer une mesure positive de flot. Le modèle déterministe se prête bien à une résolution globale, mais pèche par manque de réalisme. Nous considérons ici une extension probabiliste de ce modèle, selon laquelle les usagers d'un réseau sont alloués aux routes d'après un modèle de choix discret logit. Bien que le problème de tarification qui en résulte est non linéaire et non convexe, il conserve néanmoins une forte composante combinatoire que nous exploitons à des fins algorithmiques. Notre contribution se répartit en trois articles. Dans le premier, nous abordons le problème d'un point de vue théorique pour le cas avec une paire origine-destination. Nous développons une analyse de premier ordre qui exploite les propriétés analytiques de l'affectation logit et démontrons la validité de règles de simplification de la topologie du réseau qui permettent de réduire la dimension du problème sans en modifier la solution. Nous établissons ensuite l'unimodalité du problème pour une vaste gamme de topologies et nous généralisons certains de nos résultats au problème de la tarification d'une ligne de produits. Dans le deuxième article, nous abordons le problème d'un point de vue numérique pour le cas avec plusieurs paires origine-destination. Nous développons des algorithmes qui exploitent l'information locale et la parenté des formulations probabilistes et déterministes. Un des résultats de notre analyse est l'obtention de bornes sur l'erreur commise par les modèles combinatoires dans l'approximation du revenu logit. Nos essais numériques montrent qu'une approximation combinatoire rudimentaire permet souvent d'identifier des solutions quasi-optimales. Dans le troisième article, nous considérons l'extension du problème à une demande hétérogène. L'affectation de la demande y est donnée par un modèle de choix discret logit mixte où la sensibilité au prix d'un usager est aléatoire. Sous cette modélisation, l'expression du revenu n'est pas analytique et ne peut être évaluée de façon exacte. Cependant, nous démontrons que l'utilisation d'approximations non linéaires et combinatoires permet d'identifier des solutions quasi-optimales. Finalement, nous en profitons pour illustrer la richesse du modèle, par le biais d'une interprétation économique, et examinons plus particulièrement la contribution au revenu des différents groupes d'usagers.

Competing tunneling and capacitive paths in Co-ZrO2 granular thin films

The ac electrical response is studied in thin films composed of well-defined nanometric Co particles embedded in an insulating ZrO2 matrix which tends to coat them, preventing the formation of aggregates. In the dielectric regime, ac transport originates from the competition between interparticle capacitive Cp and tunneling Rt channels, the latter being thermally assisted. This competition yields an absorption phenomenon at a characteristic frequency 1/(RtCp), which is observed in the range 1010 000 Hz. In this way, the effective ac properties mimic the universal response of disordered dielectric materials. Temperature and frequency determine the complexity and nature of the ac electrical paths, which have been successfully modeled by an Rt-Cp network.

Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes

An antimedian of a pro le = (x1; x2; : : : ; xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the pro le. The antimedian function is de ned on the set of all pro les on G and has as output the set of antimedians of a pro le. It is a typical location function for nding a location for an obnoxious facility. The `converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes.

Improving Label Space Usage for Ethernet Label Switched Paths

Ethernet is becoming the dominant aggregation technology for carrier transport networks; however, as it is a LAN technology, native bridged ethernet does not fulfill all the carrier requirements. One of the schemes proposed by the research community to make ethernet fulfill carrier requirements is ethernet VLAN-label switching (ELS). ELS allows the creation of label switched data paths using a 12-bit label encoded in the VLAN TAG control information field. Previous label switching technologies such as MPLS use more bits for encoding the label. Hence, they do not suffer from label sparsity issues as ELS might. This paper studies the sparsity issues resulting from the reduced ELS VLAN-label space and proposes the use of the label merging technique to improve label space usage. Experimental results show that label merging considerably improves label space usage

Lightweight monitoring of label switched paths for bandwidth management

The purpose of resource management is the efficient and effective use of network resources, for instance bandwidth. In this article, a connection oriented network scenario is considered, where a certain amount of bandwidth is reserved for each label switch path (LSP), which is a logical path, in a MPLS or GMPLS environment. Assuming there is also some kind of admission control (explicit or implicit), these environments typically provide quality of service (QoS) guarantees. It could happen that some LSPs become busy, thus rejecting connections, while other LSPs may be under-utilised. We propose a distributed lightweight monitoring technique, based on threshold values, the objective of which is to detect congestion when it occurs in an LSP and activate the corresponding alarm which will trigger a dynamic bandwidth reallocation mechanism

By different paths to common outcomes.

Trata de los niños y de los primeros años de escolaridad. Los maestros en el transcurso de sus clases sienten varias preocupaciones :la conciencia de la enseñanza de la lectura y la escritura antes y después de la transición a la escuela, el poder de la escritura en una edad temprana y la conversación como una herramienta para mejorar la enseñanza. Se establecen conexiones recíprocas entre cómo un tipo de aprendizaje apoya al otro, es decir, entre el lenguaje oral y la escritura, entre la escritura y la lectura.

Development paths of university teachers during a pedagogical development course

Resumen basado en el de la publicaci??n

Reuse of paths in light source animation

In this paper we extend the reuse of paths to the shot from a moving light source. In the classical algorithm new paths have to be cast from each new position of a light source. We show that we can reuse all paths for all positions, obtaining in this way a theoretical maximum speed-up equal to the average length of the shooting path

Dynamic management and restoration of virtual paths in broadband networks based on distributed software agents

La gestió de xarxes és un camp molt ampli i inclou molts aspectes diferents. Aquesta tesi doctoral està centrada en la gestió dels recursos en les xarxes de banda ampla que disposin de mecanismes per fer reserves de recursos, com per exemple Asynchronous Transfer Mode (ATM) o Multi-Protocol Label Switching (MPLS). Es poden establir xarxes lògiques utilitzant els Virtual Paths (VP) d'ATM o els Label Switched Paths (LSP) de MPLS, als que anomenem genèricament camins lògics. Els usuaris de la xarxa utilitzen doncs aquests camins lògics, que poden tenir recursos assignats, per establir les seves comunicacions. A més, els camins lògics són molt flexibles i les seves característiques es poden canviar dinàmicament. Aquest treball, se centra, en particular, en la gestió dinàmica d'aquesta xarxa lògica per tal de maximitzar-ne el rendiment i adaptar-la a les connexions ofertes. En aquest escenari, hi ha diversos mecanismes que poden afectar i modificar les característiques dels camins lògics (ample de banda, ruta, etc.). Aquests mecanismes inclouen els de balanceig de la càrrega (reassignació d'ample de banda i reencaminament) i els de restauració de fallades (ús de camins lògics de backup). Aquests dos mecanismes poden modificar la xarxa lògica i gestionar els recursos (ample de banda) dels enllaços físics. Per tant, existeix la necessitat de coordinar aquests mecanismes per evitar possibles interferències. La gestió de recursos convencional que fa ús de la xarxa lògica, recalcula periòdicament (per exemple cada hora o cada dia) tota la xarxa lògica d'una forma centralitzada. Això introdueix el problema que els reajustaments de la xarxa lògica no es realitzen en el moment en què realment hi ha problemes. D'altra banda també introdueix la necessitat de mantenir una visió centralitzada de tota la xarxa. En aquesta tesi, es proposa una arquitectura distribuïda basada en un sistema multi agent. L'objectiu principal d'aquesta arquitectura és realitzar de forma conjunta i coordinada la gestió de recursos a nivell de xarxa lògica, integrant els mecanismes de reajustament d'ample de banda amb els mecanismes de restauració preplanejada, inclosa la gestió de l'ample de banda reservada per a la restauració. Es proposa que aquesta gestió es porti a terme d'una forma contínua, no periòdica, actuant quan es detecta el problema (quan un camí lògic està congestionat, o sigui, quan està rebutjant peticions de connexió dels usuaris perquè està saturat) i d'una forma completament distribuïda, o sigui, sense mantenir una visió global de la xarxa. Així doncs, l'arquitectura proposada realitza petits rearranjaments a la xarxa lògica adaptant-la d'una forma contínua a la demanda dels usuaris. L'arquitectura proposada també té en consideració altres objectius com l'escalabilitat, la modularitat, la robustesa, la flexibilitat i la simplicitat. El sistema multi agent proposat està estructurat en dues capes d'agents: els agents de monitorització (M) i els de rendiment (P). Aquests agents estan situats en els diferents nodes de la xarxa: hi ha un agent P i diversos agents M a cada node; aquests últims subordinats als P. Per tant l'arquitectura proposada es pot veure com una jerarquia d'agents. Cada agent és responsable de monitoritzar i controlar els recursos als que està assignat. S'han realitzat diferents experiments utilitzant un simulador distribuït a nivell de connexió proposat per nosaltres mateixos. Els resultats mostren que l'arquitectura proposada és capaç de realitzar les tasques assignades de detecció de la congestió, reassignació dinàmica d'ample de banda i reencaminament d'una forma coordinada amb els mecanismes de restauració preplanejada i gestió de l'ample de banda reservat per la restauració. L'arquitectura distribuïda ofereix una escalabilitat i robustesa acceptables gràcies a la seva flexibilitat i modularitat.

Flight Paths of Migrating Golden Eagles and the Risk Associated with Wind Energy Development in the Rocky Mountains

In recent years, the eastern foothills of the Rocky Mountains in northeastern British Columbia have received interest as a site of industrial wind energy development but, simultaneously, have been the subject of concern about wind development coinciding with a known migratory corridor of Golden Eagles (Aquila chrysaetos). We tracked and quantified eagle flights that crossed or followed ridgelines slated for one such wind development. We found that hourly passage rates during fall migration peaked at midday and increased by 17% with each 1 km/h increase in wind speed and by 11% with each 1°C increase in temperature. The propensity to cross the ridge tops where turbines would be situated differed between age classes, with juvenile eagles almost twice as likely to traverse the ridge-top area as adults or subadults. During fall migration, Golden Eagles were more likely to cross ridges at turbine heights (risk zone, < 150 m above ground) under headwinds or tailwinds, but this likelihood decreased with increasing temperature. Conversely, during spring migration, eagles were more likely to move within the ridge-top area under eastern crosswinds. Identifying Golden Eagle flight routes and altitudes with respect to major weather systems and local topography in the Rockies may help identify scenarios in which the potential for collisions is greatest at this and other installations.