7 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 7 / 7
Yayın Mobile applications discovery: a subscriber-centric approach(Wiley Periodicals, 2011-03) Erman, Bilgehan; İnan, Ali; Nagarajan, Ramesh; Uzunalioğlu, HüseyinRapid adoption of smartphones and the business success of the Apple App Store have resulted in the rampant growth of mobile applications. Seeking new revenue opportunities from application development has created a gold rush. However, free or very cheap applications constitute a great bulk of the application downloads putting great pricing pressure on the developers. Furthermore, usage statistics suggest that most of the applications have been either one-trick applications or are downright useless, meriting no attention from the user beyond the first day. This is not surprising since cheap prices will dissuade developers from investing large sums of money to continue to develop more sophisticated, high quality applications. Developers have been complaining about the lack of visibility of their applications in stores that are beginning to resemble a high volume warehouse. It is clear that enhancing application discovery and building better marketing tools will be essential for the continued success of the mobile application marketplace and application stores. This paper proposes and investigates techniques for effective discovery of applications by matching user interests with application characteristics, with a special focus on adapting classical data mining techniques to user ratings of the applications. The user ratings are leveraged to make recommendations on potential applications of interest.Yayın A priority based packet scheduler with deadline considerations(IEEE Computer Soc, 2006) Dağ, Tamer; Gökgöl, OralQoS issues have become a focal point of research on Next Generation Networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper introduces a new kind of packet scheduler which tries to integrate an important QoS parameter (the delay) with the classical schedulers. The two sets of algorithms introduced; Static Priority with Deadline Considerations (SPD) and Dynamic Priority with Deadline Considerations (DPD); not only simplify the complexity and overhead of a classical Earliest Deadline First (EDF) or Static Priority (SP) algorithm, but also provide a better QoS based on the results of the simulations conducted.Yayın Improving the calibration time of traffic simulation models using parallel computing technique(Institute of Electrical and Electronics Engineers Inc., 2019-06) Dadashzadeh, Nima; Ergün, Murat; Kesten, Ali Sercan; Zura, MarijanThe calibration procedure for traffic simulation models can be a very time-consuming process in the case of a large-scale and complex network. In the application of Evolutionary Algorithms (EA) such as Genetic Algorithms (GA) and Particle Swarm Optimization (PSO) for calibration of traffic simulation models, objective function evaluation is the most time-consuming step in such calibration problems, because EA has to run a traffic simulation and calculate its corresponding objective function value once for each set of parameters. The main contribution of this study has been to develop a quick calibration procedure for the parameters of driving behavior models using EA and parallel computing techniques (PCTs). The proposed method was coded and implemented in a microscopic traffic simulation software. Two scenarios with/without PCT were analyzed using the developed methodology. The results of scenario analysis show that using an integrated calibration and PCT can reduce the total computational time of the optimization process significantly-in our experiments by 50%-and improve the optimization algorithm's performance in a complex optimization problem. The proposed method is useful for overcoming the limitation of computational time of the existing calibration methods and can be applied to various EAs and traffic simulation software.Yayın Identification of sensor location and link flow reconstruction using turn ratio and flow sensors in an arterial network(Taylor and Francis Ltd., 2024) Taşcıkaraoğlu, Fatma Yıldız; Aksoy, GökerIn this article, a quadratic programming problem is considered to identify all link flows in an arterial network when there are unmeasured link flows. A graphical method is provided to determine the minimum number of measurements and sensor locations required to obtain a fully observable model. It is shown that this method is also valid for the augmented graph with turn ratio measurements. If the minimum measurements required are met, a fully determined network can be obtained. If there is not enough measurement, a bound on the magnitude of the resulting inaccuracy in terms of vehicle kilometers traveled (VKT) can be calculated by the proposed linear programming method. The model is that of a queueing network; the parameters describe network geometry, saturation flow rates, turning ratios, timing plan and link flows. Three case studies are conducted to validate this approach. The first two cases are to calculate all missing flows by using a few numbers of measurements and minimum number of measurements required, respectively. Upper and lower bounds in terms of VKT are also calculated for these cases. Third case is to obtain a fully determined network with the minimum number of flow measurements when turn ratio sensors are included. Real measurements are collected from a network in Mugla including 55 links and 16 intersections. Vissim simulator is used to analyze the accuracy of the link flow calculations obtained from the proposed method. The results show that the proposed programming method can calculate the missing flows with a high accuracy and short computation time.Yayın An automatic calibration procedure of driving behaviour parameters in the presence of high bus volume(Faculty of Transport and Traffic Engineering, 2019-11) Dadashzadeh, Nima; Ergün, Murat; Kesten, Ali Sercan; Zura, MarijanMost of the microscopic traffic simulation programs used today incorporate car-following and lane-change models to simulate driving behaviour across a given area. The main goal of this study has been to develop an automatic calibration process for the parameters of driving behaviour models using metaheuristic algorithms. Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and a combination of GA and PSO (i.e. hybrid GAPSO and hybrid PSOGA) were used during the optimization stage. In order to verify our proposed methodology, a suitable study area with high bus volume on-ramp from the 0-1 Highway in Istanbul has been modelled in VISSIM. Traffic data have been gathered through detectors. The calibration procedure has been coded using MATLAB and implemented via the VISSIM-MATLAB COM interface. Using the proposed methodology, the results of the calibrated model showed that hybrid GAPSO and hybrid PSOGA techniques outperformed the GA-only and PSO-only techniques during the calibration process. Thus, both are recommended for use in the calibration of microsimulation traffic models, rather than GA-only and PSO-only techniques.Yayın Traffic simulation for traffic congestion problem of Fatih Sultan Mehmet Bridge of Istanbul Turkey(Işık Üniversitesi, 2014-01-21) Selçuk, Barlas; Çavdaroğlu, Burak; Işık Üniversitesi, Fen Bilimleri Enstitüsü, Endüstri Mühendisliği - Yöneylem Araştırması Yüksek Lisans ProgramıOn a regular day, almost 200,000 cars use Fatih Sultan Mehmet Bridge of Istanbul to commute between European and Asian side of the Bosporus. This enormous volume causes the traffic congestion to become a problem not only endemic to the bridge, but also cascading some major arterial roads of the city. This study includes a simulation model to analyze the traffic congestion problem in Fatih Sultan Mehmet Bridge of Istanbul. The main focus of this research are to identify the bottlenecks of the system, to discover vehicle behaviors in these bottlenecks, and to create a simulation model to predict the level of congestion on the bridge that will occur with different arrival rates of the vehicles. Our simulation analysis shows that even though there is no significant difference between the number of cars arriving to the bridge from both directions in the evening rush hour, when both directions on the bridge have four lanes (without any counter-flow lane), east direction (Europe-to-Asia) suffers more from traffic congestion due to lane merging taking place after the electronic toll collection (ETC) plazas. The analysis also suggests that a counter-flow lane in favor of the east (Europe-to-Asia) direction significantly improves the average number of cars congested at the entrance of the bridge.Yayın Constraint-based routing in traffic engineering(IEEE, 2006) Karaman, AyşeTraffic engineering (TE) describes a domain-wide perspective for traffic control as opposed to application-specific concerns of QoS. MPLS is today's most powerful architecture for TE. Constraint-based routing refers to the process of path assignment to flows to fulfill the TE objective which has been defined in a number of multi-constraint ways, and is the most significant component of TE. In this paper, we review constraint-based routing algorithms. We first provide an overview of MPLS/TE and place constraint-based routing within this approach. We then look into the potential path attributes and the underlying platform to characterize these algorithms before we present our review. Our study provides a comprehensive reference to the operational structure and specifications of constraint-based routing algorithms.
