Lietuvos valstybei atgavus nepriklausomybę, keitėsi ir Lietuvos Respublikos teisės sistema, kuri turėjo atitikti pakitusius socialinius, ekonominius ir politinius šalies poreikius. Siekiant apsaugoti kiekvieno žmogaus teises ir pagrindines laisves, buvo būtina įstatymiškai aiškiai ir konkrečiai sureglamentuoti telekomunikacijų tinklais perduodamos informacijos kontrolę, bei įrašų darymą tiek operatyvinėje veikloje, tiek baudžiamajame procese. Nuo 2003 m. gegužės 01 d. Lietuvoje pradėjo galioti naujas Baudžiamojo proceso kodeksas, kuris daugumos teisininkų atitinka demokratinėje Europoje priimtus teisės principus, o taip pat ir žmogaus teisių ir pagrindinių laisvių apsaugos srityje. Tačiau telekomunikacijų tinklais perduodama informacija gali būti kontroliuojama ne tik remiantis BPK, bet ir vykdant operatyvinę veiklą, remiantis operatyvinės veiklos įstatymu. / After receiving the independence of Lithuania, has been changed and Lithuanian low system, which must be in keeping with changed social, economical and political country needs. Trying to protect the rights and the main liberties of every person, it was necessary to regulate the control of information transmitted by telecommunication networks and making records in operative activity and in criminal code. Since May 1st, 2003 a new code started being in force in Lithuania. In opinion of the majority of lawyers this code corresponds to the law principles accepted in democratic Europe, also in the sphere of human rights and protection of the main liberties. However the control of information transmitted by telecommunication networks in Lithuania is possible not only by Code on Criminal Procedure, but also might be regulated by Law on Operational Activities. In this work is paid a considerable attention to an establishment of the ratio of the means of proceedings compulsion provided in the Code on Criminal Procedure of Republic of Lithuania and the methods of the operational activities consolidated in the Law on Operational Activities. An importance of the notion used in the Criminal Proceedings Code of Republic of Lithuania in a definition of separate means of proceeding compulsion as well as necessity of an establishment of the limits of application of compulsion are stressed. Also are discussed contradictions of regulations of control of information transmitted by the... [to full text]

Les systèmes de positionnement ont connu un progrès indéniable. Actuellement, la précision atteint quelques centimètres sous certaines conditions : espace ouvert, ciel dégagé, technique très spécifique, etc. Néanmoins, le problème du positionnement dans un environnement intérieur demeure persistant : les trajets multiples qui compliquent les modèles de propagation, l'atténuation, etc. Différents systèmes ont vu le jour, utilisant des technologies telles que l'UWB, le WiFi ou l'Infrarouge. Ces systèmes apportent des résultats de positionnement intéressants, atteignant l'ordre du mètre. Cette précision reste liée à certaines contraintes : une infrastructure, une technologie utilisée, une calibration, une technique de calcul, etc. Afin de réduire toutes ces contraintes, nous proposons une nouvelle approche de positionnement. Notre approche utilise tous les équipements réseaux présents dans un environnement. Elle se base sur deux étapes fondamentales : l'étude de visibilité et l'élaboration de liens géographiques. L'étude de visibilité permet d'obtenir les équipements visibles par un équipement. Nous avons exposé plusieurs modèles de visibilité et nous avons effectué une comparaison des résultats. L'élaboration de liens géographiques permet de construire un graphe géographique tridimensionnel reliant tous les équipements de l'environnement. Ce graphe nous permet de visualiser la répartition des équipements et d'estimer les positions géographiques de chaque équipement. Pour la mise en œuvre de notre approche, nous avons développé un simulateur sous Matlab. Le simulateur élaboré évalue d'abord le nombre d'équipements visibles. Il estime les distances séparant cet équipement de chaque équipement visible. Enfin, il construit un graphe géographique et calcul les positions géographiques. Des résultats de simulations sont présentés pour valider notre approche qui permet d'aboutir à un système capable d'opérer, sans aucune infrastructure additionnelle, un positionnement dans un environnement intérieur et extérieur / Positioning systems have undeniably progressed. Currently, in an outdoor environment, the accuracy reaches a few centimetres under certain conditions: open space, clear sky, specific measurement techniques, etc. Nevertheless, the problem of positioning in an indoor environment remains persistent: multipath, attenuation, etc. Different systems for indoor positioning have been developed, using technologies such as UWB, WiFi or Infrared. These systems provide interesting results that could allow to reach one meter accuracy. But, this accuracy is related to many criteria: infrastructure, technology, calibration, technical computing, etc. To reduce these constraints, we propose a new approach for positioning. Our approach utilizes all the network equipments present in an environment. The approach is based on two fundamental steps: the study of visibility and the development of geographical links. The study of visibility estimates the visible equipments in the environment. We have studied several models of visibility and we carried out a comparison of the results. A three-dimensional graph is build using the study of geographical links between equipments. This graph allows us to visualize the distribution of equipments and to estimate the geographic positions of each device. To implement our approach, we developed a simulator in Matlab. The simulator first studies the visible equipments for the unknown device. Then, it estimates the distances between the device and the visible equipments. Finally, it constructs a graph and calculates the geographical positions. Simulation results are presented to validate our approach. Our approach is a positioning system capable of operating without additional infrastructure in an indoor environment

