text:
\section{Introduction}
Cost estimation is a major issue for operators, especially when their commercial expansion leads them to deploy networks on new territories often using new technologies. Today's world of mobility generates an  amount of challenging problems but does not eliminate the need to consider fixed connections that either constitute whole networks or are part of the infrastructure of mobile ones. High speed  optical connections are nowadays required wherever possible in order to satisfy customers. The problem for an operator lies in the words "wherever possible" that describe the technical feasibility as well as the financial impact of potential solutions; obviously the last one should be minimal. We consider here the design from scratch of a fixed network deployment at urban scale under cost and efficiency constraints.

The description of a realistic telecommunication network deployment involves a huge number of parameters not all equally well documented, spanning fields from geography, regional development, sociology, technology, etc\ldots\, One does not a priori know which of them will play a crucial role for a given analysis such as cost estimation in our case. For example, the physical links of fixed networks (optical fibres or copper wires) are located along the streets and therefore one can assume that it is compulsory to include the underlying road system in the formulation of the problem. But what is its real impact on the sought result? And what precise characteristics of the street system is it important to consider? Exhaustive reconstructions of deployment solutions cannot answer this for computational reasons (precise input data are often missing  and computing time to find optimal solutions is prohibitive) and due to the difficulty to extract the impact of each parameter from a set of solutions.

Once the architecture and deployment rules are known, optimization methods \cite{Grotschel,Chardy2} compute optimal locations for nodes and optimal ways for paths in order to minimize the cost of a network given the area of deployment. However, for planning purposes on a territory, other methods must be used to determine globally what would be the potentially best architectures and technical choices prior to the above mentioned detailed spatial localization of equipment. One class of such methods uses graph theory and complex networks theory to compute an estimation of the number of nodes and of the trenching length needed for a given urban area and a simple architecture \cite{Maniadakis:streetFTTH}.

 Another class of such methods are macroscopic models based on \textbf{\textit{stochastic geometry}}. Stochastic geometry \cite{Chiu} is the mathematical field of spatial probability and has a wide range of applications \cite{Kendall}. In particular, it allows an instantaneous analysis of modern telecommunication networks, which performances strongly depend on the spatial arrangement of their components, while focusing on global results rather than a detailed description of the network. This approach makes it possible to take into account and to understand the statistical complexity of the system by extracting its structuring parameters and explicitly showing how they impact the statistics of geometry dependent quantities. Here, one is not interested in the precise location of network equipment, but on statistics on quantities that are meaningful for the operator such as distances from customers to equipment, or costs, that can decide on the economic interest and/or technical feasibility of a network design on a particular area.

The idea of macroscopic models for fixed network is to replace actual locations of objects by random processes that take into account the main principles of their positioning while introducing a variability that represents the effect of numerous and unavoidable local constraints that compel in reality to slightly modify the planned locations. Random processes deal with geometrical objects of any shapes. Their definition explicitly describes some rules and associated parameters to randomly generate realizations of sets of these objects. So called "functionals" (for example the distances between pairs of points) can then be computed on each realization of the set. The aim of stochastic geometry is to derive closed form expressions for the output of the functional, depending on the type and parameters of the processes. In this way, statistics on the geometrical properties of sets of objects can be obtained instantaneously and independently of their number of elements.

This paper focuses on cost estimation of network at urban scale using the techniques of stochastic geometry. It is organized as follows: Section \ref{sec:methods} recalls the context of existing models developed in Orange Labs and explains the underlying mathematical objects involved; Section \ref{sec:implementation} describes how those objects are organized and integrated in a user-friendly tool to build a faithful macroscopic model of the implementation of a realistic network and its costs; Section \ref{sec:results} provides and discusses results on real cities and Section \ref{sec:conclusion} opens some perspectives.

\begin{figure}
\centering
\includegraphics{Fig_1.pdf}
\caption{(left) Formal architecture of a 2 levels network. The 2Net = \{HL, L\} is structured by LLs but does not include their characteristics in its definition. (right) An example of a network deployed on streets modelled by a PLT. HLs (circles) and LLs (dots) are located on the streets. All LLs located in the serving zone (black polygon) of a HL are connected to it; the physical paths of the links (thick black) follow the streets.}
\label{fig:Fig2Net}
\end{figure}

\section{Macroscopic modelling and methods}\label{sec:methods}
In \cite{Bacelli} a simple cost function for a hierarchical core network which nodes are located in the plane is considered and optimized to deduce the characteristics of the middle layer. To address access networks that describe connections to the customers, the location of networks equipment must be estimated considering the existing road system since the network nodes are located on or close to the streets. To take advantage of the power of stochastic modelling, all the parts of the model including the street system have to be randomized. Subsections below briefly present the work done in the past years concerning the randomization, respectively of the street system, the typical cell, the links and the capacity trees. Discussions and details can be found in the references.

\subsection{Elementary network} \label{subsec:2Net}
We call \textbf{\textit{node}} a geographical site containing various pieces of equipment, designed to perform specific functions in the network. Nodes of similar functions are referred to by their type such as PB (branching point) or PM (shared access point). This section will be devoted to the model of the elementary two levels network. Its architecture is the simplest one, involving low level nodes (LL), high level nodes (HL) and their formal \textbf{\textit{link}} (L) (Fig. \ref{fig:Fig2Net}%
). LL and HL must be of different types. Engineering rules ensure that any node LL is connected to a unique node HL and specify how the nodes and the physical path of the link are spatially located.

A \textbf{\textit{2Net}} is the formal representation of a number of HL nodes and their links L deployed on the territory to be served. Note that the characteristics of the links (number, length ...) depend on both HL and LL, but their description does not include any node characteristics. We shall explain below how a 2Net can be modelled by a unique spatial random object, the \textbf{\textit{typical cell}} and its content. Any hierarchical architecture can be represented as an assembly of 2Nets. For example a three levels purely hierarchical architecture from LL to HL is built form (HL, LL\_2, L\_2) and (HL\_1, LL, L\_1) by identification of LL\_2 and HL\_1. The generic aspect of the 2Net notion allows us to conduct generic computations on all network characteristics whatever the architecture (see Section \ref{subsec:network_design}).

\subsection{Models for street systems} \label{subsec:street}
The morphology of an urban street system reflects the history of the city. Ignoring dead-ends, the streets segments of a planar map constitute the edges of a planar tessellation. The cells of the tessellation are generally not uniform: their area, number of edges, etc\dots can vary from one cell to the other. To cope with this spatial variability, and ignoring the finite area of the map, it is viewed as a realization of a random stationary tessellation $\mathcal{T}$ that is fully determined by three independent scalar geometrical quantities averaged per unit area \cite{Moller:tessell}. We chose to represent the morphology of the map by the four-vector $\mathcal{M}_{real}$ composed of quantities than can be easily estimated: the mean number of crossings, of edges, of cells and the mean length of streets. The mean number of edges is included for checking purpose and should equal the mean number of crossings plus cells.

Simple homogeneous random models as Poisson Vorono\"{i}, Poisson Line and Poisson Delaunay tessellation (PVT, PLT and PDT) are good candidates to capture the morphology of a street system. Each one is fully described by a unique scalar intensity parameter $\gamma$. Their corresponding theoretical vector $\mathcal{M}_{theo}^{model}$ can be expressed as a function of $\gamma$, for example: $$\mathcal{M}_{theo}^{PVT}(\gamma)=(2 \gamma,3 \gamma,\gamma,2 \sqrt{\gamma})$$Then, a \textbf{\textit{fitting procedure}} \cite{Gloaguen:fitting} applied to the city map selects the best random model chosen in a set of available models and estimates its parameter by minimizing a distance between $\mathcal{M}_{real}$ and $\mathcal{M}_{theo}^{model}(\gamma)$. Realizations of the selected model look quite different from the real data, but averaged quantities are close. For example: 1855 crossings, 2937 edges, 1083 cells and 439 km streets measured in an area 53.9 km$^2$ of the French city of Pau, correspond to a PVT, $\gamma$=18.2 km$^{-2}$ and theoretical averages: 1961 crossings, 2941 edges, 980 cells and 460 km streets.

To cope with the frequent non stationarity of cities, a \textbf{\textit{segmentation}} procedure \cite{Courtat:physrev} automatically partitions the city in as many homogeneous parts as desired and fits the best model for each part. Simple Poisson models are sufficient for our final purpose, but better fits can be obtained considering iterated \cite{Maier:iterated}, STIT \cite{Nagel:stit} or Poisson Gabriel \cite{Courtat:these} tessellations.

\subsection{Nodes locations and typical cell} \label{subsec:typicalcell}
The above defined 2Net will be deployed in an area covered by a street system fitted by a random process. In order to anchor this 2Net to the territory, one has to specify (i) how to locate the nodes with respect to the streets and (ii) how to associate a unique HL to any LL, thus defining the HL serving zone with respect to LLs (Fig. \ref{fig:Fig2Net}).

The process for nodes is doubly stochastic (Poisson-Cox process) since they are assumed to be randomly positioned following a linear Poisson process on the random process for streets. Processes for HLs and LLs are assumed independent and are described by intensity parameters $\lambda_{HL}$ and $\lambda_{LL}$ under homogeneity assumption (see Appendix).

