Envisioning a Compulsory-Licensing System for Digital Samples Through Emergent Technologies

Despite the rapid development of modern creative culture, federal copyright law has remained largely stable, steeped in decades of tradition and history. For the most part, copyright finds strength in its stability, surviving the rise of recorded music, software programs, and, perhaps the most disruptive technology of our generation, the internet. On the other hand, copyright’s resistance to change can be detrimental, as with digital sampling. Although sampling can be a highly creative practice, and although copyright purports to promote creativity, current copyright law often interferes with the practice of sampling. The result is a largely broken system: Those who can legally sample are usually able to do so because they are wealthy, influential, or both. Those who cannot legally sample often sample illegally. Many scholars have suggested statutory solutions to this problem. Arguably, the most workable solutions are rooted in compulsory licenses. Unfortunately, implementing these solutions is practically difficult. Two recent developments invite us to revisit these proposals. First, with the passage of the Music Modernization Act (“MMA”), Congress has evinced a willingness to “modernize” parts of copyright law. Second, emergent technologies—from the MMA’s musical-works database to blockchain to smart contracts—can be leveraged to more easily implement a compulsory-licensing solution. This time around, rather than simply discuss why this solution is favorable, this Note will focus on how it can be implemented

Intelligent hybrid cheapest cost and mobility optimization RAT selection approaches for heterogeneous wireless networks

The evolution of wireless networks has led to the deployment of different Radio Access Technologies (RATs) such as UMTS Terrestrial Radio Access Network (UTRAN), Long Term Evolution (LTE), Wireless Local Area Network (WLAN) and Mobile Worldwide Interoperability for Microwave Access (WiMAX) which are integrated through a common platform. Common Radio Resource Management (CRRM) was proposed to manage radio resource utilization in heterogeneous wireless networks and to provide the required Quality of Service (QoS) for allocated calls. RAT selection algorithms are an integral part of the CRRM algorithms. Their role is to decide, when a new or Vertical Handover (VHO) call is requested, which of the available RATs is most suitable to fit the need of the incoming call and when to admit them. This paper extends our earlier work on the proposed intelligent mobility optimization and proposes an intelligent hybrid cheapest cost RAT selection approach which aims to increase users' satisfaction by allocation users that are looking for cheapest cost connections to a RAT that offers the cheapest cost of service. A comparison for the performance of centralized load-balancing, proposed and distributed cheapest cost and mobility optimization algorithms is presented. Simulation results show that the proposed intelligent algorithms perform better than the centralized load-balancing and the distributed algorithms. © 2014 Academy Publisher

Performance analysis of the intelligent mobility optimization CRRM approach using a markovian chain model

Due to the increasing demand of wireless services, mobile technology has rapidly progressed towards the fourth generation (4G) networking paradigm. This generation will be heterogeneous in nature and it can be achieved through the integration of different Radio Access Technologies (RATs) over a common platform. Common Radio Resource Management (CRRM) was proposed to manage radio resource utilization in heterogeneous wireless networks and to provide required Quality of Service (QoS) for allocated calls. RAT selection algorithms are an integral part of the CRRM algorithms. Their role is to decide, when a new or Vertical Handover (VHO) call is requested, which of the available RATs is most suitable to fit the need of the incoming call and when to admit them. This paper extends our earlier work on the proposed intelligent hybrid mobility optimization RAT selection approach which allocates users in high mobility to the most suitable RAT and proposes an analytical presentation of the proposed approach in a multidimensional Markov chain model. A comparison for the performance of centralized load-balancing, distributed and the proposed intelligent mobility optimization algorithms is presented in terms of new calls blocking probability, VHO calls dropping probability, users' satisfactions probability, average networks load and average system throughput. Simulation and analytical results show that the proposed algorithm performs better than the centralized loadbalancing and distributed algorithms. © 2014 ACADEMY PUBLISHER

Advanced Model of Eddy-Current NDE Inverse Problem with Sparse Grid Algorithm

