The provision of transit priority has been shown to improve the performance of public transport, which is more efficient consumer of energy and space than private transport. On the other hand, the ...implementation of transit priority may also have disadvantages and penalize the general traffic. Thus, the design of the transit priority needs to balance these two opposing effects. This research aims to implement a bus priority system that utilizes a dedicated bus lane terminated upstream of the intersection, along with an additional signal, known as a pre-signal, at this location. A wide literature exists with studies of adaptive control pre-signals that are primarily focused on isolated intersections and concern simple traffic schemes. The current study investigates the performances of pre-signals in more realistic contexts through microsimulation and focuses specifically on two issues: the position of the pre-signal with respect to the main signal and the application domain of pre-signal strategies compared to the standard layouts of bus lanes, either continuous or interrupted.
Procrastination involves an irrational putting off of engaging in a course of action, in spite of expecting to be worse off for the delay. I suggest that to understand the processes underlying ...procrastination one should examine its relation to several behavioral procedures that have been studied in humans and other animals. For example, in delay discounting, smaller rewards that come sooner are often preferred over larger rewards that come later. In the context of delay discounting, procrastination can be viewed as the preference for an immediate competing activity over the delay to work on a required task. Another process similar to procrastination can be seen in free operant, temporal avoidance (or Sidman avoidance) in which an animal will receive a shock (a deadline not met) if an interval passes without a specified response (task completion). Once animals learn about the interval, they often procrastinate by waiting until the interval has almost passed before responding. Finally, research with animals suggests that the persistence of procrastination may involve a form of negative reinforcement associated with the sudden decline in anxiety or fear (relief) when the task is completed prior to the deadline. Research with animals suggests that the mechanisms responsible for human procrastination may involve systems that derive from several procedures known to produce similar behavior animals.
As first reported several decades ago, pigeons (Columba livia) sometimes choose options that provide less food over options that provide more food. This behavior has been variously referred to as ...suboptimal, maladaptive, or paradoxical because it lowers overall food intake. A great deal of research has been directed at understanding the conditions under which animals and people make suboptimal choices and the mechanisms that drive this behavior. Here, we review the literature on suboptimal choice and the variables that play a role in this phenomenon. Suboptimal choice is most likely to occur when the outcomes following a choice are uncertain, when the outcomes are delayed after the choice, and when the outcomes are signaled only on the option that provides food less often. We propose a mathematical formalization of the signal for good news (SiGN) model which assumes that a signal for a reduction in delay to food reinforces choice. We generate predictions from the model about the effect of parameters that characterize suboptimal choice and we show that, even in the absence of free parameters, the SiGN model provides a very good fit to the choice proportions of birds from a large set of conditions across studies from numerous researchers. R code for SiGN predictions and the data set are available on the Open Science Framework (https://osf.io/39qtj). We discuss limitations of the model, propose directions for future research, and discuss the general applicability of this research to understanding how rewards and signals for reward may combine to reinforce behavior.
The speed of solving and processing factors that are beneficial in reaching the desired target is one of the problematic aspects of controlling robots that has been neglected by the majority of ...researchers. Therefore, it is essential to look into the factors that influence calculation speed and goal achievement, and there should be some solutions to control robots in a lower time without sacrificing accuracy. The speed of processing and operations in wheeled mobile robots (WMRs), as well as the speed of a nonlinear model predictive control (NMPC), are examined in this article. The “Prediction horizon”, which is the most efficient element in increasing the calculations of the NMPC, is determined separately and intelligently at every step based on the magnitude of the error and the significance of the state variable by training a multilayer neural network, to decrease the time-delay in software mode. In addition, the processing speed in the hardware mode has increased due to the investigations conducted and the optimal selection of equipment effective in the speed of performing actuators, such as the use of the U2D2 interface instead of interface boards with their own processing, and the use of the pixy2 as a smart camera. The results have employed that the proposed intelligence method responds 40 to 50% faster compared to the conventional method of NMPC. Also, the path tracking error has been reduced by using the proposed algorithm due to the optimal gain extraction at each step. In addition, there is a comparison of solving speed in hardware mode between the proposed and usual methods. In this regard, about 33% increase in solving speed has been shown.
•Identification of the highly effective time-delay factors in the NMPC.•Reducing solving-time without accuracy sacrificing.•Intelligently regulating of prediction horizon gain to increase the solving-speed.•Decreasing the path tracking error due to the optimal gain extraction at each step.•The speed of processing and operations in wheeled mobile robots (WMRs).
Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, ...this approach has a significant weakness in routing because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes, and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes a new routing/scheduling back-pressure algorithm that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm .
With the increase of the electrical interconnect network complexity, the signal integrity (SI) analysis becomes crucial for the electronic RF and mixed circuit designer. Approximated and optimized ...models of printed circuit boards (PCBs) electrical interconnect network were developed. However, interconnect effect correction techniques are still needed. The present paper addresses an example of correction technique of electrical interconnect for the PCBs. The feasibility of the concept is verified by considering a distributed transmission line (TL) latency and delay correction. The proposed correction technique is based on the use of the negative group delay (NGD) circuits. The theoretical approach including the NGD cell synthesis relations are established. The innovative low- and band-pass NGD topologies are suggested respectively for the baseband and modulated signal delay reduction. The fundamental characteristics of the low- and band-pass NGD cells are examined. The proposed technique is applied to the compensation of the microstrip interconnect line delay. It was found that the NGD effects enable to compensate the signal delay in baseband frequency up to hundreds MHz with low-pass NGD circuit and 2.45GHz modulated microwave signals with band-pass NGD circuit. In both cases, the possibilities to reduce the latency and delay of some nanoseconds (ns) are performed.
By providing shared and flexible communication, computation, and storage resources along the cloud-to-things continuum, fog computing has become an attractive technology to support delay-sensitive ...applications in Internet of Things (IoT) and future wireless networks. Consider a typical heterogeneous fog network consisting of different types of fog nodes (FNs), wherein some task nodes (TNs) have computation-intensive and delay-sensitive tasks, while some helper nodes (HNs) have spare computation resources for sharing with their neighboring nodes. In order to minimize the delay of every task, these TNs and HNs should be effectively associated in a distributed manner, which is the fundamental multi-task multi-helper (MTMH) problem. To tackle this challenging problem, a potential game called paired offloading of multiple tasks (POMT) is formulated and studied. Theoretical analysis proves the existence of the Nash equilibrium (NE) for this proposed game. Further, the corresponding POMT algorithm is developed for every TN to achieve the NE of the general game. The analytical and simulation results show that our POMT algorithm can offer the near-optimal performance in system average delay and delay reduction ratio (DRR), and achieve more number of beneficial TNs, at two orders of magnitude lower complexity than a centralized optimal algorithm for computation offloading.
Spectrum scarcity and dramatically increasing demand for high data rate and high-quality video live streaming are of future cellular network design challenges. As a solution to this problem, ...cache-enabled cellular network architecture has been recently proposed. Device-to-device (D2D) communications can be exploited for distributed video content delivery, and devices can be used for caching of the video files. This can increase the capacity and reduce the end-to-end delay in cellular networks. In this study, the authors propose a new scheme for video distribution over cellular networks by exploiting full-duplex (FD) radios for D2D devices in two scenarios: (i) two nodes exchange their desired video files simultaneously and (ii) each node can concurrently transmit to and receive from two different nodes. In the latter case, an intermediate transceiver can serve one or multiple users’ file request(s) whilst capturing its desired file from another device in the vicinity. Mathematical expressions along with extensive simulations are used to compare their proposed scheme with a half-duplex scheme to show the achievable gains in terms of sum throughput, active links, and delay. They will also look into the energy cost for achieving the improvements provided by operation in FD mode.
We introduce a gossip-like protocol for covert message passing between Alice and Bob as they move in an area watched over by a warden Willie. The area hosts a multitude of Internet of (Battlefield) ...Things (Io<inline-formula> <tex-math notation="LaTeX">\beta \text{T} </tex-math></inline-formula>) objects. Alice and Bob perform random walks on a random regular graph. The Io<inline-formula> <tex-math notation="LaTeX">\beta \text{T} </tex-math></inline-formula> objects reside on the vertices of this graph, and some can serve as relays between Alice and Bob. The protocol starts with Alice splitting her message into small chunks, which she can covertly deposit to the relays she encounters. The protocol ends with Bob collecting the chunks. Alice may encode her data before the dissemination. Willie can either perform random walks as Alice and Bob do or conduct uniform surveillance of the area. In either case, he can only observe one relay at a time. We evaluate the system performance by the covertness probability and the message passing delay. In our protocol, Alice splits her message to increase the covertness probability and adds (coded) redundancy to reduce the transmission delay. The performance metrics depend on the graph, communications delay, and code parameters. We show that, in most scenarios, it is impossible to find the design parameters that simultaneously maximize the covertness probability and minimize the message delay.
PDF
