Donald E. Knuth has been making foundational contributions to the field of computer science for as long as computer science has been a field. His award-winning textbooks are often given credit for shaping the field, and his scientific papers are widely referenced and stand as milestones of development over a wide variety of topics. The present volume, the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. Nearly thirty of Knuth’s (...) classic papers are collected in this book and brought up to date with extensive revisions and notes on subsequent developments. The papers cover numerous discrete problems, such as assorting, searching, data compression, theorem proving, and cryptography, as well as methods for controlling errors in numerical computations. (shrink)

Artificial Immune Systems (AIS) are intelligent algorithms derived on the principles inspired by human immune system. In this research work, electroencephalography (EEG) signals for four distinct motor movement of human limbs are detected and classified using Negative Selection Classification Algorithm (NSCA). For this study, a widely studied open source EEG signal database (BCI IV - Graz dataset 2a, comprising 9 subjects) has been used. Mel Frequency Cepstral Coefficients (MFCCs) are extracted as selected feature from recorded EEG signals. Dimensionality reduction (...) of data is carried out by applying two hidden layered stacked auto-encoder. Genetic Algorithm (GA) optimized detectors (Artificial Lymphocytes) are trained using Negative Selection Algorithm (NSA) for detection and classification of four motor movements. The trained detectors consist of four sets of detectors, each set is trained for detection and classification of one of the four movements from the other three movements. The optimized radius of detector is small enough not to mis-detect the sample. Euclidean distance of each detector with every training dataset sample is taken and compared with optimized radius of detector as a non-self detector. Our proposed approach achieved a mean classification accuracy of 86.39% for limb movements over 9 subjects with a maximum individual subject classification accuracy of 97.5 % for subject number eight. (shrink)

The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low training time. In this work, a hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed as an FS method based on wrapper mode to solve a classification problem. The QO method was employed in (...) tuning the value of flight length in the BCSA which is controlling the ability of the crows to find the optimal solution. To evaluate the performance of the proposed method, four benchmark datasets have been used which are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, and antimicrobial. Accordingly, the experimental results are discussed and compared against other standard algorithms based on the accuracy rate, the average number of selected features, and running time. The results have proven the robustness of the proposed method relied on the high obtained value of accuracy (84.93–95.92%), G-mean (0.853–0.971%), and average selected features (4.36–11.8) with a relatively low computational time. Moreover, to investigate the effectiveness of the proposed method, Friedman test was used which declared that the performance supremacy of the proposed BCSA-QO with four datasets was very evident against BCSA and CSA by selecting the minimum relevant features and producing the highest accuracy classification rate. The obtained results verify the usefulness of the proposed method (BCSA-QO) in the FS with classification in terms of high classification accuracy, a small number of selected features, and low computational time. (shrink)

The Next Release Problem (NRP) is a combinatorial optimization problem that aims to find a subset of software requirements to be delivered in the next software release, which maximize the satisfaction of a list of clients and minimize the effort required by developers to implement them. Previous studies have applied various metaheuristics, mostly genetic algorithms. Estimation of Distribution Algorithms (EDA), based on probabilistic modelling, have been proved to obtain good results in problems where genetic algorithms struggle. In this paper we (...) propose to adapt three EDAs to tackle the multi-objective NRP in a fast and effective way. Results show that EDAs can be applicable to solve the NRP with rather good quality of solutions. Furthermore, we prove that their execution time can be significantly reduced using a per-iteration solution subset selection method while maintaining the overall quality of the solutions obtained, and they perform the best when limiting the search time as in an interactive tool that requires fast responsiveness. The experimental framework, code and datasets have been made public in a code repository. (shrink)