Any LL located in the geographical area called the serving zone of the HL will be connected to it. The serving zone of a HL is modelled as its Vorono\"i cell (set of points of the plane closest to this HL than to any other) constructed with the Euclidean metric. Any LL is thus almost surely connected to a single HL. Note that the set of all serving zones is a Poisson-Cox-Vorono\"i-Tessellation (PCVT) of the plane, different from a PVT since the location of HLs is restricted to the streets. We define the \textbf{\textit{typical cell}} as the random object which characteristics obey the statistics of the cells of PCVT. Fast algorithms for simulation of these cells are described in \cite{Gloaguen:typical,Fleischer:typical}. They are based on realizations of the street system supporting the HL and stopping criteria from neighbouring HLs locations. Links and capacity trees discussed below are mathematically defined relatively to those typical cells.

More complicated models using non Euclidean metric for the typical cells and Gibbs models for the location of nodes, could be thought more realistic. But the simpler assumptions above proved to be quite effective and sufficient for our macroscopic approach.

\subsection{Length of links within typical cells} \label{subsec:links}
The links between a HL and all the LLs included in its serving zone are assumed to follow the shortest paths along the streets. Their number as well as their lengths $\ell$ are random. Explicit formulas relating the average $\bar{\ell}$ to the parameters of the streets and nodes random models were proposed in \cite{Gloaguen:networks}. This is not enough for practical purpose on topics such as eligibility (\% of customers closer than a given length threshold to the highest node, ensuring a good quality for communication) that require to know the probability distribution of the length $dis_{LH}(\ell)$.

