«A genuine literary treatment of the soul» is what Eugenio Massa called the brief section of Egidio of Viterbo’s Sentences Commentary that he published in 1954. What Massa published is Egidio’s discussion of part of Peter Lombard’s third distinction in Book I, which bears the title «De imagine et similitudine Trinitatis in anima humana». The main topic at so early a place in the Sentences is not, strictly speaking, the human soul but the divine Trinity. The point of departure is (...) Lombard’s consideration of the soul as analogous to the Trinity; and behind that connection lies Augustine, who presented the soul as an image of the Trinity because he saw in the soul a unity and simplicity of substance but also Platonism’s tripartite divisions. These include, for example, the appetitive, emotional, and rational functions, from the Republic, and Augustine’s subdivision of the rational functions into memory, understanding, and will. This connection between Trinity and human soul, however, gave commentators excellent opportunities not only for theology, discourse about God, but also for psychology, the study of the soul. Descriptions of the human soul initially offered in the theological context became important in their own right. According to Massa, in light of the soul’s being created in God’s image, Egidio was able to make human dignity the major theme even at this early point in the commentary. (shrink)

Emmanuel Kant s'est attaqué sinon à la métaphysique, du moins à sa méthode. Il lui reproche d'avoir l'ambition de parvenir à une connaissance scientifique de ce qui est en tant que tel et de dépasser ainsi les données de l'expérience sensible. La métaphysique classique de tradition aristotélicienne prétendait en effet parvenir à une véritable connaissance de Dieu, de la création, de l'âme, de la liberté.00Mais selon Kant, la métaphysique ne parvient en réalité qu'à des conclusions contradictoires qu'il nomme les ± (...) antinomies de la raison pure?. Les contradictions entre les divers métaphysiciens attestent cette impasse. Il ne reste donc plus à la raison qu'à se tourner vers elle-même et au mieux vers les conditions de la science des phénomènes et de la pratique. C'est en cela que réside le suicide de la raison théorique et métaphysique que met en lumière Michel Nodé-Langlois. L'idée d'une métaphysique comme connaissance et science est devenue, d'après Kant, impossible.00Pourtant, et c'est tout l'intérêt de ce livre, il est aisé de montrer que les contradictions exposées par Kant n'en sont pas. Elles reposent sur des interprétations erronées de la manière dont la métaphysique aborde les questions. S'il en est ainsi, les prétendues antinomies s'effondrent et la raison libérée du piège kantien peut reprendre le chemin de la spéculation théorique sur les grandes questions, avec l'espoir de les résoudre grâce à une connaissance véritable. (shrink)

In recent years, while extensive researches on various networks properties have been proposed and accomplished, little has been proposed and done on network robustness and node vulnerability assessment under cascades in directed large-scale online community networks. In essential, an online directed social network is a group-centered and information spread-dominated online platform which is very different from the traditional undirected social network. Some further research studies have indicated that the online social network has high robustness to random removals of nodes (...) but fails to the intentional attacks, particularly to those attacks based on node betweenness or node directed coefficient. To explore on the robustness of directed social network, in this article, we have proposed two novel node centralities of ITG and I M p v. These two new centrality models are designed to capture this cascading effect in directed online social networks. Furthermore, we also propose a new and highly efficient computing method based on iterations for I M p v. Then, with the abundant experiments on the synthetic signed network and real-life networks derived from directed online social media and directed human mobile phone calling network, it has been proved that our ITG and I M p v based on directed social network robustness and node vulnerability assessment method is more accurate, efficient, and faster than several traditional centrality methods such as degree and betweenness. And we also have proposed the solid reasoning and proof process of iteration times k in computation of I M p v. To the best knowledge of us, our research has drawn some new light on the leading edge of robustness on the directed social network. (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)

