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.     

Scalability and performance of an agent‐based network management middleware

Rapid growth of computer network sizes and uses necessitate analysis of network application middleware in terms of its scalability as well as performance. In this paper we analyze a distributed network management middleware based on agents that can be dispatched to locations where they can execute close to the managed nodes. The described middleware operates between the network protocol layer and the application layer and uses standard TCP protocol and SNMP probes to interface the network. By aggregating requests from many users into a single agent, our system allows multiple managers to probe problem areas with minimal management traffic overhead. We discuss and quantify the benefits of the described middleware by implementing real‐time network managers using our system. The main result of this paper is a comparison of scalability and efficiency of our agent‐based management middleware and traditional SNMP‐based data collection. To this end, we measured traffic in both real and simulated networks. In the latter case, we designed, used and described here a method of separating simulated application flow into separate subflows to simplify design of simulations. Copyright © 2004 John Wiley & Sons, Ltd.     

Management gaps analysis: a case study of groundwater resource management in New Zealand

The primary objective of this project is to identify gaps, whether real or perceived, that hinder effective groundwater management in New Zealand. These gaps show as gaps in information, gaps in implementation, gaps in technological and management tools, and gaps in understanding of fundamental processes. The secondary objective is to propose a management strategy to close the identified gaps. Several methods are used to meet these objectives: surveys distributed to selected staff in each regional council; the review of various written reports; the analysis of land-use databases; and private consultation within each regional council. Results show that groundwater management in New Zealand is generally reactionary with the main gaps being in strategic planning and national guidelines. Most gaps appear to be predominantly information and implementation issues. In some cases there are gaps in the understanding of fundamental processes within an aquifer system, including the long-term effects of land-use on groundwater quality. An adaptive management approach is suggested as a means of closing these gaps.     

Dual command travel times and miniload system throughput with turnover-based storage

We analyze travel times for automated storage/retrieval systems. In particular, we apply our travel time model to turnover-based storage systems and determine the mean and variance of dual command travel times. We present detailed numerical results for selected rack shape factors and ABC inventory profiles. We then investigate the effect of alternative rack configurations on travel time performance measures. We also show how to determine the throughput of miniload systems with turnover-based storage and exponentially distributed pick times.     

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.     

Partial congenital defect of the left pericardium: angiographic diagnosis and treatment by thoracoscopic pericardiectomy: case report

Twenty-six patients with an intracardiac myxoma underwent surgical resection at our institution from 1977 through 1992. Left atrial myxoma was diagnosed in 22 patients, left ventricular in 1, right atrial in 2, and right ventricular in 1. Six patients were asymptomatic; preoperative symptoms included dyspnea, arrhythmias, embolic episodes, and syncope. The diagnosis was established with transthoracic echocardiography in all cases but one. Surgery was performed in all cases with the aid of cardiopulmonary bypass with moderate hypothermia and cold crystalloid cardioplegia. One patient with a left ventricular myxoma died in a comatose state during the immediate postoperative period. Long-term clinical and echocardiographic evaluation was performed in 19 patients; results were excellent (all the patients were in New York Heart Association functional class I or II), and no recurrences were documented. The clinical characteristics, diagnostic methods, and surgical approach are presented and discussed.     

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.