Switching queues, cultural conventions, and social welfare

We use queuing-related behavior as an instrument for assessing the social appeal of alternative cultural norms. Specifically, we study the behavior of rational and sophisticated individuals who stand in a given queue waiting to be served, and who, in order to speed up the process, consider switching to another queue. We look at two regimes that govern the possible order in which the individuals stand should they switch to the other queue: a regime in which cultural convention, social norms, and basic notions of fairness require that the order in the initial queue is preserved, and a regime without such cultural inhibitions, in which case the order in the other queue is random, with each configuration or sequence being equally likely. We seek to find out whether in these two regimes the aggregate of the behaviors of self-interested individuals adds up to the social optimum defined as the shortest possible total waiting time. To do this, we draw on a Nash Equilibrium setting. We find that in the case of the preserved order, the equilibrium outcomes are always socially optimal. However, in the case of the random order, unless the number of individuals is small, the equilibrium outcomes are not socially optimal

Securing the Containerized Supply Chain: Analysis of Government Incentives for Private Investment

To mitigate the threat that terrorists smuggle weapons of mass destruction into the United States through maritime containers, the U.S. Bureau of Customs and Border Protection (CBP) inspects containers upon entry to domestic ports. Inspection-driven congestion is costly, and CBP provides incentives to firms to improve security upstream in the supply chain, thereby reducing the inspection burden at U.S. ports. We perform an economic analysis of this incentive program, called Customs-Trade Partnership Against Terrorism (C-TPAT), modeling in a game-theoretic framework the strategic interaction between CBP, trading firms, and terrorists. Our equilibrium results highlight the possibility that a properly run program can efficiently shift some of CBP\u27s security burden to private industry. These results also suggest that CBP may have the opportunity to use strategic delay as an incentive for firms to join. Analysis of comparative statics shows that, with increasing capacity, membership in C-TPAT systematically declines

Climbing and Walking Robots

Nowadays robotics is one of the most dynamic fields of scientific researches. The shift of robotics researches from manufacturing to services applications is clear. During the last decades interest in studying climbing and walking robots has been increased. This increasing interest has been in many areas that most important ones of them are: mechanics, electronics, medical engineering, cybernetics, controls, and computers. Today’s climbing and walking robots are a combination of manipulative, perceptive, communicative, and cognitive abilities and they are capable of performing many tasks in industrial and non- industrial environments. Surveillance, planetary exploration, emergence rescue operations, reconnaissance, petrochemical applications, construction, entertainment, personal services, intervention in severe environments, transportation, medical and etc are some applications from a very diverse application fields of climbing and walking robots. By great progress in this area of robotics it is anticipated that next generation climbing and walking robots will enhance lives and will change the way the human works, thinks and makes decisions. This book presents the state of the art achievments, recent developments, applications and future challenges of climbing and walking robots. These are presented in 24 chapters by authors throughtot the world The book serves as a reference especially for the researchers who are interested in mobile robots. It also is useful for industrial engineers and graduate students in advanced study

Network Science for IoT

The research work presented in this thesis is based on the concept and defintion of network that can spread in several and different real world contexts. Indeed, we can refer to a network in a telecommunications sense considering a collection of transmitters, receivers, and communication channels that send or are used to send information to one another. However, as a matter of fact, in nature there are other several examples of networks: the human brain is one of them. The relationship between the actors in Hollywood can be studied in terms of network as well, a generic social community can be compared to a network, eco-systems are networks of species. The recent Network Science aims at studying all these systems using a set of common mathematical methods. In the following of the thesis, we will focus on some of well known telecommunications networks issues using standard telecommunications procedures to address them, with relevant reference to video flow transmissions and management of electric vehicles networks. At the same time, different models aiming at reach the same goals in contexts that may differ from a telecommunications setup can be used. In more details, we will evaluate queueing systems, jamming problems, groups recognition in networks, and mobile computing using game theoretic approaches. It is worth noting that this aspect can be also seen in a reverse order. Indeed, we will discuss how standard telecommunications analysis can be used to investigate on problems not directly related to a telecommunications background. In particular, one of our future purposes is to investigate on the brain connectivity that is raising significant interest in the recent scientific society