It would be useful to have a category of extensive-form games whose isomorphisms specify equivalences between games. Since working with entire games is too large a project for a single paper, I begin here with preforms, where a “preform” is a rooted tree together with choices and information sets. In particular, this paper first defines the category \, whose objects are “functioned trees”, which are specially designed to be incorporated into preforms. I show that \ is isomorphic to the full (...) subcategory of \ whose objects are converging arborescences. Then the paper defines the category \, whose objects are “node-and-choice preforms”, each of which consists of a node set, a choice set, and an operator mapping node-choice pairs to nodes. I characterize the \ isomorphisms, define a forgetful functor from \ to \, and show that \ is equivalent to the full subcategory of \ whose objects are perfect-information preforms. The paper also shows that many game-theoretic entities can be derived from preforms, and that these entities are well-behaved with respect to \ morphisms and isomorphisms. (shrink)

The study of cyber-attacks, and in particular the spread of attack on the power cyber-physical system, has recently attracted considerable attention. Identifying and evaluating the important nodes under the cyber-attack propagation scenario are of great significance for improving the reliability and survivability of the power system. In this paper, we improve the closeness centrality algorithm and propose a compound centrality algorithm based on adaptive coefficient to evaluate the importance of single-layer network nodes. Moreover, we quantitatively calculated the decouple degree of (...) cascading failures caused by exposed nodes formed by attack propagation. At last, experiments based on the IEEE 57 test system show that the proposed compound centrality algorithm can match the cyber-attack propagation scenario well, and we give the importance values of the nodes in a specific attack scenario. (shrink)

Aiming to improve the commercialization efficiency of scientific innovative achievements, this paper utilizes the time series visualization method to construct the time series network of each subsystem. After that, the network similarity is calculated by the cosine similarity theorem. On this basis, a new multilayer network adjacency matrix is obtained. With the adoption of k-core technology, the critical nodes can be identified to study the transformation efficiency of the innovation value in the network. Finally, according to the provincial innovation value (...) transformation data of China from 1998 to 2016, an empirical study was carried out to calculate and analyze the transformation efficiency of innovation achievements in 30 provinces. The results indicate that the transformation efficiency of innovation value can be expressed by the structure of the time series network constructed by the input-output vectors; the mapping relationship of the value transformation vectors could be reflected by the cosine similarity of the time series network, while the transformation efficiency of innovation value could be identified using the k-core; and the transformation efficiency of innovation value in three coastal provinces is relatively higher, while that of the rest of the provinces is roughly the same among the 30 provinces. (shrink)

This article presents qualitative research conducted in an Israeli ova `extraction' clinic in Romania. Following on from a piece written by Jyotsna Gupta and published in this journal in February 2006, this article asks what kinds of feminist alliances can or should be made in the arena of reproductive technologies. In conversation with Gupta, the author asks whether `an ethic of universal human dignity' is possible or desirable. This article looks to the voices of Romanian egg sellers themselves as a (...) source of theoretical and political direction for transnational feminists who try to think about responses to reproductive technologies. (shrink)

The present article provides an analysis of the instants of a system that performs a Newtonian supertask. For each instant it studied the possibility of the system having, from the instant in question, more than one possible course of evolution. This analysis shows that some supertasks presented as deterministic by Pérez Laraudogoitia are in fact indeterministic and specifies the difficulties ahead in showing the radical indeterminism suggested by Atkinson and Johnson.

