"We consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same schedule as the centralized greedy heuristic."

"…Here we study the quantitative relation between adaptive response and background compensation within a modeling framework. In contrast to the commonly held view, we show that any particular type of adaptive response is neither sufficient nor necessary for adaptive enlargement of dynamic range. In particular a precise adaptive response, where system activity is maintained at a constant level at steady state, does not ensure a large dynamic range neither in input signal nor in system output. A general mechanism for input dynamic range enlargement comes about from the activity-dependent modulation of protein responsiveness by multiple biochemical modification, regardless of the type of adaptive response it induces. Therefore hierarchical biochemical processes such as methylation and phosphorylation are natural candidates to induce this property in signalling systems."

"Many models of market dynamics make use of the idea of wealth exchanges among economic agents. A simple analogy compares the wealth in a society with the energy in a physical system, and the trade between agents to the energy exchange between molecules during collisions. However, while in physical systems the equipartition of energy is valid, in most exchange models for economic markets the system converges to a very unequal "condensed" state, where one or a few agents concentrate all the wealth of the society and the wide majority of agents shares zero or a very tiny fraction of the wealth. Here we present an exchange model where the goal is not only to avoid condensation but also to reduce the inequality; to carry out this objective the choice of interacting agents is not at random, but follows an extremal dynamics regulated by the wealth of the agent.…"

"One direction for future research would be to investi- gate to what extent these counterexamples are special. For example, are all shapes which repel a point charge similar to the hemisphere geometry discussed here, or are there completely different kinds of geometries with this property? More specifically, is it possible to achieve re- pulsion with a convex metallic object? One can ask sim- ilar questions about Casimir repulsion. There are many open questions here—we have only just begun to under- stand these counterintuitive geometric effects."

"Rotor-router networks are discrete analogues of continuous linear systems such as electrical circuits; they are also deter- ministic analogues of stochastic systems such as random walk processes. These analogies permit one to design rotor-router networks to compute numerical quantities associated with lin- ear and/or stochastic systems. These distributed computations can behave stably even in the presence of significant disruption."

"Behavior-Driven Development (BDD) is a specification technique that automatically certifies that all functional requirements are treated properly by source code, through the connection of the textual description of these requirements to automated tests. Given that in some areas, in special Enterprise Information Systems, requirements are identified by Business Process Modeling – which uses graphical notations of the underlying business processes, this paper aims to provide a mapping from the basic constructs that form the most common BPM languages to Behavior Driven Development constructs."

"The study of networks has grown into a substantial interdisciplinary endeavor across the natural, social, and information sciences. Yet there have been very few attempts to investigate the interrelatedness of the different classes of networks studied by different disciplines. Here, we introduced a framework to establish a taxonomy of networks from various origins. The provision of this family tree not only helps understand the kinship of networks, but also facilitates the transfer of empirical analysis, theoretical modeling, and conceptual developments across disciplinary boundaries. The framework is based on probing the mesoscopic properties of networks, an important source of heterogeneity for their structure and function. Using our method, we computed a taxonomy for 752 individual networks and a separate taxonomy for 12 network classes. We also computed three within-class taxonomies for political, fungal, and financial networks, and found them to be insightful in each case."

"…The h index is compared with the Degree centrality (a local measure), the Betweenness and Eigenvector centralities (two non-local measures) in the case of a biological network (Yeast interaction protein-protein network) and a linguistic network (Moby Thesaurus II). In both networks, the Hirsch index has poor correlation with Betweenness centrality but correlates well with Eigenvector centrality, specially for the more important nodes that are relevant for ranking purposes, say in Search Engine Optimization. In the thesaurus network, the h index seems even to outperform the Eigenvector centrality measure as evaluated by simple linguistic criteria."

"Despite the availability of very detailed data on financial market, agent-based modeling is hindered by the lack of information about real trader behavior. This makes it impossible to validate agent-based models, which are thus reverse-engineering attempts. This work is a contribution to the building of a set of stylized facts about the traders themselves. Using the client database of Swissquote Bank SA, the largest on-line Swiss broker, we find empirical relationships between turnover, account values and the number of assets in which a trader is invested. A theory based on simple mean-variance portfolio optimization that crucially includes variable transaction costs is able to reproduce faithfully the observed behaviors. We finally argue that our results bring into light the collective ability of a population to construct a mean-variance portfolio that takes into account the structure of transaction costs."