Closed parametric forms  $dis_{LH}^{model} (\gamma,\lambda_{HL},\ell)$ for the probability distribution of $\ell$ (see Appendix) are derived in \cite{Gloaguen:annales,Voss:densities}. The distribution does not depend on $\lambda_{LL}$ and may be understood as the distribution of lengths viewed from a typical LL, or as the distribution of all the lengths of links L in the network. The formulas include limit values and are valid in the whole range $)0,\infty[$ of parameters. They can be plugged in a software, avoiding lengthy simulations, and adapt to all possible cases.

This abstract construction has been successfully tested in \cite{Gloaguen:spaswin} by comparing simulation results to histograms for lengths of links obtained from real networks. The parametric formulas $dis_{LH}^{model}(\ell)$ provide a quantitative and explicit appreciation of the structuring features of our problem that are the morphology of the street system (represented by the random model) and the nature of the physical path of the link (in straight line or along the streets).

\subsection{Capacity trees within typical cells} \label{subsec:capacity}
\begin{figure}
\centering
\includegraphics[width=3. in]{Fig_2.pdf}
\caption{A realisation of a typical capacity tree on a PVT road system (red: path of the link, dotted black: uncovered streets).}
\label{fig:TypicalTree}
\end{figure}

However costs cannot be directly inferred from the distance distributions and one has to consider the multipoint to point tree rooted in HL to all the LLs of its serving zone. This tree has a meaning only if the physical paths of the links follow an underlying street system; then more than one link can share a common street segment. In optical networks, optical fibres are bundled in cables. The cabling policy selects which size of cable(s) will accommodate the \textbf{\textit{capacity}} of each street segment, i.e. the number of fibres running along it. Since the cost of cables depends on their size (for example a 12-fibre cable is quite cheaper than two 6-fibre ones) it is a major issue to study \textbf{\textit{capacity trees}} rooted in HLs. Cabling itself is considered as network engineering and will be addressed in Section \ref{subsec:cable}. In the framework of stochastic modelling, random capacity trees on street systems are extremely difficult to handle. Tentative definitions for structuring characteristics, such as typical sub trees, were investigated in \cite{Voss:capacity} together with estimators for the distribution function of their length. Since an HL is located almost surely on a street segment and not on a crossing, a capacity tree is composed of two half trees that are statistically dependent because they are constrained to live in the same cell. A parametric copula description for their lengths as well as asymptotic results for infinitely sparse or dense networks is studied in \cite{Neuhauser:halftrees}. Sparse random trees with a fixed number of two LLs are fully explored in \cite{Neuhauser:sparsetree}.

Since we do not have for now generic parametric formulas for the joint probability distributions of the various elements that will enter our cost function (number of cables merging, number of kilometres of cables for each cable capacity), we have to simulate the capacity trees.  The input parameters are $\gamma, \lambda_{HL}$, $\lambda_{LL}$ and the capacity $c$ incoming from each LL, assuming that all LLs bring in a common deterministic capacity. Future work could introduce some variability in this capacity.

A capacity tree is obtained from a realization of the typical cell and of the LLs (Fig. \ref{fig:TypicalTree}). The root of the tree is the HL. The final leaves are either an edge of the cell or a "midpoint" at which two different paths of equal length to the root HL exist. Note that a path to the HL may need to borrow streets outside the cell. A street element of constant capacity defines a "section" of the tree. Starting from a final leaf, the capacity changes (i) by adding $c$ each time we pass a LL (ii) by adding the capacities of incoming branches at a street crossing.  The vertices of the tree are the street crossings. The set of sections of non zero capacity is the portion of the road system covered by the network. The sections are indexed and each realization of the tree is stored in a text file containing information on vertices (planar location, index of parent vertex), contour of the typical cell, distance of LLs to HL, etc\ldots\, This allows a full reconstruction of the tree and offers the possibility of statistical analysis of all possible single or joined characteristics. For our purpose, only the length of covered streets and the joint distribution (capacity, length of sections) will be used. The limit cases mentioned above are not yet included in the tool that restricts the simulation to a given range of parameters, avoiding cases of too dense or too sparse networks.

\subsection{Problem formulation}
The sections above introduce typical random objects related to the description of an elementary two levels network. To model the deployment of this network in a realistic setting, one has to precise the geographical area $A$ to be covered (whole city or part of it) and the expected number $Z$ of serving zones (or equivalently of HL nodes) to consider. Added to the model for roads, this characterizes the parameters for the typical cell of averaged area $A/Z$ and the intensity $\lambda_{HL}$ (see Appendix). In real networks, the serving zones in $A$ are not identical and present a variability that is assumed to be correctly represented by the statistics of this typical cell. Rigorously, the covering of $A$ by typical cells should include some constraints on the sum of their areas and border effects should also be considered. For the sought applications, these corrections can be neglected and the very simple approach of combining the characteristics of $Z$ typical cells of identical parameters is sufficient.

To summarize, realistic access networks have their lowest level directly connected to the customers. They can be built by combining elementary 2Nets simply assuming for each of them that the serving zones are Vorono\"{i} areas in which the physical links follow shortest paths on the streets or in the plane. The above mentioned results mainly concern technical and geometrical aspects of the network (nodes, links and capacity trees).

The theoretical framework being complete, in order to achieve our goal to build an user-friendly tool for cost estimation, one still has to:
\begin{itemize}
\item enable the user to select a deployment territory, to design an architecture and to specify engineering rules,
\item specify how demography and road data should be selected and processed to be proposed as input for the tool,
\item enable the user to enter precise formulas allowing to compute the costs,
\item compare the results to data obtained in an operational context and explain the observed discrepancies.
\end{itemize}

\section{Implementation}
\label{sec:implementation}
Two tools were developed with the aim to allow a user to benchmark different architectures and several engineering parameters for each architecture, in order to compare them and to determine the optimal (with respect to costs and eligibility) architecture and engineering rules to deploy in a given city.

The \textbf{\textit{OSMMiner}} prototype (Fig. \ref{fig:osmminer}) is used first to acquire the territory data, choose the best model to fit them and compute the parameters of the model (Section \ref{subsec:territory}). Then, proceeding with the \textbf{\textit{NTSTool}} prototype, the user selects a territory and designs or selects an architecture (Fig. \ref{fig:ntstool}); the tool then implements the methodology described above to compute the distance and attenuation distributions and to estimate the deployment costs. NTSTool is designed to be generic for urban areas and can potentially address a variety of situations. Sections \ref{subsec:network_design} to \ref{subsec:costs} below focus on optical access networks.

\begin{figure}
\centering
\includegraphics[width=1.8in]{Fig_3.pdf}
\caption{Snapshot from OSM Miner showing the street system (grey) for the city of Bouake (Ivory Coast) and the "build-up" area limit computed by the tool (dotted yellow) that can be afterwards tailored by the user. }
\label{fig:osmminer}
\end{figure}

\begin{figure}
\centering
\includegraphics[width=2.5in]{Fig_4.png}
\caption{NTSTool prototype: the user can choose his territory (imported from the OSM Miner prototype), choose his architecture or design a new one, choose a scenario or enter a new one, and compute the probability distribution of the length of the links and the deployment costs}
\label{fig:ntstool}
\end{figure}

\subsection{Territory data acquisition and formatting}
\label{subsec:territory}
The road system of the territory is extracted from the Open Street Map (OSM) database \cite{OSM} since it has a worldwide coverage with a very detailed description of the various types of roads. Its rich typology allows to select the types of streets that will support the network wires while suppressing the useless or duplicated ones (eg. cycle ways or paths). Moreover, OSM comes with several free applications and is free of charge. OSM also provides information about buildings, but they are not always complete nor accurate.

The administrative boundary of a given municipality generally differs from the  "build-up" area limit inside which the streets are more or less continuously lined with buildings. The "build-up" area sometimes includes part of the neighbouring municipalities and contains most of the population of the city. It is thus the area of interest from the point of view of network deployment. A java code has been developed to automatically determine this limit using information on buildings. Since there are regions where no information on the buildings is available, the limit can also be deduced from the road system information only. The method is to sum up the number of buildings or streets in each square of a regular grid of adjustable size and to first eliminate the squares with a sum less than a threshold given by the user, and second the isolated squares (those with no more than one neighbour). A concave hull of the set of remaining squares is determined using \cite{Concave} and an algorithm directly inspired by \cite{Duckham}. The limit (Fig. \ref{fig:osmminer}) is given in the form of a standard OSM  ".poly" file  which can then be tailored if necessary by free tools like JOSM \cite{JOSM}.

Finally, to recover a planar graph for the town, i.e. the streets inside the build-up area, the longitude-latitude coordinates given by OSM are projected on the tangent plane at the center of the territory (which is small enough to neglect distortions). Following the methodology described in Section \ref{subsec:street}, dead-ends are removed in order to get a tessellation \cite{Courtat:these}, the town is segmented in as many parts as desired, and the best model for each part is determined with its intensity parameter (for now, one can chose among three tessellation models: PVT, PDT and PLT). The results are stored in a "\textbf{\textit{voirie}}" file constituted by as many lines as there are parts of the town, plus one line representing the town as a whole (Table \ref{tab:voirie}).

\begin{table}
\renewcommand{\arraystretch}{1.3}
\caption{Example of a "voirie" file for the French city of Nantes. Part1 is the dense core of the city.  }
\label{tab:voirie}
\centering
\begin{tabular}{cccc}
\hline
part & area (km $^2$) & model & intensity (km $^{-2}$)\\
\hline
1 &  2.181 & PVT & 125.642 \\
2 &  10.789 & PVT & 38.101 \\
3  & 40.011 & PVT & 13.877 \\
total & 52.981 &  PVT & 23.142  \\
\hline
\end{tabular}
\end{table}

In the same way, information about the households on the territory are stored, if available, in an "\textbf{\textit{habitat}}" file. For French cities, a complete description of the number of households contained in every building in all parts of the town can be obtained from various sources. But for countries where no such information is available, the user will be asked by NTSTool to provide its estimate of the number of households in each part of the town.

\subsection{Designing the network}
\label{subsec:network_design}

\subsubsection{Architecture}
An architecture designer is included in NTSTool , which enables the user to build his own architecture and immediately use the tool on this new architecture.

A general network architecture may have several branches (Fig. \ref{fig:archi}). Each branch will be represented as an independent set of 2Nets, the highest type of node of a secondary branch being identified with a type of node of the primary branch by an operation called \textbf{\textit{connector}}. A connector can be called either \textbf{\textit{identity connector}}, which means that the wires from the secondary branch will physically pass at the location and through the equipment of the common node, or \textbf{\textit{passage connector}}, which means the wires will physically pass at the location of the node without passing through the equipment (in which case, there is no signal attenuation at this node for the secondary branch).

Finally, a \textbf{\textit{mapping}} line is defined on the architecture. The 2Nets above the line are considered at the scale of the whole town (using the parameters of the last line of "voirie" file) and the 2Nets below are considered on each part of the town as listed in the "voirie" file described above.

\begin{figure}
\centering
\includegraphics[width=2.5in]{Fig_5.pdf}
\caption{The ZMD architecture: there are two branches, five 2Nets: (NRO,T), (PM,D), (PBO,J), (PM\_2,DD), (PBZ,JZ), a mapping line above the PM node (the (NRO,T) 2Net should be considered on the whole town while the other 2Nets should be considered separately on each part of the town), and an identity connector (PM and PM\_2 are the same nodes, wires of branch 1 go through the PM node to the NRO, while wires of branch 2 pass through the PM site and through the PM node).}
\label{fig:archi}
\end{figure}

\subsubsection{Engineering}
Orange chose to deploy optical fibre with a "Passive Optical Network" (PON) architecture. A "1:$n$ splitter" can be placed in each node to divide the signal from one single fibre to $n$ ($2, 4, 8, 16$ or $32$) fibres. Since each customer is connected to a fibre in the lower 2Nets, this guarantees a reasonable number of fibres at each level of the network. In order to deploy this network architecture through the town, this and additional information below must be provided by the user in a so-called \textbf{\textit{scenario}}.

One needs first to describe the general engineering rules that will decide on the total number of nodes in each part of the town. According to the rules chosen, the number of nodes of a given type can then be either directly entered by the user or deduced from the other data (the number of households to be served, or the number of nodes of the inferior level, or the number of wires coming out of the node, etc\ldots). Then, in order to complete the geometrical description of 2Nets, one has to specify how to compute the length of each link. A link does not necessarily follow the streets: for instance, the link from the last node to the customer is generally (all or part  of it) inside a building. So, when defining a link, the user is offered a choice between several possibilities: as the crow flies, following the streets, with constant distance or with randomized (following a normal distribution) distance.

The scenario also specifies the linear attenuation of the fibre (dB/km) and all possible causes that can generate a signal attenuation when passing through each type of node.

\subsection{Distances and attenuation}
\label{subsec:distances}
A 2Net is associated to a typical cell and thus to the probability distribution of the length of its link. If two 2Nets are one on top of the other in the architecture, the probability distribution of the length of the resulting link will be the convolution of the two probability distributions. The distribution of the total length of a branch is obtained by successive convolutions. The distribution of two branches in parallel is the mean of their distributions pondered by the number of customers. The 2Net notion being generic, this algorithm can be applied to any architecture designed by the user.

\begin{figure}
\centering
\includegraphics[width=3.0in]{Fig_6.jpg}
\caption{Example of an NTSTool output: the user can choose an attenuation threshold and see the percentage of customers under this threshold in the town}
\label{fig:pertes}
\end{figure}
From this point, the distribution of linear attenuation along the fibres can easily be computed; there remains to compute the attenuation at nodes. A splitting in $n$ fibres in a node corresponds to a signal attenuation of $10 log(1/n)$ dB.  By construction, a node in NTS contains various pieces of equipment that have to be connected, spliced, etc\ldots\, These operations are never perfect nor identically performed and can also generate some signal attenuation. Each type of attenuation, including splitting, is modelled in NTS by a random variable which law (Uniform or Normal) and parameters can be specified. The probability distribution of the total attenuation on each branch is the convolution of all the attenuation distributions associated to nodes and links.

Thus, given an architecture and a scenario, we are able to compute the attenuation distribution for the whole network, i.e. to say that $x$ percent of the customers in the city will be connected to the highest node with a signal attenuation less than $y$ (dB) to be chosen by the user (Fig. \ref{fig:pertes}).

Note that the convolutions are computed using a Fast Fourier Transform algorithm. The distribution functions have to be sampled with a sufficient number of $2^n$ points, so that the maximum value of the cumulative function of the final result is close to unity. The desired precision (ex. 0.999) is entered by the user. If necessary, the sampling is automatically refined ($n \rightarrow n+1$) to guarantee this goal. The detailed results (including all the sample points of the probability distribution curves) are stored as Excel files for individual 2Nets, branches and the whole network for further analysis.

\subsection{Cabling}\label{subsec:cable}

\subsubsection{Cabling policy}\label{subsec:policy}A realization of the capacity tree (see Section. \ref{subsec:capacity}) specifies the number of fibres running along each section of the street system covered by a 2Net. Optical fibres are gathered in cables of standard n-fibre types. The cabling policy decides which type(s) of cables to install to accommodate all those capacities.

Cabling a network is an extremely difficult problem \cite{Angilella:cablage}, even assuming as in NTS that each 2Net can be cabled independently. Note that this assumption is made in most optimization tools and its impact on final cost is judged small by operational teams.  Rigorously speaking, cabling policies should tend to minimize the global cost of cables that depend directly or indirectly on their length, number and types. This means that solutions favouring long big cables even with unused fibres could be better than solutions with shorter and cheaper cables (that generate supplementary costs when merged). NTS prototype uses the simplest policy~: a section of capacity $c$ is cabled with a single n-fibre cable with the lowest $n \ge c$. It can happen that sections close to the HL have a capacity greater that the highest available type of cables. In that case, an additional cable is added to the highest capacity one.

\subsubsection{Simulations}\label{subsec:simulations}
Now, capacity trees have to be simulated. Some constraints on the parameters ($\gamma, \lambda_{HL}, \lambda_{LL}$) ensure that the simulation time is not prohibitively long (most architectures in urban area are compatible with these constraints). The final user is required to enter a value for the number $N$ of simulations for each 2Net. As a hint, the tool gives him the choice $N_{a}$ that will insure at $95\%$ that the error on the mean values of the tree characteristics (mainly covered road system and length of segment capacities) will be less than a chosen percentage $a$ (following the central limit theorem), and the estimated time of simulation for the value he chooses. Of course, the error on the final result will also depend on the standard deviation of the distribution of each parameter, but this is limited because the sum of the surfaces of the real Vorono\"i cells is equal to the number of cells times the surface of the typical cell. Using the prototype, we could observe that very low values for $N$ ($N=5$ or $10$) already give very good results.

The joint distribution of (types, length) of cables for a 2Net is thus easily computed from the joint distribution of (capacity, length of sections) recovered from all the $N$ simulations. The required time to compute the cabling system for a whole 3-levels network does not exceed ten minutes.

\subsection{Cost computation}
\label{subsec:costs}

\subsubsection{Generic form}
To get the total deployment cost, we need to determine the cost function. This is mainly a question of expertise and know-how of the operator. However, any cost function can be described as a sum of basic bricks:
\begin{center}
 WU * data\_NTS * coeff
\end{center}
where:
\begin{itemize}
\item[1)] WU is a Work Unit, i.e. an unitary cost for an article, expressed in a given currency by the final user of the tool (ex: cost of a PMZ in Euros, cost of workforce for laying one kilometre of a 6-fibre cable...),
\item[2)] data\_NTS is a data, already available in NTSTool at this stage, from which the number of elements of the WU can be recovered.(ex: number of households, number of nodes of a given type, etc\ldots),
\item[3)] coeff is a coefficient given by the user (ex: margin multiplier).
\end{itemize}