O comportamento de insetos sociais, em especial de formigas, tem sido muito estudado nos últimos tempos, devido à capacidade destes insetos realizarem tarefas complexas a partir de interações entre indivíduos simples. Ao se moverem sobre um ambiente na busca de alimento, as formigas depositam no solo uma substância química, denominada feromônio, que atrai as formigas que se encontram no ninho e as guia em direção ao alimento encontrado. O processo de construção e seguimento destas trilhas permite que as formigas descubram os menores caminhos e as melhores fontes de alimento no ambiente. Com o objetivo de estudar as características das formigas que contribuem para a sua adaptação a diferentes condições do meio, diversos experimentos vêm sendo realizados com estes insetos. Dentro deste contexto, esta tese apresenta experimentos inéditos realizados com formigas em laboratório, sobre uma rede artificial de túneis, onde diversos caminhos interconectados conduzem a uma fonte de alimento. As decisões das formigas foram analisadas nos níveis individual e coletivo, sob mudanças no meio, compreendendo o bloqueio/desbloqueio de ramos. A medição de diversas características individuais das formigas permitiu desenvolver dois modelos matemáticos sobre o seu comportamento, que foram aplicados à situação em que não se alterou a condição do ambiente com relação ao acesso aos ramos (estática), como também a mudanças no meio (dinâmica). A análise realizada do comportamento coletivo foi utilizada na comparação dos resultados obtidos pelas simulações dos modelos. De forma geral, o segundo modelo proposto foi mais eficiente que o primeiro na situação estática, porém ele ainda necessita de ajustes nas demais situações. O bom desempenho do segundo modelo proposto levou a aplicação de sua principal característica, a função de escolha que considera a concentração de feromônio sobre os ramos do meio e a capacidade de orientação das formigas, a um problema de otimização combinatorial, o roteamento em redes de telecomunicações. O algoritmo de roteamento proposto foi avaliado sob variações no nível de tráfego e topologia da rede, e seu desempenho foi comparado ao de dois algoritmos usados por concessionárias de telecomunicações, considerando diversas medidas de desempenho. O algoritmo desenvolvido obteve resultados encorajadores, sugerindo a aplicabilidade da estrutura do modelo proposto a outros problemas complexos de otimização. / The behavior of social insects, particularly of ants, has been intensively studied in the last years, due to their capacity to perform complex tasks through interactions among simple individuals. When moving in the environment searching for food, ants deposit on the ground a chemical substance, called pheromone, to attract ants in the nest and guide them towards the source of food that was found. The process of laying/following the pheromone trails allows ants to find the shortest paths and best sources of food of the environment. With the aim to study the characteristics of the ants that contribute to their adaptation to different environment conditions, several experiments with ants have been performed and reported in this research. In this context, this thesis presents novel experiments with ants in the laboratory, in an artificial network of tunnels, where several interconnected paths lead the insects from the nest to the food source. Ants\' decision were analyzed according to the individual and collective levels, under changes in the environment, comprising the blockage/release of branches. The measure of several individual characteristics of ants allowed the development of two mathematical models of their behavior, which were applied to the non-changing (static) environment access to all branches and to changing (dynamic) access. The analysis of the collective behavior of ants in the experiments was used to compare the results derived from the simulations of the models. In general, the second proposed model was more accurate than the first one in simulating ants behavior for the static situation, however, it needs some improvements for the other situations. The satisfactory behavior of the second model led to apply its main feature, the choice taking into consideration the pheromone concentration over the branches and the ants ability to orient themselves, to solve an optimization problem, the routing in telecommunications networks. The proposed routing algorithm was evaluated under variations on the traffic level and topology of the network, and its performance was compared with two routing algorithms used by telecommunications companies, considering several performance measures. The developed algorithm produced encouraging results, suggesting the possibility to apply the framework of the proposed model to other optimization problems.

