Guide Communications of the ACM-Volume 53 Issue 6, June 2010

Free download. Book file PDF easily for everyone and every device. You can download and read online Communications of the ACM-Volume 53 Issue 6, June 2010 file PDF Book only if you are registered here. And also you can download or read online all Book PDF file that related with Communications of the ACM-Volume 53 Issue 6, June 2010 book. Happy reading Communications of the ACM-Volume 53 Issue 6, June 2010 Bookeveryone. Download file Free Book PDF Communications of the ACM-Volume 53 Issue 6, June 2010 at Complete PDF Library. This Book have some digital formats such us :paperbook, ebook, kindle, epub, fb2 and another formats. Here is The CompletePDF Book Library. It's free to register here to get Book file PDF Communications of the ACM-Volume 53 Issue 6, June 2010 Pocket Guide.

Volume 46 Issue 3 May-June Volume 46 Issue 2 March-April Volume 46 Issue 1 January-February Volume 45 Issue 6 November-December Volume 45 Issue 5 September-October Volume 45 Issue 4 July-August Volume 45 Issue 3 May-June Volume 45 Issue 2 March-April Volume 45 Issue 1 January-February Volume 44 Issue 6 November-December Volume 44 Issue 5 September-October Volume 44 Issue 4 July-August Volume 44 Issue 3 May-June Volume 44 Issue 2 March-April Volume 44 Issue 1 January-February Volume 43 Issue 6 November-December Volume 43 Issue 5 September-October Volume 43 Issue 4 July-August Volume 43 Issue 3 May-June Volume 43 Issue 2 March-April Volume 43 Issue 1 January-February Volume 42 Issue 6 November-December Volume 42 Issue 5 September-October Volume 42 Issue 4 July-August Volume 42 Issue 3 May-June Volume 42 Issue 2 March-April Volume 42 Issue 1 January-February Volume 41 Issue 6 November-December Volume 41 Issue 5 September-October Volume 41 Issue 4 July-August Volume 41 Issue 3 May-June Volume 41 Issue 2 March-April Volume 41 Issue 1 January-February Volume 40 Issue 6 November-December Volume 40 Issue 5 September-October Volume 40 Issue 4 July-August Volume 40 Issue 3-supplement-2 May-June Volume 40 Issue 3 May-June Volume 40 Issue 2 March-April Volume 40 Issue 1-supplement-1 January-February Volume 40 Issue 1 January-February Volume 39 Issue 6 November-December Volume 39 Issue 5 September-October Volume 39 Issue 4 July-August Volume 39 Issue 3 May-June Volume 39 Issue 2 March-April Volume 39 Issue 1 January-February Volume 38 Issue 6 November-December Volume 38 Issue 5 September-October Volume 38 Issue 4 July-August Volume 38 Issue 3 May-June Volume 38 Issue 2 March-April Volume 38 Issue 1 January-February Volume 37 Issue 6 November-December Volume 37 Issue 5 September-October Volume 37 Issue 4 July-August Volume 37 Issue 3 May-June Volume 37 Issue 2 March-April Volume 37 Issue 1 January-February Volume 36 Issue 6 November-December Volume 36 Issue 5 September-October Volume 36 Issue 4 July-August Volume 36 Issue 3 May-June Volume 36 Issue 2 March-April Volume 36 Issue 1 January-February Volume 35 Issue 6 November-December Volume 35 Issue 5 September-October Volume 35 Issue 4 July-August Volume 35 Issue 3 May-June Volume 35 Issue 2 March-April Volume 35 Issue 1 January-February Volume 34 Issue 6 November-December Volume 34 Issue 5 September-October Volume 34 Issue 4 July-August Volume 34 Issue 3 May-June Volume 34 Issue 2 March-April Volume 34 Issue 1 January-February Volume 33 Issue 6 November-December Volume 33 Issue 5 September-October Volume 33 Issue 4 July-August Volume 33 Issue 3 May-June Volume 33 Issue 2 March-April Volume 33 Issue 1 January-February Volume 32 Issue 6 November-December Volume 32 Issue 5 September-October Volume 32 Issue 4 July-August Volume 32 Issue 3 May-June Volume 32 Issue 2 March-April Volume 32 Issue 1 January-February Volume 31 Issue 6 November-December Volume 31 Issue 5 September-October Volume 31 Issue 4 July-August Volume 31 Issue 3 May-June Volume 31 Issue 2 March-April Volume 31 Issue 1 January-February Volume 30 Issue 6 November-December Volume 30 Issue 5 September-October Volume 30 Issue 4 July-August Volume 30 Issue 3 May-June Volume 30 Issue 2 March-April Volume 30 Issue 1 January-February Volume 29 Issue 6 November-December Volume 29 Issue 5 September-October Volume 29 Issue 4 July-August Volume 29 Issue 3 May-June Volume 29 Issue 2 March-April Volume 29 Issue 1 January-February Volume 28 Issue 6 November-December Volume 28 Issue 5 September-October Volume 28 Issue 4 July-August Volume 28 Issue 3-part-ii May-June Volume 28 Issue 3-part-i May-June Volume 28 Issue 2 March-April Volume 28 Issue 1 January-February Volume 27 Issue 6 November-December Volume 27 Issue 5 September-October Volume 27 Issue 4 July-August Volume 27 Issue 3 May-June Volume 27 Issue 2 March-April Volume 27 Issue 1 January-February Volume 26 Issue 6 November-December Volume 26 Issue 5 September-October Volume 26 Issue 4 July-August Volume 26 Issue 3 May-June Volume 26 Issue 2 March-April Volume 26 Issue 1 January-February Volume 25 Issue 6 November-December Volume 25 Issue 5 September-October Volume 25 Issue 4 July-August Volume 25 Issue 3 May-June Volume 25 Issue 2 March-April Volume 25 Issue 1 January-February Volume 24 Issue 6 November-December Volume 24 Issue 5 September-October Volume 24 Issue 4 July-August Volume 24 Issue 3 May-June Volume 24 Issue 2 March-April Volume 24 Issue 1 January-February Volume 23 Issue 6 November-December Volume 23 Issue 5 September-October Volume 23 Issue 4 July-August Volume 23 Issue 3 May-June Volume 23 Issue 2 March-April Volume 23 Issue 1 January-February Volume 22 Issue 6 November-December Volume 22 Issue 5 September-October Volume 22 Issue 4 July-August Volume 22 Issue 3 May-June Volume 22 Issue 2 March-April Volume 22 Issue 1 January-February Volume 21 Issue 6 November-December Volume 21 Issue 5 September-October Volume 21 Issue 4 July-August Volume 21 Issue 3 May-June Volume 21 Issue 2 March-April Volume 21 Issue 1 January-February Volume 20 Issue 6 November-December Volume 20 Issue 5 September-October Volume 20 Issue 4 July-August Volume 20 Issue 3 May-June Volume 20 Issue 2 March-April Volume 20 Issue 1 January-February Volume 19 Issue 7 November-December Volume 19 Issue 6 October Volume 19 Issue 5 September Volume 19 Issue 4 July-August Volume 19 Issue 3 May-June Volume 19 Issue 2 March-April Volume 19 Issue 1 January-February Volume 18 Issue 6 November-December Volume 18 Issue 5 September-October Volume 18 Issue 4 July-August Volume 18 Issue 3 May-June Volume 18 Issue 2 March-April Volume 18 Issue 1 January-February Volume 17 Issue 6 November-December Volume 17 Issue 5 September-October Volume 17 Issue 4 July-August Volume 17 Issue 3 May-June Volume 17 Issue 2 March-April Volume 17 Issue 1 January-February Volume 16 Issue 6 November-December Volume 16 Issue 5 September-October Volume 16 Issue 4 July-August Volume 16 Issue 3 May-June Volume 16 Issue 2 March-April Volume 16 Issue 1 January-February Volume 15 Issue 6 November-December Volume 15 Issue 5 September-October Volume 15 Issue 4 July-August Volume 15 Issue 3 May-June Volume 15 Issue 2 March-April Volume 15 Issue 1 January-February Volume 14 Issue 6 November-December Volume 14 Issue 5 September-October Volume 14 Issue 4 July-August Volume 14 Issue 3 May-June Volume 14 Issue 2 March-April Volume 14 Issue 1 January-February Volume 13 Issue 6 November-December Volume 13 Issue 5 September-October Volume 13 Issue 4 July-August Volume 13 Issue 3 May-June Volume 13 Issue 2 March-April Volume 13 Issue 1 January-February Volume 12 Issue 6 November-December Volume 12 Issue 5 September-October Volume 12 Issue 4 July-August Volume 12 Issue 3 May-June Volume 12 Issue 2 March-April Volume 12 Issue 1 January-February Volume 11 Issue 6 November-December Volume 11 Issue 5 September-October Volume 11 Issue 4 July-August Volume 11 Issue 3 May-June Volume 11 Issue 2 March-April Volume 11 Issue 1 January-February Volume 10 Issue 6 November-December Volume 10 Issue 5 September-October Volume 10 Issue 4 July-August Volume 10 Issue 3 May-June Volume 10 Issue 2 March-April Volume 10 Issue 1 January-February Volume 9 Issue 6 November-December Volume 9 Issue 5 September-October Volume 9 Issue 4 July-August Volume 9 Issue 3 May-June Volume 9 Issue 2 March-April Volume 9 Issue 1 January-February Volume 8 Issue 6 November-December Volume 8 Issue 5 September-October Volume 8 Issue 4 July-August Volume 8 Issue 3 May-June Volume 8 Issue 2 March-April Volume 8 Issue 1 January-February Volume 7 Issue 6 November-December Volume 7 Issue 5 September-October Volume 7 Issue 4 July-August Volume 7 Issue 3 May-June Volume 7 Issue 2 March-April Volume 7 Issue 1 January-February Volume 6 Issue 6 November-December Volume 6 Issue 5 September-October Volume 6 Issue 4 July-August Volume 6 Issue 3 May-June Volume 6 Issue 2 March-April Volume 6 Issue 1 January-February Volume 5 Issue 6 December Volume 5 Issue 5 October Volume 5 Issue 4 August Volume 5 Issue 3 June Volume 5 Issue 2 April Volume 5 Issue 1 February Volume 4 Issue 6 December Volume 4 Issue 5 October Volume 4 Issue 4 August Volume 4 Issue 3 June Volume 4 Issue 2 April Volume 4 Issue 1 February Volume 3 Issue 4 November Volume 3 Issue 3 August Volume 3 Issue 2 May Volume 3 Issue 1 February Volume 2 Issue 4 November Volume 2 Issue 3 August Volume 2 Issue 2 May Volume 2 Issue 1 February Volume 1 Issue 5 November Volume 1 Issue 4 August Volume 1 Issue 3 May Volume 1 Issue 2 February Volume 1 Issue 1 November View PDF.

