Search results for: Vehicle Routing Problem with Hard Time Windows
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 24663

Search results for: Vehicle Routing Problem with Hard Time Windows

24453 Review for Mechanical Tests of Corner Joints on Wooden Windows and Effects to the Stiffness

Authors: Milan Podlena, Stepan Hysek, Jiri Prochazka, Martin Bohm, Jan Bomba

Abstract:

Corner joints are the weakest part of windows, where the members are connected together. Since the dimensions of the windows started become bigger, the strength requirements for corner joints started to increase as well. Therefore, the aim of this study was to test the samples of corner joints of wooden windows. Moisture content of test specimens was stabilized in the climate chamber. After conditioning, test specimens were loaded in the laboratory conditions onto an universal testing machine and the failure load was measured. Data was recalculated by using goniometric, bending moment and stiffness equation to the stiffness coefficients and the bending moments were investigated. The results showed difference that was observed for the mortise with tenon joint and the dowel joint. This difference was explained by a varied adhesive bond area, which is related to the dimensions of dowels (diameter and length) as well. The bending moments and stiffness ware (except of type of corner joint) also affected by type of used adhesive, type of dowels and wood species.

Keywords: corner joint, wooden window, bending moment, stiffness

Procedia PDF Downloads 188
24452 Existence and Uniqueness of Solutions to Singular Higher Order Two-Point BVPs on Time Scales

Authors: Zhenjie Liu

Abstract:

This paper investigates the existence and uniqueness of solutions for singular higher order boundary value problems on time scales by using mixed monotone method. The theorems obtained are very general. For the different time scale, the problem may be the corresponding continuous or discrete boundary value problem.

Keywords: mixed monotone operator, boundary value problem, time scale, green's function, positive solution, singularity

Procedia PDF Downloads 233
24451 A Novel Methodology for Browser Forensics to Retrieve Searched Keywords from Windows 10 Physical Memory Dump

Authors: Dija Sulekha

Abstract:

Nowadays, a good percentage of reported cybercrimes involve the usage of the Internet, directly or indirectly for committing the crime. Usually, Web Browsers leave traces of browsing activities on the host computer’s hard disk, which can be used by investigators to identify internet-based activities of the suspect. But criminals, who involve in some organized crimes, disable browser file generation feature to hide the evidence while doing illegal activities through the Internet. In such cases, even though browser files were not generated in the storage media of the system, traces of recent and ongoing activities were generated in the Physical Memory of the system. As a result, the analysis of Physical Memory Dump collected from the suspect's machine retrieves lots of forensically crucial information related to the browsing history of the Suspect. This information enables the cyber forensic investigators to concentrate on a few highly relevant selected artefacts while doing the Offline Forensics analysis of storage media. This paper addresses the reconstruction of web browsing activities by conducting live forensics to identify searched terms, downloaded files, visited sites, email headers, email ids, etc. from the physical memory dump collected from Windows 10 Systems. Well-known entry points are available for retrieving all the above artefacts except searched terms. The paper describes a novel methodology to retrieve the searched terms from Windows 10 Physical Memory. The searched terms retrieved in this way can be used for doing advanced file and keyword search in the storage media files reconstructed from the file system recovery in offline forensics.

Keywords: browser forensics, digital forensics, live Forensics, physical memory forensics

Procedia PDF Downloads 84
24450 Success Rate of Endotracheal Intubation Using Inline Stabilization with and without Cervical Hard Collar; A Comparative Study

Authors: Welawat Tienpratarn, Chaiyaporn Yuksen, Kasamon Aramvanitch, Karn Suttapanit, Yahya Mankong, Nussareen Yaemluksanalert, Sansanee Meesawad

Abstract:

Introduction : Application of a rigid cervical collar may interfere with the laryngeal view, and potentially lead to failed endotracheal intubation (ETI). This study aimed to compare intubation success rates while performing inline stabilization with and without cervical hard collar. Methods : This randomized prospective comparative study included paramedics working in the Department of Emergency Medicine, Ramathibodi Hospital, Mahidol University, Bangkok, Thailand to compare the success rates of endotracheal intubation on manikin using inline stabilization with and without cervical hard collar. Results : 125 participants were evaluated; 63 in the rigid cervical collar and 62 in the non-cervical hard collar group. The rate of successful intubation was significantly higher using manual stabilization without cervical hard collar (61 (96.8%) vs. 55 (88.7%); p=0.048). The time required to successfully perform intubation was also shorter, with manual stabilization only (14.1 ±20.9 vs. 18.9±29.0; p = 0.081). Conclusion : It seems that, removal of the rigid cervical collar during ETI in patients with suspected traumatic spine injury could increase the intubation success rate.