The core theme of the special issue in which this article appears is the inherent impossibility of confining the knowledge required to build and sustain the instruments of travel to a single space or institution. This is certainly true for the ships that built empires – the large sailing and later steam ships produced by navies and companies in the process of European expansion. Ships traveled between polities and required repairs overseas, taking the construction knowledge and practices with them. Skilled (...) laborers – experienced shipwrights and increasingly also trained engineers – helped to transfer shipbuilding practices across oceans, and to adapt these practices to local conditions based on forms of “blended know-how.” This article explores how the circulation of shipbuilding knowledge and practices within and between maritime empires changed with the increasing pace of industrialization. It does so on the basis of three moments: the Dutch East India Company’s shipbuilding activities in Asia in the seventeenth and eighteenth centuries; the interaction between private industry and the Dutch state in advancing machine-manufacturing in both the Netherlands and on Java in the 1830s and 1840s; and the aid provided by Dutch engineers in laying the groundwork for Japanese industrial warship-construction in the second half of the nineteenth century. Such transfers put high demands on the capacities of states and naval administrators in controlling the flows of necessary resources and skilled labor, requiring complex arrangements between states and private capital. Industrialization did not change this basic fact, but it did change the nature of these arrangements. Although shipbuilding knowledge always remained practice-driven, highly mobile and susceptible to local adaptation, the increasing technological demands created by the transition from sail to steam and wood to iron, combined with the extension of the power of states and transnationally operating manufacturing companies, considerably changed the institutional embeddings and societal consequences of its circulation. (shrink)

I shall compare two views of legal concepts: as nodes in inferential nets and as categories in an ontology (a conceptual architecture). Firstly, I shall introduce the inferential approach, consider its implications, and distinguish the mere possession of an inferentially defined concept from the belief in the concept’s applicability, which also involves the acceptance of the concept’s constitutive inferences. For making this distinction, the inferential and eliminative analysis of legal concepts proposed by Alf Ross will be connected to the views (...) on theoretical concepts in science advanced by Frank Ramsey and Rudolf Carnap. Consequently, the mere comprehension of a legal concept will be distinguished from the application of the concept to a particular legal system, since application presupposes a doctrinal commitment, namely, the belief that the inferences constituting the concept hold in that system. Then, I shall consider how concepts can be characterised by defining the corresponding terms and placing them within an ontology. Finally, I shall argue that there is a tension between the inferential and the ontological approach, but that both need to be taken into account, to capture the meaning and the cognitive function of legal concepts. (shrink)

Efficient identification of influential nodes is one of the essential aspects in the field of complex networks, which has excellent theoretical and practical significance in the real world. A valuable number of approaches have been developed and deployed in these areas where just a few have used centrality measures along with their concerning deficiencies and limitations in their studies. Therefore, to resolve these challenging issues, we propose a novel effective distance-based centrality algorithm for the identification of influential nodes in concerning (...) networks. EDBC algorithm comprises factors such as the power of K-shell, degree nodes, effective distance, and numerous levels of neighbor’s influence or neighborhood potential. The performance of the proposed algorithm is evaluated on nine real-world networks, where a susceptible infected recovered epidemic model is employed to examine the spreading dynamics of each node. Simulation results demonstrate that the proposed algorithm outperforms the existing techniques such as eigenvector, betweenness, closeness centralities, hyperlink-induced topic search, H-index, K-shell, page rank, profit leader, and gravity over a valuable margin. (shrink)

Freezers with biospecimen deposits became biobanks and later were networked at the pan-European level in 2013 under the Biobanking and BioMolecular Resources Research Infrastructure—European Research Infrastructure Consortium (BBMRI-ERIC). Drawing on document analysis about the BBMRI-ERIC and multi-sited fieldwork with biobankers in Spain from a science and technology studies approach, we explore what biobanks are expected to do and become under the BBMRI-ERIC framework, and how infrastructural transitions promote particular transformations in biobanking practices. The primary purpose of biobanks in Europe is (...) presented as being to become mediators in contemporary biomedical research (global sharing nodes) distribution, and distributed nodes of samples and their associated data. We argue that infrastructural transitions are complicated and heterogeneous, giving rise to unattended local concerns on adjusting their practices to fit into the BBMRI-ERIC framework, even for non-members, as the case of Spain illustrates, where “old practices” of collection and storage are questioned. In this article, we aim to encourage qualitative studies to explore the lags between pan-European policies and prospects, different contextual interpretations, and biobanking reconfigurations as an opportunity to explore what that lag is made of (e.g. tensions with “old practices,” unresolved conflicts with the national agendas, reservations on a possible centralization of the biobanking practices by regional biobanks, lack of funding, etc.). Such research could enrich not only policy guidance, but also the understanding of technoscientific infrastructures’ scalability. (shrink)