if and only if for every W in V, W is independent of the set of all its non-descendants conditional on the set of its parents. One natural question that arises with respect to DAGs is when two DAGs are “statistically equivalent”. One interesting sense of “statistical equivalence” is “d-separation equivalence” (explained in more detail below.) In the case of DAGs, d-separation equivalence is also corresponds to a variety of other natural senses of statistical equivalence (such as representing the same (...) set of distributions). Theorems characterizing d-separation equivalence for directed acyclic graphs and that can be used as the basis for polynomial time algorithms for checking d-separation equivalence were provided by Verma and Pearl (1990), and Frydenberg (1990). The question we will examine is how to extend these results to cases where a DAG may have latent (unmeasured) variables or selection bias (i.e. some of the variables in the DAG have been conditioned on.) D-separation equivalence is of interest in part because there are algorithms for constructing DAGs with latent variables and selection bias that are based on observed conditional independence relations. For this class of algorithms, it is impossible to determine which of two d-separation equivalent causal structures generated a given probability distribution, given only the set of conditional independence and dependence relations true of the observed distribution. We will describe a polynomial (in the number of vertices) time algorithm for determining when two DAGs which may have latent variables or selection bias are d-separation equivalent. (shrink)

This paper reconstructs the history of the introduction and use of iterative algorithms in conservation biology in the 1980s and early 1990s in order to prioritize areas for protection as nature reserves. The importance of these algorithms was that they led to greater economy in spatial extent (“efficiency”) in the selection of areas to represent biological features adequately (that is, to a specified level) compared to older methods of scoring and ranking areas using criteria such as biotic “richness” (the (...) number of features of interest). The development of these algorithms was critical to producing a research program for conservation biology that was distinct from ecology and eventually led to what came to be called systematic conservation planning. Very similar algorithmic approaches were introduced independently in the 1980–1990 period in Australia, South Africa, and (arguably) the United Kingdom. The key rules in these algorithms were the use of rarity and what came to be called complementarity (the number of new or under-represented features in an area relative to those that had already been selected). Because these algorithms were heuristic, they were not guaranteed to produce optimal (most “efficient”) solutions. However, complementarity came to be seen as a principle rather than a rule in an algorithm and its use was also advocated for the former reason. Optimal solutions could be produced by reformulating the reserve selection problem in a mathematical programming formalism and using exact algorithms developed in that context. A dispute over the relevance of full optimality arose and was never resolved. Moreover, exact algorithms could not easily incorporate criteria determining the spatial configuration of networks of selected areas, in contrast to heuristic algorithms. Meanwhile metaheuristic algorithms emerged in the 1990s and came to be seen as a credible more effective alternative to the heuristic algorithms. Ultimately what was important about these developments was that the reserve selection problem came to be viewed a complex optimal decision problem under uncertainty, resource, and other constraints. It was a type of problem that had no antecedent in traditional ecology. (shrink)

The integrated scheduling algorithm of process sequence time-selective strategy is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time-selective strategy. Generally, there are too many “trial scheduling” times. The authors propose that there is no need to make “trial scheduling” at every “quasi-scheduling time point.” In fact, the process scheduling scheme can be obtained by trial scheduling on some “quasi-scheduling time points.” The scheduling result is the same as (...) that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect. (shrink)

Due to the huge amount of data being generating from different sources, the analyzing and extracting of useful information from these data becomes a very complex task. The difficulty of dealing with big data optimization problems comes from many factors such as the high number of features, and the existing of lost data. The feature selection process becomes an important step in many data mining and machine learning algorithms to reduce the dimensionality of the optimization problems and increase the (...) performance of the classification or clustering algorithms. In this paper, a set of hybrid and efficient genetic algorithms are proposed to solve feature selection problem, when the handled data has a large feature size. The proposed algorithms use a new gene-weighted mechanism that can adaptively classify the features into strong relative features, weak or redundant features, and unstable features during the evolution of the algorithm. Based on this classification, the proposed algorithm gives the strong features high priority and the weak features less priority when generating new candidate solutions. In the same time, the proposed algorithm tries to more concentrate on unstable features that sometimes appear and sometimes disappear from the best solutions of the population. The performance of proposed algorithms is investigated by using different datasets and feature selection algorithms. The results show that our proposed algorithms can outperform the other feature selection algorithms and effectively enhance the classification performance over the tested datasets. (shrink)