Advanced data management system analysis techniques study

The state of the art of system analysis is reviewed, emphasizing data management. Analytic, hardware, and software techniques are described

Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control

An ever increasing demand for instant and reliable information on modern communication networks forces codewords to operate in a non-asymptotic regime. To achieve reliability for imperfect channels in this regime, codewords need to be retransmitted from receiver to the transmit buffer, aided by a fast feedback mechanism. Large occupancy of this buffer results in longer communication delays. Therefore, codewords need to be designed carefully to reduce transmit queue-length and thus the delay experienced in this buffer. We first study the consequences of physical layer decisions on the transmit buffer occupancy. We develop an analytical framework to relate physical layer channel to the transmit buffer occupancy. We compute the optimal code-rate for finite-length codewords operating over a correlated channel, under certain communication service guarantees. We show that channel memory has a significant impact on this optimal code-rate. Next, we study the delay in small ad-hoc networks. In particular, we find out what rates can be supported on a small network, when each flow has a certain end-to-end service guarantee. To this end, service guarantee at each intermediate link is characterized. These results are applied to study the potential benefits of setting up a network suitable for network coding in multicast. In particular, we quantify the gains of network coding over classic routing for service provisioned multicast communication over butterfly networks. In the wireless setting, we study the trade-off between communications gains achieved by network coding and the cost to set-up a network enabling network coding. In particular, we show existence of scenarios where one should not attempt to create a network suitable for coding. Insights obtained from these studies are applied to design a distributed rate control algorithm in a large network. This algorithm maximizes sum-utility of all flows, while satisfying per-flow end-to-end service guarantees. We introduce a notion of effective-capacity per communication link that captures the service requirements of flows sharing this link. Each link maintains a price and effective-capacity, and each flow maintains rate and dissatisfaction. Flows and links update their respective variables locally, and we show that their decisions drive the system to an optimal point. We implemented our algorithm on a network simulator and studied its convergence behavior on few networks of practical interest

Queue methods for variability in congested traffic

Time-dependent queue methods are extended to calculate variances of stochastic queues along with their means, and thereby provide a tool for evaluation and better understanding of travel time variability and reliability in congested traffic networks and other systems, including through probability distributions estimated from moments. Objectives include developing computationally efficient analytical methods, and achieving robustness by reflecting the underlying structure of queuing systems rather than relying on statistical fitting, New deterministic and equilibrium formulae for queue variance are developed, acting also as constraints on estimating time-dependent queues generated by a range of processes, enabling improved accuracy and reliability estimates. New methods for approximating equilibrium and dynamic probability distributions use respectively doubly-nested geometric distributions and exponentially-weighted combinations of exponential and Normal functions, avoiding the need to rely on empirical functions, costly simulation, or equilibrium distributions inappropriate in dynamic cases. For growing queues, corrections are made to the popular sheared approximation, that combines deterministic and Pollaczek-Khinchin equilibrium mean formulae in one time-dependent function. For decaying queues, a new exponential approximation is found to give better results, possibly through avoiding implicit quasi-static assumption in shearing. Predictions for M/M/1 (yield) and M/D/1 (signal) processes applied to 34 oversaturated peaks show good agreement when tested against Markov simulations based on recurrence relations. Looking to widen the range of queues amenable to time-dependent methods, dependence of stochastic signal queues on green period capacity is confirmed by an extended M/D/1 process, for which new formulae for equilibrium moments are obtained and compared with earlier approximations. A simple formulation of queuing on multiple lanes with shared service is developed, two-lane examples with turning movements showing fair match to simulation. The main new methods are implemented in a spreadsheet demonstrator program, incorporating a database of time-sliced peak cases together with a procedure for estimating dynamic probability distributions from moments