Les algorithmes de l’amour

Online dating systems (ODS) have had a central role in our social practices for many years. How can we analyze this phenomenon? How can we understand it? The point is not to know whether or not these services are actually able to facilitate relationship formation, but rather to understand what kinds of values the ODS are based upon and what kinds of values they produce. In other words, it is crucial to understand what ideas of love these platforms are proposing. This paper will focus on the ODS that explicitly have the goal of giving their clients the possibility of meeting someone with whom they can have a love affair or a durable romance. This paper aims to analyze how love is defined according to the ODS algorithms’ rules.

Les virtualités du sténopé dans « Le Retour imaginaire » d’Atiq Rahimi

Depuis quelque temps déjà, le bruit court que nous serions entrés dans « l'ère du virtuel », sans que l'on sache très bien ce qu'une telle expression signifie - et qui, d'ailleurs, cache une grande confusion avec l'avènement des nouvelles technologies numériques. Si, incontestablement, l'outil numérique aura marqué le tournant du XXIe siècle, la révolution souvent promise se traduit par davantage de permanences que de ruptures : c'est ainsi que, dans le champ de la photographie, on n'en finit plus d'attendre la disparition définitive de l'argentique, dont la mort est sans cesse reprogrammée. [...]

La littérature numérique, existe-t-elle?

This article attempts to analyze the definition of "electronic literature" as given by the Electronic Literature Organization and to understand the relationship between electronic literature and digital literature. The thesis defended here is that this change of adjective hides a change in the theoretical status of the object that it attempts to define. The definition of electronic literature once concentrated on the tools used in the production of literary works and the critical analysis concentrating on the objects produced with the aid of new technologies. The move to the adjective "digital" marks a change in perception: now, from this perspective, the challenge is no longer to study works produced thanks to computers, but to understand the new status of literature in the age of the digital. To demonstrate this thesis, the article proposes to analyze one recent literary example: the 1984 trilogy by Eric Plamondon.

Les interprétations féministes du concept d'état de nature chez Hobbes : une clé de lecture

Pour comprendre l’origine des différentes interprétations féministes portant sur la famille et le patriarcat chez Hobbes, il faut avoir pour clé de lecture la double compréhension possible de l’état de nature. Une première lecture fait de l’état de nature un outil démonstratif dans un système logique, alors qu’une seconde lecture en fait une hypothèse historique sur la genèse de nos institutions. Comprendre la distinction entre une lecture purement logique et une lecture plus historisante de l’état de nature peut permettre une meilleure compréhension des différentes interprétations féministes. En effet, nous tenterons de démontrer que derrière ces positions polarisées se cache une lecture différente de l’état de nature chez Hobbes.

Cooperative caching techniques for mobile ad hoc networks

Data caching can remarkably improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The cache placement problem minimizes total data access cost in ad hoc networks with multiple data items. The ad hoc networks are multi hop networks without a central base station and are resource constrained in terms of channel bandwidth and battery power. By data caching the communication cost can be reduced in terms of bandwidth as well as battery energy. As the network node has limited memory the problem of cache placement is a vital issue. This paper attempts to study the existing cooperative caching techniques and their suitability in mobile ad hoc networks.

A virtual backbone based approach for cooperative caching in mobile ad hoc networks

Cache look up is an integral part of cooperative caching in ad hoc networks. In this paper, we discuss a cooperative caching architecture with a distributed cache look up protocol which relies on a virtual backbone for locating and accessing data within a cooperate cache. Our proposal consists of two phases: (i) formation of a virtual backbone and (ii) the cache look up phase. The nodes in a Connected Dominating Set (CDS) form the virtual backbone. The cache look up protocol makes use of the nodes in the virtual backbone for effective data dissemination and discovery. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a CDS that contains a small number of nodes, still having full coverage of the network. We evaluated the effect of various parameter settings on the performance metrics such as message overhead, cache hit ratio and average query delay. Compared to the previous schemes the proposed scheme not only reduces message overhead, but also improves the cache hit ratio and reduces the average delay

Cooperative Caching Framework for Mobile Cloud Computing

