What shapes the delay in the Nobel Prize discoveries? A research note

Scientometrics - The scope of this study is to shed light on the determinants of the time gap between the publication of a Nobel discovery and the bestowment of the prize across three science...     

Externally bonded grids as strengthening and seismic retrofitting materials of masonry panels

Externally bonded grids are used in this study as a means of increasing the load-carrying and deformation capacity of unreinforced masonry (URM) walls subjected to cyclic loading. The experimental investigation was carried out on two groups of medium-scale, single-wythe wallettes consisting of either perforated fired clay bricks, or solid stone blocks. The specimens were subjected to cyclic loading which induced in-plane flexure combined with axial force, out-of-plane flexure and in-plane shear with axial force. The parameters considered were the number of strengthening layers (one or two layers, applied on both sides), the type of grid (open mesh structures comprising carbon, glass or basalt fibers and polypropylene or polyester), the type of bonding agent (mortars of different compositions or epoxy resin) and the compressive stress level applied to specimens undergoing in-plane loading. Based on the findings of this work the use of externally bonded grids comprises a promising solution for the structural upgrade of existing masonry structures.     

A novel family of compression algorithms for ECG and other semiperiodical, one-dimensional, biomedical signals

In this paper, a novel family of compression algorithms is presented, which is designed to exploit the redundancy of one-dimensional (1-D) semiperiodical biomedical signals resulting from the cyclic nature of the underlying physical process. The basic idea is that a pool of past-seen cycles is maintained and cycles to be encoded can be stored as transformed versions of those residing in the pool. Conceptually, this approach is an extension of dictionary-based coding schemes used for text compression to signal patterns residing in an n-dimensional space. A cycle transformation method is introduced in order to render the pattern matching process practical and to enable cycle substitution. Based on the principles of the algorithmic family and this transformation method, an electrocardiogram (ECG)-oriented algorithm is implemented and thoroughly tested. The performance of this implementation is examined theoretically and deductions about the optimal algorithm settings are made. The ECG compression algorithm is superior to the average beat subtraction algorithm as proposed by Hamilton and Tompkins in cases where high compression ratios are required.     

Same Land Cover,Same Land Use at the Large Scale,Different Landscapes at the Small Scale: Landscape Change in Olive Plantations on Lesvos Island,Greece

In this paper, agricultural landscape change at the small scale (for example, at the farm and field level) is studied to conceptualize the processes that change these landscapes (such as features, forms and functions) according to the decisions that farmers make. The case study is olive plantations on the island of Lesvos, Greece. The five-year differences in land cover, land use and landscape at the small scale of a number of olive fields in the same area are studied in three dimensions: symbolic, productive and ecological, with data that come from the observation of practices and vegetation measurements. A conceptual framework is constructed that links the changes of six different landscapes at the individual olive field level with specific management choices of farmers. Findings demonstrate that although olive plantations are of the same land cover and land use class as at the large scale, diverging practices create different landscapes at the small scale along a continuous line with many intermediate cases. The findings also demonstrate that the whole system is dynamic, with the different small-scale landscapes changing into each other continuously due to different practices. Understanding this dynamic diversity requires studying human interventions at the right scale, the one that corresponds to the scale of the changes at the farm.     

Quantum Hall effects in graphene-based two-dimensional electron systems

In this article we review the quantum Hall physics of graphene-based two-dimensional electron systems, with a special focus on recent experimental and theoretical developments. We explain why graphene and bilayer graphene can be viewed respectively as J D 1 and 2 chiral two-dimensional electron gases (C2DEGs), and why this property frames their quantum Hall physics. The current status of experimental and theoretical work on the role of electron-electron interactions is reviewed at length with an emphasis on unresolved issues in the field, including the role of disorder in current experiments. Special attention is given to the interesting low magnetic field limit, and to the relationship between quantum Hall effects and the spontaneous anomalous Hall effects that might occur in bilayer graphene systems in the absence of a magnetic field.     

On minimizing the resource consumption of cloud applications using process migrations

According to the pay-per-use model adopted in clouds, the more resources an application running in a cloud computing environment consumes, the greater the amount of money the owner of the corresponding application will be charged. Therefore, applying intelligent solutions to minimize the resource consumption is of great importance. In this paper, we study the problem of identifying an assignment scheme between the interacting components of an application, such as processes and virtual machines, and the computing nodes of a cloud system, such that the total amount of resources consumed by the respective application is minimized. Because centralized solutions are deemed unsuitable for large distributed systems or large-scale applications, we propose a fully distributed algorithm (called DRA) to overcome scalability issues. DRA takes decisions concerning the transition from one assignment scheme to another in a dynamic way, based solely on local information. We also propose and test two modifications of the basic DRA algorithm to deal better with the heterogeneity of cloud servers in terms of capacity constraints. We must note that we capture heterogeneity regarding the network model. Through theoretical analysis, we formally prove that DRA achieves convergence and always provides an optimal solution for tree-based networks in the uncapacitated case. Moreover, we prove through experimental evaluation that DRA achieves up to 55% network cost reduction when compared to the most recent algorithm in the literature. We also show that the proposed modifications of DRA improve the algorithm’s performance considerably in the case where servers have limited capacity.     

