We design a well-developed algorithm for solving large bound-constrained systems. The method combines a subspace trust-region strategy with a Newton-Krylov method and with a strategy for handling the bounds. To solve the trust-region problem efficiently, we look for an approximate solution and do not require the exact solution of the Newton equation. In addition, a strategy for obtaining an imp...

The main focus of the presented paper is to investigate whether the concept of bonding and bridging social capital can be reasonably specified by categorizing voluntary associations according to their constitutive goods, i.e. purposes, and whether this conceptualization will also hold for empirical analysis in the realm of political participation. The empirical findings both for East and West G...

We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed links between pairs of agents, with capacities that are related to the credit an agent is willing to extend another; payments may be routed between any two agents that are connected by a path in the network. The network ...

We present a prototype of agent-based intrusion detection system designed for deployment on high-speed backbone networks. The main contribution of the system is the integration of several anomaly detection techniques by means of collective trust modeling within a group of collaborative detection agents, each featuring a specific detection algorithm. The anomalies are used as an input for the tr...

Why do the poor make shortsighted choices in decisions that involve delayed payoffs? Foregoing immediate rewards for larger, later rewards requires that decision makers (i) believe future payoffs will occur and (ii) are not forced to take the immediate reward out of financial need. Low-income individuals may be both less likely to believe future payoffs will occur and less able to forego immedi...

The robustness of distributed systems is usually phrased in terms of the number of failures of certain types that they can withstand. However, these failure models are too crude to describe the different kinds of trust and expectations of participants in the modern world of complex, integrated systems extending across different owners, networks, and administrative domains. Modern systems often ...

A general inner-outer iteration for computing extreme eigenpairs of symmetric/positive-definite matrix pencils is proposed. The principle of the method is to produce a sequence of p-dimensional bases {Xk} that converge to a minimizer of a generalized Rayleigh quotient. The role of the inner iteration is to produce an “update” vector by (approximately) minimizing a quadratic model of the Rayleig...