In this paper I offer a unified causal account of natural kinds. Using as a starting point the widely held view that natural kind terms or predicates are projectible, I argue that the ontological bases of their projectibility are the causal properties and relations associated with the natural kinds themselves. Natural kinds are not just concatenations of properties but ordered hierarchies of properties, whose instances are related to one another as causes and effects in recurrent causal processes. The resulting account (...) of natural kinds as clusters of core causal properties that give rise to clusters of derivative properties enables us to distinguish genuine natural kinds from non-natural kinds. For instance, it enables us to say why some of the purely conventional categories derived from the social domain do not correspond to natural kinds, though other social categories may. (shrink)

Online social network services have brought a kind of new lifestyle to the world that is parallel to people’s daily offline activities. Social network analysis provides a useful perspective on a range of social computing applications. Social interaction on the Web includes both positive and negative relationships, which is certainly important to social networks. The authors of this article found that the accuracy of the signs of links in the underlying social networks can be predicted. The trust that other users (...) impart on a node is an important attribute of networks. In this article, the authors present a model to compute the prestige of nodes in a trust-based network. The model is based on the idea that trustworthy nodes weigh more. To fulfill this task, the authors first attempt to infer the attitude of one user toward another by predicting signed edges in networks. Then, the authors propose an algorithm to compute the prestige and trustworthiness where the edge weight denotes the trust score. To prove the algorithm’s effectiveness, the authors conducted experiments on the public dataset. Theoretical analysis and experimental results show that this method is efficient and effective. (shrink)

This article studies natural food packaging as enabling artifacts of the traditional material culture of Antioquia in Colombia. For this purpose, we consider artifacts as objective nodes that combine design and use intentions, functions, materials, histories, artifactual lineages, and cooperative relationships that stabilize ritualized practices of a human group. We take the example of natural packaging as artifacts that enablers and stabilizers of traditional cooking and food preparation practices. Natural packaging materials are here assumed to be leaves having some favorable (...) property to contain a food product. After providing a theoretical reflection, we analyze the data collected from fieldwork we conducted in two towns in Antioquia, Colombia (Santa Fe de Antioquia and Amagá), as well as from an interview with an expert in the field. Finally, we show that it is possible to postulate an analysis under a relational ontological description of a traditional practice with conceptual categories of the philosophy of technology. (shrink)

Given a target area and a location-aware social network, the location-aware influence maximization problem aims to find a set of seed users such that the information spread from these users will reach the most users within the target area. We show that the problem is NP-hard and present an approximate algorithm framework, namely, TarIM-SF, which leverages on a popular sampling method as well as spatial filtering model working on arbitrary polygons. Besides, for the large-scale network we also present a coarsening (...) strategy to further improve the efficiency. We theoretically show that our approximate algorithm can provide a guarantee on the seed quality. Experimental study over three real-world social networks verified the seed quality of our framework, and the coarsening-based algorithm can provide superior efficiency. (shrink)

Tiebreak rules are necessary for revealing indifference in non- sequential decisions. I focus on a preference relation that satisfies Ordering and fails Independence in the following way. Lotteries a and b are indifferent but the compound lottery f, 0.5b> is strictly preferred to the compound lottery f, 0.5a>. Using tiebreak rules the following is shown here: In sequential decisions when backward induction is applied, a preference like the one just described must alter the preference relation between a and b at (...) certain choice nodes, i.e., indifference between a and b is not stable. Using this result, I answer a question posed by Rabinowicz (1997) concerning admissibility in sequential decisions when indifferent options are substituted at choice nodes. (shrink)