"We consider the problem of parameter estimation for a system of ordinary differential equations from noisy observations on a solution of the system. In case the system is nonlinear, as it typically is in practical applications, an analytic solution to it usually does not exist. Consequently, straightforward estimation methods like the ordinary least squares method depend on repetitive use of numerical integration in order to determine the solution of the system for each of the parameter values considered, and to find subsequently the parameter estimate that minimises the objective function. This induces a huge computational load to such estimation methods. We propose an estimator that is defined as a minimiser of an appropriate distance between a nonparametrically estimated derivative of the solution and the right-hand side of the system applied to a nonparametrically estimated solution.…"

"We present designs of 2D isotropic, disordered photonic materials of arbitrary size with complete band gaps blocking all directions and polarizations. The designs with the largest gaps are obtained by a constrained optimization method that starts from a hyperuniform disordered point pattern, an array of points whose number variance within a spherical sampling window grows more slowly than the volume. We argue that hyperuniformity, combined with uniform local topology and short-range geometric order, can explain how complete photonic band gaps are possible without long-range translational order. We note the ramifications for electronic and phononic band gaps in disordered materials."

"Systems whose organization displays causal asymmetry constraints, from evolutionary trees to river basins or transport networks, can be often described in terms of directed paths (causal flows) on a discrete state space. Such a set of paths defines a feed-forward, acyclic network. A key problem associated with these systems involves characterizing their intrinsic degree of path reversibility: given an end node in the graph, what is the uncertainty of recovering the process backwards until the origin? Here we propose a novel concept, \textit{topological reversibility}, which rigorously weigths such uncertainty in path dependency quantified as the minimum amount of information required to successfully revert a causal path.…"

"In this paper, a parametric level set method for reconstruction of obstacles in general inverse problems is considered. General evolution equations for the reconstruction of unknown obstacles are derived in terms of the underlying level set parameters. We show that using the appropriate form of parameterizing the level set function results a significantly lower dimensional problem, which bypasses many difficulties with traditional level set methods, such as regularization, re-initialization and use of signed distance function.…"

"… The aim is to find efficient decompositions that simultaneously minimize the irradiation time, the cardinality of the decomposition and the setup-time to configure the multi-leaf collimator at each step of the decomposition. We propose for this NP-hard multiobjective combinatorial problem a heuristic, based on the adaptation of the two-phase Pareto local search. Experiments are carried out on different size instances and the results are reported."

"The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or to approximate the set of efficient solutions. In a first step, we classify and describe briefly the existing works, that are essentially based on the use of metaheuristics. In a second step, we propose the adaptation of the two-phase Pareto local search (2PPLS) to the resolution of the MOMKP. With this aim, we use a very-large scale neighborhood (VLSN) in the second phase of the method, that is the Pareto local search. We compare our results to state-of-the-art results and we show that we obtain results never reached before by heuristics, for the biobjective instances. Finally we consider the extension to three-objective instances."

"We consider the problem of computing a response curve for binary cellular automata — that is, the curve describing the dependence of the density of ones after many iterations of the rule on the initial density of ones. We demonstrate how this problem could be approached using rule 130 as an example. For this rule, preimage sets of finite strings exhibit recognizable patterns, and it is therefore possible to compute both cardinalities of preimages of certain finite strings and probabilities of occurrence of these strings in a configuration obtained by iterating a random initial configuration $n$ times. Response curves can be rigorously calculated in both one- and two-dimensional versions of CA rule 130. We also discuss a special case of totally disordered initial configurations, that is, random configurations where the density of ones and zeros are equal to 1/2."

"This paper presents a new numerical approach to the study of non-periodicity in signals, which can complement the maximal Lyapunov exponent method for determining chaos transitions of a given dynamical system. The proposed technique is based on the continuous wavelet transform and the wavelet multiresolution analysis. A new parameter, the \textit{scale index}, is introduced and interpreted as a measure of the degree of the signal's non-periodicity. This methodology is successfully applied to three classical dynamical systems: the Bonhoeffer-van der Pol oscillator, the logistic map, and the Henon map."