Optimization Solid Waste Management in Nablus Joint service council

The existing solid waste management system in Nablus Joint Service Council (JSC) is suffering from the absence on a real plan for collection waste from localities with a clear vehicle routes. Therefore, the total process of SWM is affected by; collected fees are not covering the real costs of SWM, and solid waste service revenues normally flow into a general municipal account. Although, about 41% of total solid waste management cost is related to waste collection (Load waste, Expenses waste disposal/Sirafi, and Expenses Landfill); high amount from this cost is related to fuel (16%). Currently, the daily transportation cost for one ton collected by Nablus JSC is 36,718.55 ILS. In this study, a dynamic waste management model is developed by a proposed liner algebra mathematical model using GAMS software program; to minimize the transportation cost of the SWM process for municipal solid waste management system for identifying optimal Waste-flow-allocation, and to assist decision makers to improve solid waste management in Nablus JSC-SWM. The model has two scenarios one for minimizing the transportations cost by identifying the best route to transfer solid waste to the nearest transfer station with in Nablus governorate (Al-Sirafi or Beta). The second scenario is to give the optimal route and cost incase a recycling process were done in both transfer stations Al-Sirafi and Beta before delivering the waste to its last distention in Zahret Al-Finjan landfill in Jenin. The modeling results are valuable for supporting the planning of Nablus JSC management practices. The total transportation costs for the current used system is 36,718.55 ILS / day while applying the first scenario of GAMS model the total daily transportation costs using two transfer station will be 32,718.94 ILS which means is only 12 % of the current used system with 3,946.03 ILS daily saving from costs. Although, the results show that applying the second scenario is the best by including a recycling and re-using processes in the two transfer stations (Beta and Al-Sirafi) before delivering the remaining solid waste after the recycling process to Zahret Al-Finjan land fill in Jenin. The second scenario will make the iv total daily transportation cost is only 17,871.94 ILS which leads to 51% reduction on the existing daily total transportation costs. In order to improve solid waste management in Nablus JSC and the served 24 local government units (LGUs), and to improve the solid waste management for the JSC’s surrounding localities the emerging conditions for the adoption and operation of the model need to be addressed through the main stakeholder collaborations under the umbrella of Ministry of Local government (MoLG) as a decision maker to encourage the solid waste sector participation and the development of technological innovations for solid waste management in Palestine.يعاني نظام إدارة النفايات الصلبة الموجود في مجلس الخدمات المشترك لإدارة النفايات الصلبة في محافظة نابلس كمعظم المجالس المشتركة لإدارة النفايات الصلبة في فلسطين من غياب خطة حقيقيه واضحة لآلية جمع و نقل النفايات من الهيئات المحلية التي يقدم لها المجلس المشترك خدمة إدارة النفايات وهي أربعة وعشرون هيئة محلية ضمن حدود محافظة نابلس. كما ولا يوجد خطة واضحة لمسار آليات المجلس المشترك لعملية جمع النفايات الصلبة. و لذلك، تتأثر العملية الكلية لإدارة النفايات الصلبة بنسبة الرسوم المحصلة من الهيئات والتي لا تغطي التكاليف الحقيقة لإدارة النفايات الصلبة من قبل المجلس المشترك هذا ويجدر الإشارة بأن معظم إيرادات خدمة إدارة النفايات الصلبة المدفوعة من المواطنين للهيئات المحلية تتدفق عادة في الحساب البنكي ً تخصيصها لتطوير خدمة إدارة النفايات العام للهيئات المحلية مما يجعل من الصعب أحيانا الصلبة في الهيئات المحلية أو مجلس الخدمات المشترك. كما يتم إنفاق ما معدله 41 ٪من إجمالي تكلفة إدارة النفايات الصلبة في مجلس خدمات نابلس على عملية جمع النفايات، و تحميلها وترحيل النفايات إلى محطة الترحيل في الصيرفي ونفقات مكب زهرة الفنجان ورسوم الطمر الصحي للنفايات الصلبة في مكب زهرة الفنجان. فيما تتراوح نسبة التكلفة المنفقة على وقود آليات المجلس المشترك 16 ٪من اجمالي تكلفة إدارة النفايات الصلبة ضمن مجلس خدمات محافظة نابلس في هذه الدراسة، تم تطوير نموذج إدارة النفايات الصلبة بواسطة نموذج رياضي مقترح باستخدام برنامج GAMS لتقليل تكلفة نقل و جمع النفايات الصلبة من خلال تحديد الآلية الأمثل لجمع النفايات الصلبة، ومساعدة صانعي القرار لتحسين إدارة النفايات الصلبة في مجلس الخدمات المشترك لإدارة النفايات الصلبة في محافظة نابلس. 87 تم استخدام البرمجة الخطية في النموذج المقترح بواسطة برنامج GAMS وتم اقتراح سيناريوهات عمل لإدارة النفايات الصلبة في مجلس خدمات محافظة نابلس. السيناريو الأول يهدف للتقليل من التكاليف المدفوعة لجمع و نقل النفايات الصلبة من 24 هيئة محلية إلى مكب زهرة الفنجان في محافظة جنين وذلك من خلال تحديد أفضل طريق لجمع و نقل النفايات الصلبة إلى أقرب محطة ً على بعد الهيئات ُ ترحيل في محافظة نابلس (محطة الصيرفي أو محطة بيتا) وذلك اعتمادا المحلية عن محطتي الترحيل. في حين أن السيناريو الثاني يعتمد على تقليل تكلفة نقل وجمع النفايات الصلبة بناء عملية إعادة استخدام لبعض ً على السيناريو الأول ولكن على أن تكون هنالك المواد القابلة للتدوير وا جلس المشترك في كل ٕ عادة استخدام لبعض النفايات المجموعة من قبل الم ً في من محطة بيتا ومحطة الصيرفي للترحيل قبل ارسال ما تبقي للمحطة النهائية ليطمر صحيا مكب زهرة الفنجان في محافظة جنين. تعتبر النتائج قيمة لدعم التخطيط لإدارة النفايات الصلبة في مجلس خدمات محافظة نابلس في حين أن مجموع تكاليف النقل اليومية للنظام الحالي المستخدم هي 55.718,36 شيكل اسرائيلي فقد أظهرت النتائج أنه في حال تطبيق السيناريو الأول من سيكون مجموع تكاليف النقل اليومية في حال استخدام محطتي ترحيل بيتا والصيرفي يكون 94.718,32 شيكل اسرائيلي وهو ما يعني ان السيناريو الأول سيعمل فقط على ما هو حوالي 12 ٪ فقط من تكاليف النظام الحالي المستخدم مع توفير يومي علي تكاليف النقل تبلغ 03.946,3 شيكل اسرائيلي.فيما قد بينت النتائج أن تطبيق السيناريو الثاني هو الأفضل في حال اعتماد السيناريو الأول بما يشمل إعادة التدوير وا النفايات الصلبة التي يتم ترحيلها لمحطتي ترحيل بيتا و الصيرفي قبل ترحيل ٕ عادة استخدام النفايات الصلبة المتبقية بعد عملية إعادة التدوير للطمر الصحي في مكب زهرة الفنجان في محافظة جنين. حيث أن إجمالي تكلفة النقل اليومي فقط 94.971,17 شيكل اسرائيلي الأمر الذي سيؤدي إلى تخفيض 51 ٪من إجمالي تكاليف النقل اليومية الحالية. وهذه النتائج تعني أنه حال تطبيق هذه الآلية في العمل سيتسنى للمجلس المشترك تقديم خدمة إدارة النفايات لعدد من الهيئات المحلية القريبة في المستقبل القريب. من أجل تحسين إدارة النفايات الصلبة في مجلس الخدمات المشترك لإدارة النفايات الصلبة في محافظة نابلس، وتحسين إدارة النفايات الصلبة للهيئات المحلية الاعضاء في المجلس المشترك و الهيئات المحلية القريبة والمحيطة فهنالك ضرورة ملحة لتعاون أصحاب المصلحة الرئيسيين تحت 88 مظلة وزارة الحكم المحلي باعتبارها صانع القرار الرئيس لإدارة النفايات على المستوي الوطني لتشجيع المشاركة في تطوير قطاع النفايات الصلبة وتطوير الابتكارات التكنولوجية لإدارة النفايات الصلبة في فلسطي

