Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.     

Life is pleasant--and memory helps to keep it that way!

People's recollections of the past are often positively biased. This bias has 2 causes. The 1st cause lies in people's perceptions of events. The authors review the results of several studies and present several new comparative analyses of these studies, all of which indicate that people perceive events in their lives to more often be pleasant than unpleasant. A 2nd cause is the fading affect bias: The affect associated with unpleasant events fades faster than the affect associated with pleasant events. The authors review the results of several studies documenting this bias and present evidence indicating that dysphoria (mild depression) disrupts such bias. Taken together, this evidence suggests that autobiographical memory represents an important exception to the theoretical claim that bad is stronger than good. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Large deflection dynamics and control for planar continuum robots

This paper focuses on a class of robot manipulators termed "continuum" robots - robots that exhibit behavior similar to tentacles, trunks, and snakes. In previous work, we studied details of the mechanical design, kinematics, path-planning and small-deflection dynamics for continuum robots such as the Clemson "tentacle manipulator". In this paper, we discuss the dynamics of a planar continuum backbone section, incorporating a large-deflection dynamic model. Based on these dynamics, we formulate a vibration-damping setpoint controller, and include experimental results to illustrate the efficacy of the proposed controller.     

K-winner networks.

A special class of mutually inhibitory networks is analyzed, and parameters for reliable K-winner performance are presented. The network dynamics are modeled using interactive activation, and results are compared with the sigmoid model. For equal external inputs, network parameters that select the units with the larger initial activations (the network converges to the nearest stable state) are derived. Conversely, for equal initial activations, networks that select the units with larger external inputs (the network converges to the lowest energy stable state) are derived. When initial activations are mixed with external inputs, anomalous behavior results. These discrepancies are analyzed with several examples. Restrictions on initial states are derived which ensure accurate K-winner performance when unequal external inputs are used.