In multimodal multiobjective optimization problems, multiple Pareto optimal sets, even some good local Pareto optimal sets, should be reserved, which can provide more choices for decision-makers. To solve MMOPs, this paper proposes an evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization, in which the addition operator and deletion operator are proposed to comprehensively consider the diversity in both decision and objective spaces. Specifically, in decision space, the union population is partitioned into multiple clusters by using a (...) density-based clustering method, aiming to assist the addition operator to strengthen the population diversity. Then, a number of weight vectors are adopted to divide population into N subregions in objective space. Moreover, in the deletion operator, the solutions in the most crowded subregion are first collected into previous clusters, and then the worst solution in the most crowded cluster is deleted until there are N solutions left. Our algorithm is compared with other multimodal multiobjective evolutionary algorithms on the well-known benchmark MMOPs. Numerical experiments report the effectiveness and advantages of our proposed algorithm. (shrink)

This article proposes an Analytic Hierarchy Process Dempster-Shafer and similarity-based network selection algorithm for the scenario of dynamic changes in user requirements and network environment; combines machine learning with network selection and proposes a decision tree-based network selection algorithm; combines multiattribute decision-making and genetic algorithm to propose a weighted Gray Relation Analysis and genetic algorithm-based network access decision algorithm. Firstly, the training data is obtained from the collaborative algorithm, and it is used as the training set, and (...) the network attributes are used as the attribute set, and the continuous attributes are discretized by dichotomization, and the attribute that can make the greatest information gain is selected as the division feature, and a decision tree with strong generalization ability is finally obtained, which is used as the decision basis for network access selection. The simulation results show that the algorithm proposed in this thesis can effectively improve user service quality under three services, and the algorithm is simple and effective with low complexity. It first uses AHP-DS hierarchical analysis to establish a recursive hierarchy for the network selection problem and obtains the subjective weights of network attributes through the judgment matrix. Then, it uses a genetic algorithm to adjust the subjective weight, defines the fitness function in the genetic algorithm-based on gray correlation analysis, adjusts the weights of the selection operator, crossover operator, and variation operator in the genetic algorithm, and gets the network with the largest fitness as the target network, which can effectively improve the user service quality. (shrink)

Dan Dennett and Jerry Fodor have recently offered diametrically opposed estimations of the relevance of the theory of natural selection to an adequate theory of intentionality. In this paper, I show, first, how this opposition can be traced largely to differences both in their respective understandings of what the theory of natural selection includes, and in their respective ‘pre-theoretic’ takes on the datum to be explained by a theory of intentionality. These differences, in turn, have been ‘pre-selected’ by (...) contrasting outlooks on the general nature of the explanatory enterprise. While no final adjudication of these large issues is attempted, I argue, second, that it is important to distinguish two rather different questions about the relevance of natural selection to the nature of intentionality, and that, having done so, one can see that, from standpoints purely internal to their respective projects, Dennett and Fodor each in his own way misconstrues the relevance of natural selection. (shrink)

Dan Dennett and Jerry Fodor have recently offered diametrically opposed estimations of the relevance of the theory of natural selection to an adequate theory of intentionality. In this paper, I show, first, how this opposition can be traced largely to differences both in their respective understandings of what the theory of natural selection includes, and in their respective ‘pre-theoretic’ takes on the datum to be explained by a theory of intentionality. These differences, in turn, have been ‘pre-selected’ by (...) contrasting outlooks on the general nature of the explanatory enterprise. While no final adjudication of these large issues is attempted, I argue, second, that it is important to distinguish two rather different questions about the relevance of natural selection to the nature of intentionality, and that, having done so, one can see that, from standpoints purely internal to their respective projects, Dennett and Fodor each in his own way misconstrues the relevance of natural selection. (shrink)

