An incentive scheduling mechanism for peer-to-peer video streaming

P2P video streaming networks are found as a scalable solution and an alternative for traditional client–server based video streaming over the Internet. One of the significant issues affecting the success of any P2P streaming network is cooperation between peers. Practical observations have proved the prevalence of free riders in P2P networks that degrade their performance. To solve this problem, using incentive mechanisms, which encourage peers to contribute more in the network, is necessary. In this paper, we designed and proposed a distributed and scalable incentive mechanism for mesh based P2P video streaming networks. In the proposed approach the contribution of the peers is measured and maintained in a distributed fashion. Furthermore, we proposed an incentive sending side scheduler in which peers are served based on their contribution in the network. Our simulation evaluations show the efficiency of the proposed approach in improving the overall perceived video quality by the non-free rider nodes and consequently in the whole network.     

Autocalibration of multiprojector CAVE-like immersive environments

In this paper, we present the first method for the geometric autocalibration of multiple projectors on a set of CAVE-like immersive display surfaces including truncated domes and 4 or 5-wall CAVEs (three side walls, floor, and/or ceiling). All such surfaces can be categorized as swept surfaces and multiple projectors can be registered on them using a single uncalibrated camera without using any physical markers on the surface. Our method can also handle nonlinear distortion in the projectors, common in compact setups where a short throw lens is mounted on each projector. Further, when the whole swept surface is not visible from a single camera view, we can register the projectors using multiple pan and tilted views of the same camera. Thus, our method scales well with different size and resolution of the display. Since we recover the 3D shape of the display, we can achieve registration that is correct from any arbitrary viewpoint appropriate for head-tracked single-user virtual reality systems. We can also achieve wallpapered registration, more appropriate for multiuser collaborative explorations. Though much more immersive than common surfaces like planes and cylinders, general swept surfaces are used today only for niche display environments. Even the more popular 4 or 5-wall CAVE is treated as a piecewise planar surface for calibration purposes and hence projectors are not allowed to be overlapped across the corners. Our method opens up the possibility of using such swept surfaces to create more immersive VR systems without compromising the simplicity of having a completely automatic calibration technique. Such calibration allows completely arbitrary positioning of the projectors in a 5-wall CAVE, without respecting the corners.     

Study of the High‐Pressure Vapour‐Liquid Equilibria for Strongly Non‐ideal Binary and Ternary Mixtures

High‐pressure vapour‐liquid equilibria for binary and ternary high polar and asymmetric systems are calculated using the Peng‐Robinson‐Stryjek‐Vera equation of state coupled with the Twu‐Coon (TWMR), the Orbey‐Sandler (OSMR) and the Wong‐Sandler (WSMR) mixing rules. Modified UNIFAC model is used for determining the activity coefficient and excess Gibbs free energy. The calculated results are compared with the experimental data and good agreement is observed. The average absolute deviation percents (AAD%)s indicated that the WSMR has less AAD% than other mixing rules in most of cases.     

A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts

In the service industry, workers perform work shifts and are assigned to interruptible activities and uninterruptible tasks during their shifts. The work shifts of regular employees are often established several weeks in advance of the operations when the activity and task demands are still uncertain. Just a few days before the operations when these demands are unveiled with more certainty, the planned schedules can be slightly modified and on-call temporary employees can be scheduled to satisfy the demands as best as possible. As acceptable modifications, extending the planned shifts and moving workers’ meal breaks are considered. In this paper, we are interested in the scheduling problem encountered in this second step, which also involves assigning activities and tasks to the scheduled work shifts. To produce good-quality solutions in fast computational times for large-sized instances, we develop a two-phase heuristic. In the first phase, an approximate mixed-integer programming model is used to suggest temporary shifts and extensions to regular shifts and to schedule and assign tasks. In the second phase, a column-generation heuristic embedded in a rolling horizon procedure determines the final shifts and assigns activities to them. Computational results obtained on randomly generated instances are reported to evaluate the validity of the proposed solution method.     

NUMERICAL SIMULATION OF FLOW OVER TWO CIRCULAR CYLINDERS IN TANDEM ARRANGEMENT

In this article,the 2-D unsteady viscous flow around two circular cylinders in a tandem arrangement is numerically simulated in order to study the characteristics of the flow in both laminar and turbulent regimes.The method applied alternatively is based on the finite volume method on a Cartesian-staggered grid.The great source term technique is employed to identify the cylinders placed in the flow field.To apply the boundary conditions,the ghost-cell technique is used.The implemented computational method is firstly validated through simulation of laminar and turbulent flows around a fixed circular cylinder.Finally,the flow around two circular cylinders in a tandem arrangement is simulated and analyzed.The flow visualization parameters,the Strouhal numbers,and drag and lift coefficients are comprehensively presented and compared for different cases in order to reveal the effect of the Reynolds number and gap spacing on the behavior of the flow.The obtained results have shown two completely distinct flow characteristics in laminar and turbulent regimes.     

Freestanding hierarchical porous carbon film derived from hybrid nanocellulose for high-power supercapacitors

Nanocellulose is a sustainable and eco-friendly nanomaterial derived from renewable biomass.In this study,we utilized the structural advantages of two types of nanocellulose and fabricated freestanding carbonized hybrid nanocellulose films as electrode materials for supercapacitors.The long cellulose nanofibrils (CNFs) formed a macroporous framework,and the short cellulose nanocrystals were assembled around the CNF framework and generated micro/mesopores.This two-level hierarchical porous structure was successfully preserved during carbonization because of a thin atomic layer deposited (ALD) Al2O3 conformal coating,which effectively prevented the aggregation of nanocellulose.These carbonized,partially graphitized nanocellulose fibers were interconnected,forming an integrated and highly conductive network with a large specific surface area of 1,244 m2·g-1.The two-level hierarchical porous structure facilitated fast ion transport in the film.When tested as an electrode material with a high mass loading of 4 mg·cm-2 for supercapacitors,the hierarchical porous carbon film derived from hybrid nanocellulose exhibited a specific capacitance of 170 F.g-1and extraordinary performance at high current densities.Even at a very high current of 50 A·g-1,it retained 65％ of its original specific capacitance,which makes it a promising electrode material for high-power applications.     

A constrained optimization approach for an adaptive generalized subspace tracking algorithm

In this paper, we present an orthonormal version of the generalized signal subspace tracking. It is based on an interpretation of the generalized signal subspace as the solution of a constrained minimization task. This algorithm, referred to as the CGST algorithm, guarantees the C_x-orthonormality of the estimated generalized signal subspace basis at each iteration which C_x denotes the correlation matrix of the sequence x(t). An efficient implementation of the proposed algorithm enhances applicability of it in real time applications.