This special session will involve three related components. It will begin with a history of the ACM Code of Ethics and Professional Conduct (the Code), its evolving presence in the computing curriculum guidelines over time, and its documented use outside of academe. This will lead into an overview of the major changes to the Code that occurred in the most recent update. The third component and primary focus of the session will be to work with participants to identify ways that ACM and the ACM Committee on Professional Ethics (COPE) can help Computer Science educators integrate the Code as broadly as possible into diverse programs, ranging from Kindergarten to PhD-level. The outcome of the session would be a preliminary set of guidelines for programs and departments to adopt the Code, potential challenges to be addressed when formalizing those guidelines, and suggested approaches to resolve these difficulties. If attendance is sufficiently large, we would adopt a jigsaw model, breaking into smaller focus groups that are tasked with distinct portions of the Code. Each group reports back at the end, and members of COPE will collate the results into a document for future distribution and work.

An air‐cycle air conditioning system, using a typical automotive turbocharger as the core of the system, was designed and tested. Effects on engine performance were kept to a minimum while providing the maximum amount of cooling possible and minimizing weight and space requirements. A test stand utilizing shop compressed air was developed to measure component performance. An unmodified automotive turbocharger was tested initially as a baseline in a Reversed‐Brayton Cycle air cooling system. Once the baseline was established, another aircycle machine, assembled from commercial turbocharger components chosen individually to optimize their performance for cooling purposes, was tested to improve the overall cycle efficiency. Finally, once the air‐cycle air conditioning system was optimized, it was tested on an engine to simulate more realistic operating conditions and performance. The shop‐air test stand experiments showed a peak dry‐air‐rated (DAR) coefficient of performance (COP) of 0.38 and a DAR cooling capacity of 0.45 tons for the baseline turbocharger, and a peak DAR COP of 0.73 and DAR cooling capacity of 1.5 tons for the optimized system with a modified turbocharger. The on‐engine testing was limited due to a thrust bearing failure in the ACM. However, the data collected at lower engine load and speed indicates a DAR COP of 0.56 and a DAR cooling capacity of 0.72 tons. On‐engine testing was planned to include operating points where the stock turbocharger was utilizing turbine‐bypass to limit boost pressure. While it wasn't possible to continue testing, it is expected that DAR COP and cooling capacity would have increased at higher engine load and speed, where turbine‐bypass operation typically occurs.

In an increasing number of use cases, databases face the challenge of managing heterogeneous data. Heterogeneous data is characterized by a quickly evolving variety of entities without a common set of attributes. These entities do not show enough regularity to be captured in a traditional database schema. A common solution is to centralize the diverse entities in a universal table. Usually, this leads to a very sparse table. Although today’s techniques allow efficient storage of sparse universal tables, query efficiency is still a problem. Queries that address only a subset of attributes have to read the whole universal table includingmany irrelevant entities. Asolution is to use a partitioning of the table, which allows pruning partitions of irrelevant entities before they are touched. Creating and maintaining such a partitioning manually is very laborious or even infeasible, due to the enormous complexity. Thus an autonomous solution is desirable. In this article, we define the Online Partitioning Problem for heterogeneous data. We sketch how an optimal solution for this problem can be determined based on hypergraph partitioning. Although it leads to the optimal partitioning, the hypergraph approach is inappropriate for an implementation in a database system. We present Cinderella, an autonomous online algorithm for horizontal partitioning of heterogeneous entities in universal tables. Cinderella is designed to keep its overhead low by operating online; it incrementally assigns entities to partition while they are touched anyway duringmodifications. This enables a reasonable physical database design at runtime instead of static modeling.

