The Politics of Internet Regulation in Brazil : dynamics, factors, and actors in broadband policy

In May 2010, Brazil joined the roll of nations with a National Broadband Plan. The Decree nº 7,175/2010 had implemented a program that aimed to offer 30 million permanent broadband accesses until 2014 and established its main goals, such as accelerating economic and social development, promoting digital inclusion, reducing social and regional inequalities, promoting a generation of employment and income, and expanding electronic government services. However, the broadband access in Brazil is limited, expensive, and centralized in the main urban centres. Despite the fast growth in the past years due to mobile internet access, the market is still concentrated in the local incumbent operators that currently provide mobile services, landline services and Paid-TV services, resulting in a high level of market verticalization. The following dissertation investigates the constraint of broadband access development, the dynamics, the actors, and the factors that have delayed the roll-out of broadband services in Brazil. The study also promotes reflections about the challenge posed by the media, by costumers associations and by public opinion as critical observers of the policy making process. This research examines on the political influence towards regulation to determine the way policy will benefit interest groups. Many interviews have been conducted in order to understand the forces which have been acting in the telecommunications in Brazil after privatization, in 1998. This study aims to provide a better understanding of telecommunications regulatory process in Brazil, in order to help the country finding an adequate policy which can lead to the implementation of a broadband roll-out. The universal broadband access is the only way to benefit the whole society in Brazil with a satisfactory level of education and create more jobs and economic development regarding the plenty use of Information and Communications Technology (ICT).

Authority files: Breaking out of the library silo to become signposts for research information

Authority files serve to uniquely identify real world ‘things’ or entities like documents, persons, organisations, and their properties, like relations and features. Already important in the classical library world, authority files are indispensable for adequate information retrieval and analysis in the computer age. This is because, even more than humans, computers are poor at handling ambiguity. Through authority files, people tell computers which terms, names or numbers refer to the same thing or have the same meaning by giving equivalent notions the same identifier. Thus, authority files signpost the internet where these identifiers are interlinked on the basis of relevance. When executing a query, computers are able to navigate from identifier to identifier by following these links and collect the queried information on these so-called ‘crosswalks’. In this context, identifiers also go under the name controlled access points. Identifiers become even more crucial now massive data collections like library catalogues or research datasets are releasing their till-now contained data directly to the internet. This development is coined Open Linked Data. The concatenating name for the internet is Web of Data instead of the classical Web of Documents.

Civil framework of the Internet : Law n°. 12.965, of April 23, 2014, which establishes the principles, guarantees, rights and duties for use of the Internet in Brazil

Traz atualizado o texto do Marco Civil Brasileiro da Internet, a Lei nº 12.965, de 23 de abril de 2014.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Use of social networks and the Internet 2.0 in marketing management by SMEs

Nowadays, enterprises, and especially SMEs, are immersed in a very difficult economic situation. Therefore, they need new and innovative tools to compete in that environment. Integration of the internet 2.0 and social networks in marketing strategies of companies could be the key to success. If social networks are well managed, they can bring a lot to enterprise plans. Moreover, social networks are very attractive from an economic point of view as companies can find most of their customers on it.

Whose News? Copyright and the Dissemination of News on the Internet

International Review of Law, Computers & Technology, Volume 17, Issue 2 July 2003 , pages 163 - 174 RAE2008