We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic
truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation
randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines
is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that
yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a
previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism. 相似文献
Haraden's model for estimating the economic cost of global warming is analysed. We change his method of discounting and some of his input parameters in a manner consistent with physical and economic theory as well as empirical data. We then find much higher costs than Haraden found. These costs are compared to the cost of reducing CO2 emissions and we find that deep cuts of the emissions of CO2 are preferable. A check of the sensitivity of our results with respect to some crucial parameter values does not alter that conclusion. 相似文献
In this paper, a five-level cascaded H-bridge multilevel inverters topology is applied on induction motor control known as direct torque control (DTC) strategy. More inverter states can be generated by a five-level inverter which improves voltage selection capability. This paper also introduces two different control methods to select the appropriate output voltage vector for reducing the torque and flux error to zero. The first is based on the conventional DTC scheme using a pair of hysteresis comparators and look up table to select the output voltage vector for controlling the torque and flux. The second is based on a new fuzzy logic controller using Sugeno as the inference method to select the output voltage vector by replacing the hysteresis comparators and lookup table in the conventional DTC, to which the results show more reduction in torque ripple and feasibility of smooth stator current. By using Matlab/Simulink, it is verified that using five-level inverter in DTC drive can reduce the torque ripple in comparison with conventional DTC, and further torque ripple reduction is obtained by applying fuzzy logic controller. The simulation results have also verified that using a fuzzy controller instead of a hysteresis controller has resulted in reduction in the flux ripples significantly as well as reduces the total harmonic distortion of the stator current to below 4 %. 相似文献
The stress relaxation behavior of acrylic–polyurethane (PU)-based graft-interpenetrating polymer networks (IPNs) was characterized via dynamic mechanical analysis (DMA) and modeled using finite element method (FEM) analysis. Stress relaxation of glassy IPN specimens was experimentally studied under flexural testing, while rubbery IPN specimens were tested in tension. The effects of varying the styrene content in the acrylic copolymer phase, compatibility of the two phases in IPNs, and changing the concentration of acrylic copolymer and PU were studied. A higher percentage of styrene content resulted in higher homogeneity of IPN specimens, and decrease in initial modulus for acrylic copolymer specimens. Additionally, glassy IPN specimens with 90% styrene shows resistance to relaxation as high as acrylic copolymer samples. Experimental results were used to develop a numerical model to study stress relaxation response of specimens. While polymer systems have been studied computationally, numerical modeling of IPN systems is still in its infancy. A three-dimensional FEM model was developed using the Generalized Maxwell model and four-term Prony series constants, which were extracted from the stress relaxation experiments. With four terms in the Prony series, a good match was observed between experimental observations and results from the FEM model. 相似文献
The Peer to Peer-Cloud (P2P-Cloud) is a suitable alternative to distributed cloud-based or peer-to-peer (P2P)-based content on a large scale. The P2P-Cloud is used in many applications such as IPTV, Video-On-Demand, and so on. In the P2P-Cloud network, overload is a common problem during overcrowds. If a node receives many requests simultaneously, the node may not be able to respond quickly to user requests, and this access latency in P2P-Cloud networks is a major problem for their users. The replication method in P2P-Cloud environments reduces the time to access and uses network bandwidth by making multiple data copies in diverse locations. The replication improves access to the information and increases the reliability of the system. The data replication's main problem is identifying the best possible placement of replica data nodes based on user requests for data access time and an NP-hard optimization problem. This paper proposes a new replica replacement to improve average access time and replica cost using fuzzy logic and Ant Colony Optimization algorithm. Ants can find the shortest path to discover the optimal node to place the duplicate file with the least access time latency. The fuzzy module evaluates the historical information of each node to analyze the pheromone value per iteration. The fuzzy membership function is also used to determine each node's degree based on the four characteristics. The simulation results showed that the access time and replica cost are improved compared to other replica replacement algorithms.
The use of colloidal quantum dots (CQDs) as a gain medium in infrared laser devices has been underpinned by the need for high pumping intensities, very short gain lifetimes, and low gain coefficients. Here, PbS/PbSSe core/alloyed-shell CQDs are employed as an infrared gain medium that results in highly suppressed Auger recombination with a lifetime of 485 ps, lowering the amplified spontaneous emission (ASE) threshold down to 300 µJ cm−2, and showing a record high net modal gain coefficient of 2180 cm−1. By doping these engineered core/shell CQDs up to nearly filling the first excited state, a significant reduction of optical gain threshold is demonstrated, measured by transient absorption, to an average-exciton population-per-dot 〈Nth〉g of 0.45 due to bleaching of the ground state absorption. This in turn have led to a fivefold reduction in ASE threshold at 〈Nth〉ASE = 0.70 excitons-per-dot, associated with a gain lifetime of 280 ps. Finally, these heterostructured QDs are used to achieve near-infrared lasing at 1670 nm at a pump fluences corresponding to sub-single-exciton-per-dot threshold (〈Nth〉Las = 0.87). This work brings infrared CQD lasing thresholds on par to their visible counterparts, and paves the way toward solution-processed infrared laser diodes. 相似文献
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal
is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or
with free reconfiguration, the problem reduces to the well-known packets scheduling problem, where the celebrated earliest-deadline-first
(EDF) strategy is optimal 1-competitive. However, EDF is not 1-competitive when there is a reconfiguration overhead. We design
an online algorithm that achieves a competitive ratio of 1−o(1) when the ratio between the minimum laxity of the packets and the number of ports tends to infinity. This is one of the
rare cases where one can design an almost 1-competitive algorithm. One ingredient of our analysis, which may be interesting
on its own right, is a perturbation theorem on EDF for the classical packets scheduling problem. Specifically, we show that
a small perturbation in the release and deadline times cannot significantly degrade the optimal throughput. This implies that
EDF is robust in the sense that its throughput is close to the optimum even when the deadlines are not precisely known. 相似文献
We consider the on-line version of the maximum vertex disjoint path problem when the underlying network is a tree. In this
problem, a sequence of requests arrives in an on-line fashion, where every request is a path in the tree. The on-line algorithm
may accept a request only if it does not share a vertex with a previously accepted request. The goal is to maximize the number
of accepted requests. It is known that no on-line algorithm can have a competitive ratio better than Ω(log n) for this problem, even if the algorithm is randomized and the tree is simply a line. Obviously, it is desirable to beat
the logarithmic lower bound. Adler and Azar (Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithm, pp. 1–10, 1999) showed that if preemption is allowed (namely, previously accepted requests may be discarded, but once a request is discarded
it can no longer be accepted), then there is a randomized on-line algorithm that achieves constant competitive ratio on the
line. In the current work we present a randomized on-line algorithm with preemption that has constant competitive ratio on
any tree. Our results carry over to the related problem of maximizing the number of accepted paths subject to a capacity constraint
on vertices (in the disjoint path problem this capacity is 1). Moreover, if the available capacity is at least 4, randomization
is not needed and our on-line algorithm becomes deterministic. 相似文献
Trunk flexion results in adverse mechanical effects on the spine and is associated with a higher incidence of low back pain. To examine the effects of creep deformation on trunk behaviours, participants were exposed to full trunk flexion in several combinations of exposure duration and external load. Trunk mechanical and neuromuscular behaviours were obtained pre- and post-exposure and during recovery using sudden perturbations. Intrinsic trunk stiffness decreased with increasing flexion duration and in the presence of the external load. Recovery of intrinsic stiffness required more time than the exposure duration and was influenced by exposure duration. Reflexive trunk responses increased immediately following exposure but recovered quickly (~2.5 min). Alterations in reflexive trunk behaviour following creep deformation exposures may not provide adequate compensation to allow for complete recovery of concurrent reductions in intrinsic stiffness, which may increase the risk of injury due to spinal instability. STATEMENT OF RELEVANCE: An increased risk of low back injury may result from flexion-induced disturbances to trunk behaviours. Such effects, however, appear to depend on the type of flexion exposure, and have implications for the design of work involving trunk flexion. 相似文献