The dynamic models are proposed to investigate the influence node activity has on rumor spreading process in both homogeneous and heterogeneous networks. Different from previous studies, we believe that the activity of nodes in complex networks affects the process of rumor spreading. An active node can have contact with all the nodes it directly links to, while an inactive node could only interact with its active neighbors. We explore the joint effort of activity rate, spreading rate and (...) network topology on rumor spreading process by mean-field equations and numerical simulations, which reveals that there exists a critical curve consisting of critical activity rate and spreading rate; meanwhile, activity rate and spreading rate both have influence on the final rumor spreading scale. (shrink)

Community search is a query-oriented variant of community detection problem, and the goal is to retrieve a single community from a given set of nodes. Most of the existing community search methods adopt handcrafted features, so there are some limitations in applications. Our idea is motivated by the recent advances of node embedding. Node embedding uses deep learning method to obtain feature representation of nodes directly from graph structure automatically and offers a new method to measure the distance (...) between two nodes. In this paper, we propose a two-stage community search algorithm with a minimum spanning tree strategy based on node embedding. At the first stage, we propose a node embedding model NEBRW and map nodes to the points in a low-dimensional vector space. At the second stage, we propose a new definition of community from the distance viewpoint, transform the problem of community search to a variant of minimum spanning tree problem, and uncover the target community with an improved Prim algorithm. We test our algorithm on both synthetic and real-world network datasets. The experimental results show that our algorithm is more effective for community search than baselines. (shrink)

The critical node detection problem is a central task in computational graph theory due to its large applicability, consisting in deleting $k$ nodes to minimize a certain graph measure. In this article, we propose a new Extremal Optimization-based approach, the Pseudo-Deterministic Noisy Extremal Optimization (PDNEO) algorithm, to solve the Critical Node Detection variant in which the pairwise connectivity is minimized. PDNEO uses an adaptive pseudo-deterministic parameter to switch between random nodes and articulation points during the search, as well (...) as other features, such as noise induction to preserve diversity, greedy search to better exploit the search space and a greater search space exploration mechanism. Numerical experiments on synthetic and real-world networks show the effectiveness of the proposed algorithm compared with existing methods. (shrink)

Demodulating harmful nodes and diminishing the energy waste in sensor nodes can prolong the lifespan of wireless sensor networks. In this study, a genetic algorithm and an adaptive neuro fuzzy inference system were used to diminish the energy waste of sensors. Weighted trust evaluation was applied to search for harmful nodes in the network to prolong the lifespan of WSNs. A low-energy adaptive clustering hierarchy method was used to analyze the results. It was discovered that searching for harmful nodes with (...) GA-ANFIS using weighted trust evaluation significantly increased the lifespan of WSNs. For evaluation of the proposed method we used the mean of energy of all sensors against of the round, data packets received in base station, minimum energy versus rounds and number of alive sensors versus rounds. Also, in this paper we compared the proposed method results with LEACH, LEACH-DT, Random, SIF and GA-Fuzzy methods. As results the proposed method has high life time than other methods. A representation of the overall system was implemented using MATLAB software. (shrink)

The Internet of Things (IoT) is a fast-growing technology that connects everyday devices to the Internet, enabling wireless, low-consumption and low-cost communication and data exchange. IoT has revolutionized the way devices interact with each other and the internet. The more devices become connected, the greater the risk of security breaches. There is currently a need for new approaches to algorithms that can detect malware regardless of the size of the network and that can adapt to dynamic changes in the network. (...) Through the use of a multi-agent reinforcement learning algorithm, this paper proposes a novel algorithm for malware detection in IoT devices. The proposed algorithm is not strongly dependent on the size of the IoT network due to the that its training is adapted using time differences if the IoT network size is small or Monte Carlo otherwise. To validate the proposed algorithm in an environment as close to reality as possible, we proposed a scenario based on a real IoT network, where we tested different malware propagation models. Different simulations varying the number of agents and nodes in the IoT network have been developed. The result of these simulations proves the efficiency and adaptability of the proposed algorithm in detecting malware, regardless of the malware propagation model. (shrink)