Keywords: ntubation, Intratracheal, Spinal Injuries, Multiple trauma

Procedia PDF Downloads 98
24449 Analysis of Formation Methods of Range Profiles for an X-Band Coastal Surveillance Radar

Authors: Nguyen Van Loi, Le Thanh Son, Tran Trung Kien

Abstract:

The paper deals with the problem of the formation of range profiles (RPs) for an X-band coastal surveillance radar. Two popular methods, the difference operator method, and the window-based method, are reviewed and analyzed via two tests with different datasets. The test results show that although the original window-based method achieves a better performance than the difference operator method, it has three main drawbacks that are the use of 3 or 4 peaks of an RP for creating the windows, the extension of the window size using the power sum of three adjacent cells in the left and the right sides of the windows and the same threshold applied for all types of vessels to finish the formation process of RPs. These drawbacks lead to inaccurate RPs due to the low signal-to-clutter ratio. Therefore, some suggestions are proposed to improve the original window-based method.

Keywords: range profile, difference operator method, window-based method, automatic target recognition

Procedia PDF Downloads 98
24448 Estimation of Optimum Parameters of Non-Linear Muskingum Model of Routing Using Imperialist Competition Algorithm (ICA)

Authors: Davood Rajabi, Mojgan Yazdani

Abstract:

Non-linear Muskingum model is an efficient method for flood routing, however, the efficiency of this method is influenced by three applied parameters. Therefore, efficiency assessment of Imperialist Competition Algorithm (ICA) to evaluate optimum parameters of non-linear Muskingum model was addressed through this study. In addition to ICA, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) were also used aiming at an available criterion to verdict ICA. In this regard, ICA was applied for Wilson flood routing; then, routing of two flood events of DoAab Samsami River was investigated. In case of Wilson flood that the target function was considered as the sum of squared deviation (SSQ) of observed and calculated discharges. Routing two other floods, in addition to SSQ, another target function was also considered as the sum of absolute deviations of observed and calculated discharge. For the first floodwater based on SSQ, GA indicated the best performance, however, ICA was on first place, based on SAD. For the second floodwater, based on both target functions, ICA indicated a better operation. According to the obtained results, it can be said that ICA could be used as an appropriate method to evaluate the parameters of Muskingum non-linear model.

Keywords: Doab Samsami river, genetic algorithm, imperialist competition algorithm, meta-exploratory algorithms, particle swarm optimization, Wilson flood

Procedia PDF Downloads 475
24447 The Effect of Gross Vehicle Weight on the Stability of Heavy Vehicle during Cornering

Authors: Nurzaki Ikhsan, Ahmad Saifizul Abdullah, Rahizar Ramli

Abstract:

One of the functions of the commercial heavy vehicle is to safely and efficiently transport goods and people. Due to its size and carrying capacity, it is important to study the vehicle dynamic stability during cornering. Study has shown that there are a number of overloaded heavy vehicles or permissible gross vehicle weight (GVW) violations recorded at selected areas in Malaysia assigned by its type and category. Thus, the objective of this study is to investigate the correlation and effect of the GVW on heavy vehicle stability during cornering event using simulation. Various selected heavy vehicle types and category are simulated using IPG/Truck Maker® with different GVW and road condition (coefficient of friction of road surface), while the speed, driver characteristic, center of gravity of load and road geometry are constant. Based on the analysis, the relationship between GVW and lateral acceleration were established. As expected, on the same value of coefficient of friction, the maximum lateral acceleration would be increased as the GVW increases.

Keywords: heavy vehicle, road safety, vehicle stability, lateral acceleration, gross vehicle weight

Procedia PDF Downloads 504
24446 The Hospitals Residents Problem with Bounded Length Preference List under Social Stability

Authors: Ashish Shrivastava, C. Pandu Rangan

Abstract:

In this paper, we consider The Hospitals Residents problem with Social Stability (HRSS), where hospitals and residents can communicate only through the underlying social network. Those residents and hospitals which don not have any social connection between them can not communicate and hence they cannot be a social blocking pair with respect to a socially stable matching in an instance of hospitals residents problem with social stability. In large scale matching like NRMP or Scottish medical matching scheme etc. where set of agents, as well as length of preference lists, are very large, social stability is a useful notion in which members of a blocking pair could block a matching if and only if they know the existence of each other. Thus the notion of social stability in hospitals residents problem allows us to increase the cardinality of the matching without taking care of those blocking pairs which are not socially connected to each other. We know that finding a maximum cardinality socially stable matching, in an instance, of HRSS is NP-hard. This motivates us to solve this problem with bounded length preference lists on one side. In this paper, we have presented a polynomial time algorithm to compute maximum cardinality socially stable matching in a HRSS instance where residents can give at most two length and hospitals can give unbounded length preference list. Preference lists of residents and hospitals will be strict in nature.