Go to Section. Home Operations Research Vol. Cynthia Barnhart. Ellis L. George L. Martin W. Pamela H. Published Online: 1 Jun Previous Back to Top. Figures References Related Information Cited By A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems. Scheduling with uncertain processing times in mixed-criticality systems. Vehicle scheduling problem with loss in bus ridership. ADMM-based problem decomposition scheme for vehicle routing problem with time windows. The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling.

Fleet sizing for one-way electric carsharing services considering dynamic vehicle relocation and nonlinear charging profile. An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations. Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods. A rollout algorithm for the resource constrained elementary shortest path problem. Baris Yildiz , Martin Savelsbergh. Dixit , S.

Travis Waller. Solving a dial-a-flight problem using composite variables.

Reference Material

Constraint Games for stable and optimal allocation of demands in SDN. Integrated condition-based track maintenance planning and crew scheduling of railway networks. Allocation method for transit lines considering the user equilibrium for operators. A robust framework for task-related resident scheduling. The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach. An integer programming approach to fisheries observer deployment. A hybrid model for crew scheduling in rail rapid transit networks. Taxi planning: Branch and price decomposition.

Albert H. Schrotenboer , Evrim Ursavas , Iris F. Integral column generation for the set partitioning problem. Optimal deployment for anti-submarine operations with time-dependent strategies. Liner shipping service scheduling and cargo allocation. An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs. Selective pricing in branch-price-and-cut algorithms for vehicle routing. A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs. A comparison of integer programming models for the partial directed weighted improper coloring problem.