A real cost function is usually  composed of a huge number of such basic bricks (one hundred is a rough estimate). The NTSTool prototype includes a "cost function builder" associated to the architecture that allows the user to define his own cost function. In order to ease his task as well as to give explicit and detailed results, it seems sensible to split the costs in four \textbf{\textit{categories}}: material, workforce, civil work (streets trenches etc\ldots) and studies (paperwork); this for as many levels as there are 2Nets in the architecture.  Basic bricks allow to consider a variety of costs as for example:
\begin{itemize}
\item the study costs for aerial Distribution. WU is the elementary study cost for aerial distribution in Euros; data\_NTS is the number of households and coeff is the \% of aerial distribution  (the distribution can also be buried or on fa\c{c}ades),
\item the civil work costs for chambers. Chambers are manholes used to install new cables or monitor the bundles of cables running under the pavement. They have to be explored prior to any deployment in order to check the space for cables, and thus generate costs. WU is the civil work cost for one chamber in Euros; data\_NTS is the length of covered streets and coeff is one over the mean interval between chambers.
\end{itemize}

Note that the cost of cables writes in a special way. For each link, a family of available cables and associated costs (material and workforce) for one meter of each type of cables, are provided by the user. The cabling procedure (Section \ref{subsec:cable}) computes an histogram of (types, length) of cables for each 2Net that is easily converted in costs.

Another splitting of costs results in fixed and variable parts may be useful to evaluate the impact of architecture and/or scenario choices on the global cost. Variable costs depend on the architecture and fixed costs - studies and junction 2Nets - depend only on fixed parameters like the number of households to serve in the city.

\section{Results} \label{sec:results}
\subsection{Comparison setting}
\textbf{\textit{GPON Optimizer}} \cite{Chardy2} is an Orange optimization tool that determines the optimal locations of the nodes, the exact paths of the fibres and the optimal cabling scheme on the real cities' streets given the architecture and the engineering constraints in order to minimize the deployment global cost. GPON exclusively considers the architecture required by the French regulator Arcep \cite{Arcep} for deployment in "less dense areas" of France (Fig. \ref{fig:archi}) with the standard deployment rules used by Orange for fibre deployment (mainly 1:32 splitter in the PM and 1:2 splitter in the NRO (central office), and a mean of 340 households for a PM). An additional regulator rule demands operators to reserve two extra-fibres for competitors for each fibre going from the PM to the NRO, so that the transport cables out of the PM are always 36-fibre ones. The optimization process being complex and thus lengthy, GPON is limited to rather small areas.

\textbf{\textit{NTSTool}} is conceived to provide statistical results representative of the deployment of a network on a sufficiently large and/or with sufficient spatial variability territory. The above architecture and scenario are easily described for NTSTool, including the additional regulator rule.

In order to check the plausibility of our results, we compare them with the results obtained by GPON Optimizer on parts of two french cities Tours and Rouen. The tests are conducted on one NRO serving zone (Fig. \ref{fig:mapToursRouen}) that constitutes a standard area for GPON Optimizer use, but is at the limit range of size for NTS.  Note that the secondary branch of the architecture does not exist in the territories under study since they do not contain sufficiently huge buildings and that due to their small size they are not segmented (one line in the voirie file). The NTS cost function is built with the same WU than those given in GPON Optimizer.

\begin{figure}
\centering
\includegraphics[height=3. cm]{Fig_7a.jpg} \includegraphics[height=3.5 cm]{Fig_7b.jpg}
\caption{Deployment territories used for comparing NTS and GPON. (left) 185 km streets on 9.2 km$^2$ extracted from Tours. (right) 199 km streets on 8.6 km$^2$ extracted from Rouen.}
\label{fig:mapToursRouen}
\end{figure}
The results are given for Tours and Rouen, respectively on transport (T), distribution (D) and junction (J) 2Nets. The time needed for 3500 simulations on the D links and 300 simulations on the T link with NTSTool was a few minutes for Tours and for Rouen (while the time needed for GPON Optimizer tool is of course much larger: several scores of hours).

\subsection{Special case of the last link}\label{subsec:lastlink}
On each branch of the architecture, the last link, between the lowest level node and the final customer, is composed of two parts: one inside the building and one between the building and the NTS node located on the street. In France, the lowest level node is generally placed inside the buildings, while NTS locates all the nodes on the streets, which means that while the first part should be included in the J link, the second one is part of the D link.

The first part is generally a standard kit of fixed price for each household and the workforce to install it is forfeited. Its cost depends only on the number of households to be  equipped in the city and is easily computed. The second part is a cable that can contain a variable number of fibres to accommodate the number of households in the building (one fibre for each household) and runs between the building and the street (and more precisely the closest chamber in the street). A random variable length could have been associated to this type of link, but a fixed length of 15 meters estimated in french cities as a mean proved to be enough. Two cabling policies were considered, compatible with FTTH deployment~: using only 12-fibre cables (policy 1) or using cables adapted to the number of household in each building (policy 2). This has of course some influence on the cabling cost. Policy 1 gives a rougher estimate but may be used when precise information on buildings is unknown (for instance in some African countries).

\subsection{Causes of differences on the cost evaluation}
The NTS cost function is built with the same WUs than those given in GPON Optimizer, but there are still well identified major causes that stand for the differences between NTS and GPON results in the test.

\textbf{\textit{Errors NTS vs reality}}. Cause \textbf{($C_1$)} comes from WUs that cannot be represented at all or can only be estimated. For example, there exist some network pieces of equipment such as "PA" (Access Point not containing any network equipment) for which it is impossible to write a rule with the scenario builder of NTS. All such WUs that cannot be represented in NTS are gathered and referred to as "Uncounted". It happens also that some WUs have to be approximated since they strongly depend on unknown minute details of the deployment. For instance, the civil works cost of chambers mentioned above depends on the exact number of chambers to be inspected and on their depth. This data being unknown, the number of chambers is estimated assuming a mean 100 meters distance between chambers and taking the cost of inspection for small depths.
\begin{figure}
\centering
\includegraphics[height=3.3 cm]{Fig_8a.pdf} \includegraphics[height=3.3 cm]{Fig_8b.pdf}
\caption{Transport 2Net in Tours. Probability distributions of the area of the NRO serving zone (top) and of the length of T Links (bottom).}
\label{fig:randomTours}
\end{figure}

Cause  \textbf{($C_2$)} is due to NTS methodology itself, based on randomness. NTS proposes probability distributions for relevant quantities that can compare to reality only when the "law of big numbers" holds. This statistical nature of NTS results is illustrated by the geometrical characteristics of the Transport \{NRO, T\} 2Net. Recall that the territory area is in reality one NRO serving zone of deterministic area $A_T$. It is modelled in NTS by a random typical cell having the same average area $A_T$ and the probability distribution of Fig.
\ref{fig:randomTours}. In Tours, the averaged number of LLs connected to one NRO is more than a hundred. Then even considering a single NRO cell, the probability distribution of the lengths of T links provided by NTS (Fig. \ref{fig:randomTours}) is close to the one obtained by GPON that optimizes the locations of the LLs.

\textbf{\textit{Differences NTS vs GPON}}. GPON Optimizer uses a much more elaborated cabling policy than NTSTool's one described in Section \ref{subsec:cable}. This is the cause \textbf{($C_3$)} of some differences that will probably remain even if more sophisticated policies are  integrated in the tool. Cause \textbf{($C_4$)} is produced by some heuristic cabling strategies used by GPON in order to reduce the computing time. The final class of causes \textbf{($C_5$)} is that GPON itself is also a representation of the reality that introduces its own assumptions and depends on detailed databases not always complete nor accurate.

Given a 2Net and a cost category, the difference is computed as $\bigtriangleup$=(NTS-GPON)/GPON, with positive values whenever NTS costs are greater than GPON ones. For "Uncounted", $\bigtriangleup$ is computed as minus the ratio of GPON costs for Uncounted divided by the total GPON cost.

\subsection{Discussion on Tours }
This section analyses the results for T, D and J 2Nets in Tours and explains the major observed differences with respect to the causes introduced above.

The \textbf{\textit{Transport}} cables histograms for NTSTool and GPON (Fig. \ref{fig:cables_trans_Tours}) shows that NTS underestimates the 720-fibre cables and correspondingly overestimates the 72, 144 and 288-fibre cables. This is mainly explained by \textbf{($C_3$)} because GPON considers over-sized 720-fibres cables if this eventually proves cheaper.
\begin{figure}
\centering
\includegraphics{Fig_9.pdf}
\caption{The histogram of transport cables in Tours: the x-axis gives the various types of cables used for transport.}
\label{fig:cables_trans_Tours}
\end{figure}

\begin{table}
\renewcommand{\arraystretch}{1.3}
\caption{Variable costs in Tours, detailed difference $\Delta$ for transport}
\label{tab:trans_Tours}
\centering
\begin{tabular}{ccc}
\hline
Category & & $\Delta$ \\
\hline
\multirow{3}{*}{Material} & Nodes &  -2\% \\
& Cables & -8\%\\
& Uncounted & -4\%\\
\hline
\multirow{3}{*}{Workforce} & Nodes & 2\%\\
& Cables & 17\%\\
& Uncounted & -41\%\\
\hline
Civil work & Chambers & -29\%\\
\hline
\hline
Total variable&  & -21\%\\
\hline
\end{tabular}
\end{table}
Regarding the variable transport costs (detailed in Table \ref{tab:trans_Tours}), note that the  "Uncounted" lines \textbf{($C_1$)} are by far the main source of differences. The covered part of the road system -and thus the cable workforce- is overestimated in NTS \textbf{($C_2$)}. The total number of chambers is slightly underestimated and they are all associated to small depths \textbf{($C_1$)}; this explains the underestimation of the civil works cost. However, the civil work costs being quite low compared to the other costs, the impact on the total cost is weak. Table \ref{tab:Tours} synthesizes the differences for the fixed (studies), variable parts and total T cost and separately for the cable costs (material and workforce). Overall, for transport in Tours, the cable costs are only 2\% lower for NTS, while the variable costs are much underestimated due to the "Uncounted".