Les retours et les études dont on dispose sur les réseaux IP par satellite ne permettent pas d’apprécier les performances dont ils sont capables. Pourtant, les difficultés de transmettre de l’IP par satellite persistent encore. L’inadaptation du protocole IP, initialement conçu pour des réseaux terrestres, au large produit délai-bande du média satellite est une raison. Le fonctionnement souvent dé-corrélé entre les niveaux supérieurs de la pile TCP/IP et les couches physique et MAC du média satellite, est une autre. Dans le cadre de ce travail de thèse nous adoptons une démarche expérimentale basée sur l’observation, l’analyse et l’évaluation de systèmes implantant des technologies IP par satellite tels que le standard DVB-RCS, la technologie propriétaire iDirect ou la nouvelle norme DVB-S2. Nous étudions l’impact des règles de qualité de service IP sur les performances des applications dans un contexte de bande limitée. Nous nous penchons notamment sur l’évaluation des efficacités de l’encapsulation IP en termes de consommation de bande. Notre premier objectif est de déceler les niveaux auxquels un opérateur peut agir en vue d’optimiser la configuration d’un système IP par satellite et en accroître les performances / Despite of a number of IP satellite networks developed and deployed, only a limited number of studies and feedbacks about the performance is available. IP over satellite systems raises several constraints. One of the main reasons is the lack of adaptation of IP protocol, initially designed for terrestrial wired networks, to the large bandwidth delay product of the satellite media. Another reason is a lack of coordination between the IP protocol stack upper layer and the satellite MAC and physical layer. The purpose of this PhD study is to evaluate and assess the behaviour of IP applications when conveyed over satellite systems. We mainly focus on the IP quality of service performance, bandwidth encapsulation efficiency as well as IP applications metrics. Through the observation, we try to find how it’s possible to modify the IP satellite systems configuration in order to improve IP applications performance. We also suggest some ideas about the way to refine these technologies with regards to the design aspects. Experimentations have been performed over test beds implementing both standardised satellite technologies such as DVB-RCS as well as proprietary systems such as iDirect in addition to the new normalised technology DVB-S2

We present a numerical inversion method for generating random variates from continuous distributions when only the density function is given. The algorithm is based on polynomial interpolation of the inverse CDF and Gauss-Lobatto integration. The user can select the required precision which may be close to machine precision for smooth, bounded densities; the necessary tables have moderate size. Our computational experiments with the classical standard distributions (normal, beta, gamma, t-distributions) and with the noncentral chi-square, hyperbolic, generalized hyperbolic and stable distributions showed that our algorithm always reaches the required precision. The setup time is moderate and the marginal execution time is very fast and the same for all distributions. Thus for the case that large samples with fixed parameters are required the proposed algorithm is the fastest inversion method known. Speed-up factors up to 1000 are obtained when compared to inversion algorithms developed for the specific distributions. This makes our algorithm especially attractive for the simulation of copulas and for quasi-Monte Carlo applications. (author´s abstract) / Series: Research Report Series / Department of Statistics and Mathematics

Pendant la guerre d'Algérie (1955-1962), le gouvernement général de l'Algérie met en place dans les campagnes et les banlieues des grandes villes d'Algérie une structure de pacification, les SAS (sections administratives spécialisées) et les SAU (sections administratives urbaines), dont on trouve le prolongement au sein des SAT (Service d'assistance technique) en métropole (Paris, Lyon, Marseille) et au niveau de la Force de police auxiliaire de Paris. Les officiers SAS, officiers de carrière, de réserve en situation d'active, et appelés, recrutent des supplétifs (moghaznis) et mènent une politique de pacification dans les domaines administratif, politique (promotion d'élus musulmans), économique (Plan de Constantine), social (aide aux indigents et résorption des bidonvilles), médical, scolaire, et militaire. Au cœur de la politique de la France en Algérie de 1955 à 1959, ces officiers se retrouvent, dès 1960, en porte-à-faux de la nouvelle politique du général de Gaulle. Si certains démissionnent ou partent amers de leur période de SAS, d'autres s'opposent au général de Gaulle lors du référendum sur l'autodétermination de l'Algérie de janvier 1961, du putsch d'avril 1961, voire ont la tentation de basculer dans l'organisation subversive de I'OAS. L'indépendance de l'Algérie risquant de menacer la vie des supplétifs, certains officiers SAS organisent des filières clandestines de rapatriement des supplétifs et de leurs familles, et les aident à s'insérer en France grâce à des associations, des initiatives individuelles et du soutien administratif et financier de l'État (SAT de Paris et de Marseille). / The mission of the SAS in Algeria is the current equivalent in NATO parlance civil-military cooperation. The SAS, the special administrative sections and SAU the city administrative sections were created by the governor general J. Soustelle. Its mission was to maintain contact with the population and collect the intelligence necessary for successful operation. The SAS and SAU would be irnplemented to administer the villages in Algeria to combat the economic misery and political inequality that were the root causes of the insurgency. With their civilian personnel and Muslin auxiliary troops (moghaznis), they were the administrative intermediaries responsible for development of their districts. They rebuilt schools. They cared for the sick by establishing fee medical assistance. They conducted censuses to establish welfare services and organized elections for municipal officials. They improved agriculture and husbandry, built roads and bridges. In military terms, the SAS officiers dismantled the FLN cells and collected intelligence on the ALN. They protected the village with their auxiliaries (moghaznis). ln three cities of metropolis, we find the presence of similar structures, with for Paris, an auxiliary police force. The SAS was an important policy to preserve French Algeria from 1955 to 1959, but then the new policy who wants to give at Algeria her independence (1960-1962) changed the SAS officer policy opinion. They try to oppose them during the referendum of Algerian auto determination (January 1961), at the time of the putsch (Apri11961), by tipping over to the terrorism (OAS), or by organizing Mussulmen auxiliary secret repatriation in France (April-May 1962).

