scholarly journals A deferred acceptance mechanism for decentralized, fast, and fair childcare assignment

2021 ◽  
Vol 6 (1) ◽  
pp. 59-100
Author(s):  
Tobias Reischmann ◽  
◽  
Thilo Klein ◽  
Sven Giegerich ◽  
◽  
...  
Keyword(s):  
Rank Order ◽  
First Come First Serve ◽  
Deferred Acceptance ◽  
Simulation Results ◽  
Stable Allocations ◽  
German Cities

We design and implement a program-proposing deferred acceptance mechanism with ties (DAT) and apply it to childcare assignment in two German cities. The mechanism can accommodate complementarities in providers' preferences, is fast to terminate even in larger cities, is difficult to manipulate in practice, and produces stable allocations. It can be further sped up by introducing two new features. First, allowing for an arbitrary share of facilities who participate in a centralized manner by submitting a rank-order-list over applicants. Second, by breaking ties in applicants' rank-order-lists on a first-come-first-serve basis, which sets incentives for programs to propose faster. We provide and evaluate simulation results.

scholarly journals On the Design of Efficient Hierarchic Architecture for Software Defined Vehicular Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1400
Author(s):  
Muhammad Adnan ◽  
Jawaid Iqbal ◽  
Abdul Waheed ◽  
Noor Ul Amin ◽  
Mahdi Zareei ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Traffic Management ◽  
Vehicular Networks ◽  
Scheduling Algorithm ◽  
Main Research ◽  
First Come First Serve ◽  
Computing Framework ◽  
Simulation Results

Modern vehicles are equipped with various sensors, onboard units, and devices such as Application Unit (AU) that support routing and communication. In VANETs, traffic management and Quality of Service (QoS) are the main research dimensions to be considered while designing VANETs architectures. To cope with the issues of QoS faced by the VANETs, we design an efficient SDN-based architecture where we focus on the QoS of VANETs. In this paper, QoS is achieved by a priority-based scheduling algorithm in which we prioritize traffic flow messages in the safety queue and non-safety queue. In the safety queue, the messages are prioritized based on deadline and size using the New Deadline and Size of data method (NDS) with constrained location and deadline. In contrast, the non-safety queue is prioritized based on First Come First Serve (FCFS) method. For the simulation of our proposed scheduling algorithm, we use a well-known cloud computing framework CloudSim toolkit. The simulation results of safety messages show better performance than non-safety messages in terms of execution time.

scholarly journals Timetable Design for Urban Rail Line with Capacity Constraints

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Yu-Ting Zhu ◽  
Bao-Hua Mao ◽  
Lu Liu ◽  
Ming-Gao Li
Keyword(s):  
Solution Method ◽  
Operating Cost ◽  
Capacity Constraints ◽  
Scheduling Model ◽  
Urban Rail ◽  
Proposed Model ◽  
Rail Line ◽  
First Come First Serve ◽  
Waiting Cost ◽  
Simulation Results

To design an efficient and economical timetable for a heavily congested urban rail corridor, a scheduling model is proposed in this paper. The objective of the proposed model is to find the departure time of trains at the start terminal to minimize the system cost, which includes passenger waiting cost and operating cost. To evaluate the performance of the timetable, a simulation model is developed to simulate the detailed movements of passengers and trains with strict constraints of station and train capacities. It assumes that passengers who arrive early will have more chances to access a station and board a train. The accessing and boarding processes of passengers are all based on a first-come-first-serve basis. When a station is full, passengers unable to access must wait outside until the number of waiting passengers at platform falls below a given value. When a train is full, passengers unable to board must wait at the platform for the next train to arrive. Then, based on the simulation results, a two-stage genetic algorithm is introduced to find the best timetable. Finally, a numerical example is given to demonstrate the effectiveness of the proposed model and solution method.

scholarly journals Placement Strategy for Intercommunicating Tasks of an Elastic Request in Fog-Cloud Environment

2019 ◽  
Vol 20 (2) ◽  
pp. 335-348
Author(s):  
R. Sridharan ◽  
S. Domnic
Keyword(s):  
Resource Utilization ◽  
Bin Packing ◽  
Fog Computing ◽  
Life Time ◽  
Cloud Environment ◽  
First Come First Serve ◽  
Current Resource ◽  
Simulation Results ◽  
Resource Fragmentation ◽  
Additional Constraints