Keywords: matching under preference, socially stable matching, the hospital residents problem, the stable marriage problem

Procedia PDF Downloads 253
24445 Definition and Core Components of the Role-Partner Allocation Problem in Collaborative Networks

Authors: J. Andrade-Garda, A. Anguera, J. Ares-Casal, M. Hidalgo-Lorenzo, J.-A. Lara, D. Lizcano, S. Suárez-Garaboa

Abstract:

In the current constantly changing economic context, collaborative networks allow partners to undertake projects that would not be possible if attempted by them individually. These projects usually involve the performance of a group of tasks (named roles) that have to be distributed among the partners. Thus, an allocation/matching problem arises that will be referred to as Role-Partner Allocation problem. In real life this situation is addressed by negotiation between partners in order to reach ad hoc agreements. Besides taking a long time and being hard work, both historical evidence and economic analysis show that such approach is not recommended. Instead, the allocation process should be automated by means of a centralized matching scheme. However, as a preliminary step to start the search for such a matching mechanism (or even the development of a new one), the problem and its core components must be specified. To this end, this paper establishes (i) the definition of the problem and its constraints, (ii) the key features of the involved elements (i.e., roles and partners); and (iii) how to create preference lists both for roles and partners. Only this way it will be possible to conduct subsequent methodological research on the solution method.     

Keywords: collaborative network, matching, partner, preference list, role

Procedia PDF Downloads 202
24444 Exploiting SLMail Server with a Developed Buffer Overflow with Kali Linux

Authors: Senesh Wijayarathne

Abstract:

This study focuses on how someone could develop a Buffer Overflow and could use that to exploit the SLMail Server. This study uses a Kali Linux V2018.4 Virtual Machine and Windows 7 - Internet Explorer V8 Virtual Machine (IPv4 Address - 192.168.56.107). This study starts by sending continued bytes to the SLMail Server to find the crashing point range and creating a unique pattern of the length of the crashing point range to control the Extended Instruction Pointer (EIP). Then by sending all characters to SLMail Server, we could observe and find which characters are not rendered properly by the software, also known as Bad Characters. By finding the ‘Jump to the ESP register (JMP ESP) and with the help of ‘Mona Modules’, we could use msfvenom to create a non-stage windows reverse shell payload. By including all the details gathered previously on one script, we could get a system-level reverse shell of the Windows 7 PC. The end of this paper will discuss how to mitigate this vulnerability.

Keywords: slmail server, extended instruction pointer, jump to the esp register, bad characters, virtual machine, windows 7, kali Linux, buffer overflow, Seattle lab, vulnerability

Procedia PDF Downloads 125
24443 Green Windows of Opportunity in Latin American Countries

Authors: Fabianna Bacil, Zenathan Hasannundin, Clovis Freire

Abstract:

The green transition opens green windows of opportunity – temporary moments in which there are lower barriers and shorter learning periods for developing countries to enter emerging technologies and catch-up. However, taking advantage of these windows requires capabilities in national sectoral systems to adopt and develop technologies linked to green sectors as well as strong responses to build the required knowledge, skills, and infrastructure and foster the growth of targeted sectors. This paper uses UNCTAD’s frontier technology readiness index to analyse the current position of Latin America and the Caribbean to use, adopt, and adapt frontier technologies, examining the preconditions in the region to take up windows of opportunity that arise with the green transition. The index highlights the inequality across countries in the region, as well as gaps in capabilities dimensions, especially in terms of R&D. Moving to responses, it highlights industrial policies implemented to foster the growth of green technologies, emphasising the essential role played by the state to build and strengthen capabilities and provide infant industry protection that enables the growth of these sectors. Overall, while there are exceptions, especially in the Brazilian case, countries in Latin America and the Caribbean should focus on strengthening their capabilities to be better positioned, especially in terms of knowledge creation, infrastructure, and financing availability.

Keywords: Green technologies, Industrial policy, Latin America, windows of opportunity

Procedia PDF Downloads 36
24442 Cooperative Coevolution for Neuro-Evolution of Feed Forward Networks for Time Series Prediction Using Hidden Neuron Connections

Authors: Ravneil Nand

Abstract:

Cooperative coevolution uses problem decomposition methods to solve a larger problem. The problem decomposition deals with breaking down the larger problem into a number of smaller sub-problems depending on their method. Different problem decomposition methods have their own strengths and limitations depending on the neural network used and application problem. In this paper we are introducing a new problem decomposition method known as Hidden-Neuron Level Decomposition (HNL). The HNL method is competing with established problem decomposition method in time series prediction. The results show that the proposed approach has improved the results in some benchmark data sets when compared to the standalone method and has competitive results when compared to methods from literature.