Submitted by admin tede (tede@pucgoias.edu.br) on 2017-06-29T13:39:22Z No. of bitstreams: 1 Emerson de Souza Campos.pdf: 5716166 bytes, checksum: 5ece2fef286c7d6b282f34feaaf709e4 (MD5) / Made available in DSpace on 2017-06-29T13:39:22Z (GMT). No. of bitstreams: 1 Emerson de Souza Campos.pdf: 5716166 bytes, checksum: 5ece2fef286c7d6b282f34feaaf709e4 (MD5) Previous issue date: 2017-03-29 / Telecommunication systems are in constant development and the increasing demand of users and new services have enabled the emergence of new technologies. Planning has become indispensable due to the competitiveness and the large amount of financial resources involved. This work aims to propose and evaluate a genetic optimization algorithm for the planning of telecommunications networks. Because it is a combinatorial problem, the objective is to evaluate the advantages and disadvantages of the model based on the genetic algorithm. The graphs representing the networks were encoded in incidence matrices and the genetic operators of crossing and mutation were designed to act on matrices. MATLAB® software was used as a computational tool to implement the algorithms. The proposed model minimizes cost, considering the constraints of demand and technical capacity. The results found are compared to the published results in the SNDlib network instance library. The evaluation of the first version of the algorithm was based on a small PDH (Plesiochronous Digital Hierarchy) instance. The gain obtained in the cost of this network, compared to the solution presented in the library using linear programming with an arc-path approach, is 15.15%. In the second step, the algorithm for the optimization of a larger SDH (Synchronous Digital Hierarchy) network was applied. In this case, the need to hybridize the initial algorithm with a postoptimization algorithm was identified. The results obtained for the larger network were close to that of the SNDlib network library, although they were not better. The results found are promising because they approach similar solutions at a substantially shorter execution time than the SNDlib reference time. New research must be done so that the proposed algorithm can give good answers to large networks due to this being the reality of this area of research. / Os sistemas de telecomunicações estão em constante desenvolvimento e a demanda crescente de usuários e novos serviços possibilitaram o surgimento de novas tecnologias. O planejamento tornou-se indispensável devido à competividade e a grande quantidade de recursos financeiros envolvidos. Este trabalho visa propor e avaliar um algoritmo genético de otimização para o planejamento de redes de telecomunicações. Por se tratar de um problema combinatorial o objetivo é avaliar as vantagens e desvantagens do modelo com base no algoritmo genético. Os grafos que representam as redes foram codificados em matrizes de incidência e os operadores genéticos de cruzamento e mutação foram projetados para atuarem sobre matrizes. O software MATLAB® foi utilizado como ferramenta computacional para implementação dos algoritmos. O modelo proposto minimiza o custo, considerando as restrições de demanda e capacidade técnica. Os resultados encontrados são comparados com os resultados publicados na biblioteca de instâncias de rede SNDlib. A avaliação da primeira versão do algoritmo foi feita com base em uma instância PDH (Plesiochronous Digital Hierarchy), de pequeno porte. O ganho obtido no custo da rede, em relação à solução apresentada na biblioteca usando programação linear com abordagem arco-caminho, é de 15,15%. Na segunda etapa aplicou-se o algoritmo para otimização de uma rede SDH (Synchronous Digital Hierarchy), de maior porte. Identificou-se a necessidade de hibridizar o algoritmo inicial com um algoritmo de pós-otimização. Os resultados encontrados são promissores porque se aproximam de soluções similares em um tempo de execução substancialmente menor que o tempo de referência da SNDlib. Novas pesquisas devem ser feitas para que o algoritmo proposto possa dar boas respostas para redes de grande porte em função de ser esta a realidade desta área de pesquisa.