Iman Dayarian , Guy Desaulniers. Stochastic dual dynamic integer programming. Flexible staffing of physicians with column generation. A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem. Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm.

Bus and driver scheduling with mealtime windows for a single public bus route. Vehicle routing problem with drones. Failure-Aware Kidney Exchange. John P.

Volume-7 Issue-4S | International Journal of Recent Technology and Engineering(TM)

Dickerson , Ariel D. Procaccia , Tuomas Sandholm. Operating room planning and surgical case scheduling: a review of literature. Airport ground workforce planning with hierarchical skills: a new formulation and branch-and-price approach. The sport teams grouping problem. A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling. Multi-objective model and optimization algorithm based on column generation for continuous casting production planning. Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system.

Behaviorally stable vehicle platooning for energy savings. The vertex k -cut problem. An integer optimality condition for column generation on zero—one linear programs. Dynamic job assignment: A column generation approach with an application to surgery allocation. An exact branch-and-price algorithm for scheduling rescue units during disaster response.

Optimised buffer allocation to construct stable personnel shift rosters. Column generation for vehicle routing problems with multiple synchronization constraints. Detecting critical node structures on graphs: A mathematical programming approach. Maximizing the expected number of transplants in kidney exchange programs with branch-and-price. Integrated crew scheduling and roster problem for trainmasters of passenger railway transportation. A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine.

Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. Optimization in liner shipping. Algorithms for the one-dimensional two-stage cutting stock problem. A column generation based distributed scheduling algorithm for multi-mode resource constrained project scheduling problem. The delivery problem: Optimizing hit rates in e-commerce deliveries. Vehicle routing with probabilistic capacity constraints. The time-dependent pickup and delivery problem with time windows. A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options.