Composite engines for application to a single-stage-to-orbit vehicle

Seven composite engines were designed for application to a reusable single-stage-to-orbit vehicle. The engine designs were variations of the supercharged ejector ramjet engine. The resulting performance, weight, and drawings of each engine form a data base for establishing a potential of this class of composite engine to various missions, including the single-stage-to-orbit application. The impact of advanced technology in the design of the critical fan turbine was established

A cross-stack, network-centric architectural design for next-generation datacenters

This thesis proposes a full-stack, cross-layer datacenter architecture based on in-network computing and near-memory processing paradigms. The proposed datacenter architecture is built atop two principles: (1) utilizing commodity, off-the-shelf hardware (i.e., processor, DRAM, and network devices) with minimal changes to their architecture, and (2) providing a standard interface to the programmers for using the novel hardware. More specifically, the proposed datacenter architecture enables a smart network adapter to collectively compress/decompress data exchange between distributed DNN training nodes and assist the operating system in performing aggressive processor power management. It also deploys specialized memory modules in the servers, capable of performing general-purpose computation and network connectivity. This thesis unlocks the potentials of hardware and operating system co-design in architecting application-transparent, near-data processing hardware for improving datacenter's performance, energy efficiency, and scalability. We evaluate the proposed datacenter architecture using a combination of full-system simulation, FPGA prototyping, and real-system experiments

