The politics of the digital single market:Culture vs. competition vs. copyright

This paper examines the implications for European music culture of the European Union’s Digital Single Market strategy. It focuses on the regulatory framework being created for the management of copyright policy, and in particular the role played by Collective Management Organisations (or Collecting Societies). One of the many new opportunities created by digitalization has been the music streaming services. These depend on consumers being able to access music wherever they are, but such a system runs counter to the management of rights on a national basis and through collecting organisations who act as monopolies within their own territories. The result has been ‘geo-blocking’. The EU has attempted to resolve this problem in a variety of ways, most recently in a Directive designed to reform the CMOs. In this paper, we document these various efforts, showing them to be motivated by a deep-seated and persisting belief in the capacity of ‘competition’ to resolve problems that, we argue, actually lie elsewhere - in copyright policy itself. The result is that the EU’s intervention fails to address its core concern and threatens the diversity of European music culture by rewarding those who are already commercially successful

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints

In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: at each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a maximum number of visits and the temporal synchronization of deliveries) and evaluate the impact of these measures on carrier efficiency by means of different objective functions (comprising variable routing costs, costs related to route durations, fixed fleet costs). We consider the vehicle routing problem with time windows in which split deliveries are allowed (SDVRPTW) and define the corresponding generalization that takes into account customer inconvenience constraints (SDVRPTW-IC). We design an extended branch-and-cut algorithm to solve the SDVRPTW-IC and report on experimental results showing the impact of customer inconvenience constraints. We finally draw useful insights for logistics managers on the basis of the experimental analysis carried out

Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.The authors wish to thank three anonymous referees for their comments and valuable suggestions to improve the paper. The first author acknowledges Ciˆencia 2007 of FCT (Foundation for Science and Technology) Portugal for the fellowship grant C2007-UMINHO-ALGORITMI-04. Financial support from FEDER COMPETE (Operational Programme Thematic Factors of Competitiveness) and FCT under project FCOMP-01-0124-FEDER-022674 is also acknowledged

Fuzzy-logic controlled genetic algorithm for the rail-freight crew-scheduling problem

AbstractThis article presents a fuzzy-logic controlled genetic algorithm designed for the solution of the crew-scheduling problem in the rail-freight industry. This problem refers to the assignment of train drivers to a number of train trips in accordance with complex industrial and governmental regulations. In practice, it is a challenging task due to the massive quantity of train trips, large geographical span and significant number of restrictions. While genetic algorithms are capable of handling large data sets, they are prone to stalled evolution and premature convergence on a local optimum, thereby obstructing further search. In order to tackle these problems, the proposed genetic algorithm contains an embedded fuzzy-logic controller that adjusts the mutation and crossover probabilities in accordance with the genetic algorithm’s performance. The computational results demonstrate a 10% reduction in the cost of the schedule generated by this hybrid technique when compared with a genetic algorithm with fixed crossover and mutation rates

Insights Into Elevated Distortion Product Otoacoustic Emissions In Sickle Cell Disease: Comparisons of Hydroxyurea-treated and Non-treated Young Children

Distortion product otoacoustic emissions (DPOAEs) were examined in 15 normal- hearing African-American children between the ages of 6 and 14 years with homozygous sickle cell disease (SCD), who were on a regimen of hydroxyurea (HDU), a drug that reduces inflammatory processes and symptoms of SCD; a matched group of 15 African- American children with homozygous SCD not on HDU; and 15 African-American children with normal hemoglobin. DPOAEs were evoked by 13 primary tone pairs with f2 frequencies ranging from 1000 to 4500 Hz. Increased DPOAE amplitudes, believed to be a precursor of eventual hearing loss, were evident in children with SCD who were not receiving HDU. Those taking HDU had DPOAE amplitudes similar to normal controls. These findings suggest that HDU, in addition to reducing symptoms of SCD, may play a role in inhibiting or preventing cochlear pathology and hearing loss in individuals with SCD. Key Words: distortion product otoacoustic emissions; sickle cell disease; hydroxyurea Abbreviations: ABR = auditory brainstem response; DPOAE = distortion product otoacoustic emission; HDU = hydroxyurea; HbSS = homozygous sickle cell disease; ICAM = intercellular adhesion molecule; M = mean; OAE = otoacoustic emission; p = probability; PECAM = platelet-endothelial cell adhesion molecule SCD = sickle cell disease; SD = standard deviation of the mean; SOAE = spontaneous otoacoustic emission; TEOAE = transient evoked otoacoustic emission; VCAM = vascular cell adhesion molecule