Due to the advancement in mobile devices and wireless networks mobile cloud computing, which combines mobile computing and cloud computing has gained momentum since 2009. The characteristics of mobile devices and wireless network makes the implementation of mobile cloud computing more complicated than for fixed clouds. This section lists some of the major issues in Mobile Cloud Computing. One of the key issues in mobile cloud computing is the end to end delay in servicing a request. Data caching is one of the techniques widely used in wired and wireless networks to improve data access efficiency. In this paper we explore the possibility of a cooperative caching approach to enhance data access efficiency in mobile cloud computing. The proposed approach is based on cloudlets, one of the architecture designed for mobile cloud computing.

A location aided cooperative caching protocol for mobile ad hoc networks

Cooperative caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the caching overhead and delay by reducing the number of control messages flooded in to the network. A cache discovery process based on location of neighboring nodes is developed for this. The cache replacement policy we propose aims at increasing the cache hit ratio. The simulation results gives a promising result based on the metrics of studies

Economic Impact of Identity Theft in India: Lessons from Western Countries

In this computerized, globalised and internet world our computer collects various types of information’s about every human being and stores them in files secreted deep on its hard drive. Files like cache, browser history and other temporary Internet files can be used to store sensitive information like logins and passwords, names addresses, and even credit card numbers. Now, a hacker can get at this information by wrong means and share with someone else or can install some nasty software on your computer that will extract your sensitive and secret information. Identity Theft posses a very serious problem to everyone today. If you have a driver’s license, a bank account, a computer, ration card number, PAN card number, ATM card or simply a social security number you are more than at risk, you are a target. Whether you are new to the idea of ID Theft, or you have some unanswered questions, we’ve compiled a quick refresher list below that should bring you up to speed. Identity theft is a term used to refer to fraud that involves pretending to be someone else in order to steal money or get other benefits. Identity theft is a serious crime, which is increasing at tremendous rate all over the world after the Internet evolution. There is widespread agreement that identity theft causes financial damage to consumers, lending institutions, retail establishments, and the economy as a whole. Surprisingly, there is little good public information available about the scope of the crime and the actual damages it inflicts. Accounts of identity theft in recent mass media and in film or literature have centered on the exploits of 'hackers' - variously lauded or reviled - who are depicted as cleverly subverting corporate firewalls or other data protection defenses to gain unauthorized access to credit card details, personnel records and other information. Reality is more complicated, with electronic identity fraud taking a range of forms. The impact of those forms is not necessarily quantifiable as a financial loss; it can involve intangible damage to reputation, time spent dealing with disinformation and exclusion from particular services because a stolen name has been used improperly. Overall we can consider electronic networks as an enabler for identity theft, with the thief for example gaining information online for action offline and the basis for theft or other injury online. As Fisher pointed out "These new forms of hightech identity and securities fraud pose serious risks to investors and brokerage firms across the globe," I am a victim of identity theft. Being a victim of identity theft I felt the need for creating an awareness among the computer and internet users particularly youngsters in India. Nearly 70 per cent of Indian‘s population are living in villages. Government of India already started providing computer and internet facilities even to the remote villages through various rural development and rural upliftment programmes. Highly educated people, established companies, world famous financial institutions are becoming victim of identity theft. The question here is how vulnerable the illiterate and innocent rural people are if they suddenly exposed to a new device through which some one can extract and exploit their personal data without their knowledge? In this research work an attempt has been made to bring out the real problems associated with Identity theft in developed countries from an economist point of view.

Thread Scheduling Mechanisms for Multiple-Context Parallel Processors

Scheduling tasks to efficiently use the available processor resources is crucial to minimizing the runtime of applications on shared-memory parallel processors. One factor that contributes to poor processor utilization is the idle time caused by long latency operations, such as remote memory references or processor synchronization operations. One way of tolerating this latency is to use a processor with multiple hardware contexts that can rapidly switch to executing another thread of computation whenever a long latency operation occurs, thus increasing processor utilization by overlapping computation with communication. Although multiple contexts are effective for tolerating latency, this effectiveness can be limited by memory and network bandwidth, by cache interference effects among the multiple contexts, and by critical tasks sharing processor resources with less critical tasks. This thesis presents techniques that increase the effectiveness of multiple contexts by intelligently scheduling threads to make more efficient use of processor pipeline, bandwidth, and cache resources. This thesis proposes thread prioritization as a fundamental mechanism for directing the thread schedule on a multiple-context processor. A priority is assigned to each thread either statically or dynamically and is used by the thread scheduler to decide which threads to load in the contexts, and to decide which context to switch to on a context switch. We develop a multiple-context model that integrates both cache and network effects, and shows how thread prioritization can both maintain high processor utilization, and limit increases in critical path runtime caused by multithreading. The model also shows that in order to be effective in bandwidth limited applications, thread prioritization must be extended to prioritize memory requests. We show how simple hardware can prioritize the running of threads in the multiple contexts, and the issuing of requests to both the local memory and the network. Simulation experiments show how thread prioritization is used in a variety of applications. Thread prioritization can improve the performance of synchronization primitives by minimizing the number of processor cycles wasted in spinning and devoting more cycles to critical threads. Thread prioritization can be used in combination with other techniques to improve cache performance and minimize cache interference between different working sets in the cache. For applications that are critical path limited, thread prioritization can improve performance by allowing processor resources to be devoted preferentially to critical threads. These experimental results show that thread prioritization is a mechanism that can be used to implement a wide range of scheduling policies.

ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction

The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms. An implementation of this architecture could migrate a null thread in 66 cycles -- over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies.

Ameliorating the Overhead of Dynamic Optimization

Dynamic optimization has several key advantages. This includes the ability to work on binary code in the absence of sources and to perform optimization across module boundaries. However, it has a significant disadvantage viz-a-viz traditional static optimization: it has a significant runtime overhead. There can be performance gain only if the overhead can be amortized. In this paper, we will quantitatively analyze the runtime overhead introduced by a dynamic optimizer, DynamoRIO. We found that the major overhead does not come from the optimizer's operation. Instead, it comes from the extra code in the code cache added by DynamoRIO. After a detailed analysis, we will propose a method of trace construction that ameliorate the overhead introduced by the dynamic optimizer, thereby reducing the runtime overhead of DynamoRIO. We believe that the result of the study as well as the proposed solution is applicable to other scenarios such as dynamic code translation and managed execution that utilizes a framework similar to that of dynamic optimization.

Plan de Empresa “BIO S.A.S”

BIO S.A.S es una organización que iniciará actividades en septiembre de 2012, y se dedicará a la producción, manipulación y distribución especial más no limitativa de Naranja Tangelo (Mineola). Nuestro producto será comercializado en Chapinero.

Efectos reglamentarios y jurisdiccionales del derecho comunitario Andino sobre el derecho administrativo colombiano

Este trabajo se soporta sobre una base conformada por dos conceptos, que constituyen el horizonte contextual de la investigación: Derecho Administrativo y Comunidad de integración. Es claro que al hablar de una Comunidad de integración específica como la Comunidad Andina (CAN), incide de forma directa en la actividad del derecho administrativo.Ha sido necesario que los países que conforman los grupos de integración económica cedan parte de sus competencias para crear un ordenamiento jurídico de orden supranacional, el cual modifica la dinámica social de las relaciones comerciales y afecta la estructura de la administración pública, haciendo que el derecho administrativo no se limite a interactuar solo con derecho nacional. Esta mutua dependencia de las políticas internas y las regionales se realiza, entonces, cada vez que existe participación y compromiso de los Estados frente a las decisiones, de carácter vinculante o no. En esa medida surge el problema de investigación tendiente a esclarecer cómo ha sido la adopción de las decisiones e interpretaciones, emanadas de los mecanismos oficiales del Derecho Comunitario Andino, en el ordenamiento jurídico colombiano. La existencia de varios puntos de vista con respecto a la obligatoriedad o no de dicha adopción, moldea un tema de suficiente amplitud y profundidad para ser estudiado en un trabajo de investigación.

Percepción de la pertinencia de los programas académicos de Magíster en Administración en egresados titulados y empleadores en Bogotá

El propósito de esta investigación es describir la percepción de los egresados titulados y empleadores acerca de la pertinencia de la formación de programas académicos de Magíster en Administración ofrecidos por las Instituciones de Educación Superior en Bogotá. Además a través de esta investigación es posible determinar su importancia en el desarrollo y potencialización de las capacidades, habilidades y destrezas directivas y gerenciales necesarias para desempeñarse dentro de una empresa perdurable, coherentes con la realidad social, laboral, cultural y ambiental. Para ello, se hace un análisis del grado de satisfacción de los egresados titulados y empleadores permitiendo conocer las fortalezas y debilidades del programa. En consecuencia fue posible proponer recomendaciones y conclusiones para mejorar el programa, asegurando un camino para aportar “el estado del arte “ de la Administración para los futuros estudiantes y en beneficio de las compañías.