Machine intelligence already helps medical staff with a number of tasks. Ethical decision-making, however, has not been handed over to computers. In this proof-of-concept study, we show how an algorithm based on Beauchamp and Childress’ prima-facie principles could be employed to advise on a range of moral dilemma situations that occur in medical institutions. We explain why we chose fuzzy cognitive maps to set up the advisory system and how we utilized machine learning to train it. We report on the (...) difficult task of operationalizing the principles of beneficence, non-maleficence and patient autonomy, and describe how we selected suitable input parameters that we extracted from a training dataset of clinical cases. The first performance results are promising, but an algorithmic approach to ethics also comes with several weaknesses and limitations. Should one really entrust the sensitive domain of clinical ethics to machine intelligence? (shrink)

The swarm intelligence algorithm simulates the behavior of animal populations in nature and is a new type of intelligent solution that is different from traditional artificial intelligence. Feature selection is a very common data dimensionality reduction method, which requires us to select the feature subset with the best evaluation criteria from the original feature set. Feature selection, as an effective data processing method, has become a hot research topic in the fields of machine learning, pattern recognition, and data (...) mining and has received extensive attention and attention. In order to verify the improvement effect of the feature selection algorithm based on the swarm intelligence algorithm on the data, this paper conducts experiments on six classes in the city’s first middle school with similar conditions. First, count the current situation of the students in the class, then divide them into classes, use different algorithms to teach them, and count the changes of the students after a period of teaching. The experiment found that the performance of students under the feature selection algorithm is about 30% higher than other teaching methods, and the awareness of cooperation between students reaches 0.8. It solves the contradiction between popularization and improvement and solves the problems of polarization and transformation of underachievers. The individuality of the algorithm has been fully utilized and developed. The test results show that the improved algorithm has faster convergence speed and higher solution accuracy, and the feature selection algorithm based on swarm intelligence algorithm can effectively improve the efficiency of the algorithm. (shrink)

Artificial intelligence plays an increasingly important role in legal disputes, influencing not only the reality outside the court but also the judicial decision-making process itself. While it is clear why judges may generally benefit from technology as a tool for reducing effort costs or increasing accuracy, the presence of technology in the judicial process may also affect the public perception of the courts. In particular, if individuals are averse to adjudication that involves a high degree of automation, particularly given fairness (...) concerns, then judicial technology may yield lower benefits than expected. However, the degree of aversion may well depend on how technology is used, i.e., on the timing and strength of judicial reliance on algorithms. Using an exploratory survey, we investigate whether the stage in which judges turn to algorithms for assistance matters for individual beliefs about the fairness of case outcomes. Specifically, we elicit beliefs about the use of algorithms in four different stages of adjudication: (i) information acquisition, (ii) information analysis, (iii) decision selection, and (iv) decision implementation. Our analysis indicates that individuals generally perceive the use of algorithms as fairer in the information acquisition stage than in other stages. However, individuals with a legal profession also perceive automation in the decision implementation stage as less fair compared to other individuals. Our findings, hence, suggest that individuals do care about how and when algorithms are used in the courts. (shrink)

Current research in artificial intelligence (AI) sheds light on algorithmic bias embedded in AI systems. The underrepresentation of women in the AI design sector of the tech industry, as well as in training datasets, results in technological products that encode gender bias, reinforce stereotypes and reproduce normative notions of gender and femininity. Biased behaviour is notably reflected in anthropomorphic AI systems, such as personal intelligent assistants (PIAs) and chatbots, that are usually feminized through various design parameters, such as names, (...) voices and traits. Gendering of AI entities, however, is often reduced to the encoding of stereotypical behavioural patterns that perpetuate normative assumptions about the role of women in society. The impact of this behaviour on social life increases, as human-to-(anthropomorphic)machine interactions are mirrored in human-to-human social interactions. This article presents current critical research on AI bias, focusing on anthropomorphic systems. Moreover, it discusses the significance of women’s engagement in AI design and programming, by presenting selected case studies of contemporary female media artists and designers. Finally, it suggests that women, through their creative practice, provide feminist and critical approaches to AI design which are essential for imagining alternative, inclusive, ethic and de-biased futures for anthropomorphic AIs. (shrink)

