Impacte de les tecnologies de la informació i la comunicació en l’Administració de justícia: modernització i eficiència

L’Administració de Justícia, com servei públic que ha de donar als ciutadans una eficaç resolució dels conflictes, ha de comptar per al correcte compliment de la seva funció institucional, amb una sèrie de mitjans, no tan sols personals i materials, sinó també tecnològics, que li permetin assegurar la consecució de les seves finalitats. Per tant, es precisa una Administració oberta i transparent, caracteritzada per l’efectivitat i per la seva proximitat al ciutadà. La introducció de les TIC en l’Administració de Justícia és un procés bastant recent i encara no tancat, si es compara amb la resta del sector públic, especialment d’altres àmbits de l’Administració molt més avançats en la incorporació de les TIC, com són el tributari i el de la Seguretat Social. No obstant això, avui en dia, on majors èxits s’han assolit en aquest camp en l’Administració de Justícia és en el de la seva utilització interna: informatització interna, gestió interna dels procediments, intranets, etc. Per això, on queda un llarg camí per recórrer encara és en el camp de les relacions telemàtiques entre Administració de Justícia i els operadors jurídics, però especialment amb els ciutadans. D’altra banda, el legislador és sensible cada vegada més a aquest tema i s’ha preocupat de regular determinats aspectes on les TIC incideixen en l’àmbit de la justícia: actuacions dels procuradors, advocats, notificacions telemàtiques, el valor del document electrònic en el procés judicial... Així queda reflectit, per exemple, a la Llei Orgànica del Poder Judicial o la Llei d’Enjudiciament Civil. No obstant això, de lege ferenda, seria convenient l’existència d’un marc normatiu únic regulador de l’aplicació de les TIC en la Justícia. Així mateix, també ha d’assenyalar-se que en el procés institucional d’introducció de les noves tecnologies en la Justícia alguns dels acords adoptats així com les previsions contingudes en la normativa aplicable, no deixen de ser en la majoria dels casos simplement programàtics.

Counterexamples to some pointwise estimates of the maximal Cauchy transform in terms of the Cauchy transform

Motivated by the work of Mateu, Orobitg, Pérez and Verdera, who proved inequalities of the form $T_*f\lesssim M(Tf)$ or $T_*f\lesssim M^2(Tf)$ for certain singular integral operators $T$, such as the Hilbert or the Beurling transforms, we study the possibility of establishing this type of control for the Cauchy transform along a Lipschitz graph. We show that this is not possible in general, and we give a partial positive result when the graph is substituted by a Jordan curve.

L2−estimates for the DG IIPG-0 scheme

We discuss the optimality in L2 of a variant of the Incomplete Discontinuous Galerkin Interior Penalty method (IIPG) for second order linear elliptic problems. We prove optimal estimate, in two and three dimensions, for the lowest order case under suitable regularity assumptions on the data and on the mesh. We also provide numerical evidence, in one dimension, of the necessity of the regularity assumptions.

On spectral approximation, Folner sequences and crossed products

In this article we review first some of the possibilities in which the notions of Fo lner sequences and quasidiagonality have been applied to spectral approximation problems. We construct then a canonical Fo lner sequence for the crossed product of a concrete C* -algebra and a discrete amenable group. We apply our results to the rotation algebra (which contains interesting operators like almost Mathieu operators or periodic magnetic Schrödinger operators on graphs) and the C* -algebra generated by bounded Jacobi operators.

Parametrization of spectral surfaces of a class of periodic 5-diagonal matrices

The main result of this work is a parametric description of the spectral surfaces of a class of periodic 5-diagonal matrices, related to the strong moment problem. This class is a self-adjoint twin of the class of CMV matrices. Jointly they form the simplest possible classes of 5-diagonal matrices.

Quantifying urban attractiveness from the distribution and density of digital footprints