This research attempts to create a novel process, Social Engineering Vulnerability Evaluation, SiEVE, to use open source data and open source intelligence (OSINT) to perform efficient and effectiveness spear phishing attacks. It is designed for use by "œred teams" and students learning to conduct a penetration test of an organization, using the vector of their workforce. The SiEVE process includes the stages of identifying targets, profiling the targets, and creating spear phishing attacks for the targets. The contributions of this research include the following: (1) The SiEVE process itself was developed using an iterative process to identify and fix initial shortcomings; (2) Each stage of the final version of the SiEVE process was evaluated in an experiment that compared performance of students using SiEVE against performance of those not using SiEVE in order to test effectiveness of the SiEVE process in a learning environment; Specifically, the study showed that those using the SiEVE process (a) did not identify more targets, (b) did identify more information about targets, and (c) did lead to more effective spear phishing attacks. The findings, limitations, and future work are discussed in order to provide next steps in developing formalized processes for red teams and students learning penetration testing.

The problem addressed in this thesis was identified in a real life context in which an attempt was made to re-constitute a BSc Computer Science degree programme. The curriculum was modelled on the ACM/IEEE Computing Curriculum of 2001. It was further required to comply with accreditation requirements as defined by ABET’s Computing Accreditation Commission. Relying on a spreadsheet, the curriculum was iteratively and manually evaluated against the ACM/IEEE curriculum specification. A need was identified to automate or at least semi-automate this process. In this thesis a generalisation of the problem is presented. Curricula are modelled as directed graphs (digraphs) in which graph vertices represent curriculum elements such as topics, knowledge areas, knowledge units year- levels or modules. Edges in the graph represent dependencies between these vertices such as belonging to grouping or pre-requisites. The task of curriculum comparison then abstracts to a task of digraph comparison. A framework, the Graph Comparison Framework, is proposed. The frame- work comprises of components which are used to guide the digraph comparison process. The so-called Graph Trans-morphism algorithm component is the only component in the framework which is mandatory. The algorithm converts the information from one of the digraphs being compared into the structure of the other. This conversion enables the graphs to be compared as graph isomorphisms. All digraphs are modelled as sets of triples, making it possible to subtract one digraph from another using the set minus operator. The resultant difference sets are used by components defined in the framework to quantify and visualise the differences. By modelling curricula as digraphs and applying the framework to the di-graphs, it is possible to compare curricula. This application of the framework to a real-world problem forms the applications research part of the thesis. In this part, domain knowledge of curriculum design is necessary to apply to the curriculum being developed in order to improve it. / Thesis (PhD)--University of Pretoria, 2014. / Computer Science / unrestricted

Bei der zunehmenden Anzahl von Papers spielt die Affiliationsanalyse eine größer werdende Rolle, man erstrebt zusätzlich zur bibliografischen Analyse, um weitere nützliche Information zu erhalten. So wird z.B. die Affiliation nach Instituten, Countrys, Regionen, Citys und Koordinaten, die aus der Originalaffiliation nicht direkt bekannt sind, analysiert, anschließend kann mit diesen Informationen weiter gearbeitet werden. Man kann die Affiliation mit dem gefundenen Ergebnis kontrollieren und verteilen. Weltweit existieren zahlreiche semantische Analysewerkzeuge. Hier soll die Rede von vier grundsätzlichen Analysemethoden sein und am Ende wird die Auswertung nach einer einzigen Metrik stehen. Durch diesen gefundenen Ergebnisse können wir viele Hinweise gewinnen, z.B. den das Trends der Papers innerhalb von zehn Jahren errechnen und dann weiteres mit Hilfe von GoogleMaps durch die MarkerCluster Technik anzeigen. Auch können wir die Papers nach verschiedenen Ansätzen verlinken. Es wird möglich eine Reihe von Beziehungen definiert, um ein Netz aufzubauen. Dieses kann schnell durchgesehen und es können mächtige Suchstrategien ausgeführt werden. Diese Idee ist unser heutiges Thema und auch unter dem Begriff des Semantik Web bekannt.

No description available.