O comportamento de insetos sociais, em especial de formigas, tem sido muito estudado nos últimos tempos, devido à capacidade destes insetos realizarem tarefas complexas a partir de interações entre indivíduos simples. Ao se moverem sobre um ambiente na busca de alimento, as formigas depositam no solo uma substância química, denominada feromônio, que atrai as formigas que se encontram no ninho e as guia em direção ao alimento encontrado. O processo de construção e seguimento destas trilhas permite que as formigas descubram os menores caminhos e as melhores fontes de alimento no ambiente. Com o objetivo de estudar as características das formigas que contribuem para a sua adaptação a diferentes condições do meio, diversos experimentos vêm sendo realizados com estes insetos. Dentro deste contexto, esta tese apresenta experimentos inéditos realizados com formigas em laboratório, sobre uma rede artificial de túneis, onde diversos caminhos interconectados conduzem a uma fonte de alimento. As decisões das formigas foram analisadas nos níveis individual e coletivo, sob mudanças no meio, compreendendo o bloqueio/desbloqueio de ramos. A medição de diversas características individuais das formigas permitiu desenvolver dois modelos matemáticos sobre o seu comportamento, que foram aplicados à situação em que não se alterou a condição do ambiente com relação ao acesso aos ramos (estática), como também a mudanças no meio (dinâmica). A análise realizada do comportamento coletivo foi utilizada na comparação dos resultados obtidos pelas simulações dos modelos. De forma geral, o segundo modelo proposto foi mais eficiente que o primeiro na situação estática, porém ele ainda necessita de ajustes nas demais situações. O bom desempenho do segundo modelo proposto levou a aplicação de sua principal característica, a função de escolha que considera a concentração de feromônio sobre os ramos do meio e a capacidade de orientação das formigas, a um problema de otimização combinatorial, o roteamento em redes de telecomunicações. O algoritmo de roteamento proposto foi avaliado sob variações no nível de tráfego e topologia da rede, e seu desempenho foi comparado ao de dois algoritmos usados por concessionárias de telecomunicações, considerando diversas medidas de desempenho. O algoritmo desenvolvido obteve resultados encorajadores, sugerindo a aplicabilidade da estrutura do modelo proposto a outros problemas complexos de otimização. / The behavior of social insects, particularly of ants, has been intensively studied in the last years, due to their capacity to perform complex tasks through interactions among simple individuals. When moving in the environment searching for food, ants deposit on the ground a chemical substance, called pheromone, to attract ants in the nest and guide them towards the source of food that was found. The process of laying/following the pheromone trails allows ants to find the shortest paths and best sources of food of the environment. With the aim to study the characteristics of the ants that contribute to their adaptation to different environment conditions, several experiments with ants have been performed and reported in this research. In this context, this thesis presents novel experiments with ants in the laboratory, in an artificial network of tunnels, where several interconnected paths lead the insects from the nest to the food source. Ants\' decision were analyzed according to the individual and collective levels, under changes in the environment, comprising the blockage/release of branches. The measure of several individual characteristics of ants allowed the development of two mathematical models of their behavior, which were applied to the non-changing (static) environment access to all branches and to changing (dynamic) access. The analysis of the collective behavior of ants in the experiments was used to compare the results derived from the simulations of the models. In general, the second proposed model was more accurate than the first one in simulating ants behavior for the static situation, however, it needs some improvements for the other situations. The satisfactory behavior of the second model led to apply its main feature, the choice taking into consideration the pheromone concentration over the branches and the ants ability to orient themselves, to solve an optimization problem, the routing in telecommunications networks. The proposed routing algorithm was evaluated under variations on the traffic level and topology of the network, and its performance was compared with two routing algorithms used by telecommunications companies, considering several performance measures. The developed algorithm produced encouraging results, suggesting the possibility to apply the framework of the proposed model to other optimization problems.