Keji Wei , Vikrant Vaze. Biomass feedstock supply chain design — a taxonomic review and a decomposition-based methodology. A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs.

2014 (Total 55)

A survey of the literature on airline crew scheduling. Scheduled service network design with resource acquisition and management. Integer programming formulations for minimum deficiency interval coloring. A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows. Optimal design of decentralized energy conversion systems for smart microgrids using decomposition methods. Lower bound development in a flow shop electronic assembly problem with carryover sequence-dependent setup time.

A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design. Electric multiple unit circulation plan optimization based on the branch-and-price algorithm under different maintenance management schemes. Prize-collecting set multicovering with submodular pricing. Multiple depot vehicle scheduling with controlled trip shifting. Expanding scope and computational challenges in process scheduling. Improving set partitioning problem solutions by zooming around an improving direction. The Vehicle Rescheduling Problem with Retiming.

Constraint programming and operations research. An exact algorithm for the Partition Coloring Problem. Airline-driven ground delay programs: A benefits assessment. Recent planning approaches and mobility concepts for home health care services in Austria — A review. Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft. An integrated algorithm for shift scheduling problems for local public transport companies. An efficient computational method for large scale surgery scheduling problems with chance constraints.

Task assignment with start time-dependent processing times for personnel at check-in counters. A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times. Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling. Robust Aircraft Routing. Chiwei Yan , Jerry Kung.

CACM Mar. 2018 - A Programmable Programming Language

Glossary of Mathematical Optimization Terminology. Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows. Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking. A two-stage robust investment model for a risk-averse price-maker power producer. Efficient airplane arrival scheduling using a set partitioning-based branch-and-price method.

Analyzing complex service structures in liner shipping network design. Dynamic constraint and variable aggregation in column generation. A heuristic approach to minimize the number of saw cycles in small-scale furniture factories. A decomposition framework for managing inventory and distribution of fluid products by an order-based-resupply methodology.

Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs. A column generation approach and new bounds for the car sequencing problem. Integer programming techniques for educational timetabling. Delay resistant line planning with a view towards passenger transfers. Using branch-and-price to maximize redundant network utilization in cloud datacenter.

An efficient approach for the multiprocessor non-preemptive strictly periodic task scheduling problem. Branch-cut-price algorithms for solving a class of search problems on general graphs. Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem. A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. Integrating rolling stock scheduling with train unit shunting.

Branch-and-price for p-cluster editing. A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Solving a large-scale integrated fleet assignment and crew pairing problem. Airline crew scheduling: models, algorithms, and data sets. Algorithms for Generalized Clusterwise Linear Regression. A resource type analysis of the integrated project scheduling and personnel staffing problem. Jonathan D.