Critical algorithm scholarship has demonstrated the difficulties of attributing accountability for the actions and effects of algorithmic systems. In this commentary, we argue that we cannot stop at denouncing the lack of accountability for algorithms and their effects but must engage the broader systems and distributed agencies that algorithmic systems exist within; including standards, regulations, technologies, and social relations. To this end, we explore accountability in “the Generated Detective,” an algorithmically generated comic. Taking up the mantle of detectives (...) ourselves, we investigate accountability in relation to this piece of experimental fiction. We problematize efforts to effect accountability through transparency by undertaking a simple operation: asking for permission to re-publish a set of the algorithmically selected and modified words and images which make the frames of the comic. Recounting this process, we demonstrate slippage between the “complication” of the algorithm and the obscurity of the legal and institutional structures in which it exists. (shrink)

In nature, gregarious animals, insects, or bacteria usually exhibit paradoxical behaviors in the form of group fission and fusion, which exerts an important influence on group’s pattern formation, information transfer, and epidemiology. However, the fission-fusion dynamics have received little attention compared to other flocking behavior. In this paper, an intermittent selective interaction based control algorithm for the self-organized fission-fusion behavior of flocking system is proposed, which bridges the gap between the two conflicting behaviors in a unified fashion. Specifically, a hybrid (...) velocity coordination strategy that includes both the egalitarian and selective interactions is proposed, where the egalitarian interaction is to maintain the flock’s order and achieve the fusion behavior while the selective interaction strategy is for the response to external stimulus information and generates the fission behavior. Numerical simulations demonstrate that the proposed control algorithm can realize the self-organized fission-fusion behavior of flocking system under a unified framework. The influences of the main control parameters on the performance of the fission-fusion behavior are also discussed. In particular, the trade-off parameterαbalances the exploration and exploitation behaviors of flocking system and significantly enhances its movement flexibility and environmental adaptivity. (shrink)

This paper argues that instituting Citizen Boards of Governance (CBGs) is the optimal strategy to democratically contain Big Tech’s algorithmic powers in the digital public sphere. CBGs are bodies of randomly selected citizens that are authorized to govern the algorithmic infrastructure of Big Tech platforms. The main advantage of CBGs is to tackle the concentrated powers of private tech corporations without giving too much power to governments. I show why this is a better approach than ordinary state regulation (...) or relying on market mechanisms. My proposal follows from the critique of Big Tech’s concentrated powers, and explains how this justifies democratizing algorithms in the digital public sphere. My approach thus speaks to a core commitment in democratic theory: enhancing the autonomy of the public sphere from the centers of powers in modern societies, be it corporations or governments. (shrink)

How should we incorporate algorithms into humanistic scholarship? The typical approach is to clone what humans have done but faster, extrapolating expert insights to landfills of source material. But creative scholars do not clone tradition; instead, they produce readings that challenge closely held understandings. We theorize and then illustrate how to construct bad robots trained to surprise and provoke. These robots aren’t the most human but rather the most alien—not tame but dangerous. We explore the relationship between the reproduction of (...) tradition and the generation of surprise and then show how formalizing a particular humanistic theory as a Bayesian prior allows us to identify readings that disrupt it through a process of algorithmic abduction. Among the exploding universe of surprising (and mostly ridiculous) possible readings, algorithmic efficiency allows us to select readings that nonetheless garner substantial support from the total archive and so merit interpretation and engagement. It is in such interaction between alien and human readers that meaning is made and understanding disturbed; it is by extending alien readings to novel texts that the scholarly community tests the value of those readings. (shrink)