In the past, sensors networks in cities have been limited to fixed sensors, embedded in particular locations, under centralised control. Today, new applications can leverage wireless devices and use them as sensors to create aggregated information. In this paper, we show that the emerging patterns unveiled through the analysis of large sets of aggregated digital footprints can provide novel insights into how people experience the city and into some of the drivers behind these emerging patterns. We particularly explore the capacity to quantify the evolution of the attractiveness of urban space with a case study of in the area of the New York City Waterfalls, a public art project of four man-made waterfalls rising from the New York Harbor. Methods to study the impact of an event of this nature are traditionally based on the collection of static information such as surveys and ticket-based people counts, which allow to generate estimates about visitors’ presence in specific areas over time. In contrast, our contribution makes use of the dynamic data that visitors generate, such as the density and distribution of aggregate phone calls and photos taken in different areas of interest and over time. Our analysis provides novel ways to quantify the impact of a public event on the distribution of visitors and on the evolution of the attractiveness of the points of interest in proximity. This information has potential uses for local authorities, researchers, as well as service providers such as mobile network operators.

Determinants of organizational form: Transaction costs and institutions in the European trucking industry

We explain why European trucking carriers are much smaller and rely more heavily on owner-operators(as opposed to employee drivers) than their US counterparts. Our analysis begins by ruling outdifferences in technology as the source of those disparities and confirms that standard hypothesesin organizational economics, which have been shown to explain the choice of organizational form inUS industry, also apply in Europe. We then argue that the preference for subcontracting oververtical integration in Europe is the result of European institutions particularly, labor regulationand tax laws that increase the costs of vertical integration.

Quasi-integration in less-than-truckload trucking

This work studies the organization of less-than-truckload trucking from a contractual point of view. We show that the huge number of owner-operators working in the industry hides a much less fragmented reality. Most of those owner-operators are quasi-integrated in higher organizational structures. This hybrid form is generally more efficient than vertical integration because, in the Spanish institutional environment, it lessens serious moral hazard problems, related mainly to the use of the vehicles, and makes it possible to reach economies of scale and density. Empirical evidence suggests that what leads organizations to vertically integrate is not the presence of such economies but hold-up problems, related to the existence of specific assets. Finally, an international comparison hints that institutional constraints are able to explain differences in the evolution of vertical integration across countries.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.

On the receiver pays principle

This paper extends the theory of network competition betweentelecommunications operators by allowing receivers to derive a surplusfrom receiving calls (call externality) and to affect the volume ofcommunications by hanging up (receiver sovereignty). We investigate theextent to which receiver charges can lead to an internalization of thecalling externality. When the receiver charge and the termination(access) charge are both regulated, there exists an e±cient equilibrium.Effciency requires a termination discount. When reception charges aremarket determined, it is optimal for each operator to set the prices foremission and reception at their off-net costs. For an appropriately chosentermination charge, the symmetric equilibrium is again effcient. Lastly,we show that network-based price discrimination creates strong incentivesfor connectivity breakdowns, even between equal networks.

Parametrització de contorns oberts

Un dels principals problemes quan es realitza un anàlisi de contorns és la gran quantitat de dades implicades en la descripció de la figura. Per resoldre aquesta problemàtica, s’aplica la parametrització que consisteix en obtenir d’un contorn unes dades representatives amb els mínims coeficients possibles, a partir dels quals es podrà reconstruir de nou sense pèrdues molt evidents d’informació. En figures de contorns tancats, la parametrització més estudiada és l’aplicació de la transformada discreta de Fourier (DFT). Aquesta s’aplica a la seqüència de valors que descriu el comportament de les coordenades x i y al llarg de tots els punts que formen el traç. A diferència, en els contorns oberts no es pot aplicar directament la DFT ja que per fer-ho es necessita que el valor de x i de y siguin iguals tan en el primer punt del contorn com en l’últim. Això és degut al fet que la DFT representa sense error senyals periòdics. Si els senyals no acaben en el mateix punt, representa que hi ha una discontinuïtat i apareixen oscil·lacions a la reconstrucció. L’objectiu d’aquest treball és parametritzar contorns oberts amb la mateixa eficiència que s’obté en la parametrització de contorns tancats. Per dur-ho a terme, s’ha dissenyat un programa que permet aplicar la DFT en contorns oberts mitjançant la modificació de les seqüencies de x i y. A més a més, també utilitzant el programari Matlab s’han desenvolupat altres aplicacions que han permès veure diferents aspectes sobre la parametrització i com es comporten els Descriptors El·líptics de Fourier (EFD). Els resultats obtinguts han demostrat que l’aplicació dissenyada permet la parametrització de contorns oberts amb compressions òptimes, fet que facilitarà l’anàlisi quantitatiu de formes en camps com l’ecologia, medicina, geografia, entre d’altres.