Novel RF CMOS Integrated Circuits and Systems for Broadband Dielectric Spectroscopy

Broadband dielectric spectroscopy has proven to be a valuable technique for characterization of chemicals and biomaterials. It has the great potential to become an indispensable and cost-effective tool in point-of-care medical applications due to its label-free and non-invasive operation. However, most of the existing dielectric spectroscopy instruments require bulky, heavy and expensive measurement set-up, restricting their use to only special applications in industry and laboratories. Therefore, integrated dielectric spectroscopy on silicon capable of direct detection of chemicals/biomaterials' complex permittivity can yield significant cost and size reduction, system integration, portability, enormous processing, and high throughput. A CMOS wideband dielectric spectroscopy system is proposed for chemical and biological material characterization. The complex permittivity detection is performed using a configurable harmonic-rejecting receiver capable of indirectly measuring the complex admittance of sensing capacitor exposed to the material-under-test (MUT) and subject to RF signal excitation with a frequency range of 0.62-10 GHz. The sensing capacitor is embedded in a voltage divider topology with a fixed capacitor and the relative variations in the magnitude and phase of the voltages across the capacitors are used to find the real and imaginary parts of the permittivity. The sensor achieves an rms permittivity error of less than 1% over the entire operation bandwidth. Using a sub-harmonic mixing scheme, the system can perform complex permittivity measurements from 0.62 to 10 GHz while requiring an input signal source with frequency range of only from 5 to 10 GHz. Thereby, the permittivity measurement system can be easily made self-sustained by implementing a 5-10 GHz frequency synthesizer on the same chip. One of the key building blocks in such a frequency synthesizer is the voltage-controlled oscillator (VCO) which has to cover an octave of frequency range. A novel low-phase-noise wide-tuning range VCO is presented using a triple-band LC resonator. The implemented VCO in 0.18μm CMOS technology achieves a continuous tuning range of 86.7% from 5.12 GHz to 12.95 GHz while drawing 5 to 10 mA current from 1-V supply. The measured phase noise at 1 MHz offset from carrier frequencies of 5.9, 9.12 and 12.25 GHz is -122.9, -117.1 and -110.5 dBc/Hz, respectively. Also, a dual-band quadrature voltage-controlled oscillator (QVCO) is presented using a transformer-based high-order LC-ring resonator which inherently provides quadrature signals without requiring noisy coupling transistors as in traditional approaches. The proposed resonator shows two possible oscillation frequencies which are exploited to realize a wide-tuning range QVCO employing a mode-switching transistor network. Due to the use of transformers, the oscillator has minimal area penalty compared to the conventional designs. The implemented prototype in a 65-nm CMOS process achieves a continuous tuning range of 77.8% from 2.75 GHz to 6.25 GHz while consuming 9.7 to 15.6 mA current from 0.6-V supply. The measured phase noise figure-of-merit (FoM) at 1 MHz offset ranges from 184 dB to 188.2 dB throughout the entire tuning range. The QVCO also exhibits good quadrature accuracy with 1.5º maximum phase error and occupies a relatively small silicon area of 0.35 mm^2

Parallel cryptanalysis

Most of today’s cryptographic primitives are based on computations that are hard to perform for a potential attacker but easy to perform for somebody who is in possession of some secret information, the key, that opens a back door in these hard computations and allows them to be solved in a small amount of time. To estimate the strength of a cryptographic primitive it is important to know how hard it is to perform the computation without knowledge of the secret back door and to get an understanding of how much money or time the attacker has to spend. Usually a cryptographic primitive allows the cryptographer to choose parameters that make an attack harder at the cost of making the computations using the secret key harder as well. Therefore designing a cryptographic primitive imposes the dilemma of choosing the parameters strong enough to resist an attack up to a certain cost while choosing them small enough to allow usage of the primitive in the real world, e.g. on small computing devices like smart phones. This thesis investigates three different attacks on particular cryptographic systems: Wagner’s generalized birthday attack is applied to the compression function of the hash function FSB. Pollard’s rho algorithm is used for attacking Certicom’s ECC Challenge ECC2K-130. The implementation of the XL algorithm has not been specialized for an attack on a specific cryptographic primitive but can be used for attacking some cryptographic primitives by solving multivariate quadratic systems. All three attacks are general attacks, i.e. they apply to various cryptographic systems; the implementations of Wagner’s generalized birthday attack and Pollard’s rho algorithm can be adapted for attacking other primitives than those given in this thesis. The three attacks have been implemented on different parallel architectures. XL has been parallelized using the Block Wiedemann algorithm on a NUMA system using OpenMP and on an Infiniband cluster using MPI. Wagner’s attack was performed on a distributed system of 8 multi-core nodes connected by an Ethernet network. The work on Pollard’s Rho algorithm is part of a large research collaboration with several research groups; the computations are embarrassingly parallel and are executed in a distributed fashion in several facilities with almost negligible communication cost. This dissertation presents implementations of the iteration function of Pollard’s Rho algorithm on Graphics Processing Units and on the Cell Broadband Engine