Keywords: cooperative coevaluation, feed forward network, problem decomposition, neuron, synapse

Procedia PDF Downloads 302
24441 Design of a Vehicle Door Structure Based on Finite Element Method

Authors: Tawanda Mushiri, Charles Mbohwa

Abstract:

The performance of door assembly is very significant for the vehicle design. In the present paper, the finite element method is used in the development processes of the door assembly. The stiffness, strength, modal characteristic, and anti-extrusion of a newly developed passenger vehicle door assembly are calculated and evaluated by several finite element analysis commercial software. The structural problems discovered by FE analysis have been modified and finally achieved the expected door structure performance target of this new vehicle. The issue in focus is to predict the performance of the door assembly by powerful finite element analysis software, and optimize the structure to meet the design targets. It is observed that this method can be used to forecast the performance of vehicle door efficiently when it’s designed. In order to reduce lead time and cost in the product development of vehicles more development will be made virtually.

Keywords: vehicle door, structure, strength, stiffness, modal characteristic, anti-extrusion, Finite Element Method

Procedia PDF Downloads 394
24440 Classification of Germinatable Mung Bean by Near Infrared Hyperspectral Imaging

Authors: Kaewkarn Phuangsombat, Arthit Phuangsombat, Anupun Terdwongworakul

Abstract:

Hard seeds will not grow and can cause mold in sprouting process. Thus, the hard seeds need to be separated from the normal seeds. Near infrared hyperspectral imaging in a range of 900 to 1700 nm was implemented to develop a model by partial least squares discriminant analysis to discriminate the hard seeds from the normal seeds. The orientation of the seeds was also studied to compare the performance of the models. The model based on hilum-up orientation achieved the best result giving the coefficient of determination of 0.98, and root mean square error of prediction of 0.07 with classification accuracy was equal to 100%.

Keywords: mung bean, near infrared, germinatability, hard seed

Procedia PDF Downloads 273
24439 Data Recording for Remote Monitoring of Autonomous Vehicles

Authors: Rong-Terng Juang

Abstract:

Autonomous vehicles offer the possibility of significant benefits to social welfare. However, fully automated cars might not be going to happen in the near further. To speed the adoption of the self-driving technologies, many governments worldwide are passing laws requiring data recorders for the testing of autonomous vehicles. Currently, the self-driving vehicle, (e.g., shuttle bus) has to be monitored from a remote control center. When an autonomous vehicle encounters an unexpected driving environment, such as road construction or an obstruction, it should request assistance from a remote operator. Nevertheless, large amounts of data, including images, radar and lidar data, etc., have to be transmitted from the vehicle to the remote center. Therefore, this paper proposes a data compression method of in-vehicle networks for remote monitoring of autonomous vehicles. Firstly, the time-series data are rearranged into a multi-dimensional signal space. Upon the arrival, for controller area networks (CAN), the new data are mapped onto a time-data two-dimensional space associated with the specific CAN identity. Secondly, the data are sampled based on differential sampling. Finally, the whole set of data are encoded using existing algorithms such as Huffman, arithmetic and codebook encoding methods. To evaluate system performance, the proposed method was deployed on an in-house built autonomous vehicle. The testing results show that the amount of data can be reduced as much as 1/7 compared to the raw data.

Keywords: autonomous vehicle, data compression, remote monitoring, controller area networks (CAN), Lidar

Procedia PDF Downloads 131
24438 Real Time Ultrasoft Transverse Photons Self Energy at Next To-Leading Order in Hot Scalar Quantum Electrodynamics

Authors: Karima Bouakaz, Amel Youcefi, Abdessamad Abada

Abstract:

We determine a compact analytic expression for the complete next-to-leading contribution to the retarded transverse photons self-energy in the context of hard-thermal-loop summed perturbation of massless quantum electrodynamics (QED) at high temperature to calculate the next-to-leading order dispersion relations for slow-moving transverse photons at high temperature scalar quantum electrodynamics (Scalar QED), using the real time formalism (RTF) in physical representation. We derive the analytic expressions of hard thermal loop (HTL) contributions to propagators and vertices to determine the expressions of the effective propagators and vertices in RTF that contribute to the complete next-to leading order contribution of retarded transverse photons self-energy.

Keywords: hard thermal loop, hot scalar QED, NLO computations, soft transverse photons

Procedia PDF Downloads 47
24437 The Impact of Hospital Intensive Care Unit Window Design on Daylighting and Energy Performance in Desert Climate

Authors: A. Sherif, H. Sabry, A. Elzafarany, M. Gadelhak, R. Arafa, M. Aly

Abstract:

This paper addresses the design of hospital Intensive Care Unit windows for the achievement of visual comfort and energy savings. The aim was to identify the window size and shading system configurations that could fulfill daylighting adequacy, avoid glare and reduce energy consumption. The study focused on addressing the effect of utilizing different shading systems in association with a range of Window-to-Wall Ratios (WWR) in different orientations under the desert clear-sky of Cairo, Egypt. The results of this study demonstrated that solar penetration is a critical concern affecting the design of ICU windows in desert locations, as in Cairo, Egypt. Use of shading systems was found to be essential in providing acceptable daylight performance and energy saving. Careful positioning of the ICU window towards a proper orientation can dramatically improve performance. It was observed that ICU windows facing the north direction enjoyed the widest range of successful window configuration possibilities at different WWRs. ICU windows facing south enjoyed a reasonable number of configuration options as well. By contrast, the ICU windows facing the east orientation had a very limited number of options that provide acceptable performance. These require additional local shading measures at certain times due to glare incidence. Moreover, use of horizontal sun breakers and solar screens to protect the ICU windows proved to be more successful than the other alternatives in a wide range of Window to Wall Ratios. By contrast, the use of light shelves and vertical shading devices seemed questionable.

Keywords: daylighting, desert, energy efficiency, shading

Procedia PDF Downloads 412
24436 A Graph Theoretic Algorithm for Bandwidth Improvement in Computer Networks

Authors: Mehmet Karaata

Abstract:

Given two distinct vertices (nodes) source s and target t of a graph G = (V, E), the two node-disjoint paths problem is to identify two node-disjoint paths between s ∈ V and t ∈ V . Two paths are node-disjoint if they have no common intermediate vertices. In this paper, we present an algorithm with O(m)-time complexity for finding two node-disjoint paths between s and t in arbitrary graphs where m is the number of edges. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.

Keywords: disjoint paths, distributed systems, fault-tolerance, network routing, security

Procedia PDF Downloads 415
24435 Reinforcement of an Electric Vehicle Battery Pack Using Honeycomb Structures

Authors: Brandon To, Yong S. Park

Abstract:

As more battery electric vehicles are being introduced into the automobile industry, continuous advancements are constantly made in the electric vehicle space. Improvements in lithium-ion battery technology allow electric vehicles to be capable of traveling long distances. The batteries are capable of being charged faster, allowing for a sufficient range in shorter amounts of time. With increased reliance on battery technology and the changes in vehicle power trains, new challenges arise from this. Resulting electric vehicle fires caused by collisions are potentially more dangerous than those of the typical internal combustion engine. To further reduce the battery failures involved with side collisions, this project intends to reinforce an existing battery pack of an electric vehicle with honeycomb structures such that intrusion into the batteries can be minimized with weight restrictions in place. Honeycomb structures of hexagonal geometry are implemented into the side extrusions of the battery pack. With the use of explicit dynamics simulations performed in ANSYS, quantitative results such as deformation, strain, and stress are used to compare the performance of the battery pack with and without the implemented honeycomb structures.

Keywords: battery pack, electric vehicle, honeycomb, side impact

Procedia PDF Downloads 80
24434 Routing and Energy Efficiency through Data Coupled Clustering in Large Scale Wireless Sensor Networks (WSNs)

Authors: Jainendra Singh, Zaheeruddin

Abstract:

A typical wireless sensor networks (WSNs) consists of several tiny and low-power sensors which use radio frequency to perform distributed sensing tasks. The longevity of wireless sensor networks (WSNs) is a major issue that impacts the application of such networks. While routing protocols are striving to save energy by acting on sensor nodes, recent studies show that network lifetime can be enhanced by further involving sink mobility. A common approach for energy efficiency is partitioning the network into clusters with correlated data, where the representative nodes simply transmit or average measurements inside the cluster. In this paper, we propose an energy- efficient homogenous clustering (EHC) technique. In this technique, the decision of each sensor is based on their residual energy and an estimate of how many of its neighboring cluster heads (CHs) will benefit from it being a CH. We, also explore the routing algorithm in clustered WSNs. We show that the proposed schemes significantly outperform current approaches in terms of packet delay, hop count and energy consumption of WSNs.

Keywords: wireless sensor network, energy efficiency, clustering, routing

Procedia PDF Downloads 236
24433 Energy Efficient Clustering with Reliable and Load-Balanced Multipath Routing for Wireless Sensor Networks

Authors: Alamgir Naushad, Ghulam Abbas, Shehzad Ali Shah, Ziaul Haq Abbas

Abstract:

Unlike conventional networks, it is particularly challenging to manage resources efficiently in Wireless Sensor Networks (WSNs) due to their inherent characteristics, such as dynamic network topology and limited bandwidth and battery power. To ensure energy efficiency, this paper presents a routing protocol for WSNs, namely, Enhanced Hybrid Multipath Routing (EHMR), which employs hierarchical clustering and proposes a next hop selection mechanism between nodes according to a maximum residual energy metric together with a minimum hop count. Load-balancing of data traffic over multiple paths is achieved for a better packet delivery ratio and low latency rate. Reliability is ensured in terms of higher data rate and lower end-to-end delay. EHMR also enhances the fast-failure recovery mechanism to recover a failed path. Simulation results demonstrate that EHMR achieves a higher packet delivery ratio, reduced energy consumption per-packet delivery, lower end-to-end latency, and reduced effect of data rate on packet delivery ratio when compared with eminent WSN routing protocols.

Keywords: energy efficiency, load-balancing, hierarchical clustering, multipath routing, wireless sensor networks

Procedia PDF Downloads 47
24432 Hybrid Approach for the Min-Interference Frequency Assignment

Authors: F. Debbat, F. T. Bendimerad

Abstract:

The efficient frequency assignment for radio communications becomes more and more crucial when developing new information technologies and their applications. It is consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters. Separation of the frequencies assigned is necessary to avoid interference. However, unnecessary separation causes an excess requirement for spectrum, the cost of which may be very high. This problem is NP-hard problem which cannot be solved by conventional optimization algorithms. It is therefore necessary to use metaheuristic methods to solve it. This paper proposes Hybrid approach based on simulated annealing (SA) and Tabu Search (TS) methods to solve this problem. Computational results, obtained on a number of standard problem instances, testify the effectiveness of the proposed approach.

Keywords: cellular mobile communication, frequency assignment problem, optimization, tabu search, simulated annealing

Procedia PDF Downloads 355
24431 Model for Calculating Traffic Mass and Deceleration Delays Based on Traffic Field Theory

Authors: Liu Canqi, Zeng Junsheng

Abstract:

This study identifies two typical bottlenecks that occur when a vehicle cannot change lanes: car following and car stopping. The ideas of traffic field and traffic mass are presented in this work. When there are other vehicles in front of the target vehicle within a particular distance, a force is created that affects the target vehicle's driving speed. The characteristics of the driver and the vehicle collectively determine the traffic mass; the driving speed of the vehicle and external variables have no bearing on this. From a physical level, this study examines the vehicle's bottleneck when following a car, identifies the outside factors that have an impact on how it drives, takes into account that the vehicle will transform kinetic energy into potential energy during deceleration, and builds a calculation model for traffic mass. The energy-time conversion coefficient is created from an economic standpoint utilizing the social average wage level and the average cost of motor fuel. Vissim simulation program measures the vehicle's deceleration distance and delays under the Wiedemann car-following model. The difference between the measured value of deceleration delay acquired by simulation and the theoretical value calculated by the model is compared using the conversion calculation model of traffic mass and deceleration delay. The experimental data demonstrate that the model is reliable since the error rate between the theoretical calculation value of the deceleration delay obtained by the model and the measured value of simulation results is less than 10%. The article's conclusion is that the traffic field has an impact on moving cars on the road and that physical and socioeconomic factors should be taken into account while studying vehicle-following behavior. The deceleration delay value of a vehicle's driving and traffic mass have a socioeconomic relationship that can be utilized to calculate the energy-time conversion coefficient when dealing with the bottleneck of cars stopping and starting.

Keywords: traffic field, social economics, traffic mass, bottleneck, deceleration delay

Procedia PDF Downloads 30
24430 Comparison of Illuminance Levels in Old Omani and Portuguese Forts in Oman

Authors: Maatouk Khoukhi

Abstract:

Nowadays the reduction of the energy consumed by buildings to achieve mainly the thermal comfort for the occupants represent the main concern for architects and building designers. The common and traditional solution to achieve this target is the design of a highly insulated envelope and reduce the opening and the transparent elements such windows. However, this will lead to the artificial lighting system to consume more energy to compensate the lack of natural lighting coming through the glazed parts of the building envelope. Therefore, a good balance between sufficient daylight and control thermal heat through the building envelope should be considered for energy saving purpose. To achieve a better indoor environment the windows size and spacing including the interior finishing and the location of the partition must be assessed accurately. Daylighting is the controlled admission of natural light into space through windows and transparent elements of the building envelope which helps create a visually stimulating and productive environment for building occupants. The main concern is not to provide enough daylight to an occupied space, but how to achieve this without any undesirable side effect. Indeed, the glare is a major problem in glazed façade buildings, and this could be reduced by using tinted windows. The main target of this research is to investigate the daylight adequacy of functional needs in old Omani Forts and how they have been designed and built to avoid glare and overheating with the appropriate window-to-floor ratio. Because more windows do not automatically result in more daylighting but that is natural light has been controlled and distributed properly throughout the space. Spaces from different Omani and Portuguese Forts under the same climate conditions are considered in order to compare the daylight illuminance levels and examine the similarities and differences in visual attributes between them. The result of this study indicates that lighting preference is not universal and people from different geographical locations are adapted to certain illuminance levels. Therefore, the standards could not be generalized for the entire world. This would be useful to practitioners who are designing to effectively address the diversity of user’s lighting levels preferences in our globally connected society.

