901 resultados para Computer networks -- TFC
Resumo:
En el proyecto se describe el proceso de una auditoría web que servirá para detectar y resolver las vulnerabilidades tanto del código de la aplicación como de la configuración del sistema que la aloja.
Resumo:
Este trabajo se centra en el uso del lenguaje Python y la librería OpenCV de visión por computador para el seguimiento de crustáceos marinos en condiciones experimentales y determinar su comportamiento en un entorno social.
Resumo:
L'analitzador desenvolupat en aquest treball de final de grau, a diferència dels analitzadors de xarxa habituals, no pretén mostrar les dades contingudes en les trames dels paquets capturats, sinó mostrar la informació del tràfic de xarxa des d'un nivell d'abstracció per sobre, centrant-se en l'anàlisi dels protocols i els ports de servei que formen les comunicacions en les xarxes d'ordinadors.
Resumo:
En aquest treball de final de carrera explico els conceptes principals dels dispositius tàctils, les seves tecnologies i el disseny centrat en l'usuari (DCU), per tal de poder comprendre com funcionen aquests dispositius i la seva metodologia d'ús.
Resumo:
El proyecto realizado es un localizador gráfico de direcciones IP.
Resumo:
Verkostosodankäynti on suuren huomion kohteena useiden maiden puolustusvoimien järjestelmäkehityshankkeissa. Verkostosodankäynnin tavoitteena on kytkeä kaikki taistelukentän komponentit yhteen nopean tiedonsiirtoverkon avulla. Tällä pyritään tehokkaampaan tiedonjakoon ja edelleen resurssien tehokkaampaan käyttöön. Keskeisessä osassa verkostosodankäynnin tavoitteiden saavuttamisessa on palvelukeskeinen arkkitehtuuri (SOA). Tarve yhä monimutkaisemmille tietojärjestelmille pakottaa myös sotilasympäristön toimijat etsimään ratkaisuja valmiista kaupallisista toteutuksista. Verkottunut toiminta tuottaa valtavasti erilaista tilannetietoa. Tilannetiedon pohjalta muodostetaan erilaisia tilannekuvia, joita johtajat käyttävät päätöksentekonsa tukena. Työssä tutkitaan kaupallisen mashup-alustan käyttöä tilannekuvan luomiseen. Mashup-alusta on tietojärjestelmä, jolla voidaan helposti ja nopeasti integroida useista lähteistä saatavaa informaatiota. Mashup-alusta mahdollistaa niin kutsuttujen käyttäjämääriteltyjen tilannekuvien luomisen. Työn tuloksena mashup-alustan soveltuvuus tähän käyttöön on hyvä ja se soveltuu hyvin erityisesti tilanteisiin, joissa vaaditaan nopeita ratkaisuja. Jatkotutkimusta aiheesta tarvitaan, koska mashupalustan käyttöä sotilaallisissa tietojärjestelmissä ei ole juurikaan tutkittu ja aihe on suhteellisen uusi myös tiedeyhteisössä.
Resumo:
Els orígens de la telemàtica apareixen amb la necessitat d’establir comunicacions entre ordinadors. Les primeres xarxes que hi havia als centres educatius permetien que, dins d’un mateix edifici, diferents ordinadors poguessin compartir informació i programes educatius. En canvi, avui la comunicació es pot establir no només entre individus i grups d’individus, sinó també entre centres de documentació i centres educatius situats en diferents ambients. Cal destacar que, com a exemple de xarxa telemàtica educativa a Catalunya, tenim la XTEC
Resumo:
Tapahtumat ovat perusta monille nykyaikaisille tietoteknisille palveluille. Yksittäinen tapahtuma voidaan nähdä työtehtävänä, joka käsittelevän järjestelmän tulee suorittaa. Tapahtumankäsittely pyrkii pitämään järjestelmän tunnetussa ja ristiriidattomassa tilassa. Tämä toteutetaan pitämällä huolta, että jokainen tapahtuma joko onnistuu tai epäonnistuu kokonaisuudessaan. Tapahtumankäsittelyjärjestelmät ovat kasvaneet ja yhtäaikaisten käsiteltävien tapahtumien määrä noussut palveluiden siirtyessä yhä enemmän tietoverkkoihin. Samalla järjestelmien kehittäminen ja ylläpito vaikeutuvat, jolloin kehittäjät tarvitsevat parempia työkaluja järjestelmän valvontaan. Tapahtumankäsittelyn seuranta pyrkii seuraamaan järjestelmän sisäistä toimintaa yksittäisen tapahtuman tai osatapahtuman tarkkuudella. Riippuen toteutuksesta kehittäjä voi joko tarkkailla järjestelmää reaaliaikaisesti tai jälkikäteen suorituksen perusteella tallennetun seurantatiedon avulla. Työssä esitellään tapahtumanseurantakomponentin suunnitteluprosessi ratkaisuineen, joka mahdollistaa tapahtumien suorituksen tarkkailun, seurantatiedon tallentamisen sekä tulosten tarkastelun jälkikäteen. Työ on toteutettu osaksi Syncron Tech Oy:n Syncware-ohjelmistoalustaa.
Resumo:
As computer networks grow larger and more complex there is a need for a new, simpler kind of approach to configuring them. Software Defined Networking (SDN) takes the control plane away from individual nodes and centralizes the network control by utilizing a flow based traffic management. In this thesis the suitability of SDN in a small ISP (Internet Service Provider) network is considered for an alternative to the current traditional core network and access network OSSs (Operations Support System), mainly to simplify the network management but also to see what else would SDN offer for such an environment. Combining information learned from a theoretical study on the matter to a more practical experiment of SDN network simulation using Mininet simulation software and OpenDayLight SDN controller software does this. Although the simulation shows that SDN is able to provide the functionality needed for the network, the immaturity of the technology suggests that for a small ISP network there is no need to utilize SDN just yet. For when SDN becomes more commonplace a brief transition plan is introduced.
Resumo:
The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.
Resumo:
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.
Resumo:
Sharing of information with those in need of it has always been an idealistic goal of networked environments. With the proliferation of computer networks, information is so widely distributed among systems, that it is imperative to have well-organized schemes for retrieval and also discovery. This thesis attempts to investigate the problems associated with such schemes and suggests a software architecture, which is aimed towards achieving a meaningful discovery. Usage of information elements as a modelling base for efficient information discovery in distributed systems is demonstrated with the aid of a novel conceptual entity called infotron.The investigations are focused on distributed systems and their associated problems. The study was directed towards identifying suitable software architecture and incorporating the same in an environment where information growth is phenomenal and a proper mechanism for carrying out information discovery becomes feasible. An empirical study undertaken with the aid of an election database of constituencies distributed geographically, provided the insights required. This is manifested in the Election Counting and Reporting Software (ECRS) System. ECRS system is a software system, which is essentially distributed in nature designed to prepare reports to district administrators about the election counting process and to generate other miscellaneous statutory reports.Most of the distributed systems of the nature of ECRS normally will possess a "fragile architecture" which would make them amenable to collapse, with the occurrence of minor faults. This is resolved with the help of the penta-tier architecture proposed, that contained five different technologies at different tiers of the architecture.The results of experiment conducted and its analysis show that such an architecture would help to maintain different components of the software intact in an impermeable manner from any internal or external faults. The architecture thus evolved needed a mechanism to support information processing and discovery. This necessitated the introduction of the noveI concept of infotrons. Further, when a computing machine has to perform any meaningful extraction of information, it is guided by what is termed an infotron dictionary.The other empirical study was to find out which of the two prominent markup languages namely HTML and XML, is best suited for the incorporation of infotrons. A comparative study of 200 documents in HTML and XML was undertaken. The result was in favor ofXML.The concept of infotron and that of infotron dictionary, which were developed, was applied to implement an Information Discovery System (IDS). IDS is essentially, a system, that starts with the infotron(s) supplied as clue(s), and results in brewing the information required to satisfy the need of the information discoverer by utilizing the documents available at its disposal (as information space). The various components of the system and their interaction follows the penta-tier architectural model and therefore can be considered fault-tolerant. IDS is generic in nature and therefore the characteristics and the specifications were drawn up accordingly. Many subsystems interacted with multiple infotron dictionaries that were maintained in the system.In order to demonstrate the working of the IDS and to discover the information without modification of a typical Library Information System (LIS), an Information Discovery in Library Information System (lDLIS) application was developed. IDLIS is essentially a wrapper for the LIS, which maintains all the databases of the library. The purpose was to demonstrate that the functionality of a legacy system could be enhanced with the augmentation of IDS leading to information discovery service. IDLIS demonstrates IDS in action. IDLIS proves that any legacy system could be augmented with IDS effectively to provide the additional functionality of information discovery service.Possible applications of IDS and scope for further research in the field are covered.
Resumo:
Page 1. Webhosting and Networking G. Santhosh Kumar, Dept. of Computer Science Cochin University of Science and Technology Page 2. Agenda What is a Network? Elements of a Network Hardware Software Ethernet Technology World Wide Web Setting up a Network Conclusion Page 3. What is a Network? An interconnected system of things or people Purpose of a Network? Resource Sharing Communication LANs have become the most popular form of Computer Networks Page 4. Principle of Locality of Reference Temporal Locality of Reference ...
Resumo:
Creació d’un portal web amb informació sobre el Trampolí Tecnològic de la UdG (activitats, ofertes, etc.), i disseny d'una intranet que permeti al trampolí gestionar les diferents funcions que s'hi duen a terme (gestió dels diferents gestors de projectes, projectes que es tutelen, emprenedors i inversors que intervenen, ajudes que es poden rebre, etc.)
Resumo:
Miquel Alimentació es una empresa líder en distribución de artículos de consumo en España. El objetivo principal del proyecto es concebir un punto de trabajo común de acceso centralizado para ubicar toda la información, aplicaciones de empresa y servicios tanto dentro como fuera de ella. Contener herramientas para la gestión, análisis y enlace de datos que permitirá la colaboración de varios usuarios