In this paper a general formulation for finding the maximum allowable dynamic load (MADL) of flexible link mobile manipulators is presented. The main constraints used for the algorithm presented are the actuator torque capacity and the limited error bound for the end-effector during motion on the given trajectory. The precision constraint is taken into account with two boundary lines in plane w...

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formulas of its mutual information rate; and ...

In this paper, a closed-loop supply chain (CLSC) consisting of one manufacturer and supplier is considered. The capacity the limited, can increase by investing in capacity, there are different cooperation contracts among members. This paper pushes collecting activities upstream, assumes that activity be completed supplier, accepts between members, which increases involvement. Dynamic game model...

Capacity uncertainty is a common issue in the transportation planning field. However, few studies discuss the intermodal routing problem with service capacity uncertainty. Based on our previous study on the intermodal routing under deterministic capacity consideration, we systematically explore how service capacity uncertainty influences the intermodal routing decision. First of all, we adopt t...

A checkerboard constraint is a bounded measurable set 2, containing the origin. A binary labeling of the 2 lattice satisfies the checkerboard constraint if whenever 2 is labeled 1, all of the other 2-lattice points in the translate + are labeled 0. Two-dimensional channels that only allow labelings of 2 satisfying checkerboard constraints are studied. Let ( ) be the area of , and let ( ) mean t...

In this paper, an inventory model for deterioration items in a two-echelon supply chain including one retailer and one manufacturer is proposed by considering the stock and price dependent demand and capacity constraint for holding inventories. First, the model is presented as a leader-follower game in which the manufacturer announces wholesale prices. Second, the retailer decides for the order...

The class of multiple-repetition strategies is known to achieve capacity for specific discrete memoryless channels with noiseless feedback. We show, given an arbitrary discrete memoryless channel with noiseless feedback, that the repetition parameters should be chosen close to the self information of a transmission error to maximise the transmission rate. Furthermore, it is indicated how close ...

In the side constraints. Profiling the solving process of instances having numerous side constraints shown bottlenecks in lonely and capacity that were responsible of a high computation time. The implementation of lonely has been modified to substitute the set-based disjoint constraint by an equivalent that directly manage two lists of integer variables. As a result, the set variables and the c...

In spectrum-sharing systems where the secondary user (SU) opportunistically accesses the primary user (PU)’s licensed channel, the SU should satisfy both the transmit power constraint of the SU transmitter and the received power constraint at the PU receiver. This letter studies the ergodic capacity of spectrum-sharing systems in fading channels. The ergodic capacity expression along with the o...