New algorithms for max restricted path consistency

Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that enforces a higher order of consistency than arc consistency. Despite the strong pruning that can be achieved, maxRPC is rarely used because existing maxRPC algorithms suffer from overheads and redundancies as they can repeatedly perform many constraint checks without triggering any value deletions. In this paper we propose and evaluate techniques that can boost the performance of maxRPC algorithms by eliminating many of these overheads and redundancies. These include the combined use of two data structures to avoid many redundant constraint checks, and the exploitation of residues to quickly verify the existence of supports. Based on these, we propose a number of closely related maxRPC algorithms. The first one, maxRPC3, has optimal O(end ³) time complexity, displays good performance when used stand-alone, but is expensive to apply during search. The second one, maxRPC3 ^rm , has O(en ² d ⁴) time complexity, but a restricted version with O(end ⁴) complexity can be very efficient when used during search. The other algorithms are simple modifications of maxRPC3 ^rm . All algorithms have O(ed) space complexity when used stand-alone. However, maxRPC3 has O(end) space complexity when used during search, while the others retain the O(ed) complexity. Experimental results demonstrate that the resulting methods constantly outperform previous algorithms for maxRPC, often by large margins, and constitute a viable alternative to arc consistency on some problem classes.     

Jxta-Overlay: An interface for efficient peer selection in P2P JXTA-based systems

In this paper we address the problem of the efficient peer selection in P2P distributed platforms. To this end, we have developed a P2P distributed platform using Sun's JXTA technology, which is endowed with resource brokerage strategies to efficiently select peers using four selection models: (a) economic scheduling model; (b) priced-based model; (c) peer-priority selection model; and, (d) random selection model. Next, we have deployed the P2P platform in a real network using nodes of the PlanetLab and have experimentally evaluated the performance of the peer selection models. The P2P platform offers a user-friendly interface for efficient peer selection and configuration of the P2P platform.     

Parallel algorithms for reducing derivation time of distinguishing experiments for nondeterministic finite state machines

Many approaches have been proposed for deriving tests from finite state machine (FSM) specifications with respect to some established coverage criteria. A fundamental core problem in FSM-based testing relates to the derivation of input sequences that can distinguish states of an FSM specification, aka distinguishing sequences. A major effort in the construction of these sequences is based on the derivation of a successors search-tree labeled by sets of pairs of states of the given machine. We aim at reducing the time associated with such constructions through the use of state-of-the-art parallel technologies. Namely, we propose a parallel algorithm that we implement and evaluate on multicore CPUs and on many-core GPUs. We evaluate two alternative GPU implementations that use the CUDA and Thrust software platforms and a network of workstations based solution. The latter sports a workload partitioning based on Divisible Load Theory. A rigorous set of experiments highlights the differences of the proposed implementations in terms of execution time and speedup.     

A mechanism that provides incentives for truthful feedback in peer-to-peer systems

We propose a mechanism for providing the incentives for reporting truthful feedback in a peer-to-peer system for exchanging services (or content). This mechanism is to complement reputation mechanisms that employ ratings’ feedback on the various transactions in order to provide incentives to peers for offering better services to others. Under our approach, each of the transacting peers (rather than just the client) submits a rating on the performance of their mutual transaction. If these are in disagreement, then both transacting peers are punished, since such an occasion is a sign that one of them is lying. The severity of each peer’s punishment is determined by his corresponding non-credibility metric; this is maintained by the mechanism and evolves according to the peer’s record. When under punishment, a peer does not transact with others. We model the punishment effect of the mechanism in a peer-to-peer system as a Markov chain that is experimentally proved to be very accurate. According to this model, the credibility mechanism leads the peer-to-peer system to a desirable steady state isolating liars. Then, we define a procedure for the optimization of the punishment parameters of the mechanism for peer-to-peer systems of various characteristics. We experimentally prove that this optimization procedure is effective and necessary for the successful employment of the mechanism in real peer-to-peer systems. Then, the optimized credibility mechanism is combined with reputation-based policies to provide a complete solution for high performance and truthful rating in peer-to-peer systems. The combined mechanism was experimentally proved to deal very effectively with large fractions of collaborated liar peers that follow static or dynamic rational lying strategies in peer-to-peer systems with dynamically renewed population, while the efficiency loss induced to sincere peers by the presence of liars is diminished. Finally, we describe the potential implementation of the mechanism in real peer-to-peer systems.