Adler , Pitu B. A multiple ship routing and speed optimization problem under time, cost and environmental objectives. A Branch-and-Price algorithm for railway rolling stock rescheduling. Optimization over structured subsets of positive semidefinite matrices via column generation.

A new heuristic branching scheme for the crew pairing problem with base constraints. A taxonomy for task allocation problems with temporal and ordering constraints. Petroleum supply planning: reformulations and a novel decomposition algorithm. Single-commodity stochastic network design under demand and topological uncertainties with insufficient data. Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign.

Dual relaxations of the time-indexed ILP formulation for min—sum scheduling problems. Multi-pattern generation framework for logical analysis of data. Optimizing railway crew schedules with fairness preferences. Shengzhi Shao , Hanif D. Sherali , Mohamed Haouari. Optimisation of maintenance routing and scheduling for offshore wind farms.

A column generation based algorithm for the robust graph coloring problem. Benchmarking of Mask Fracturing Heuristics. Lane covering with partner bounds in collaborative truckload transportation procurement. Puzzle—The Fillomino Puzzle. Robin H. Pearce , Michael A. A new cross decomposition method for stochastic mixed-integer linear programming. Resource Allocation Using Branch and Bound. Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm.

Reference Material

Metro timetable optimization from passenger perspective based on simulation models and incomplete data of passenger flow. A column generation algorithm for the bus driver scheduling problem. An optimization approach to designing a baseball scout network. Branch-and-price-and-cut for a service network design and hub location problem. A branch-and-price approach for solving the train unit scheduling problem. Sepehr Nemati , Oleg V. Shylo , Oleg A. Prokopyev , Andrew J. A dynamic constraint aggregation based solution approach for monthly aircrew pairing problem. A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings.

Lower bounding procedure for the asymmetric quadratic traveling salesman problem. Scheduling cranes at an indented berth. Rakke , Leandro C. Column generation for stochastic green telecommunication network planning with switchable base stations. A branch and price algorithm for the pharmacy duty scheduling problem. A novel column generation strategy for large scale airline crew pairing problems.

Thomas W. Vossen , R. Kevin Wood , Alexandra M. Branch-and-price algorithm for fuzzy integer programming problems with block angular structure. A column generation approach for solving the examination-timetabling problem. Increasing the revenue of self-storage warehouses by optimizing order scheduling. Optimal allocation of emergency medical resources in a mass casualty incident: Patient prioritization by column generation.

Full-shipload tramp ship routing and scheduling with variable speeds. Maximizing expected number of transplants in kidney exchange programs. Service Network Design with Resource Constraints. Decomposition approaches for recoverable robust optimization problems. A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills. Deriving compact extended formulations via LP-based separation techniques. Combining metaheuristics with mathematical programming, constraint programming and machine learning.

Optimizing spectrum utilization in dynamic RWA. A decomposition method for large scale MILPs, with performance guarantees and a power system application. Operational planning of forward and reverse logistic activities on multi-echelon supply-chain networks. Stratified patient appointment scheduling for mobile community-based chronic disease management programs. Design of efficient node p-cycles in WDM mesh networks. Designing Connected and Compact Nature Reserves.

An exact algorithm for an integrated project staffing problem with a homogeneous workforce. Optimized load planning for motorail transportation. Workforce scheduling and routing problems: literature survey and computational study. A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines. Branch-and-price-and-cut for the manpower routing problem with synchronization constraints.

Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows.

  • Research Interests.
  • Tutorials for R.
  • Journal Papers - Christos Verikoukis!
  • June Andronick.
  • Tibet Wild: A Naturalist’s Journeys on the Roof of the World.
  • Branch-and-Price: Column Generation for Solving Huge Integer Programs!

David R. Morrison , Edward C. Sewell , Sheldon H. Timo Gschwind , Stefan Irnich. A mixed integer programming approach to multi-skilled workforce scheduling. Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Big Data Optimization in Maritime Logistics. Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. Column generation approach for disassembly line balancing. The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach.

Unit Commitment by Column Generation. A branch-and-price method for a ship routing and scheduling problem with cargo coupling and synchronization constraints. A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Scheduling fighter squadron training missions using column generation. Scheduling pumpoff operations in onshore oilfields under electric-power constraints.