While there has always been a tremendous demand for streaming video over Wireless networks, the nature of the application still presents some challenging issues. These applications that transmit coded video sequence data over best-effort networks like the Internet, the application must cope with the changing network behaviour; especially, the source encoder rate should be controlled based on feedback from a channel estimator that explores the network intermittently. The arrival of powerful video compression techniques such as H.264, which advance in networking and telecommunications, opened up a whole new frontier for multimedia communications. The aim of this research is to transmit the H.264 coded video frames in the wireless network with maximum reliability and in a very efficient manner. When the H.264 encoded video sequences are to be transmitted through wireless network, it faces major difficulties in reaching the destination. The characteristics of H.264 video coded sequences are studied fully and their capability of transmitting in wireless networks are examined and a new approach called Optimal Packet Fragmentation (OPF) is framed and the H.264 coded sequences are tested in the wireless simulated environment. This research has three major studies involved in it. First part of the research has the study about Long Range Dependence (LRD) and the ways by which the self-similarity can be estimated. For estimating the LRD a few studies are carried out and Wavelet-based estimator is selected for the research because Wavelets incarcerate both time and frequency features in the data and regularly provides a more affluent picture than the classical Fourier analysis. The Wavelet used to estimate the self-similarity by using the variable called Hurst Parameter. Hurst Parameter tells the researcher about how a data can behave inside the transmitted network. This Hurst Parameter should be calculated for a more reliable transmission in the wireless network. The second part of the research deals with MPEG-4 and H.264 encoder. The study is carried out to prove which encoder is superior to the other. We need to know which encoder can provide excellent Quality of Service (QoS) and reliability. This study proves with the help of Hurst parameter that H.264 is superior to MPEG-4. The third part of the study is the vital part in this research; it deals with the H.264 video coded frames that are segmented into optimal packet size in the MAC Layer for an efficient and more reliable transfer in the wireless network. Finally the H.264 encoded video frames incorporated with the Optimal Packet Fragmentation are tested in the NS-2 wireless simulated network. The research proves the superiority of H.264 video encoder and OPF's master class.

As redes de telecomunicações são responsáveis pelo envio de informação entre pontos de origem e destino. Dentre os diversos dispositivos que participam deste processo, destaca-se o sistema de roteamento, que realiza a seleção das rotas a serem percorridas pelas mensagens ao longo da rede e sua condução ao destino desejado. O avanço das tecnologias utilizadas pelas redes de telecomunicações provocou a necessidade de novos sistemas de roteamento, que sejam capazes de lidar corretamente com as diversas situações enfrentadas atualmente. Dentro deste contexto, este projeto de pesquisa desenvolveu um algoritmo de roteamento adaptativo e distribuído, resultado da integração de três estratégias de aprendizagem e da adição de alguns mecanismos extras, com o objetivo de obter um algoritmo eficiente e robusto às diversas variações das condições de operação da rede. As abordagens utilizadas foram a aprendizagem-Q, aprendizagem por reforço dual e aprendizagem baseada no comportamento coletivo de formigas. O algoritmo desenvolvido foi aplicado a duas redes de comutação de circuitos e seu desempenho foi comparado ao de dois algoritmos baseados no comportamento coletivo de formigas, que foram aplicados com sucesso ao problema de roteamento. Os experimentos conduzidos envolveram situações reais enfrentadas pelas redes, como variações dos seus padrões de tráfego, nível de carga e topologia. Além disto, foram realizados testes envolvendo a presença de ruído nas informações utilizadas para a seleção das rotas a serem percorridas pelas chamadas. O algoritmo proposto obteve melhores resultados que os demais, apresentando maior capacidade de adaptação às diversas situações consideradas. Os experimentos demonstraram que novos mecanismos de otimização devem ser anexados ao algoritmo proposto, para melhorar seu comportamento exploratório sob variações permanentes do nível de carga da rede e presença de ruído nos dados utilizados em suas tarefas. / The telecommunications networks are responsible for transmiting information between source and destination points in a fast, secure and reliable way, providing low cost and high quality services. Among the several devices that takes place on this process, there is thre routing system, which selects the routes to be traversed by the messages through the network and their forwarding to the destination desired. The advances in tecnologies used by telecommunications networks caused the necessity of new routing systems, that can work correctly with the situations faced by current telecommunications networks. Hence, this research project developed an adaptive and distributed routing algorithm, resulting of the integration of three leaming strategies and addition of some extra mechanisms, with the goal of having a robust and adaptive algorithm to the several variations on operation network conditions. The approaches chosen were Q-learning, dual reinforcement learning and learning based on collective behavior of ants. The developed algorithm was applied to two circuit-switching telecommunications networks and its performance was compared to two algorithms based on ant colony behavior, which were used with success to solve the routing problem. The experiments run comprised real situations faced by telecommunications networks, like variations on the network traffic patterns, load level and topology. Moreover, we did some tests with the presence of noise in information used to select the routes to be traversed by calls. The algorithm proposed produced better results than the others, showing higher capacity of adaptation to the several situations considered. The experiments showed that new optimization mechanisms must be added to the routing algorithm developed, to improve its exploratory behavior under permanent variations on network load level and presence of noise in data used in its tasks.