\begin{table}
\renewcommand{\arraystretch}{1.3}
\caption{Total costs in Tours: difference $\bigtriangleup$ between NTS and GPON. Policy 2 is used for Distribution.}
\label{tab:Tours}
\centering
\begin{tabular}{cccc||c}
\hline
 & Fixed & Variable & Total & Cables \\
\hline
Transport & 0 \% & -21 \% & -8 \% & -2 \% \\
Distribution &0 \% & -8 \% & -7 \% & -8 \% \\
Junction &-1 \% & 0 \% & -1 \% & 0 \%\\
Total &-1 \% & -9 \% & -4 \% & -6 \%\\
\hline
\end{tabular}
\end{table}

\begin{figure}
\centering
\includegraphics{Fig_10.pdf}
\caption{The histogram of distribution cables for Tours. NTS adds 15 m of cables from street to buildings: 12-fibre (policy 1) or n-fibre depending on household number (policy 2). The x-axis gives the various types of cables used for distribution.}
\label{fig:cables_dist_Tours}
\end{figure}

The \textbf{\textit{Distribution}} cables histograms (Fig. \ref{fig:cables_dist_Tours}) compares GPON to NTS and shows the impact of the cabling policy for the last link (Section \ref{subsec:lastlink}). GPON overestimates the number of 6-fibre cables \textbf{($C_5$)}. NTS predicts no 6-fibre cables and a big number of 12-fibre cables in policy 1. With policy 2 NTS is close to GPON apart from the 6-fibre cables. The main differences come again from the "Uncounted" \textbf{($C_1$)} which are fewer for distribution and from the civil works costs (same reason than for T). Here however, the covered part of the road system is underestimated in NTS (and with it the cable workforce), due to the fact that the dead-ends are not accounted for \textbf{($C_1$)}. This can be partly corrected by taking into account in the tool their total length that can be saved while analyzing the city prior to the fitting step.

\begin{table}
\renewcommand{\arraystretch}{1.3}
\caption{Variable costs in Tours, detailed difference $\bigtriangleup$ for distribution, policy 2}
\label{tab:dist_Tours}
\centering
\begin{tabular}{ccc}
\hline
Category & &  $\bigtriangleup$  \\
\hline
\multirow{3}{*}{Material} & Nodes &  1\% \\
& Cables & 0\%\\
& Uncounted & -8\%\\
\hline
\multirow{3}{*}{Workforce} & Nodes & -1\%\\
& Cables & -14\%\\
& Uncounted & -10\%\\
\hline
Civil work & Chambers & -17\%\\
\hline \hline
Total variable& & -8\%\\
\hline
\end{tabular}
\end{table}

The \textbf{\textit{Junction}} 2Net generates fixed costs deduced from the number of households. The 2\% difference comes from some Uncounted and approximations in the kits prices \textbf{($C_1$)}.

Finally, the global cost difference is less than 4\% (Table \ref{tab:Tours}), mainly due to those "Uncounted" features of the GPON cost function that were not easily reproducible in NTS.

\subsection{Discussion on Rouen }
The results for Rouen were analysed in the same detailed way and the differences have similar  causes and trends than in Tours (Table \ref{tab:Rouen}): (i) the global cost difference is less than 4 \%, mainly due to "Uncounted" (ii) the difference regarding the cost of the cables is less than 1 \% and (iii) the error on the variable part of the total costs is less than 8\%, which is precise enough both to compare different scenarios and to fix a budget.

\begin{table}
\renewcommand{\arraystretch}{1.3}
\caption{Total costs in Rouen: difference $\bigtriangleup$ between NTS and GPON. Policy 2 is used for Distribution.}
\label{tab:Rouen}
\centering
\begin{tabular}{cccc||c}
\hline
 & Fixed & Variable & Total & Cables \\
\hline
Transport & 0 \% & -22 \% & -8 \% & 1 \% \\
Distribution& 0 \% & 5 \% & -5 \%& 1 \% \\
Junction & -2 \% & 0 \% & -2 \% & 0 \% \\
Total & -2 \% & -8 \% & -4 \% & -1 \% \\
\hline
\end{tabular}
\end{table}

\section{Conclusion}
\label{sec:conclusion}
The theoretical results developed in previous works were implemented in two user-friendly prototypes for cost estimation of fixed access network deployment on any urban area with very short computing time. The idea is to let the user try several architectures and scenarios in order to compare them and determine the best one according to its criteria. On a specific use case (deploying optical fibre) the costs obtained are very close to those computed by an Orange optimization tool based on an entirely different approach. The NTS methodology based on statistical modelling proved to be quite efficient even on the small areas considered in the comparison. The tools are modular and will be enriched by non-isotropic models for streets (Manhattan) and extended to rural areas.

The range of applications of OSMMiner/NTSTool prototypes is quite large since they make it possible to consider any architecture and scenario on any urban or rural area. We are currently considering  using their results on  the fibre networks linking mobile base stations to antennas, as well as on electrical networks. Another possible application is to evaluate the distance to drive in order to maintain all the mobile sites in a country, depending on the number of maintenance centres: this could allow us to better challenge the costs declared by the sub-contractors.

\section*{Appendix : Retreiving model parameters from reality}
\label{app:def}
A two levels network with a number $N_H$ of high nodes HL and $N_L$ of low nodes LL is to be deployed on a territory $T$ of area $A$ (km$^2$). Let us assume that the fitting process identified a PVT model of intensity $\gamma$ (km$^{-2}$) for the streets and recall that the corresponding morphological vector is
$$\mathcal{M}_{theo}^{PVT}(\gamma)=(2 \gamma,3 \gamma,\gamma,\tau= 2 \sqrt{\gamma}),$$
where $\tau$ (km$^{-1}$) is the average length of streets par unit area.

The averaged area of a HL serving zone is then $A /N_H$ since everything is assumed homogeneous. It contains a mean length of streets $L_s= \tau A /N_H$ (km) and is assimilated to the area of the typical "Poisson-Cox-Vorono\"i" cell centred on HL. This typical cell also contains by construction a unique HL thus giving $\lambda_{HL}=1/L_s$ (km$^{-1}$) for the linear intensity of the random process that models HL locations on the streets. A key parameter is the dimensionless ratio $\kappa= \tau / \lambda_{HL} =4 \gamma A /N_H.$
A high (resp. low) value of $\kappa$ describes a typical cell with a dense (resp. sparse) street system.

Using scaling arguments, Palm theory and statistical analysis of extensive simulation data, it is shown that for $\kappa \ge 1$ the probability distribution of length $\ell$ (km) writes:
$$dis_{LH}^{PVT} (\gamma,\lambda_{HL},\ell)=\tau W_t(a(\kappa), b(\kappa),c(\kappa),\tau\ell) $$
where $a, b, c $ are known polynomial functions and $W_t$ is the truncated Weibull probability distribution
$$W_t(a,b,c,x)=\frac{a}{b} C^a (\frac{x}{b}+C)^{a-1} e^{(\frac{x}{b}+C)^a}$$
with $C=(bc/a)^{1/(a-1)}$. Explicit formulas exist for the cumulative function, quantile and average of $W_t$ distribution. Theoretical considerations provide formulas for $\kappa <1$.  Similar expressions hold for the others PLT and PDT models, using the associated expression for $\tau$.
\bigskip

\textbf{Acknowledgments} The authors would like to thank M Jean-Philippe Lanquetin  and  M Patrick Boss\'e (Orange engineers), as well as  M Yu Hao, Ms Wenting Bao and Ms Lena Schmidt (Orange interns) who participated in the development of the two prototypes.

redpajama_set_name: RedPajamaArXiv


text:
Siasat.com/News/India/Govt plans to introduce 16 new bills in upcoming Winter session of Parliament
Govt plans to introduce 16 new bills in upcoming Winter session of Parliament
It also aims to improve monitoring mechanism and ensuring ease of doing business for multi-state cooperative societies.
Press Trust of India| Posted by Mansoor Hameed | Published: 1st December 2022 9:34 pm IST
Indian Parliament
New Delhi: The government has planned to introduce 16 new bills, including the one which seeks to increase accountability and reform electoral process in multi-state cooperative societies, in the Winter Session of Parliament beginning December 7.
The National Dental Commission Bill, which seeks to set up a National Dental Commission and to repeal the Dentists Act, 1948, is also in the tentative session agenda of the government.
The National Nursing and Midwifery Commission Bill, another measure the Health Ministry plans to introduce, seeks to set up a National Nursing and Midwifery Commission (NNMC) and to repeal the Indian Nursing Council Act, 1947.
According to a Lok Sabha bulletin issued on Thursday, the Multi-State Cooperative Societies (Amendment) Bill, 2022, is being introduced with an objective of strengthening governance, enhancing transparency, increasing accountability and reforming electoral process in the multi-state cooperative societies by supplementing existing legislation and incorporating the provisions of 97th Constitution amendment.
The Cantonment Bill, 2022, is another draft law the government proposes to bring in the session which will conclude on December 29.
The cantonment bill relates to the administration of cantonments with a view to impart greater democratisation, modernisation and efficiency.
VHP launches nationwide campaign against 'love jihad', illegal religious conversions
It also seeks to achieve greater developmental objectives in alignment with municipalities across the country. The Bill also intends to facilitate 'ease of living' in cantonments.
Another bill in the list is the Old Grant (Regulation) Bill, 2022.
The purpose of the bill is to regulate land given under Governor General Orders of 1836, 1827, 1838, 1849 and 1851, including their transfer, subdivision and change of purpose. It also seeks to delegate powers for better management of such land.
The bill aims to enhance ease of living while ensuring effective protection of
government rights over the land.
The Forest (Conservation) Amendment Bill seeks to amend the Forest (Conservation) Act, 1980. It also envisages to remove ambiguity in the applicability of the provisions of the Act, promote plantation in non-forest areas and conserve the forests.
The Coastal Aquaculture Authority (Amendment) Bill, 2022, which the government proposes to bring seeks to revise the provisions of the principal Act to reduce the regulatory compliance burden to the stakeholders without diluting the core
principles of environment protection in coastal areas.
It also proposes to decriminalise "the offence(s)" under the Act and to expand the scope of the law to bring all coastal aquaculture activities under its ambit.
It also aims to remove difficulties and regulatory gaps in the Act for effective implementation, and to facilitate ease of doing business.
Central Government India news Parliament Winter Session
Get the news updates on WhatsApp & Telegram by subscribing to our channels. For all the latest India updates, download our app Android and iOS.

