2019 Applied Technology Award for the Media and the Moving Image Awards at University of Houston. -/- The Google algorithm, as a ranking and ordering structure, cannot be “objective” as long as the page-ranking mechanism produces social effects and always inadvertently and inescapably affects social priorities. Imitable units of information (memes) on the internet change according to the laws of exponential growth, like other social phenomena, which include Google rankings. Mathematically and graphically represented, the effects of mimetic inflation on Google (...) rankings and other site-specific information can be proposed and projected. Current algorithmic policies may actually preserve and exaggerate the social priorities of the status quo in spite of “objective” intentions. These considerations in mind, the concept of “monology”, “the monopoly on information”, might be implemented to further analyze network effects online. Algorithmic regulation could be used to enforce artificial inequalities, to permit natural inequalities, or to enforce artificial equalities: each option has implications for the justice and fairness of online and offline environments. (shrink)

This thesis studies the enabling properties of ICT and their effects and potential for social change, and prepares the ground for a sustainability-oriented ethico-political assessment of this technology. It primarily builds on interdisciplinary scholarship to describe and explain the multifaceted co-evolution between the global deployment of ICTs and the emergence of the Information Society, understood as a socioeconomic restructuring of capitalism. Beyond the role of ICTs in this regime transition, the thesis delivers other philosophical insights about crucial aspects of ICT (...) development, applications and management. These include arguments about how we should conceptualize ICTs on the basis of their different roles in extending human communication and in performing or facilitating the remote control of humans and animals, machines and systems operations; about the entanglement between telecommunications, transport networks, urban development and work and organization; and about the relations between ICTs, culture and human values. Examples are offered to illustrate the potential that these empirical and philosophical lessons may hold for the construction of a framework for the ethico-political assessment of ICTs. (shrink)

The structure formed by fossil energy trade among countries can be divided into multiple subcommodity networks. However, the difference of coupling mode and transmission mechanism between layers of the multirelationship network will affect the measurement of node importance. In this paper, a framework of multisource information fusion by considering data uncertainty and the classical network centrality measures is build. Then, the evidential centrality indicator is proposed, by integrating Dempster–Shafer evidence theory and network theory, to empirically identify influential nodes of fossil (...) energy trade along the Belt and Road Initiative. The initial result of the heterogeneity characteristics of the constructed network drives us to explore the core node issue further. The main detected evidential nodes include Russia, Kazakhstan, Czechia, Slovakia, Egypt, Romania, China, Saudi Arabia, and Singapore, which also have higher impact on network efficiency. In addition, cluster analysis discovered that resource endowment is an essential factor influencing country’s position, followed by geographical distance, economic level, and economic growth potential. Therefore, the above aspects should be considered when ensuring national trade security. At last, the rationality and comprehensiveness of EVC are verified by comparing with some benchmark centralities. (shrink)

Link trustworthiness evaluation is a crucial task for information networks to evaluate the probability of a link being true in a heterogeneous information network. This task can significantly influence the effectiveness of downstream analysis. However, the performance of existing evaluation methods is limited, as they can only utilize incomplete or one-sided information from a single HIN. To address this problem, we propose a novel multi-HIN link trustworthiness evaluation model that leverages information across multiple related HINs to accomplish link trustworthiness evaluation (...) tasks inherently and efficiently. We present an effective method to evaluate and select informative pairs across HINs and an integrated training procedure to balance inner-HIN and inter-HIN trustworthiness. Experiments on a real-world dataset demonstrate that our proposed model outperforms baseline methods and achieves the best accuracy and F1-score in downstream tasks of HINs. (shrink)

Technology and Artificial Intelligence, both today and in the near future, are dominated by automated algorithms that combine optimization with models based on the human brain to learn, predict, and even influence the large-scale behavior of human users. Such applications can be understood to be outgrowths of historical trends in industry and academia, yet have far-reaching and even unintended consequences for social and political life around the world. Countries in different parts of the world take different regulatory views for the (...) role and protection of user data, and this will in turn determine the course of development for technology and AI in the near future. (shrink)

