Self-organized criticality in dynamics without branching

We demonstrate the phenomenon of self-organized criticality (SOC) in a simple random walk model described by a random walk of a myopic ant, i.e., a walker who can see only nearest neighbors. The ant acts on the underlying lattice aiming at uniform digging, i.e., reduction of the height profile of the surface but is unaffected by the underlying lattice. In one, two, and three dimensions we have explored this model and have obtained power laws in the time intervals between consecutive events of "digging." Being a simple random walk, the power laws in space translate to power laws in time. We also study the finite size scaling of asymptotic scale invariant process as well as dynamic scaling in this system. This model differs qualitatively from the cascade models of SOC.

Optical diffraction of second-harmonic signals in the LiBO2-Nb2O5 glasses induced by self-organized LiNbO3 crystallites

The nanocrystallites ( ≈ 3 nm) of LiNbO3, evolved in the (100−x)LiBO2-xNb2O5 (5x20, in molar ratio) glass system exhibited intense second-harmonic signals in transmission mode when exposed to infrared (IR) light at λ = 1064 nm. The second-harmonic waves were found to undergo optical diffraction which was attributed to the presence of self-organized submicrometer-sized LiNbO3 crystallites that were grown within the glass matrix along the parallel damage fringes created by the IR laser radiation. Micro-Raman studies carried out on the laser-irradiated samples confirmed the self-organized crystallites to be LiNbO3.

Stochastic optimization for adaptive labor staffing in service systems

Service systems are labor intensive. Further, the workload tends to vary greatly with time. Adapting the staffing levels to the workloads in such systems is nontrivial due to a large number of parameters and operational variations, but crucial for business objectives such as minimal labor inventory. One of the central challenges is to optimize the staffing while maintaining system steady-state and compliance to aggregate SLA constraints. We formulate this problem as a parametrized constrained Markov process and propose a novel stochastic optimization algorithm for solving it. Our algorithm is a multi-timescale stochastic approximation scheme that incorporates a SPSA based algorithm for ‘primal descent' and couples it with a ‘dual ascent' scheme for the Lagrange multipliers. We validate this optimization scheme on five real-life service systems and compare it with a state-of-the-art optimization tool-kit OptQuest. Being two orders of magnitude faster than OptQuest, our scheme is particularly suitable for adaptive labor staffing. Also, we observe that it guarantees convergence and finds better solutions than OptQuest in many cases.

Certificate-less on-demand public key management (CLPKM) for self-organized MANETs

In this paper, we have proposed a novel certificate-less on-demand public key management (CLPKM) protocol for self-organized MANETs. The protocol works on flat network architecture, and distinguishes between authentication layer and routing layer of the network. We put an upper limit on the length of verification route and use the end-to-end trust value of a route to evaluate its strength. The end-to-end trust value is used by the protocol to select the most trusted verification route for accomplishing public key verification. Also, the protocol uses MAC function instead of RSA certificates to perform public key verification. By doing this, the protocol saves considerable computation power, bandwidth and storage space. The saved storage space is utilized by the protocol to keep a number of pre-established routes in the network nodes, which helps in reducing the average verification delay of the protocol. Analysis and simulation results confirm the effectiveness of the proposed protocol.

Division of Labor in Hand Usage in Free- Ranging Bonnet Macaques, Macaca radiata

Primates exhibit laterality in hand usage either in terms of (a) hand with which an individual solves a task or while solving a task that requires both hands, executes the most complex action, that is, hand preference, or (b) hand with which an individual executes actions most efficiently, that is, hand performance. Observations from previous studies indicate that laterality in hand usage might reflect specialization of the two hands for accomplishing tasks that require maneuvering dexterity or physical strength. However, no existing study has investigated handedness with regard to this possibility. In this study, we examined laterality in hand usage in urban free-ranging bonnet macaques, Macaca radiata with regard to the above possibility. While solving four distinct food extraction tasks which varied in the number of steps involved in the food extraction process and the dexterity required in executing the individual steps, the macaques consistently used one hand for extracting food (i.e., task requiring maneuvering dexterity)the maneuvering hand, and the other hand for supporting the body (i.e., task requiring physical strength)the supporting hand. Analogously, the macaques used the maneuvering hand for the spontaneous routine activities that involved maneuvering in three-dimensional space, such as grooming, and hitting an opponent during an agonistic interaction, and the supporting hand for those that required physical strength, such as pulling the body up while climbing. Moreover, while solving a task that ergonomically forced the usage of a particular hand, the macaques extracted food faster with the maneuvering hand as compared to the supporting hand, demonstrating the higher maneuvering dexterity of the maneuvering hand. As opposed to the conventional ideas of handedness in non-human primates, these observations demonstrate division of labor between the two hands marked by their consistent usage across spontaneous and experimental tasks requiring maneuvering in three-dimensional space or those requiring physical strength. Am. J. Primatol. 76:576-585, 2014. (c) 2013 Wiley Periodicals, Inc.

