A Survey Of IPv6 Address Usage In The Public Domain Name System

The IPv6 protocol has been slowly increasing in use on the Internet. The main reason for the development of the protocol is that the address space provided by IPv4 is nearing exhaustion. The pool of addresses provided by IPv6 is 296 times larger than IPv4, and should be sufficient to provide an address for every device for the foreseeable future. Another potential advantage of this significantly large address space is the use of randomly assigned addresses as a security barrier as part of a defence in depth strategy. This research examined the addresses allocated by those implementing IPv6 to determine what method or pattern of allocation was being used by adopters of the protocol. This examination was done through the use of DNS queries of the AAAA IPv6 host record using public DNS servers. It was observed that 55.84% of IPv6 addresses were in the range of 0 to (232 − 1). For those addresses with unique interface identifier (IID) portions, a nearly equal number of sequential and random IIDs were observed. Hong Kong and Germany were found to have the greatest number of IPv6 addresses. These results suggest that adopters are allocating most addresses sequentially, meaning that no security advantage is being obtained. It is unclear as to whether this is through design or the following of accepted practice. Future research will continue to survey the IPv6 address space to determine whether the patterns observed here remain constant

Survey on Combinatorial Register Allocation and Instruction Scheduling

Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler. In the last three decades, combinatorial optimization has emerged as an alternative to traditional, heuristic algorithms for these two tasks. Combinatorial optimization approaches can deliver optimal solutions according to a model, can precisely capture trade-offs between conflicting decisions, and are more flexible at the expense of increased compilation time. This paper provides an exhaustive literature review and a classification of combinatorial optimization approaches to register allocation and instruction scheduling, with a focus on the techniques that are most applied in this context: integer programming, constraint programming, partitioned Boolean quadratic programming, and enumeration. Researchers in compilers and combinatorial optimization can benefit from identifying developments, trends, and challenges in the area; compiler practitioners may discern opportunities and grasp the potential benefit of applying combinatorial optimization

Assumptions of maximal individualism in the time of the COVID-19 pandemic: ethical aspects

Maximal individualism, which is currently a prevalent trend in the way many patients think, places high hopes in the achievements of biomedicine and assumes that everyone should always receive optimal medical care. Such an approach is in line with many normative and legal acts operating worldwide, including the Declaration of Human Rights. However, its feasibility and effectiveness in the time of the COVID-19 pandemic raises numerous ethical, social and economic dilemmas. The culture of prosperity and excess, characteristic of contemporary Western societies, makes it even more challenging to come to terms with this situation

Register Loading via Linear Programming

We study the following optimization problem. The input is a number k and a directed graph with a specified “start ” vertex, each of whose vertices may have one “memory bank requirement”, an integer. There are k “registers”, labeled 1...k. A valid solution associates to the vertices with no bank requirement one or more “load instructions ” L[b,j], for bank b and register j, such that every directed trail from the start vertex to some vertex with bank requirement c contains a vertex u that has been associated L[c,i] (for some register i ≤ k) and no vertex following u in the trail has been associated an L[b,i], for any other bank b. The objective is to minimize the total number of associated load instructions. We give a k(k +1)-approximation algorithm based on linear programming rounding, with (k+1) being the best possible unless Vertex Cover has approximation 2−ǫ for ǫ> 0. We also present a O(klogn) approximation, with n being the number of vertices in the input directed graph. Based on the same linear program, another rounding method outputs a valid solution with objective at most 2k times the optimum for k registers, using 2k−1 registers. This version of the paper corrects some minor errors that made it in the final Algorithmica paper.

Revisiting labour history

A lot of water has flowed under the bridge since, in their anticipation of a Turkish invasion, the Order of St. John perceived the eldest island inhabitants as ‘useless civilians’ and evacuated them to Sicily. Malta nowadays holds a key place in the history of international ageing policy. The Maltese Government made Malta the first nation to raise the subject of population ageing as an issue of world concern. This occurred in 1969 when it successfully appealed to the United Nations for the theme’s inclusion on the agenda of the 24th session of the General Assembly. This led to unprecedented awareness on the effects of population ageing. The United Nations eventually organised a World Assembly on Ageing in 1982 where, to Malta’s credit, the designated chairperson was a Maltese citizen. However, as Brincat recently highlighted, the history of the modern Maltese welfare state awaits detailed study. This is especially true with respect to policies relating to later life. Historical analyses of the development of social policies in Malta tend to focus on general health, educational, and labour issues, and hardly any attention is awarded towards the foundation of those services geared towards older persons. Given the space limitations, and specific focus of this publication, this paper does not seek to address such a lacuna. Rather, its goal is to conduct a critical overview as how the development of local ageing policy was stimulated and influenced by the values and judgements of the Labour Party in Malta.peer-reviewe

A survey of IPV6 address usage in the public domain name system

The IPv6 protocol has been slowly increasing in use on the Internet. The main reason for the development of the protocol is that the address space provided by IPv4 is nearing exhaustion. The pool of addresses provided by IPv6 is 296 times larger than IPv4, and should be sufficient to provide an address for every device for the foreseeable future. Another potential advantage of this significantly large address space is the use of randomly assigned addresses as a security barrier as part of a defence in depth strategy. This research examined the addresses allocated by those implementing IPv6 to determine what method or pattern of allocation was being used by adopters of the protocol. This examination was done through the use of DNS queries of the AAAA IPv6 host record using public DNS servers. It was observed that 55.84% of IPv6 addresses were in the range of 0 to (232 − 1). For those addresses with unique interface identifier (IID) portions, a nearly equal number of sequential and random IIDs were observed. Hong Kong and Germany were found to have the greatest number of IPv6 addresses. These results suggest that adopters are allocating most addresses sequentially, meaning that no security advantage is being obtained. It is unclear as to whether this is through design or the following of accepted practice. Future research will continue to survey the IPv6 address space to determine whether the patterns observed here remain constant

An Immune Inspired Approach to Anomaly Detection

The immune system provides a rich metaphor for computer security: anomaly detection that works in nature should work for machines. However, early artificial immune system approaches for computer security had only limited success. Arguably, this was due to these artificial systems being based on too simplistic a view of the immune system. We present here a second generation artificial immune system for process anomaly detection. It improves on earlier systems by having different artificial cell types that process information. Following detailed information about how to build such second generation systems, we find that communication between cells types is key to performance. Through realistic testing and validation we show that second generation artificial immune systems are capable of anomaly detection beyond generic system policies. The paper concludes with a discussion and outline of the next steps in this exciting area of computer security.Comment: 19 pages, 4 tables, 2 figures, Handbook of Research on Information Security and Assuranc

Transnational reflections on transnational research projects on men, boys and gender relations

This article reflects on the research project, ‘Engaging South African and Finnish youth towards new traditions of non-violence, equality and social well-being’, funded by the Finnish and South African national research councils, in the context of wider debates on research, projects and transnational processes. The project is located within a broader analysis of research projects and projectization (the reduction of research to separate projects), and the increasing tendencies for research to be framed within and as projects, with their own specific temporal and organizational characteristics. This approach is developed further in terms of different understandings of research across borders: international, comparative, multinational and transnational. Special attention is given to differences between research projects that are in the Europe and the EU, and projects that are between the global North and the global South. The theoretical, political and practical challenges of the North-South research project are discussed