Using the search engine Google to locate information linked to individuals and organizations has become part of everyday functioning. This article addresses whether the “gaming” of Internet applications in attempts to modify reputations raises substantial ethical concerns. It analyzes emerging approaches for manipulation of how personally-identifiable information is accessed online as well as critically-important international differences in information handling. Itinvestigates privacy issues involving the data mining of personally-identifiable information with search engines and social media platforms. Notions of “gaming” and “manipulation” (...) have negative connotations as well as instrumental functions, which are distinguished in this article. The article also explores ethical matters engendered by the expanding industry of reputation management services that assist in these detailed technical matters. Ethical dimensions of online reputation are changing in the advent of reputation management, raising issues such as fairness and legitimacy of various information-related practices; the article provides scenarios and questions for classroom deliberation. (shrink)

Die Übernahme des KI-Unternehmens DeepMind durch Google für rund eine halbe Milliarde US-Dollar signalisierte vor einem Jahr, dass von der KI-Forschung vielversprechende Ergebnisse erwartet werden. Spätestens seit bekannte Wissenschaftler wie Stephen Hawking und Unternehmer wie Elon Musk oder Bill Gates davor warnen, dass künstliche Intelligenz eine Bedrohung für die Menschheit darstellt, schlägt das KI-Thema hohe Wellen. Die Stiftung für Effektiven Altruismus (EAS, vormals GBS Schweiz) hat mit der Unterstützung von Experten/innen aus Informatik und KI ein umfassendes Diskussionspapier zu den Chancen (...) und Risiken der künstlichen Intelligenz verfasst und geht darin auf aktuelle, mittel- und langfristige Herausforderungen im Bereich der KI-Entwicklung ein. (shrink)

With the wide adoption of social collaborative coding, more and more developers participate and collaborate on platforms such as GitHub through rich social and technical relationships, forming a large-scale complex technical system. Like the functionalities of critical nodes in other complex systems, influential developers and projects usually play an important role in driving this technical system to more optimized states with higher efficiency for software development, which makes it a meaningful research direction on identifying influential developers and projects in social (...) collaborative coding platforms. However, traditional ranking methods seldom take into account the continuous interactions and the driving forces of human dynamics. In this paper, we combine the bursty interactions and the bipartite network structure between developers and projects and propose the BurstBiRank model. Firstly, the burstiness between each pair of developers and projects is calculated. Secondly, a weighted developer-project bipartite network is constructed using the burstiness as weight. Finally, an iterative score diffusion process is applied to this bipartite network and a final ranking score is obtained at the stationary state. The real-world case study on GitHub demonstrates the effectiveness of our proposed BurstBiRank and the outperformance of traditional ranking methods. (shrink)

We have developed a first generation tool for the unbiased identification and characterization of human pluripotent stem cells, termed PluriTest. This assay utilizes all the information contained on a microarray and abandons the conventional stem cell marker concept. Stem cells are defined by the ability to replenish themselves and to differentiate into more mature cell types. As differentiation potential is a property that cannot be directly proven in the stem cell state, biologists have to rely on correlative measurements in stem (...) cells associated with differentiation potential. Unfortunately, most, if not all, of those markers are only valid within narrow limits of specific experimental systems. Microarray technologies and recently next‐generation sequencing have revolutionized how cellular phenotypes can be characterized on a systems‐wide level. Here we discuss the challenges PluriTest and similar global assays need to address to fulfill their enormous potential for industrial, diagnostic and therapeutic applications. (shrink)

Court judgments contain valuable information on how statutory laws and past court precedents are interpreted and how the interdependence structure among them evolves in the courtroom. Data-mining the evolving structure of such customs and norms that reflect myriad social values from a large-scale court judgment corpus is an essential task from both the academic and industrial perspectives. In this paper, using data from approximately 110,000 court judgments from Japan spanning the period 1998–2018 from the district to the supreme court level, (...) we propose two tasks that grasp such a structure from court judgments and highlight the strengths and weaknesses of major machine learning models. One is a prediction task based on masked language modeling that connects textual information to legal codes and past court precedents. Another is a dynamic link prediction task where we predict the hidden interdependence structure in the law. We make quantitative and qualitative comparisons among major machine learning models to obtain insights for future developments. (shrink)