Borcherds products and arithmetic intersection theory on Hilbert modular surfaces

We prove an arithmetic version of a theorem of Hirzebruch and Zagier saying that Hirzebruch-Zagier divisors on a Hilbert modular surface are the coefficients of an elliptic modular form of weight 2. Moreover, we determine the arithmetic selfintersection number of the line bundle of modular forms equipped with its Petersson metric on a regular model of a Hilbert modular surface, and we study Faltings heights of arithmetic Hirzebruch-Zagier divisors.

The induced generalized OWA operator

[spa] Se presenta el operador OWA generalizado inducido (IGOWA). Es un nuevo operador de agregación que generaliza al operador OWA a través de utilizar las principales características de dos operadores muy conocidos como son el operador OWA generalizado y el operador OWA inducido. Entonces, este operador utiliza medias generalizadas y variables de ordenación inducidas en el proceso de reordenación. Con esta formulación, se obtiene una amplia gama de operadores de agregación que incluye a todos los casos particulares de los operadores IOWA y GOWA, y otros casos particulares. A continuación, se realiza una generalización mayor al operador IGOWA a través de utilizar medias cuasi-aritméticas. Finalmente, también se desarrolla un ejemplo numérico del nuevo modelo en un problema de toma de decisiones financieras.

The induced 2-tuple linguistic generalized OWA operator and its application in linguistic decision making

[spa] Se presenta el operador de media ponderada ordenada generalizada lingüística de 2 tuplas inducida (2-TILGOWA). Es un nuevo operador de agregación que extiende los anteriores modelos a través de utilizar medias generalizadas, variables de ordenación inducidas e información lingüística representada mediante el modelo de las 2 tuplas lingüísticas. Su principal ventaja se encuentra en la posibilidad de incluir a un gran número de operadores de agregación lingüísticos como casos particulares. Por eso, el análisis puede ser visto desde diferentes perspectivas de forma que se obtiene una visión más completa del problema considerado y seleccionar la alternativa que parece estar en mayor concordancia con nuestros intereses o creencias. A continuación se desarrolla una generalización mayor a través de utilizar medias cuasi-aritméticas, obteniéndose el operador Quasi-2-TILOWA. El trabajo finaliza analizando la aplicabilidad del nuevo modelo en un problema de toma de decisiones sobre gestión de la producción.

The generalized index of maximum and minimum level and its application in decision making

[spa] El índice del máximo y el mínimo nivel es una técnica muy útil, especialmente para toma de decisiones, que usa la distancia de Hamming y el coeficiente de adecuación en el mismo problema. En este trabajo, se propone una generalización a través de utilizar medias generalizadas y cuasi aritméticas. A estos operadores de agregación, se les denominará el índice del máximo y el mínimo nivel medio ponderado ordenado generalizado (GOWAIMAM) y cuasi aritmético (Quasi-OWAIMAM). Estos nuevos operadores generalizan una amplia gama de casos particulares como el índice del máximo y el mínimo nivel generalizado (GIMAM), el OWAIMAM, y otros. También se desarrolla una aplicación en la toma de decisiones sobre selección de productos.