The use of machine learning algorithms has become ubiquitous in hiring decisions. Recent studies have shown that many of these algorithms generate unlawful discriminatory effects in every step of the process. The training phase of the machine learning models used in these decisions has been identified as the main source of bias. For a long time, discrimination cases have been analyzed under the banner of disparate treatment and disparate impact, but these concepts have been shown to be ineffective in the (...) context of AI. This paper examines the possibility of studying algorithmic discrimination from the perspective of negligence law. Negligent selection and validation of datasets and classifiers is a salient cause of improper training in machine learning. It is a breach of an employer’s duty to protect others, a failure of its exercise of due care in the manner of choosing employees. Adopting negligence to algorithmic discrimination requires a reformulation of what is foreseeable and reasonable within the context of black box algorithms, and a shift in the burden of proof to the employer, who must present evidence of its efforts to avoid bias. (shrink)

The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k (...) : Is there is a proof of length ≤ l ?" When restricted to proofs with universal or existential cuts, this problem is shown to be (1) undecidable for linear or tree-like LK-proofs (corresponds to the undecidability of second order unification), (2) undecidable for linear LKB-proofs (corresponds to the undecidability of semi-unification), and (3) decidable for tree-like LKB -proofs (corresponds to a decidable subprob- lem of semi-unification). (shrink)

This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.

Every scientist chooses a preferred level of analysis and this choice shapes the research program, even determining what counts as evidence. This contribution revisits Marr's three levels of analysis and evaluates the prospect of making progress at each individual level. After reviewing limitations of theorizing within a level, two strategies for integration across levels are considered. One is top–down in that it attempts to build a bridge from the computational to algorithmic level. Limitations of this approach include insufficient theoretical (...) constraint at the computation level to provide a foundation for integration, and that people are suboptimal for reasons other than capacity limitations. Instead, an inside-out approach is forwarded in which all three levels of analysis are integrated via the algorithmic level. This approach maximally leverages mutual data constraints at all levels. For example, algorithmic models can be used to interpret brain imaging data, and brain imaging data can be used to select among competing models. Examples of this approach to integration are provided. This merging of levels raises questions about the relevance of Marr's tripartite view. (shrink)

In this paper, I argue that accurate indexical representations have been crucial for the survival and reproduction of homo sapiens sapiens. Specifically, I want to suggest that reliable processes have been selected for because of their indirect, but close, connection to true belief during the Pleistocene hunter-gatherer period of our ancestral history. True beliefs are not heritable, reliable processes are heritable. Those reliable processes connected with reasoning take the form of Darwinian Algorithms: a plethora of specialized, domain-specific inference rules designed (...) to solve specific, recurrent, adaptive problems in social exchange contexts. Humans do not reason logically, but adaptively. (shrink)

This study explored the global cyberspace security issues, with the purpose of breaking the stereotype of people’s cognition of cyberspace problems, which reflects the relationship between interdependence and association. Based on the Apriori algorithm in association rules, a total of 181 strong rules were mined from 40 target websites and 56,096 web pages were associated with global cyberspace security. Moreover, this study analyzed support, confidence, promotion, leverage, and reliability to achieve comprehensive coverage of data. A total of 15,661 sites mentioned (...) cyberspace security-related words from the total sample of 22,493 professional websites, accounting for 69.6%, while only 735 sites mentioned cyberspace security-related words from the total sample of 33,603 non-professional sites, accounting for 2%. Due to restrictions of language, the number of samples of target professional websites and non-target websites is limited. Meanwhile, the number of selections of strong rules is not satisfactory. Nowadays, the cores of global cyberspace security issues include internet sovereignty, cyberspace security, cyber attack, cyber crime, data leakage, and data protection. (shrink)