Keywords: day lighting, energy, forts, thermal comfort

Procedia PDF Downloads 139
24429 Performance Analysis of Elliptic Curve Cryptography Using Onion Routing to Enhance the Privacy and Anonymity in Grid Computing

Authors: H. Parveen Begam, M. A. Maluk Mohamed

Abstract:

Grid computing is an environment that allows sharing and coordinated use of diverse resources in dynamic, heterogeneous and distributed environment using Virtual Organization (VO). Security is a critical issue due to the open nature of the wireless channels in the grid computing which requires three fundamental services: authentication, authorization, and encryption. The privacy and anonymity are considered as an important factor while communicating over publicly spanned network like web. To ensure a high level of security we explored an extension of onion routing, which has been used with dynamic token exchange along with protection of privacy and anonymity of individual identity. To improve the performance of encrypting the layers, the elliptic curve cryptography is used. Compared to traditional cryptosystems like RSA (Rivest-Shamir-Adelman), ECC (Elliptic Curve Cryptosystem) offers equivalent security with smaller key sizes which result in faster computations, lower power consumption, as well as memory and bandwidth savings. This paper presents the estimation of the performance improvements of onion routing using ECC as well as the comparison graph between performance level of RSA and ECC.

Keywords: grid computing, privacy, anonymity, onion routing, ECC, RSA

Procedia PDF Downloads 372
24428 Leukocyte Detection Using Image Stitching and Color Overlapping Windows

Authors: Lina, Arlends Chris, Bagus Mulyawan, Agus B. Dharmawan

Abstract:

Blood cell analysis plays a significant role in the diagnosis of human health. As an alternative to the traditional technique conducted by laboratory technicians, this paper presents an automatic white blood cell (leukocyte) detection system using Image Stitching and Color Overlapping Windows. The advantage of this method is to present a detection technique of white blood cells that are robust to imperfect shapes of blood cells with various image qualities. The input for this application is images from a microscope-slide translation video. The preprocessing stage is performed by stitching the input images. First, the overlapping parts of the images are determined, then stitching and blending processes of two input images are performed. Next, the Color Overlapping Windows is performed for white blood cell detection which consists of color filtering, window candidate checking, window marking, finds window overlaps, and window cropping processes. Experimental results show that this method could achieve an average of 82.12% detection accuracy of the leukocyte images.

Keywords: color overlapping windows, image stitching, leukocyte detection, white blood cell detection

Procedia PDF Downloads 276
24427 On Transferring of Transient Signals along Hollow Waveguide

Authors: E. Eroglu, S. Semsit, E. Sener, U.S. Sener

Abstract:

In Electromagnetics, there are three canonical boundary value problem with given initial conditions for the electromagnetic field sought, namely: Cavity Problem, Waveguide Problem, and External Problem. The Cavity Problem and Waveguide Problem were rigorously studied and new results were arised at original works in the past decades. In based on studies of an analytical time domain method Evolutionary Approach to Electromagnetics (EAE), electromagnetic field strength vectors produced by a time dependent source function are sought. The fields are took place in L2 Hilbert space. The source function that performs signal transferring, energy and surplus of energy has been demonstrated with all clarity. Depth of the method and ease of applications are emerged needs of gathering obtained results. Main discussion is about perfect electric conductor and hollow waveguide. Even if well studied time-domain modes problems are mentioned, specifically, the modes which have a hollow (i.e., medium-free) cross-section domain are considered.

Keywords: evolutionary approach to electromagnetics, time-domain waveguide mode, Neumann problem, Dirichlet boundary value problem, Klein-Gordon

Procedia PDF Downloads 299
24426 Job Shop Scheduling: Classification, Constraints and Objective Functions

Authors: Majid Abdolrazzagh-Nezhad, Salwani Abdullah

Abstract:

The job-shop scheduling problem (JSSP) is an important decision facing those involved in the fields of industry, economics and management. This problem is a class of combinational optimization problem known as the NP-hard problem. JSSPs deal with a set of machines and a set of jobs with various predetermined routes through the machines, where the objective is to assemble a schedule of jobs that minimizes certain criteria such as makespan, maximum lateness, and total weighted tardiness. Over the past several decades, interest in meta-heuristic approaches to address JSSPs has increased due to the ability of these approaches to generate solutions which are better than those generated from heuristics alone. This article provides the classification, constraints and objective functions imposed on JSSPs that are available in the literature.