Column generation based heuristic framework for the multiple-depot vehicle type scheduling problem. From physical security to cybersecurity. Analyzing Analytics. Jee Eun Kang , Will Recker. Hybrid methods for lot sizing on parallel machines. A column generation approach for aircraft sequencing problems: a computational study. Solving a large-scale crew pairing problem. Irregular polyomino tiling via integer programming with application in phased array antenna design. The impact of reserve duties on the robustness of a personnel shift roster: An empirical investigation.

Mathematical models and algorithms for a high school timetabling problem. Efficient solutions for joint activity based security games: fast algorithms, results and a field experiment on a transit system. A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes. A branch-cut-and-price algorithm for the piecewise linear transportation problem. A branch-and-price approach to evaluate the role of cross-docking operations in consolidated supply chains.


Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques. Timetabling and assignment problems in railway planning and integer multicommodity flow. An exact solution approach for the order batching problem. They watched a short part of 3D version of Avatar trailer which general features are shown in Table 1.

Video Avrg. Despite of using IEEE At first many WiFi networks were accessible in the department laboratory where our experiment was carried out and other WiFi networks used same channels for carrying which is shown in Figure 2 and Table 2. This throughput also prevented to get convenient vision quality during the watching. In first case mean value of result scores was 4. Scores were always recorded by the test persons for 5 important viewpoints mentioned above.

Other subjective tests with distorted 3D video contents were carried out on these two PCs in same time and each of them was connected to different AP in the way mentioned above. We can say even based on reference tests that 3D content delivery though the WiFi network is more sensitive and less effective comparing results with first or second investigation results where we could carry out measurements on 4 PCs with mean value of QoE 4.

Participants perceived quality of 3D presentation also by quality of stereo shooting like depth of scenes. For this reason we did not disturb 3D video transport by jitter increase or jitter increase combined with bandwidth limitation but only with bandwidth limitation. We counted weighted averages by formula 3 based on gathered scores and weights. Summary of results are shown in Table 3.

Therefore bandwidth was set to 5, 4. Figure 3 QoE degradation based on bandwidth limitation Appropriate mathematical descriptions were calculated by the Wolfram Alpha application. Applying the method of least squares we got solutions: 3. We can recognize from Figure 3 that 3D film delivering through The middle line shows combined results of these two channels information when started mean weighted QoE was only 3. This was caused by the highest motion level scenes when the data sequences stuck shown in Figure 4 but these critical situations soon were persisted.

Figure 5 in middle shows line of weighted averages of all results 3. The buffered playing time increase also could help to raise resistivity against QoS degradation [15] but we did not change this value. Video contents were transported in unicast mode based on TCP protocol and were played on two PCs in the same time.

The relationship between QoE and QoS was shown based on gathered data for 3D stereoscopic multimedia content but the good quality guarantee is more complex in case of WiFi network. QoE is influenced by nature of wireless technology like bandwidth limitation or channel interferences and by QoS level in transport network as well. Gathered data show that people who had watched 3D movie before this experiment 32 from 36 participants were more critical to any quality differences. We can emphasize that for good QoE of 3D stereoscopic contents delivery through WiFi network the demanded bandwidth should be provided.

Our results also show that quality of 3D presentation is also strongly influenced by quality of stereo shooting and 3D production. Researchers working in vision and graphics are attempting to develop new techniques and technologies to overcome the current limitations in 3D stereoscopic presentation. Primary importance of QoE investigation in wireless transport network environment is came to the front due to the worldwide growing of video-streams presentation on smart but small mobile devices.

Therefore future work will address investigation of gathered information from experiments carried out with smart mobile devices on client sides and all research works results in the subject: investigation of QoE — QoS relationship for 3D stereoscopic videos delivery can be used in future research work. The goal is mathematical modeling of functional relationship between QoE and QoS metrics which is needed for optimal solution of 3D stereoscopic video contents delivery with appropriate display quality.

References 1. Kulik I. Ralf Lehnert Ed. LNCS, vol. Zahariadis T. Malo France, October Cale I. Casas P. Mrak M. High-Quality of Visual Experience, Chapter 3. You J. Shibata T. SPIE, Vol. Xing L. Lambooij M. Fiedler M. Kroeker L. Fort S. Milton J. Rugel S. ITU-T P. Garroppo R. Zheng H. Zilly F.