Keyword extraction refers to the process of selecting most significant, relevant, and descriptive terms as keywords, which are present inside a single document. Keyword extraction has major applications in the information retrieval domain, such as analysis, summarization, indexing, and search, of documents. In this paper, we present a novel supervised technique for extraction of keywords from medium-sized documents, namely Corpus-based Contextual Semantic Smoothing. CCSS extends the concept of Contextual Semantic Smoothing, which considers term usage patterns in similar texts to improve (...) term relevance information. We introduce four more features beyond CSS as our novel contributions in this work. We systematically compare the performance of CCSS with other techniques, when implemented over INSPEC dataset, where CCSS outperforms all state-of-the-art keyphrase extraction techniques presented in the literature. (shrink)

Este artículo analiza cómo las multinacionales tecnológicas, y en particular aquellas que se dedican a las redes sociales, están desarrollando técnicas para construir métricas mentales de los usuarios que navegan por internet con el fin de conocer sus emociones, sus sentimientos, sus gustos, sus fobias, y, en definitiva, su psique. Se muestran algunos sencillos ejemplos de cómo se pueden implementar estas técnicas. En concreto, nos centraremos en un rasgo muy particular de lo mental: la intencionalidad.

Psychology has benefited from an enormous wealth of knowledge about processes of cognition in relation to how the brain organizes information. Within the categorization literature, this behavior is often explained through theories of memory construction called exemplar theory and prototype theory which are typically based on similarity or rule functions as explanations of how categories emerge. Although these theories work well at modeling highly controlled stimuli in laboratory settings, they often perform less well outside of these settings, such as explaining (...) the emergence of background knowledge processes. In order to explain background knowledge, we present a non-similarity-based post-Skinnerian theory of human language called Relational Frame Theory (RFT) which is rooted in a philosophical world view called functional contextualism (FC). This theory offers a very different interpretation of how categories emerge through the functions of behavior and through contextual cues, which may be of some benefit to existing categorization theories. Specifically, RFT may be able to offer a novel explanation of how background knowledge arises, and we provide some mathematical considerations in order to identify a formal model. Finally, we discuss much of this work within the broader context of general semantic knowledge and artificial intelligence research. (shrink)

Summarization of legal case judgement documents is a practical and challenging problem, for which many summarization algorithms of different varieties have been tried. In this work, rather than developing yet another summarization algorithm, we investigate if intelligently ensembling (combining) the outputs of multiple (base) summarization algorithms can lead to better summaries of legal case judgements than any of the base algorithms. Using two datasets of case judgement documents from the Indian Supreme Court, one with extractive gold standard summaries and the (...) other with abstractive gold standard summaries, we apply various ensembling techniques on summaries generated by a wide variety of summarization algorithms. The ensembling methods applied range from simple voting-based methods to ranking-based and graph-based ensembling methods. We show that many of our ensembling methods yield summaries that are better than the summaries produced by any of the individual base algorithms, in terms of ROUGE and METEOR scores. (shrink)

Law search is fundamental to legal reasoning and its articulation is an important challenge and open problem in the ongoing efforts to investigate legal reasoning as a formal process. This Article formulates a mathematical model that frames the behavioral and cognitive framework of law search as a sequential decision process. The model has two components: first, a model of the legal corpus as a search space and second, a model of the search process that is compatible with that environment. The (...) search space has the structure of a “multi-network”—an interleaved structure of distinct networks—developed in earlier work. In this Article, we develop and formally describe three related models of the search process. We then implement these models on a subset of the corpus of U.S. Supreme Court opinions and assess their performance against two benchmark prediction tasks. The first is to predict the citations in a document from its semantic content. The second is to predict the search results generated by human users. For both benchmarks, all search models outperform a null model with the learning-based model outperforming the other approaches. Our results indicate that through additional work and refinement, there may be the potential for machine law search to achieve human or near-human levels of performance. (shrink)

We present a novel technique for speeding up the computation of PageRank, a hyperlink-based estimate of the “importance” of Web pages, based on the ideas presented in [7]. The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing the Web link graph. The algorithm presented here, called Power Extrapolation, accelerates the convergence of the Power Method by subtracting off the error along several nonprincipal eigenvectors from the current (...) iterate of the Power Method, making use of known nonprincipal eigenvalues of the Web hyperlink matrix. Empirically, we show that using Power Extrapolation speeds up PageRank computation by 30% on a Web graph of 80 million nodes in realistic scenarios over the standard power method, in a way that is simple to understand and implement. (shrink)