Machine‐learning algorithms have the potential to revolutionise diagnostic and prognostic tasks in health care, yet algorithmic performance levels can be materially worse for subgroups that have been underrepresented in algorithmic training data. Given this epistemic deficit, the inclusion of underrepresented groups in algorithmic processes can result in harm. Yet delaying the deployment of algorithmic systems until more equitable results can be achieved would avoidably and foreseeably lead to a significant number of unnecessary deaths in well‐represented populations. (...) Faced with this dilemma between equity and utility, we draw on two case studies involving breast cancer and melanoma to argue for the selective deployment of diagnostic and prognostic tools for some well‐represented groups, even if this results in the temporary exclusion of underrepresented patients from algorithmic approaches. We argue that this approach is justifiable when the inclusion of underrepresented patients would cause them to be harmed. While the context of historic injustice poses a considerable challenge for the ethical acceptability of selective algorithmic deployment strategies, we argue that, at least for the case studies addressed in this article, the issue of historic injustice is better addressed through nonalgorithmic measures, including being transparent with patients about the nature of the current epistemic deficits, providing additional services to algorithmically excluded populations, and through urgent commitments to gather additional algorithmic training data from excluded populations, paving the way for universal algorithmic deployment that is accurate for all patient groups. These commitments should be supported by regulation and, where necessary, government funding to ensure that any delays for excluded groups are kept to the minimum. We offer an ethical algorithm for algorithms—showing when to ethically delay, expedite, or selectively deploy algorithmic systems in healthcare settings. (shrink)

The article defines the algorithm and details the sequential tasks for building an effective model of automated classification of events in the information space. On the eve and during the armed aggression of the Russian Federation against Ukraine, the consequences of external negative information influence were noticeable. Therefore, the organization and implementation of counteraction to such influence is urgent. An important component of this activity is the classification of information events in the information space in order to further analyze them (...) and form proposals for decision-making to counteract the negative information impact. Given the fact that in the global information space and, in particular, the information space of the state in the interests of counteracting such influence, it is necessary to constantly process a significant amount of information, so the task of improving the efficiency of this process is provided by automating its components. The algorithm of the automated classification process is based on a number of consecutive tasks, namely: data retrieval, preelection of messages, saving pre-selected messages in the database, determining a set of indicators for automated classification of information events, pre-processing a single document, distribution of messages by criteria by categories, presentation of information in a convenient form, saving the results of classification in the database. The proposed material reveals the content of these tasks. The proposed algorithm will serve to automatically divide information events of different nature into categories in order to increase the efficiency of assessing the level of negative information impact on target audiences for timely response to its manifestations. (shrink)

In the article the basic procedures for finding of connective elements and resolving conflicts of references is analyzed. On the basis of this, a generalized algorithm is proposed that combines advantages of existing procedures for search for connective elements between phrases. The advantages of the selected procedures and their sequence are described, the formal description of input data and the results of the algorithm are presented. To optimize the procedure for scanning the text, the algorithm is performed as an iterative (...) reduction of the candidates for communication elements. This is achieved through the confirmation of non-conflict links and the gradual resolution of conflicts. (shrink)

This chapter uncovers the complex negotiations for authority in various representations about futures of life which have been advanced by different branches of the sciences, and have culminated in the emerging concept of life as algorithm. It charts the historical shifts in expertise and representations of life, from naturalists, to mathematical modellers, and specialists in computation, and argues that physicists, game theorists, and economists now take a leading role in explaining and projecting futures of life. The chapter identifies Richard Dawkins (...) and Max Tegmark at the forefront of the concept of life as algorithm: the first inspired by game theory as a means to study evolution; the second proposing that a materialist basis of life could place humans and artificial intelligence on an equal footing. Through close reading of their respective texts, the chapter demonstrates that both thinkers consider life as an algorithm programmed to achieve success in survival and reproduction. (shrink)