redpajama_set_name: RedPajamaCommonCrawl


Including work from home jobs for mums, work from home entry jobs and admin work from home.
There are lots of ways to earn money as a mum, regardless of if you're looking to supplement your existing income or looking to start bringing money in after maternity leave.
And no, we aren't talking about small change here, these are real home based jobs for mums.
With the UK currently not showing any signs of following the Scandinavian countries in their approach to flexible working, many of us working mums have to turn away from traditional employment and find jobs working from home.
No matter your skill, there will be a home based job for you; you just need to go out and find them. Have a look at my 101 Genuine Work From Home Jobs in the UK post for more home based work inspiration.
Many stay at home mums fear being scammed while working mums don't want the hassle of declaring their extra income to HMRC.
But if you're willing to jump through a few hoops and do a bit of research, then home based working can be amazing and fit around your family.
Please don't let fear put you off!
If you like the sound of home based working but are unsure how to keep track of your time or even how to invoice, then have a look at The Virtual Assistant Essential Tool Kit.
This is the ultimate spreadsheet pack for your home based role. You don't have to be a Virtual Assistant, any data entry, social media or admin based role would work.
This has been made for mums who have never worked in a data entry role before but who would like to start working from home.
Take the plunge and watch how you spend less time invoicing and more time getting clients.
So if you have always wanted to have a home based job but are unsure on what you can do, then here are 35 jobs you can do while working from home on your computer. These are all legit and can be done anytime night or day.
Completely home based, selling your own products can be very profitable, especially if you source your products from overseas.
It does take a bit more work than a bricks store, but without the overheads, you can receive a more higher profit.
Start by researching the products you want to buy and see if there is a market for it. Think about where you will store the items and how much will it cost to ship them.
Reselling on sites like eBay or Facebay is becoming more popular. You can start by just selling your kids outgrown clothes or toys then start buying products in to sell.
You can search your products cheaply from car boot sales, charity shops and auctions.
It's best best to start by looking at the marketplace sites and seeing what sales for what.
What fees could there be to ship the item? Is the profit worth it?
There's so much you can do if you are a photographer.
You can either sell your photos online with a licensing agreement or show your services.
Both make good money, but the first one can make you passive income while the second you will need to actively find clients.
If you're creative, then sites like Etsy are for you. They focus on everything handmade and it's very easy to set up and get started.
Registering as a childminder is a great work from home entry job that anyone can do. You can look after your own kids while looking after others, all from your own home.
The downside is that there is a lot of admin and after hours work needed, but it does mean that you can work for yourself and pick your own days and hours.
Ok, so not at home all the time, but you can take the kids with you and earn anything from £6-£10 an hour.
You can start by registering your self as a dog walking company at Nards.
This is a great way to work from home as a mum around the kids and still make money.
You can advertise via Facebook and by just telling your family and spreading the word.
Tutoring is a great work from home job for mums who want to supplement their income part time.
Again, this can be quite open but you could look for jobs that involve pay-per-click advertising or brand development. All calls can be done over Skype and the role is so big, that there is scope to go anyway you like.
If you have the head for numbers, then trading stocks at home is for you.
Your job would be to buy and sell financial products like stocks and shares in order to get the best rewards for your clients, whether they're individual people or huge corporations.
Experience in a similar financial capacity works if you need to enter at entry-level.
You can also start trading with just a small amount of your money, to show people what you can do.
If you would like to know how to start, then I'd suggest having a look at Dr Nikki Ramskill's course, The Beginner's Guide To Investing.
Taking part in focus groups is a great way to make extra money.
Focus groups allow companies to get an idea about how their potential customers will react to their new product or service and make any changes before it is released.
In order to get your valuable feedback, they will pay for your time. You can also complete focus groups online, so you can earn money from the comfort of your own home.
If you're just looking for a bit of extra money that you can do on the go, then this list is for you.
This applies to anything to do with your home really.
Just Park is a good site if you fancy letting out your drive. If you live near a train station, hospital or a city center, then you're sure to earn a bob or two a month.
If you're doing it correctly, you will never loose any money, but you do need to take your time and be really careful to avoid any mistakes. Using a company like Profit Accumulator means that you don't have to work out the odds or be worried that you're doing it all wrong.
Make sure you understand fully before you deposit any money. Follow our guide here to make your first £20 matched bet.
A handy little earner that you can do on your laptop while watching TV. You won't necessarily make bundles of cash, but for just 20 minutes or so work, you could make a few pounds.
Weirdly, not many of us use cashback sites, which is strange, as you can earn money back from just buying your normal day to day items. From grocery shopping to insurance to household bills!
Search for what you need and buy it through a cashback site and you'll get back a percentage of what you spend. I currently use Top Cashback*, but there are loads out there just as good.
Nope, this isn't a joke!
It's really easy, legal, and the bank do everything, so you don't have too. You can read more about earning money by switching your bank account here.
It goes without saying but you can get some pretty neat stuff through entering competitions. I've been lucky enough to win event tickets, hampers and a weekend away for two in a five-star hotel!
Think about it this way, there are so many online competitions out there that many people just glaze over. The more people that ignore them, the more chance you have of winning.
They are so easy to enter and normally all you have to do is give a quick like or comment on social media or type in your email address. I do so many now that I have a separate Gmail account for just competition entries!
The easiest place to find them all is on Money Saving Expert, where many Compers have already sniffed them out and posted them online. Win!
Like talking to other mums who like making and saving money? Then come join my Facebook group, Money Saving Mums, a community for mums who want to save their family money.
I really hope these tips help you to find a work from home opportunity that suits your lifestyle and your needs.


Rihanna - Behind The Scenes of "Where Have You Been"
NEW YORK, NY - NOVEMBER 07: A general view of atmosphere backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: A model prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Victoria's Secret Angel Alessandra Ambrosio prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Victoria's Secret Angel Miranda Kerr prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Victoria's Secret Angel Adriana Lima prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Barbara Fialho prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Models Barbara Fialho (L) and Cameron Russell prepare backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Liu Wen prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Barbara Palvin prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Victoria's Secret Angels Behati Prinsloo and Lily Aldridge prepare backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Bregje Heinen prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Doutzen Kroes prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Erin Heatherton prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Sui He prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Izabel Goulart prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Jasmine Tookes prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Model Jessica Hart prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
NEW YORK, NY - NOVEMBER 07: Victoria's Secret Angel Lindsay Ellingson prepares backstage at the 2012 Victoria's Secret Fashion Show at the Lexington Avenue Armory on November 7, 2012 in New York City.
"Just realized how dumb u look takin self pix on iPhone thanx to @leandra246"
"I woke up this morning and decided I'm over Hollywood's perfection requirement. To all my girls(and boys) who have ever been embarrassed by their skin! I salute you! I'm not perfect - and that's okay with me!"
"No make up day :) and IDC :)"
"Reunited and it feels so good... Me & Kitty Purry havin a kip."
"The no make up look... Glam look to follow"
"Just found my favorite pj's! Got to be up at 5am for @e_fashionpolice thank god for my jet lag & comfy bed night night #tweethearts"