In model-based inverse problem, some unknown parameters need to be estimated. These parameters are used not only to characterize the physical properties of cracks, but also to describe the position of the probes (such as lift off and angles) in the calibration. After considering the effect of the position of the probes in the inverse problem, the accuracy of the inverse result will be improved.With increasing the number of the parameters in the inverse problems, the burden of calculations will increase exponentially in the traditional full grid method. The sparse grid algorithm which introduced by Sergey A. Smolyak was used in our work. With this algorithm, we obtain a powerful interpolation method that requires significantly fewer support nodes than conventional interpolation on a full grid. In this work,we combined sparse grid toolbox TASMANIAN which is produced by Oak Ridge National Laboratory and professional eddy-current NDE software VIC-3D®to solve a specific inverse problem. An advanced model based on our previous one is used to estimate depth and width of the crack, lift off and two angles of the position of probes. Considering the calibration process, pseudorandom noise is considered in the model and statistics behavior is discussed

Boundary-Integral Equations in Eddy-Current Calculations

Volume-integral equations have proven to be very successful in the computation of eddy-current probe-flaw responses for NDE problems having a number of simple geometries. This approach to NDE computations has proven superior to the finite-element approach in both accuracy and computer resources required, and is the basis of our proprietary code VIC-3D1. The volume-integral approach, however, is not as well adapted to accommodating the complex geometries sometimes required in practical applications. An example is the separation of edge and corner effects from the response of a flaw. We will discuss an extension of the volume-integral approach that incorporates boundary-integral equations to provide a description of complicated surface geometries

Advances in developing multiscale flaw models for eddy-current NDE

The need to accurately model multiscale phenomena is ubiquitous in eddy-current nondestructive evaluation. By using volume-integral equations, we are able to develop a very simple algorithm for accurately computing the response of a very small anomaly in the presence of a much larger one. We validate the algorithm and its associated code inVIC-3D{copyright, serif} through benchmark data on two test sets: (1) a notch at a bolt hole with an upper surface coil, and (2) a notch in a bolt hole with a plate surface coil

Recent Developments in Modeling Eddy-Current Probe-Flaw Interactions

A number of industries have been traditional users of eddy-current technology in nondestructive evaluation (NDE). The traditional mode of eddy-current inspection has been ‘monostatic,’ in which a single probe is used as both a ‘transmitter’ and ‘receiver’ Research in these industries now indicates the value of using ‘bistatic,’ or even ‘multistatic’ probe configurations, in which a single probe is used as a transmitter, and one or more probes are used as receivers. The probes may be either air core, or ferrite core, or perhaps a combination. Some examples of bistatic configurations are the split-core differential probe, and remote-field probes. The industry is turning to computer codes that are based on sophisticated computational electromagnetics algorithms in order to design these probes, and to interpret the signals that arise from the interaction of these probes with flaws

Strongly bounded groups and infinite powers of finite groups

We define a group as strongly bounded if every isometric action on a metric space has bounded orbits. This latter property is equivalent to the so-called uncountable strong cofinality, recently introduced by G. Bergman. Our main result is that G^I is strongly bounded when G is a finite, perfect group and I is any set. This strengthens a result of Koppelberg and Tits. We also prove that omega_1-existentially closed groups are strongly bounded.Comment: 10 pages, no figure. Versions 1-3 were entitled "Uncountable groups with Property (FH)". To appear in Comm. Algebr

Optimization of the OpenFlow Controller in Wireless Environments for Enhancing Mobility

OpenRoads or OpenFlow Wireless is an open-source platform for deploying an innovative and realistic strategy for different services in wireless networks. It provides a wireless extension for OpenFlow. It is developed to support existing Wireless Local Area Networks (WLANs) and Worldwide Interoperability for Microwave Access (WiMAX) networks. It can provide several mobility managers and run them concurrently in the network including hard handover, informed handover, n-casting and Hoolock. However, the provided mobility support for flow-based routing, where flows of one source taking different paths through multiple wireless access points or base stations, is not simple and hard to be deployed in the traditional routing algorithms. This paper proposes an intelligent mobility enhancement control and then develops an algorithm to decide which neighbor switches need to be selected for the installation of new flow entries and to allocate the appropriate idle-timeout for the selected switches. The proposed approach provides a simple solution to solve the user mobility problem in wireless OpenFlow environments which can handle the fast migration of user addresses (e.g. IP addresses) between several wireless access points and base stations. This approach leads to improvement in the end users' experience