Keywords: job-shop scheduling, classification, constraints, objective functions

Procedia PDF Downloads 411
24425 A Modular Solution for Large-Scale Critical Industrial Scheduling Problems with Coupling of Other Optimization Problems

Authors: Ajit Rai, Hamza Deroui, Blandine Vacher, Khwansiri Ninpan, Arthur Aumont, Francesco Vitillo, Robert Plana

Abstract:

Large-scale critical industrial scheduling problems are based on Resource-Constrained Project Scheduling Problems (RCPSP), that necessitate integration with other optimization problems (e.g., vehicle routing, supply chain, or unique industrial ones), thus requiring practical solutions (i.e., modular, computationally efficient with feasible solutions). To the best of our knowledge, the current industrial state of the art is not addressing this holistic problem. We propose an original modular solution that answers the issues exhibited by the delivery of complex projects. With three interlinked entities (project, task, resources) having their constraints, it uses a greedy heuristic with a dynamic cost function for each task with a situational assessment at each time step. It handles large-scale data and can be easily integrated with other optimization problems, already existing industrial tools and unique constraints as required by the use case. The solution has been tested and validated by domain experts on three use cases: outage management in Nuclear Power Plants (NPPs), planning of future NPP maintenance operation, and application in the defense industry on supply chain and factory relocation. In the first use case, the solution, in addition to the resources’ availability and tasks’ logical relationships, also integrates several project-specific constraints for outage management, like, handling of resource incompatibility, updating of tasks priorities, pausing tasks in a specific circumstance, and adjusting dynamic unit of resources. With more than 20,000 tasks and multiple constraints, the solution provides a feasible schedule within 10-15 minutes on a standard computer device. This time-effective simulation corresponds with the nature of the problem and requirements of several scenarios (30-40 simulations) before finalizing the schedules. The second use case is a factory relocation project where production lines must be moved to a new site while ensuring the continuity of their production. This generates the challenge of merging job shop scheduling and the RCPSP with location constraints. Our solution allows the automation of the production tasks while considering the rate expectation. The simulation algorithm manages the use and movement of resources and products to respect a given relocation scenario. The last use case establishes a future maintenance operation in an NPP. The project contains complex and hard constraints, like on Finish-Start precedence relationship (i.e., successor tasks have to start immediately after predecessors while respecting all constraints), shareable coactivity for managing workspaces, and requirements of a specific state of "cyclic" resources (they can have multiple states possible with only one at a time) to perform tasks (can require unique combinations of several cyclic resources). Our solution satisfies the requirement of minimization of the state changes of cyclic resources coupled with the makespan minimization. It offers a solution of 80 cyclic resources with 50 incompatibilities between levels in less than a minute. Conclusively, we propose a fast and feasible modular approach to various industrial scheduling problems that were validated by domain experts and compatible with existing industrial tools. This approach can be further enhanced by the use of machine learning techniques on historically repeated tasks to gain further insights for delay risk mitigation measures.

Keywords: deterministic scheduling, optimization coupling, modular scheduling, RCPSP

Procedia PDF Downloads 155
24424 Exploring Individual and Team Approaches in Crafting Workplace Inclusivity for Deaf and Hard of Hearing Employees in Malaysia

Authors: Nor Wahiza Abdul Wahat, Nor Haniza Abdul Wahat, Siti Noormi Alias, Mohamad Sazali Shaari

Abstract:

This study prepares the groundwork for the development of a strategic model and instrument for workplace inclusivity for deaf and hard-of-hearing employees in Malaysia. In the past, scholars have discussed inclusivity of workplaces to the extent to which employees feel they are significantly part of the organizational processes. Such processes include access to information, connectedness to colleagues and team members as well as their ability to participate in and influence decision-making processes. A qualitative study was conducted to explore on experiences of employed deaf and hard-of-hearing employees in a few Malaysian organizations. Data were collected from two focus group discussions involving male and female deaf and hard of hearing employees. Three in-depth interviews were also conducted with employer representatives. Generated themes highlighted individual, and team approaches towards crafting workplace inclusivity for deaf and hard of hearing employees in Malaysia. The adaptiveness of deaf and hard-of-hearing employees and social inclusion by colleagues were among the emerged sub-themes. This study allowed the researchers to further develop workplace inclusivity instruments and models for the benefit of deaf and hard of hearing Malaysian employees, as well as their employers.

Keywords: deaf, hard of hearing, workplace inclusivity, disabilities

Procedia PDF Downloads 145