Cloud computing hosts large number of modern day applications using the virtualization concept. However, end-to-end network latencies are detrimental to the performance of IoT (Internet of Things) applications like video surveillance and health monitoring. Although edge/fog computing alleviates the latency concerns to some extent, it is still not suitable for applications having intercommunicating tasks. Further, these applications can be elastic in nature and demand more tasks during their life-time. To address this gap, in this paper a network aware co-allocation strategy for the tasks of an individual applications is proposed. After modelling the problem using bin packing approach with additional constraints, the authors propose a novel heuristic IcAPER,(Inter-communication Aware Placement for Elastic Requests) algorithm. The proposed algorithm uses the network neighborhood machine for placement, once current resource is fully utilized by the application. Using CloudsimPlus simulator the performance IcAPER algorithm is compared with First Come First Serve (FCFS), Random and First Fit Decreasing (FFD) algorithms for the parameters (a) resource utilization (b) resource fragmentation and (c) Number of requests having intercommunicating tasks placed on to same PM. Extensive simulation results shows IcAPER maps 34% more tasks on to the same PM and also increase the resource utilization by 13% while decreasing the resource fragmentation by 37.8% when compared to other algorithms in our consideration.

Alternative Estimation Methods for Conjoint Analysis: A Monté Carlo Study

1981 ◽  
Vol 18 (1) ◽  
pp. 101-106 ◽  
Author(s):  
Dick R. Wittink ◽  
Philippe Cattin
Keyword(s):  
Monte Carlo ◽  
Conjoint Analysis ◽  
Predictive Validity ◽  
Simulation Study ◽  
Rank Order ◽  
Monte Carlo Study ◽  
Estimation Methods ◽  
Preference Rank ◽  
Estimation Procedures ◽  
Simulation Results

Conjoint analysis has been applied in a large number of commercial projects as well as in many noncommercial studies. Often MONANOVA, a nonmetric technique, is applied to a preference rank order obtained for a set of hypothetical objects. The authors report simulation results obtained for four alternative estimation procedures, ANOVA, LINMAP, LOGIT, and MONANOVA. The results suggest, within the limitations of the simulation study, that ANOVA may be the preferred procedure for compensatory models, whereas LINMAP is most likely to provide the best predictive validity for models with a dominant attribute.

scholarly journals DESIGN OF A HIGH-SPEED, RECONFIGURABLE, DIGITAL RANK ORDER FILTER

2010 ◽  
Vol 10 (1) ◽  
pp. 19-30
Author(s):  
George John Toscano ◽  
Pran K. Saha ◽  
A.H.M Zahirul Alam
Keyword(s):  
High Speed ◽  
Rank Order ◽  
Window Size ◽  
Binary Representation ◽  
Cmos Process ◽  
Clock Speed ◽  
Order Filter ◽  
Simulation Results ◽  
Hspice Simulation

A new architecture to realize a modular, high-speed, reconfigurable, digital Rank Order Filter (ROF) is presented in this paper. A bit-level algorithm by Kar and Pradhan has been modified in this work to implement the proposed ROF. Using the proposed digital rank selection circuit it is possible to find the element of a certain rank in a given sequence of N elements in each window in M steps, where M is the number of bits used in binary representation for the elements of the sequence. The size of the proposed ROF increases only linearly with the number of samples in each window to be ranked. The proposed ROF is also modular in nature, which means function of each part of the ROF is well defined and so the circuit can be easily expandable for larger window size. The proposed ROF has been implemented in FPGA and post-fit simulation results are presented in this paper. HSPICE simulation of the proposed ROF is also done for 0.18um CMOS process. The simulation result shows that the circuit could be operated at a clock speed of 500 MHz.

Losses of atrazine, metolachlor, prosulfuron and triasulfuron in subsurface drain water. II. Simulation results

Agronomie ◽  
2002 ◽  
Vol 22 (4) ◽  
pp. 413-425 ◽  
Author(s):  
Matteo Balderacchi ◽  
Ghasam Alavi ◽  
Ettore Capri ◽  
Alberto Vicari ◽  
Cesare Accinelli ◽  
...  
Keyword(s):  
Drain Water ◽  
Simulation Results

Study and design of dual stator permanent magnet machine with spoke-type configurations using phase-group concentrated-coil windings

2020 ◽  
Vol 64 (1-4) ◽  
pp. 1381-1389
Author(s):  
Dezhi Chen ◽  
Chengwu Diao ◽  
Zhiyu Feng ◽  
Shichong Zhang ◽  
Wenliang Zhao
Keyword(s):  
Permanent Magnet ◽  
Permanent Magnets ◽  
Low Cost ◽  
Dynamic Performance ◽  
Torque Ripple ◽  
Permanent Magnet Machine ◽  
Torque Density ◽  
Phase Group ◽  
High Torque ◽  
Simulation Results

In this paper, a novel dual-stator permanent magnet machine (DsPmSynM) with low cost and high torque density is designed. The winding part of the DsPmSynM adopts phase-group concentrated-coil windings, and the permanent magnets are arranged by spoke-type. Firstly, the winding structure reduces the amount of copper at the end of the winding. Secondly, the electromagnetic torque ripple of DsPmSynM is suppressed by reducing the cogging torque. Furthermore, the dynamic performance of DsPmSynM is studied. Finally, the experimental results are compared with the simulation results.

Sign in / Sign up

Export Citation Format

Share Document