Machine learning classifiers are increasingly used to inform, or even make, decisions significantly affecting human lives. Fairness concerns have spawned a number of contributions aimed at both identifying and addressing unfairness in algorithmic decision-making. This paper critically discusses the adoption of group-parity criteria (e.g., demographic parity, equality of opportunity, treatment equality) as fairness standards. To this end, we evaluate the use of machine learning methods relative to different steps of the decision-making process: assigning a predictive score, linking a classification (...) to the score, and adopting decisions based on the classification. Throughout our inquiry we use the COMPAS system, complemented by a radical simplification of it (our SAPMOC I and SAPMOC II models), as our running examples. Through these examples, we show how a system that is equally accurate for different groups may fail to comply with group-parity standards, owing to different base rates in the population. We discuss the general properties of the statistics determining the satisfaction of group-parity criteria and levels of accuracy. Using the distinction between scoring, classifying, and deciding, we argue that equalisation of classifications/decisions between groups can be achieved thorough group-dependent thresholding. We discuss contexts in which this approach may be meaningful and useful in pursuing policy objectives. We claim that the implementation of group-parity standards should be left to competent human decision-makers, under appropriate scrutiny, since it involves discretionary value-based political choices. Accordingly, predictive systems should be designed in such a way that relevant policy goals can be transparently implemented. Our paper presents three main contributions: (1) it addresses a complex predictive system through the lens of simplified toy models; (2) it argues for selective policy interventions on the different steps of automated decision-making; (3) it points to the limited significance of statistical notions of fairness to achieve social goals. (shrink)

A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of (...) the essential from parameterized hardness theory with a focus on W [1]-hardness, which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research. (shrink)

This article examines the construction of image recognition algorithms for the classification of plant pathology problems. Rooted in science and technology studies research on the effects of agricultural big data and agricultural algorithms, the study ethnographically examines how algorithms for the recognition of plant pathology are made. To do this, the article looks at the case of a German agtech startup developing image recognition algorithms for an app that aims to help small-scale farmers diagnose plant damages based on digital images (...) of their symptoms. The study posits that the construction of these algorithms can be grasped as a succession of layers, at each of which the startup’s employees carry out different selection practices. It is argued that these practices gradually inscribe a selective recognition of the phenomenon of plant pathology into the algorithms of the app. This selective recognition is reflected in the fact that the emerging algorithms are effective in identifying isolated plant damages on isolated crops, while ignoring most agroecosystem-related actors and relations through which plant damages arise. The article concludes that the app’s selective recognition of plant pathology is likely to perpetuate or even exacerbate the pesticide use of its users. This is because the app’s view of plant pathology as a phenomenon comprised of isolated plant damages on isolated crops is more compatible with the use of chemical pesticides than with approaches to crop protection that strive for a more moderate use of these substances (e.g., integrated pest management, agroecology, organic agriculture). (shrink)

ACMES is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science. This volume includes a selection of papers presented at the 2015 and 2016 conferences held at Western University that provide an interdisciplinary outlook on modern applied mathematics that draws from theory and practice, and situates it in proper context. These papers come from leading mathematicians, computational scientists, and philosophers of science, and cover a broad collection of mathematical and philosophical topics, (...) including numerical analysis and its underlying philosophy, computer algebra, reliability and uncertainty quantification, computation and complexity theory, combinatorics, error analysis, perturbation theory, experimental mathematics, scientific epistemology, and foundations of mathematics. By bringing together contributions from researchers who approach the mathematical sciences from different perspectives, the volume will further readers' understanding of the multifaceted role of mathematics in modern science, informed by the state of the art in mathematics, scientific computing, and current modeling techniques. (shrink)

Decisions are taken by humans very often during professional as well as leisure activities. It is particularly evident during surfing the Internet: selecting web sites to explore, choosing needed information in search engine results or deciding which product to buy in an on-line store. Recommender systems are electronic applications, the aim of which is to support humans in this decision making process. They are widely used in many applications: adaptive WWW servers, e-learning, music and video preferences, internet stores etc. In (...) on-line solutions, such as e-shops or libraries, the aim of recommendations is to show customers the products which they are probably interested in. As input data the following are taken: shopping basket archives, ratings of the products or servers log files.The article presents a solution of recommender system which helps users to select an interesting product. The system analyses data from other customers' ratings of the products. It uses clustering methods to find similarities among the users and proposed techniques to identify users' profiles. The system was implemented in Apache Mahout environment and tested on a movie database. Selected similarity measures are based on: Euclidean distance, cosine as well as correlation coefficient and loglikehood function. (shrink)