Self-organized public key management in MANETs with enhanced security and without certificate-chains

In the self-organized public key management approaches, public key verification is achieved through verification routes constituted by the transitive trust relationships among the network principals. Most of the existing approaches do not distinguish among different available verification routes. Moreover, to ensure stronger security, it is important to choose an appropriate metric to evaluate the strength of a route. Besides, all of the existing self-organized approaches use certificate-chains for achieving authentication, which are highly resource consuming. In this paper, we present a self-organized certificate-less on-demand public key management (CLPKM) protocol, which aims at providing the strongest verification routes for authentication purposes. It restricts the compromise probability for a verification route by restricting its length. Besides, we evaluate the strength of a verification route using its end-to-end trust value. The other important aspect of the protocol is that it uses a MAC function instead of RSA certificates to perform public key verifications. By doing this, the protocol saves considerable computation power, bandwidth and storage space. We have used an extended strand space model to analyze the correctness of the protocol. The analytical, simulation, and the testbed implementation results confirm the effectiveness of the proposed protocol. (c) 2014 Elsevier B.V. All rights reserved.

Directing peptide conformation with centrally positioned pre-organized dipeptide segments: studies of a 12-residue helix and beta-hairpin

Secondary structure formation in oligopeptides can be induced by short nucleating segments with a high propensity to form hydrogen bonded turn conformations. Type I/III turns facilitate helical folding while type II'/I' turns favour hairpin formation. This principle is experimentally verified by studies of two designed dodecapeptides, Boc-Val-Phe-Leu-Phe-Val-Aib-Aib-Val-Phe-Leu-Phe-Val-OMe 1 and Boc-Val-Phe-Leu-Phe-Val- (D) Pro- (L) Pro-Val-Phe-Leu-Phe-Val-OMe 2. The N- and C-terminal flanking pentapeptide sequences in both cases are identical. Peptide 1 adopts a largely alpha-helical conformation in crystals, with a small 3(10) helical segment at the N-terminus. The overall helical fold is maintained in methanol solution as evidenced by NMR studies. Peptide 2 adopts an antiparallel beta-hairpin conformation stabilized by 6 interstrand hydrogen bonds. Key nuclear Overhauser effects (NOEs) provide evidence for the antiparallel beta-hairpin structure. Aromatic proton chemical shifts provide a clear distinction between the conformation of peptides 1 (helical) and 2 (beta-hairpin). The proximity of facing aromatic residues positioned at non-hydrogen bonding positions in the hairpin results in extensively ring current shifted proton resonances in peptide 2.

Simultaneous perturbation methods for adaptive labor staffing in service systems

We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.

Dissecting Ubiquitin Folding Using the Self-Organized Polymer Model

Folding of Ubiquitin (Ub), a functionally important protein found in eukaryotic organisms, is investigated at low and neutral pH at different temperatures using simulations of the coarse-grained self-organized-polymer model with side chains (SOP-SC). The melting temperatures (T-m's), identified with the peaks in the heat capacity curves, decrease as pH decreases, in qualitative agreement with experiments. The calculated radius of gyration, showing dramatic variations with pH, is in excellent agreement with scattering experiments. At T-m Ub folds in a two-state manner at low and neutral pH. Clustering analysis of the conformations sampled in equilibrium folding trajectories at T-m with multiple transitions between the folded and unfolded states, shows a network of metastable states connecting the native and unfolded states. At low and neutral pH, Ub folds with high probability through a preferred set of conformations resulting in a pH-dependent dominant folding pathway. Folding kinetics reveal that Ub assembly at low pH occurs by multiple pathways involving a combination of nucleation-collapse and diffusion collision mechanism. The mechanism by which Ub folds is dictated by the stability of the key secondary structural elements responsible for establishing long-range contacts and collapse of Ub. Nucleation collapse mechanism holds if the stability of these elements are marginal, as would be the case at elevated temperatures. If the lifetimes associated with these structured microdomains are on the order of hundreds of microseconds, then Ub folding follows the diffusion collision mechanism with intermediates, many of which coincide with those found in equilibrium. Folding at neutral pH is a sequential process with a populated intermediate resembling that sampled at equilibrium. The transition state structures, obtained using a P-fold analysis, are homogeneous and globular with most of the secondary and tertiary structures being native-like. Many of our findings for both the thermodynamics and kinetics of folding are not only in agreement with experiments but also provide missing details not resolvable in standard experiments. The key prediction that folding mechanism varies dramatically with pH is amenable to experimental tests.