Preprototype independent air revitalization subsystem

The performance and maturity of a preprototype, three-person capacity, automatically controlled and monitored, self-contained independent air revitalization subsystem were evaluated. The subsystem maintains the cabin partial pressure of oxygen at 22 kPa (3.2 psia) and that of carbon dioxide at 400 Pa (3 mm Hg) over a wide range of cabin air relative humidity conditions. Consumption of water vapor by the water vapor electrolysis module also provides partial humidity control of the cabin environment. During operation, the average carbon dioxide removal efficiency at baseline conditions remained constant throughout the test at 84%. The average electrochemical depolarized concentrator cell voltage at the end of the parametric/endurance test was 0.41 V, representing a very slowly decreasing average cell voltage. The average water vapor electrolysis cell voltage increased only at a rate of 20 mu/h from the initial level of 1.67 V to the final level of 1.69 V at conclusion of the testing

Comprehensive CP Optimization for Dynamic Scheduling in Construction

Delays and cost overruns are common facts in construction projects due to its increasing complexity, the day-to-day dynamic changes, the stricter execution constraints, and the general lack of efficient scheduling tools to support the optimization of construction plans. Currently, many scheduling tools and techniques are available, in addition to a large body of literature that focus on schedule optimization. Such tools and techniques, however, do not adequately represent or incorporate various practical decisions and constraints, nor provide the project manager with the ability to examine the combinations of actions in order to either plan or bring the project back within the constraints. This research enhances the schedule optimization research by efficiently modeling real-life decisions and constraints, and develops a framework to optimize planning and corrective-action decisions; dynamically before and during construction. The development of the proposed framework starts with a basic model that suits the schedule optimization decisions at the preconstruction stage. This model is then extended to a generic model that accommodates the dynamic schedule optimization needs during construction. The enhancements and extensions are formulated in a generic mathematical formulation to optimize the schedule’s decisions at any stage. This formulation integrates a wide range of scheduling options (e.g., linear crashing, activity multimodes, overlapping, and multipath networks), and incorporates the project manager’s preferences about the corrective-action decisions’ implementation. The formulation also considers a variety of practical constraints (e.g., variable resource availability, correlated modes, and intermediate milestones); and uses a multi-objective optimization to tradeoff among the project time, cost, resources, and permissible schedule changes during construction. Based on the mathematical formulation, the proposed framework was then coded using the advanced v constraint programming tool “IBM ILOG CPLEX Optimization Studio”. To validate the model, multiple experiments on four case studies were used to prove the functionality, practicality, and its better representation of real-life construction challenges. Two of these case studies are taken from the literature to prove the ability of the comprehensive model to achieve better solutions. Construction experts were also consulted at multiple stages of this work to investigate the relevance of the framework. Introducing the proposed framework as an add-on to standard project management software is expected to change the practitioners’ perception that optimization is a theoretical and complex tool. Therefore, it helps to present optimization as a useful decision support tool for construction scheduling

Randomized Computations for Efficient and Robust Finite Element Domain Decomposition Methods in Electromagnetics

Numerical modeling of electromagnetic (EM) phenomenon has proved to become an effective and efficient tool in design and optimization of modern electronic devices, integrated circuits (IC) and RF systems. However the generality, efficiency and reliability/resilience of the computational EM solver is often criticised due to the fact that the underlying characteristics of the simulated problems are usually different, which makes the development of a general, \u27\u27black-box\u27\u27 EM solver to be a difficult task. In this work, we aim to propose a reliable/resilient, scalable and efficient finite elements based domain decomposition method (FE-DDM) as a general CEM solver to tackle such ultimate CEM problems to some extent. We recognize the rank deficiency property of the Dirichlet-to-Neumann (DtN) operators involved in the previously proposed FETI-2$\lambda$ DDM formulation and apply such principle to improve the computational efficiency and robustness of FETI-2$\lambda$ DDM. Specifically, the rank deficient DtN operator is computed by a randomized computation method that was originally proposed to approximate matrix singular value decomposition (SVD). Numerical results show a up to 35\% run-time and 75% memory saving of the DtN operators computation can be achieved on a realistic example. Later, such rank deficiency principle is incorporated into a new global DDM preconditioner (W-FETI) that is inspired by the matrix Woodbury identity. Numerical study of the eigenspectrum shows the validity of the proposed W-FETI global preconditioner. Several industrial-scaled examples show significant iterative convergence advantage of W-FETI that uses 35%-80% matrix-vector-products (MxVs) than state-of-the-art DDM solvers