Euthanasia Legislation: A Survey and A Model Act

1976 ◽  
Vol 2 (1) ◽  
pp. 41-99
Author(s):  
Ronald P. Kaplan
Keyword(s):  
Optimal Solution ◽  
State Legislators ◽  
Death With Dignity ◽  
Frequency State

With increasing frequency, state legislators have been proposing legislation which would permit euthanasia—the allowance of “death with dignity”—under certain circumstances. These proposals indicate varying degrees of awareness of the issues and problems involved in drafting euthanasia legislation. This Article focuses on such issues and problems, studies the methods proposed by legislators to deal with them, and offers a Model Euthanasia Act designed to achieve their optimal solution.

Identifying Measurement Invariant Item Sets in Cross-Cultural Settings Using an Automated Item Selection Procedure

Methodology ◽  
2018 ◽  
Vol 14 (4) ◽  
pp. 177-188 ◽  
Author(s):  
Martin Schultze ◽  
Michael Eid
Keyword(s):  
Measurement Invariance ◽  
Optimal Solution ◽  
Selection Procedure ◽  
Cross Cultural ◽  
Item Selection ◽  
Ant System ◽  
Item Quality ◽  
Ant System Algorithm ◽  
Selection For ◽  
Selection Of

Abstract. In the construction of scales intended for the use in cross-cultural studies, the selection of items needs to be guided not only by traditional criteria of item quality, but has to take information about the measurement invariance of the scale into account. We present an approach to automated item selection which depicts the process as a combinatorial optimization problem and aims at finding a scale which fulfils predefined target criteria – such as measurement invariance across cultures. The search for an optimal solution is performed using an adaptation of the [Formula: see text] Ant System algorithm. The approach is illustrated using an application to item selection for a personality scale assuming measurement invariance across multiple countries.

Empirical evidence from state legislators: How, when, and who uses research.

2020 ◽  
Vol 26 (4) ◽  
pp. 413-424
Author(s):  
Karen Bogenschneider ◽  
Bret N. Bogenschneider
Keyword(s):  
Empirical Evidence ◽  
State Legislators

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

Aplikasi Metode Hungarian Dalam Optimalisasi Waktu Penugasan Karyawan dan Keuntungan Produksi Home Industry

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Empya Charlie ◽  
Siti Rusdiana ◽  
Rini Oktavia
Keyword(s):  
Sensitivity Analysis ◽  
Optimal Solution ◽  
Optimal Scheduling ◽  
Total Work ◽  
Work Time ◽  
Hungarian Method ◽  
Total Work Time

Penelitian ini bertujuan untuk mengoptimalkan penjadwalan karyawan di CV. Karya Indah Bordir dalam melakukan tugas-tugas tertentu menggunakan metode Hungaria, serta menganalisis sensitivitas solusi optimal jika ada pengurangan waktu karyawan untuk menyelesaikan tugas-tugas. Metode Hongaria diterapkan pada proses bordir yang melibatkan 11 karyawan dan 10 tugas. Hasil penjadwalan yang optimal meminimalkan waktu produksi bordir perusahaan. Hasil penjadwalan optimal yang ditemukan adalah: karyawan 1 mengerjakan tas Mambo, karyawan 2 mengerjakan tas Elli, karyawan 3 mengerjakan tas Lonjong, karyawan 4 mengerjakan tas Tampang bunga, karyawan 6 mengerjakan tas Ransel, karyawan 7 mengerjakan tas Tima, karyawan 8 mengerjakan tas Keong, karyawan 9 mengerjakan tas Alexa, karyawan 10 mengerjakan tas Luna, dan karyawan 11 mengerjakan tas Mikha, dengan total waktu kerja adalah 13,7 jam. Setelah metode Hongaria diterapkan, CV. Karya Indah Bordir mendapat peningkatan pendapatan sebanyak 9,09%. Analisis sensitivitas dilakukan dengan mengurangi waktu karyawan dalam menyulam tas. Hasil analisis sensitivitas adalah beberapa batasan untuk variabel basis dan non basis untuk mempertahankan solusi optimal.   This research has a purpose to optimize the scheduling of employees in CV. Karya Indah Bordir in doing certain tasks using Hungarian method, as well as analyzing the sensitivity of the optimal solution if there is a reduction on the employees time to finish the tasks. The Hungarian method was applied on the embroidery process involving 11 employees and 10 tasks. The optimal scheduling result minimize the time of the embroidery production of the company. The optimal scheduling result found is: employee 1 does the Mambo bag, employee 2 does the Elli bag, employee 3 does the Lonjong bag, employee 4 does the Tampang bunga bag, employee 6 does the Ransel, employee 7 does the Tima bag, employee 8 does the Keong bag, employee 9 does the Alexa bag, employees 10 does the Luna bag, and employee 11 does the Mikha bag, with the total work time is 13,7 hours. After the Hungarian method was applied, CV. Karya Indah Bordir got the increasing revenue as much as 9,09 %. The sensitivity analysis was conducted by reducing the time of the employees take in embroidery the bags. The results of the sensitivity analysis are some boundaries for basis and non basis variables to maintain the optimal solution. 

Electing the Senate

2017 ◽  
Author(s):  
Wendy J. Schiller ◽  
Charles Stewart III
Keyword(s):  
Original Data ◽  
State Legislators ◽  
Internal Conflict ◽  
Data Set ◽  
Senate Elections ◽  
Political Actors ◽  
The Public ◽  
Seventeenth Amendment ◽  
The People ◽  
Election Process

From 1789 to 1913, U.S. senators were not directly elected by the people—instead the Constitution mandated that they be chosen by state legislators. This radically changed in 1913, when the Seventeenth Amendment to the Constitution was ratified, giving the public a direct vote. This book investigates the electoral connections among constituents, state legislators, political parties, and U.S. senators during the age of indirect elections. The book finds that even though parties controlled the partisan affiliation of the winning candidate for Senate, they had much less control over the universe of candidates who competed for votes in Senate elections and the parties did not always succeed in resolving internal conflict among their rank and file. Party politics, money, and personal ambition dominated the election process, in a system originally designed to insulate the Senate from public pressure. The book uses an original data set of all the roll call votes cast by state legislators for U.S. senators from 1871 to 1913 and all state legislators who served during this time. Newspaper and biographical accounts uncover vivid stories of the political maneuvering, corruption, and partisanship—played out by elite political actors, from elected officials, to party machine bosses, to wealthy business owners—that dominated the indirect Senate elections process. The book raises important questions about the effectiveness of Constitutional reforms, such as the Seventeenth Amendment, that promised to produce a more responsive and accountable government.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

Sign in / Sign up

Export Citation Format

Share Document