text:
By Federico Mazzella ,
Home / Editorial / Editorial Staff
Editorial n233
This is a monthly publication property of the Institute for the Integration of Latin America and the Caribbean, Inter-American Development Bank (IDB-INTAL). All rights reserved.
Information sources: Press releases and clippings from: LAIA; IDB; CARICOM; Andean Community; Euro-Lat; Group of 77; ACS; Group of Rio; MERCOSUR; PARLATINO; LAES; SG-SICA; SIECA. Official and International Agencies. INTAL Press.
Steering Committee:
Antoni Estevadeordal
Gustavo Beliz
Alejandro Ramos Martínez
Technical advisory:
Andrea Benítez
Santiago Chelala
Soledad Codoni
Ramiro Conte Grand
Ignacio Estévez
Alejandra Radl
Linda Plata Currán
Ana Basco
Julieta Tarquini
Web Editing:
Gastón Casella
Federico Mazzella
R.P.I.: 5234654
Copyright © 2016 Inter-American Development Bank. This work is licensed under a Creative Commons IGO 3.0 Attribution-NonCommercial-NoDerivatives (CC-IGO BY-NC-ND 3.0 IGO) license (http://creativecommons.org/licenses/by-nc-nd/3.0/igo/legalcode) and may be reproduced with attribution to the IDB and for any non-commercial purpose. No derivative work is allowed.
Any dispute related to the use of the works of the IDB that cannot be settled amicably shall be submitted to arbitration pursuant to the UNCITRAL rules. The use of the IDB's name for any purpose other than for attribution, and the use of IDB's logo shall be subject to a separate written license agreement between the IDB and the user and is not authorized as part of this CC-IGO license.
Note that link provided above includes additional terms and conditions of the license.
The opinions expressed in this publication are those of the authors and do not necessarily reflect the views of the Inter-American Development Bank, its Board of Directors, or the countries they represent.
Computational Linguistics and Subjectivity in Modern Economic Theory
IDB LINKS


Mommus made a comment in relation to my most recent post. The post tossed up some ideas concerning connections between (scientific) knowledge and the real world (applications). I will use the comment as a way to try and take the issue further, or at least in a bit of a different direction. Although Alexander's comment brings things into perspective, with some editorial assistance, let me make the case that adventurous design involves much more than "taking risks" (see below). It also builds, I suppose, on this early post musing about the invention of the bicycle.
The issue of the pliable bike connects into the bicycle industry as a whole, and really must be considered in that context. It is not about any one facet, technical, inspirational, professionalism or lack of or whatever. Anyway, it is the the market that is the absolute arbiter.
It all comes down to an understanding what the market is along with what roles designers and design should, and actually do, play in it. The market, in essence, speaks in many voices – tuning into its varied currents and joining in the conversations where we can is not only fun, it's where we are most of the time.
Valid engineering could be taken to mean that if a prototype of a 3D rendering was produced, it would be functionable – ie. rideable. But there's no necessity to be forced into an either/or position here. If a prototype could move along a trajectory, even barely, then we have moved from either/or into a continuum. The real world is defined by continuum, or to put it another way, statistics rules.
If a prototype does not work at all, or in the case of the pliable bike, its instability was such that it was simply unrideable, then we might just throw it out. Or we might find some redeeming features somewhere in it.
We may find that, in fact, a re-working of the geometry will produce a functioning prototype. I note that there have been several suggestions for the pliable bike along these lines. It could well be that modification enough to make it rideable takes the design right away from the designer's original vision, turning it from a 'pliable' bike into something else completely. Or maybe not. That's the beauty of unintended consequences.
There are shades of the pliable bike design in Omer Sagiv's entry in this year's 14th International Bicycle Design Competition, the "AO". Well, I think there are. It's just me. But then, how many others may have noticed similar correspondences?
Still, although the differences could be seen to be as stark as any similarities, how might an interchange or exchange of geometrical elements, mediated by this particular instance of the market doing its thing — other designers seeing things that nobody else can — result in a derived design or designs that takes us who-knows-where? That we may have to face montrosity is no reason for fear. What we are faced with is the truth of general, necessary, and unstoppable processes.
It's fine to evoke Richard Feynman to support a purely engineering take on this. However, physics has little to say to ecology, despite Feynmann's attraction to biology. Coupled with the alarming description of his generation by the respected thinker Paul Feyerabend as "uncivilized savages" (now that's harsh!) regarding a lack of intellectual depth of thinking on their part, I wonder whether he really is the right person to help make the case. Since market forces are all about an ecosystem of interacting "selective pressures", I am inclined to call on another Richard, Richard Dawkins.
RD has observed that in the highly improbable evolution of a bat, for example, half a bat wing had its place in the scheme of things. In one of the myriad early evolutionary bat-like prototypes, nearly everyone of which was relegated to oblivion by selective forces, a bit of wing appears to have conferred a slight adaptive advantage. However slight, an advantage is an advantage. It leads in a direction.
What is the crime and who is the victim of wacky designs, of bits of bat wing turning up all over the place? They are simply the statistical consequence of market evolutionary forces at work. Each instance, exclusive in it's wackyness, is, by itself, irrelevant. In the broad march of these processes, the population of instances is worked upon by market forces.
Wackyness won't be at the top of the bell curve distribution of possibilities — it will be in the tails, as an outlier. And, of course, we would do well to remember Nicolas Taleb's case supporting the importance of the outlier in precipitating rapid and far-reaching changes.
The weird contradictory logic at work here is that no one 'case' or 'event' is important in itself even though the probability remains, if extremely low, that any particular event or instance will make all the difference. In the long run, the probability is 100% that somewhere, sometime, somehow, one case will make all the difference.
But, of course, all this is further complicated in the era of the 'long tail' where wacky battyness is more likely to find a home sooner than later.
I believe greater distinction should be urged between ideas which will obviously never make it to production and those which genuinely aspire to become reality.
That is good advice and something which offending blogs would do well to take into account. It can only sharpen the terms of the debate. However, there are a whole host of issues raised here.
Let me begin by loosely summarizing Google's approach to production. 20% of employee time must be directed towards coming up with new ideas fostering a culture of creating applications that people might want to use. Give them away for free, get them out there, and if the ideas fly, then figure out a way to make money from the product.
The point is to create something and turn it over to the market and see what particular elements in the long tail rise to the occasion. A lot of apps are produced – most go nowhere. Some show promise and can be re-worked. The odd outlier goes ballistic.
An app that has some merits is some part of the way towards some degree of market success. Selective forces will decide if what may actually only be 'half an app' gets to climb mount improbable, or get some up the slope at any rate.
Something along the lines of this could be said to occur in the International Bicycle Design Competition held each year in conjunction with the Taipei International Cycle Show. I'll reference the most recent 14th IBDC since the remarks of one of the jurors, Han Goes, is especially interesting in light of the discussion and the specific issue of the pliable bike.
400 entries from 1000 applications were whittled down to 21 finalists. Their entries were available for viewing on-site in the form of scale models. There are no specific guidelines that designers have to conform to that I am aware of.
However, having surveyed the field, Han came up with a formula that he felt summed up the reference points designers were relying upon: *small wheels; compactness *multi-purpose functionality *UD principles *folding mechanism *electronic power support. You might say it amounts to a tacit evaluation on the part of the participants as to where the market is at the moment and where it is heading.
His overall impression of the general direction of design, exemplified in this year's entries was quite pessimistic. He singled out the "conformity and congruence of all design directions taken, or better still, the lack of variation" as being a key villain.
But this was not the main problem. Han goes further lamenting the apparent restraint –a consequence of applying the formula — that designers placed on themselves: they are holding back their "own creativity, authenticity and independence in favor of pure jury pleasing". He finishes by urging the IBDC organization and jurors to work on developing "new and creative ways to keep the level of disruptive, independent and authentic innovation as high as possible…" [emph.added] for next and future IBDC events.
We can complicate this all even further by asking what or who is the jury actually? Is it the official IBDC jurors. Is the technologists, exclusively, or partly. Is it cyclists who buy the bikes.Is it the entrepreneurs who are at the center of branding/design processes? Is it the component sourcing agents who scour the trade show booths? Is it a variable combination of these and more?
Yes, this is the market, in all it's push and pull glory, which is never on show for all to see. It's only ever seen and experienced from the point of view of a participant in it. The problem is not being able to see the forest for the trees — isn't it always? Some are better than others in dealing with that.
In a comment on my previous article, Nick Hein makes the point that the problem is not with bicycles or the bicycling industry – it is with bicyclists who accept a 100-year-old design. I wonder what would result if this was the gauntlet thrown down to designers in future IBDC events? Currently marginal design directions may well break through to make things really interesting, although I feel the forces aligned against that occurring are mighty.
What about production for sale to specific, actual, targeted sections of the consumer side of the market? How many of these entries in one of, if not the, world's most prestigious bicycle design competition, were created explicitly with the idea that they would make the complete journey into production? I suspect that a whole host of market related factors, key amongst which would be the 'formula' that we will never really know about, but could have great fun speculating about, were behind their individual histories.
Returning to the pliable bike, if it had have been an IBDC entry, the argument could be made that it very much fits the description of "disruptive, independent and authentic" unlike the other entries as charged by Han Goes.
Perhaps it was up for contention this year, but did not make the final cut. Might this have been due to it's questionable geometry? Or might it been due to a poverty of vision on the part of jurors who were disproportionately affected by perceptions of where the market is headed?
Still, despite Han's misgivings as to the forces impinging on the direction of design for this year, it still represents the overall market-effect. The forces are real and acting ceaselessly. If the road to hell is paved with good intentions, the (evolutionary) road to a product that gets market acceptance is piled high with the carcasses of prototypes, and pieces thereof.
Many –most? — never go anywhere. They are individual statistics, evolutionary outcasts — until perhaps being rediscovered anew in the future — along the road. They are the industrial equivalent of Richard Dawkins' 'half a bat wing'.
Here's a short vide0 by a friend outside my booth at the 2007 Taipei International Cycle Show. The LEV stew was being cooked up at the time but had yet to really be served up in volume. It is one batty design that, as far as I know, did not capture anyone's imagination — it did not go viral. It certainly turned heads and created buzz in this corner of the show, as it was very difficult to ride despite the vendor/developer scooting hither and thither scaring the wits out of people. Was it an evolutionary dead end? Maybe. Probably. But never necessarily.
Returning to general issues, any addition to the discussion — whether we ultimately come to view that as a 'contribution' or not — is welcome in my view. And here I am speaking as a businessperson, as an entrepreneur who is ever on the lookout for interesting points of view.
I see the pliable bike as such an interesting POV, but, nevertheless, not all that interesting. Technology is the least of its problems. That can be solved should there be a market derived rationale to do it. It was, however, always worthy of a chance for greater exposure to judgement of the market and the industry as a whole.
As an entrepreneur always 'on the lookout' I must also take note of the buzz that has been generated by the design. That's all a part of the ecology of the market doing its thing. A commotion in one corner of the forest attracts attention, and we can be sure that the impartial, unemotional gaze of the market will act as it always does.
This also reminds me of something I came across somewhere about existence consisting of long stretches of boredom relieved by shorter stretches of terror. The terror in question right here is the cruel democracy of the marketplace. Adding in the idea of the continuum enables a toning-down of the red-in-tooth-and-claw terror element here to more sedate periods of controlled excitement and just interesting stuff.
Well tone it down a bit, but not too far. I have to say in relation to this that I have worked with some lousy designers. They are great with the technology. AutoCAD chirps and hums clinically precise tunes in their hands. Advanced Photoshop is a leisurely ride in the park.
But as designers, as creative beings whose brief is to come up with that EUREKA! factor that captures the market's imagination, or these days, that segment of the 'long tail' that you have in your sights, too many of them are not up to the job!
Their job is to realize my vision, read my mind, if you like. Success here depends on many factors (there's always more factors!), paramount is communication. But that intuitive ability to 'get it', to 'tune in' is hard to come by, unlike the trade skill of configuring geometry.
Bicycle design is not rocket science by a long shot. It is complex though, because it lives in the jungles and woodlands that make up its particular marketplace, and the people who can read the lay of the land are hard to find.
Leaving the Richards to one side for now, I'll leave it up to a Friedrich, Friedrich Nietsche whose biography I am slowly, but steadily, making my way through to offer a simple insight: "Is life not a thousand times too short for us to bore ourselves?" Ok, I didn't really need Friedrich to say what most of us have thought from time to time. It's just that here is someone whose vision went way beyond all others.
A rather nice cover design which interacts in interesting ways with the stature of the figure who is the subject of the book.
Bring on the wacky designs — the long tail is wagging happily with this one!!. At the very least, they are a lot of fun. At the very least they inject energy into the conversation in their own disruptive, independent and authentic ways. Give me excitement over boredom any day coz there's more than enough of the latter to go around.


The Katherine E. Nash Gallery, located at the University of Minnesota in Minneapolis, is a research laboratory for the practice and interpretation of the visual arts. We believe the visual arts have the capacity to interpret, critique and expand on all of human experience. Our engagement with the visual arts helps us to discover who we are and understand our relationships to each other and society. The Katherine E. Nash Gallery aspires to be a center of discourse on the practice of visual art and its relationship to culture and community—a place where we examine our assumptions about the past and suggest possibilities for the future. We work in collaboration with the students, faculty, and staff in the Department of Art and all academic departments and intellectual centers at the University of Minnesota. Our collaborations embrace diversity in all its forms and extend beyond the University of Minnesota to include local, regional, national and international communities. The Katherine E. Nash Gallery is committed to ensuring that the arts thrive in Minnesota. From exhibition planning to public programs to educational activities, we strive for excellence and experimentation while expanding the discourse in our field.


Just when you thought it was over, Apple and Motorola are going back for more.
Just when you thought it was over, Apple and Motorola are going back for more. About a month after a Chicago judge dismissed the two firms' patent cases, both have filed appeals.
As Bloomberg noted, should the decision be reversed and proceed to trial, it would be the first between Apple and Google, which recently completed its purchase of Motorola Mobility.
The road to dismissal was a bit of a roller coaster. In early June, Judge Richard Posner dismissed the patent case between Apple and Motorola. Days later, however, he reversed course and said he would allow Apple to pursue an injunction against Motorola devices. But Apple did not present a strong enough case after all, and Judge Posner decided to end the case.
"Apple and Google subsidiary Motorola Mobility have both decided to appeal every single decision that Judge Posner made that wasn't in their favor. They leave no stone unturned," patent blogger Florian Mueller wrote in a blog post.
According to Mueller, Apple and Motorola have at least some chance of prevailing.
"The Federal Circuit reverses at least part of an appealed ruling in more than 40 percent of all cases," Mueller wrote, so "it would be a statistical anomaly if each and every one of Judge Posner's decisions was affirmed."
Apple and Motorola are not at a loss for patent fights in the U.S., however. Just last week, a ban on Motorola devices in the U.S. went into effect thanks to a ruling from the International Trade Commission (ITC). Motorola, however, said it had "taken proactive measures" to avoid a ban on its Android-based devices, but did not elaborate.
Across the pond, a Düsseldorf court last week dismissed Apple's request for a ban on the Motorola Xoom in Germany. But the court also declined to rule that Apple's community design rights for the iPad were invalid.


text:
ProPublica Wins Three SABEW Awards for Business Journalism
by Cynthia Gordy Giwa
March 17, 2016, 1:19 p.m. EDT
The Society of American Business Editors and Writers (SABEW) announced today that ProPublica won three awards, in addition to being named a finalist in a fourth category, in its annual Best in Business competition recognizing excellence in business journalism.
Michael Grabell and Lena Groeger's Insult to Injury, a collaboration with NPR's Howard Berkes, won in both the digital investigative and innovation categories. The investigation into America's vanishing worker protections detailed how, since 2003, 33 states have passed workers' comp laws that reduce benefits or make it more difficult for injured workers to qualify for them. In Texas and Oklahoma, companies were allowed to opt out of state workers' comp altogether and offer their own plans, often with significantly lower benefits.
Paul Kiel, Annie Waldman and Al Shaw's Color of Debt, analyzing racial disparities in the use of lawsuits to pursue consumer debts, won in the digital explanatory category. The story's unprecedented analysis of five years of court records showed that, even accounting for income, the rate of debt collection judgments was twice as high in mostly black neighborhoods as in mostly white ones.
In addition, Cezary Podkul and Marcelo Rochabrun's Rent Racket series, investigating New York City's broken rent-stabilization system, was a finalist in the real estate category.
See a list of all the SABEW Best in Business winners here.
Cynthia Gordy Giwa
Cynthia Gordy Giwa is ProPublica's marketing director.


HAMPTON, N.H. (AP) — Police in Hampton, N.H., say a 57-year-old man who was struck by a car over the weekend has died.
Charles Sayre of Amesbury, Mass., was out near Ocean Boulevard and Highland Avenue when the accident happened early Sunday. He was hospitalized in Massachusetts and died of his injuries Monday.
Police have arrested the driver, 29-year-old Danielle Kooyoomjian of Hampton, on a charge of aggravated driving while intoxicated.


* Build a Viewable to browse HDFS.
From project airlift, under directory /jaxrs/src/test/java/io/airlift/jaxrs/.
From project amber, under directory /oauth-2.0/integration-tests/src/test/java/org/apache/amber/oauth2/integration/endpoints/.
From project ANNIS, under directory /annis-service/src/main/java/annis/service/internal/.
From project Arecibo, under directory /agent/src/main/java/com/ning/arecibo/agent/status/.
From project ATHENA, under directory /core/web-resources/src/main/java/org/fracturedatlas/athena/web/resource/.
From project bam, under directory /release/jbossas/performance/app/src/main/java/org/overlord/bam/performance/jee/app/.
* This method returns the duration.
From project blog_1, under directory /miniprojects/generic-pojo-mappers/src/main/java/net/jakubholy/blog/genericmappers/rest/.
From project candlepin, under directory /src/main/java/org/candlepin/resource/.
From project cdi-arq-workshop, under directory /arquillian-showcase/jaxrs/src/main/java/com/acme/jaxrs/resource/.
From project chukwa, under directory /src/main/java/org/apache/hadoop/chukwa/hicc/rest/.
From project Cilia_1, under directory /framework/remote/src/main/java/fr/liglab/adele/cilia/remote/impl/.
* Retrieve a mediation chain.
* @return The required Chain, return <code>null<code> if chain does not exist.
From project collector, under directory /src/main/java/com/ning/metrics/collector/jaxrs/.
From project components-ness-httpserver_1, under directory /src/main/java/com/nesscomputing/httpserver/selftest/.
From project crest, under directory /integration/server/src/main/java/org/codegist/crest/server/stubs/handler/.
From project curator, under directory /curator-x-discovery-server/src/main/java/com/netflix/curator/x/discovery/server/rest/.
From project data-access, under directory /src/org/pentaho/platform/dataaccess/datasource/wizard/service/impl/.
From project EasySOA, under directory /easysoa-proxy/easysoa-proxy-core/easysoa-proxy-core-api-frascati/src/main/java/org/easysoa/proxy/core/api/records/replay/.
From project entando-core-engine, under directory /src/main/java/org/entando/entando/aps/system/services/api/server/.
From project examples_1, under directory /datanucleus/com.paremus.example.datanucleus.service/src/com/paremus/example/datanucleus/service/rest/.
From project fast-http, under directory /src/main/java/org/neo4j/smack/routing/.
From project fed4j, under directory /src/main/java/com/jute/fed4j/example/resource/.
From project flume_1, under directory /flume-config-web/src/main/java/com/cloudera/flume/master/.
From project gatein-management, under directory /rest/src/main/java/org/gatein/management/rest/.
From project gatein-sso, under directory /auth-callback/src/main/java/org/gatein/sso/authentication/callback/.
From project gatein-toolbox, under directory /CoreOrganizationInitializer/src/main/java/org/exoplatform/core/component/organization/initializer/.
From project gmc, under directory /src/org.gluster.storage.management.gateway/src/org/gluster/storage/management/gateway/resources/v1_0/.
From project hcatalog, under directory /webhcat/svr/src/main/java/org/apache/hcatalog/templeton/.
* List all the tables in an hcat database.