Fiber-deployment of telecommunications networks is currently a great challenge for sector-specific regulators, national governments, as well as for investing operators. One of the most controversial regulatory issues in Europe (and elsewhere) is whether the emerging next generation access (NGA) infrastructure should be subjected to cost-based access regulation or whether at least a temporary removal of ex ante obligations ("regulatory holidays") should be granted. In answering this question we examine the current and foreseeable EU regulatory framework and show that it does not provide positive incentives for NGA deployment and increasing penetration rates. On the basis of an international comparison with the most recent data on NGA deployment and penetration, it appears, in turn, that deregulatory and/or state aid driven approaches targeted at the demand (subscribers) and supply side (coverage) are more promising. (author's abstract) / Series: Working Papers / Research Institute for Regulatory Economics

Although the future socio-economic benefits of a new fibre-based ("next generation access", NGA) telecommunications infrastructure seem to be uncontroversial, most countries have to date only undertaken NGA investments on a small scale. Accordingly, a universal NGA coverage appears to be a rather unrealistic objective without government intervention. Indeed, many governments have already initiated diverse subsidy programs in order to stimulate NGA infrastructure deployment. We contend, however, that the current contract practice of fixing ex ante targets for network expansion is inefficient given the uncertainty about future returns on NGA infrastructure-based services and the public authorities' incomplete information about the capital costs of the network provider. This paper puts forward to delegate the choice of the network expansion to the NGA provider. Simple linear profit-sharing contracts can be designed to control the NGA provider's incentives and to put in balance the public objectives of network expansion and limitation of public expenditure. (author's abstract) / Series: Working Papers / Research Institute for Regulatory Economics

Fiber-deployment of future telecommunications networks ("Next Generation Access" - NGA) is currently a major challenge for sector-specific regulators as well as for investing firms. Although the future socio-economic importance of new telecommunications networks is uncontroversial, the related investment activities vary substantially in international comparison. This work intends to identify the most important determinants of previous NGA deployment using data from the EU27 member states for the years 2005 to 2010. For our analysis, we employ latest data on NGA deployment, relevant competition and regulatory indicators as well as other supply and demand side controls. Our econometric model incorporates: i) aggregated country level data; ii) structurally modeled dynamics of the deployment process which allows us to disentangle long-term and short-term effects; finally, iii) we argue that there is no endogeneity problem with respect to investment activities and regulation since we refer to regulation in preceding broadband markets. For our econometric analysis, we employ several dynamic panel data methods, such as GMM and LSDVC. Our results indicate that stricter previous broadband access regulation has a negative impact on NGA deployment. As regards the dynamics of the adjustment process, we find that there are severe adjustment costs and stickiness towards the desired long-term level of NGA infrastructure. (author's abstract) / Series: Working Papers / Research Institute for Regulatory Economics