To see the other types of publications on this topic, follow the link: Internet programming.
Dissertations / Theses on the topic 'Internet programming'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Internet programming.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Shen, Haifeng, and n/a. "Internet-Based Collaborative Programming Techniques and Environments." Griffith University. School of Computing and Information Technology, 2003. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20031015.143156.
Full textAbstract:
Software systems are getting larger and more complex, while the requirements are becoming vaguer and more rapidly changing. These trends make current software development more and more likely a team work. To integrate multiple developers into a coherent structured management process and make team software development a positive-sum game for both higher productivity and better quality, many team soft ware development methodologies have been proposed and practised. An emerging methodology is collaborative programming, which allows a group of programmers to work together on the same source code for design, implementation of individual components, and integration of individual components. Compared with other team software methodologies that only address needs in some phases or situations, collaborative programming is more adaptive to the variety of different phases or situations in a team software development process. A core technical component in collaborative programming is collaborative editing, which allows a group of programmers to view and edit the same source code. To support different phases or situations in an Internet-based collaborative programming process, collaborative editing must meet the requirements of supporting unconstrained, responsive, real-time collaborative editing; unconstrained, syncretic, non-real-time collaborative editing; and smooth, flexible switching between real-time and non-real-time collaborative editing. This thesis research contributes several novel techniques to address these requirements, and an Internet-based collaborative programming environment to integrate those techniques. These research contributions have advanced state-of-the-art technologies on col laborative editing for supporting Internet-based collaborative programming. First, we contribute a collaborative highlighting gestural communication technique for unconstrained, responsive, real-time collaborative editing. This technique is particularly effective in improving the quality of real-time interaction on text-based source code documents. The contribution to the operational transformation technology is the extension of the technology to support group awareness. It includes a package of operational transformation functions and transformation control algorithms for consistency maintenance in collaborative highlighting, and a flexible undo solution that has the capability of undoing any highlighting operation at any time. Second, we contribute a flexible operation-based merging technique for unconstrained, syncretic, non-real-time collaborative editing, which is efficient and has the capability of textually integrating all changes, and automatically detecting and resolving syntactic conflicts according to application-dependent user-specified policies. The contribution to the operational transformation technology is the extension of the technology to support unconstrained, syncretic, non-real-time collaborative editing. Its includes a log compression algorithm, a textual merging algorithm, and a syntactic merging algorithm. Moreover, we contribute a flexible notification technique to support flexible collaborative editing: unconstrained, responsive, real-time collaborative editing; uncon strained, syncretic, non-real-time collaborative editing; and smooth, flexible switching between them. The contribution to the operational transformation technology is the extension of the technology to support flexible collaborative editing. It includes a new transformation control algorithm that has a linear time complexity, two notification algorithms that support propagation and acceptance of any notifications at any time, and a notification propagation protocol that is efficient for both real-time and non-real-time collaborative editing.
2
Shen, Haifeng. "Internet-Based Collaborative Programming Techniques and Environments." Thesis, Griffith University, 2003. http://hdl.handle.net/10072/367439.
Full textAbstract:
Software systems are getting larger and more complex, while the requirements are becoming vaguer and more rapidly changing. These trends make current software development more and more likely a team work. To integrate multiple developers into a coherent structured management process and make team software development a positive-sum game for both higher productivity and better quality, many team soft ware development methodologies have been proposed and practised. An emerging methodology is collaborative programming, which allows a group of programmers to work together on the same source code for design, implementation of individual components, and integration of individual components. Compared with other team software methodologies that only address needs in some phases or situations, collaborative programming is more adaptive to the variety of different phases or situations in a team software development process. A core technical component in collaborative programming is collaborative editing, which allows a group of programmers to view and edit the same source code. To support different phases or situations in an Internet-based collaborative programming process, collaborative editing must meet the requirements of supporting unconstrained, responsive, real-time collaborative editing; unconstrained, syncretic, non-real-time collaborative editing; and smooth, flexible switching between real-time and non-real-time collaborative editing. This thesis research contributes several novel techniques to address these requirements, and an Internet-based collaborative programming environment to integrate those techniques. These research contributions have advanced state-of-the-art technologies on col laborative editing for supporting Internet-based collaborative programming. First, we contribute a collaborative highlighting gestural communication technique for unconstrained, responsive, real-time collaborative editing. This technique is particularly effective in improving the quality of real-time interaction on text-based source code documents. The contribution to the operational transformation technology is the extension of the technology to support group awareness. It includes a package of operational transformation functions and transformation control algorithms for consistency maintenance in collaborative highlighting, and a flexible undo solution that has the capability of undoing any highlighting operation at any time. Second, we contribute a flexible operation-based merging technique for unconstrained, syncretic, non-real-time collaborative editing, which is efficient and has the capability of textually integrating all changes, and automatically detecting and resolving syntactic conflicts according to application-dependent user-specified policies. The contribution to the operational transformation technology is the extension of the technology to support unconstrained, syncretic, non-real-time collaborative editing. Its includes a log compression algorithm, a textual merging algorithm, and a syntactic merging algorithm. Moreover, we contribute a flexible notification technique to support flexible collaborative editing: unconstrained, responsive, real-time collaborative editing; uncon strained, syncretic, non-real-time collaborative editing; and smooth, flexible switching between them. The contribution to the operational transformation technology is the extension of the technology to support flexible collaborative editing. It includes a new transformation control algorithm that has a linear time complexity, two notification algorithms that support propagation and acceptance of any notifications at any time, and a notification propagation protocol that is efficient for both real-time and non-real-time collaborative editing.Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Computing and Information Technology
Full Text
3
Haungs, Michael Laurice. "Providing network programming primitives for Internet application construction /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2002. http://uclibs.org/PID/11984.
Full text
4
Gupta, Anima. "Logic Programming Tools for Dynamic Content Generation and Internet Data Mining." Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2677/.
Full textAbstract:
The phenomenal growth of Information Technology requires us to elicit, store and maintain huge volumes of data. Analyzing this data for various purposes is becoming increasingly important. Data mining consists of applying data analysis and discovery algorithms that under acceptable computational efficiency limitations, produce a particular enumeration of patterns over the data. We present two techniques based on using Logic programming tools for data mining. Data mining analyzes data by extracting patterns which describe its structure and discovers co-relations in the form of rules. We distinguish analysis methods as visual and non-visual and present one application of each. We explain that our focus on the field of Logic Programming makes some of the very complex tasks related to Web based data mining and dynamic content generation, simple and easy to implement in a uniform framework.
5
Lopes, Júnior Ricardo de Oliveira. "Otimização via Internet." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307115.
Full textAbstract:
Orientador: Francisco A. M. Gomes NetoDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-16T18:35:34Z (GMT). No. of bitstreams: 1 LopesJr._RicardodeOliveira_M.pdf: 1018281 bytes, checksum: aa6f5adb041720d76a549b50e09fdcb2 (MD5) Previous issue date: 2010
Resumo: Este trabalho apresenta um sistema remoto de resolução de problemas de otimização através da internet. O usuário visita a página do sistema, escolhe o programa de otimização que deseja utilizar, submete o seu problema e recebe a solução na tela ou por correio eletrônico. O objetivo do sistema é popularizar as bibliotecas computacionais desenvolvidas no país, assim como atender à demanda de pesquisadores e empresas por programas de otimização. No momento, estão disponíveis os pacotes GENCAN e ALGENCAN. O sistema permite que se use derivadas automáticas, geradas pelo pacote Adol-C, caso o programa exija o uso de derivadas e o usuário não possa fornecê-las. Uma fila de compilação e uma fila de processamento controlam o fluxo de submissões de problemas. O usuário pode visualizar essas filas e cancelar um trabalho submetido
Abstract: This work presents a remote system for solving optimization problems over the internet. The user visits the system website, chooses the optimization solver and submits a problem. The solution may be visualized in the browser window or by email. The objective of the system is to popularize the solvers developed by Brazilian researchers, as well as to meet the demand of researchers and companies for optimization programs. So far, the packages GENCAN and ALGENCAN are available. If the solver needs the derivatives of the functions and the user is not able to supply them, the system permits the use of automatic differentiation, generated by the Adol-C package. A compilation queue and an execution queue control the server submission flow. The user may visualize these queues and cancel a submitted job
Mestrado
Matematica Aplicada
Mestre em Matemática
6
Crum, Shannon L. "The spatial development of the Internet /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004244.
Full text
7
Yesilyurt, Halim Burak. "A Simplified Secure Programming Platform for Internet of Things Devices." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3788.
Full textAbstract:
The emerging Internet of Things (IoT) revolution has introduced many useful applications that are utilized in our daily lives. Users can program these devices in order to develop their own IoT applications; however, the platforms and languages that are used during development are abounding, complicated, and time-consuming. The software solution provided in this thesis, PROVIZ+, is a secure sensor application development software suite that helps users create sophisticated and secure IoT applications with little software and hardware experience. Moreover, a simple and efficient domain-specific programming language, namely Panther language, was designed for IoT application development to unify existing programming languages. In addition to these contributions, PROVIZ+ supports a novel secure over-the-air programming framework, namely SOTA, using Bluetooth and WiFi as well as serial programming.
In this thesis, we explain the features of PROVIZ+’s components, how these tools can help develop IoT applications, and SOTA. We also present the performance evaluations of PROVIZ+ and SOTA.
8
Antonopoulos, Nikolaos. "MASIC : a secure mobile agent framework for Internet computing." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/843023/.
Full textAbstract:
Software mobile agents is a new distributed computing paradigm which was developed to support efficient computing over the Internet. Since its inception there has been a significant research effort to produce concrete agent-based artefacts. This phenomenon resulted in the proliferation of a large number of agent systems, mostly based on proprietary programming languages, each with its own characteristics, peculiarities and assumptions. Hence the agent technology has largely remained hidden and incomprehensible by Internet end users. Moreover the issue of interoperability and integration of agents with existing legacy software has only just started to be addressed by the agent research community in a rather ad hoc way. In this thesis we attempt to design an agent architecture which is independent of any programming language and therefore is directly suitable for Internet end users. The proposed architecture, labelled as Mobile Agent System for Internet Computing (MASIC), addresses several important contemporary issues in agent research. It defines an agent as a container of reusable components that can be copied or moved to other agents. Each agent has a symmetric I/O access control module and is also equipped with associative access collaboration facilities. Additionally every agent contains a navigator module which stores the agent's itinerary plan and provides an interface via which the agent itself or other authorised agents can dynamically adapt the plan to reflect run-time events and constraints. The agent system provides an integrated access control architecture which enables an agent to define customised access control structures that can be fully or partially shared with other agents. Existing access control structures can be combined to create new structures that represent more complex access mechanisms. Agents can discover other agents offering pertinent services via an adaptive, customisable agent discovery architecture incorporated in MASIC. This discovery architecture enables the full interaction of links with queries and supports the definition of access paths which are tightly coupled with access control and. other customised services. MASIC also provides the conceptual architecture of a message-oriented agent communication system integrated with a mobility management scheme. Finally, this thesis presents the design and implementation of a prototype graphical interface which enables the potential user of the system to create, manage and interact with agents in real time. In conclusion the research presented in this thesis aims to provide a comprehensive, language-neutral, secure, collaborative environment within which mobile agents can interact with their peers in order to perform their tasks efficiently while human operators can oversee and manage these activities through a user friendly interface. The architecture is generic in nature as it can support general-purpose, agent-based computations. Its concepts, entities and mechanisms can be fully or partially re-used to provide architectural solutions to challenges in various application domains such as Knowledge Management, the GRID and E-Commerce.
9
Sibson, Keith. "Programming language abstractions for the global network." Thesis, University of Glasgow, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368587.
Full text
10
Saberi, Amin. "Algorithmic Aspects of the Internet." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/6427.
Full textAbstract:
The goal of this thesis is to use and advance the techniques developed in the field of exact and approximation algorithms for many of the problems arising in the context of the Internet. We will formalize the method of dual fitting and the idea of factor-revealing LP. We use this combination to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61 respectively. We also provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891. Our algorithm is modeled after Kuhn's primal-dual algorithm for bipartite matching. We also study the connectivity properties of the Internet graph and its impact on its structure. In particular, we consider the model of growth with preferential attachment for modeling the graph of the Internet and prove that under some reasonable assumptions, this graph has a constant conductance.
11
Davidson, Ian Joseph. "Tele-operation of a manipulator using the Internet." Thesis, Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/17623.
Full text
12
Auzias, Maël. "Programming Support for a Delay-Tolerant Web of Things." Thesis, Lorient, 2017. http://www.theses.fr/2017LORIS462/document.
Full textAbstract:
L'internet des Objets (IoT) est habituellement présenté comme l'ensemble d'objets interconnectés à travers un réseau qui est, en pratique, Internet. Or, il existe beaucoup de cas où la connectivité est intermittente à cause des interfaces radio courte-portées et des contraintes d'économie d'énergie. L'architecture de réseautage tolérant les délais (DTN) ainsi que le Bundle Protocole (BP) sont considérés comme des solutions viables pour résoudre ce genre de challenges grâce au mécanisme store-carry-and-forward. Cette thèse vise à fournir des supports de programmation adaptés autant à l'IoT qu'au contexte DTN. Dans ce but, les challenges relevant du DTN et de l'IoT (DT-IoT) sont étudiés et quelques principes de design logiciels sont proposés. Ces principes ont pour but d'optimiser la réactivité et l'efficacité des applications ayant pour cible un contexte DT- IoT. La première contribution est la définition d'un support de programmation orienté ressources, nommé BoaP. Ce support fournit un protocole de requête/réponse grâce à une transposition de CoAP (Contrained Application Protocol). Cette transposition est composée d'ajustements fondamentaux et d'améliorations pour utiliser BP en tant que couche de transport. BoaP a été implémenté et testée dans un petit réseau physique. Une méthode pour évaluer des intergiciels dans des réseaux DTNs est présentée. Un outil implémentant cette méthode a été développé. Il repose sur une plateforme de virtualisation qui simule les contacts réseaux tout en émulant les nœuds du réseau. Cet outil a été utilisé pour exécuter des expériences pour évaluer la validité de BoaP. Enfin, un autre support de programmation est examiné. Celui-ci adopte une approche orientée service et respecte les contraintes REST (Representational State Transfer). Il se repose sur BoaP a été créé avec l'IoT en tête et est adapté à l’environnement DTN. La découverte exploite une interface de publications/souscriptions. Les descripteurs de services contiennent des champs spécifiques pour informer de la disponibilité de leur fournisseursThe Internet of Things (IoT) is usually presented as a set of THINGS interconnected through a network that is, in practice, Internet. However, there exist many contexts in which the connectivity is intermittent due to short-range wireless communication means or energy constraints. The Delay Tolerant Networking (DTN) architecture and the Bundle Protocol (BP) are known to overcome this communication challenge as they provide communication means by relying on a store-carry-and- forward mechanism. This thesis aims to provide programming supports adapted to both IoT and DTN contexts. For this, both DTN and IoT (DT-IoT) challenges are studied and several design principles are proposed. These principles aim to optimize reactivity and efficiency of applications targeting the DT-IoT context. The first contribution is the definition of a resource-oriented programming support, named BoaP, to enable a DT-IoT. It provides a protocol based on request/response thanks to a transposition of CoAP (Contrained Application Protocol). This transposition consists of fundamental adjustments and enhancements to use BP as the underlying transport protocol. BoaP has been implemented and tested in a small physical network. A method to evaluate middleware systems in DTNs is presented. A tool implementing this method has been developed. It relies on a virtualization platform that simulates network contacts and emulates network devices. This tool was used to run experimentations that assessed the validity of BoaP. Finally, another programming support is investigated. It follows a service-oriented approach and respects REST (Representational State Transfer) constraints. It is built on top of BoaP with IoT in mind and is adapted to DTN environments. Its discovery/advertisement exploits a publish/subscribe interface. Service descriptors contain specific fields to inform on the availability of the service providers. %Finally, requests are extended with some options to enforce conditions on geographic or time context
13
Joshi, Nicky. "IntelliBid an event-trigger-rule-based auction system over the Internet /." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1603/thesis%5Fsubmit2.pdf.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2001.Title from first page of PDF file. Document formatted into pages; contains x, 61 p.; also contains graphics. Vita. Includes bibliographical references (p. 58-60).
14
Thakore, Kushal. "Intellibid an Event-Trigger-Rule-Based auction system over the Internet /." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1001185.
Full text
15
Tang, Wei. "Internet-Scale Information Monitoring: A Continual Query Approach." Diss., Available online, Georgia Institute of Technology, 2003:, 2003. http://etd.gatech.edu/theses/available/etd-12042003-173321/unrestricted/tangwei200312.pdf.
Full textAbstract:
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2004.Thomas E. Potok, Committee Member; Calton Pu, Committee Member; Edward Omiecinski, Committee Member; Leo Mark, Committee Member; Constantinos Dovrolis, Committee Member; Ling Liu, Committee Chair. Includes bibliography.
16
Waldring, Ségio Jim. "Standard network diagramming language and corresponding meta-model." Click here to access thesis, 2009. http://www.georgiasouthern.edu/etd/archive/spring2008/segio_j_waldring/waldring_segio_j_200901_msm.pdf.
Full textAbstract:
Thesis (M.S.)--Georgia Southern University, 2009."A thesis submitted to the Graduate Faculty of Georgia Southern University in partial fulfillment of the requirements for the degree Master of Science." Directed by Vladan Jovanovic. ETD. Includes bibliographical references (p. 31-34) and appendix.
17
Suryasaputra, Robert, and rsuryasaputra@gmail com. "Congestion Removal in the Next Generation Internet." RMIT University. Electrical and Computer Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080521.114723.
Full textAbstract:
The ongoing development of new and demanding Internet applications requires the Internet to deliver better service levels that are significantly better than the best effort service that the Internet currently provides and was built for. These improved service levels include guaranteed delays, jitter and bandwidth. Through extensive research into Quality of Service and Differentiated Service (DiffServ) it has become possible to provide guaranteed services, however this turns out to be inadequate without the application of Traffic Engineering methodologies and principles. Traffic Engineering is an integral part of network operation. Its major goal is to deliver the best performance from an existing service provider's network resources and, at the same time, to enhance a customers' view of network performance. In this thesis, several different traffic engineering methods for optimising the operation of native IP and IP networks employing MPLS are proposed. A feature of these new methods is their fast run times and this opens the way to making them suitable for application in an online traffic engineering environment. For native IP networks running shortest path based routing protocols, we show that an LP-based optimisation based on the well known multi-commodity flow problem can be effective in removing network congestion. Having realised that Internet service providers are now moving towards migrating their networks to the use of MPLS, we have also formulated optimisation methods to traffic engineer MPLS networks by selecting suitable routing paths and utilising the feature of explicit routing contained in MPLS. Although MPLS is capable of delivering traffic engineering across different classes of traffic, network operators still prefer to rely on the proven and simple IP based routing protocols for best effort traffic and only use MPLS to route traffic requiring special forwarding treatment. Based on this fact, we propose a method that optimises the routing patterns applicable to different classes of traffic based on their bandwidth requirements. A traffic engineering comparison study that evaluates the performance of a neural network-based method for MPLS networks and LP-based weight setting approach for shortest path based networks has been performed using a well-known open source network simulator, called ns2. The comparative evaluation is based upon the packet loss probability. The final chapter of the thesis describes the software development of a network management application called OptiFlow which integrates techniques described in earlier chapters including the LP-based weight setting optimisation methodology; it also uses traffic matrix estimation techniques that are required as input to the weight setting models that have been devised. The motivation for developing OptiFlow was to provide a prototype set of tools that meet the congestion management needs of networking industries (ISPs and telecommunications companies - telcos).
18
Nand, Alka. "Design and implemetation of internet mail servers with embedded data compression." CSUSB ScholarWorks, 1997. https://scholarworks.lib.csusb.edu/etd-project/1482.
Full text
19
Paixão, Valeria Jotta dos Reis. "Politicas e mecanismos de engenharia de trafego para redes MPLS/DS." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276099.
Full textAbstract:
Orientador: Edmundo Roberto Mauro MadeiraDissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-10T07:03:06Z (GMT). No. of bitstreams: 1 Paixao_ValeriaJottadosReis_M.pdf: 1508382 bytes, checksum: 5099f72d547bb027df24dd7692d43775 (MD5) Previous issue date: 2007
Resumo: Um problema atual no mundo das ¿Redes de Computadores¿ é o fornecimento de QoS fim-a-fim na Internet a diferentes usuários, ou seja, a distintos tipos de serviços. Além disso, a demanda por este serviços'o vem aumentando uma vez que a Internet está sendo cada vez mais solicitada não somente para transferência de arquivos, web ou para tarefas relacionadas com o correio eletrônico, mas também para aplicações multimídia que solicitam meios de transporte mais precisos. A proposta desta dissertação é fornecer melhorias a uma plataforma MPLS-DiffServ, transformando a mesma em um sistema mais flexível e dinâmico no oferecimento de qualidade de serviço fim-a-fim. As novas características utilizam tipos de tráfegos amplamente encontrados na Internet, assim como dois parâmetros de monitoramento, a largura de banda do LSP e os níveis de descartes de pacotes. As inovações vêm no formato de novas políticas para o gerenciamento da rede em caso da ruptura dos acordos pré-estabelecidos com os clientes, além de uma nova estrutura introduzida no mecanismo de Engenharia de Tráfego que ajudará o sistema a fazer uma análise mais profunda do tráfego no LSP de modo que as decisões mais exatas e rápidas possam ser aplicadas a fim de recuperar circunstâncias ideais para atender às expectativas dos usuários finais. Na mesma plataforma foi feita a verificação das melhorias para as quais o sistema forneceu respostas bem sucedidas que estimulasse a ambição de fazer da plataforma uma opção de ferramenta para companhias que desejem simular novas políticas administrativas antes de executá-las em uma rede real que afetam usuários reais
Abstract: A current problem in the ¿Computer Network¿ world is to provide end-to-end QoS in the Internet to different users what means supply support to distinct types of services. Moreover, the demand for this support is increasing even more once the Internet is being handled not only for transferring files, accessing the web or for email tasks but also for multimedia applications, it means, services that require a more accurate transmission media. The proposal of this dissertation is to provide enhancements to an MPLS-DiffServ platform, making it up a more flexible and dynamic system to offer end-to-end QoS. The new features make use of types of traffic largely handled in the Internet as well as two monitor parameters, the LSP bandwidth and the levels of packet drop. The innovation comes in the format of new policies in order to manage the networks in case of break of agreements made with the clients, besides a new structure that was inserted in the ¿Traffic Engineering¿ mechanism that will help in a sense of deep analysis of the traffic in the LSP so that more accurate and fast decisions can be applied in order to recover ideal conditions to attend the expectations of the final users. On this framework the verification of the new improvements was done and, as a result, the system provided a successful response that copes with the ambition of making the platform an option tool for companies that wish to simulate new administrative policies just before to implement them in a real network that affects real users
Mestrado
Redes de Computadores
Mestre em Ciência da Computação
20
Ma, Jie Carleton University Dissertation Engineering Systems and Computer. "Measurement and performance analysis of World Wide Web applications." Ottawa, 1996.
Find full text
21
Kwok, Sheung-yin Dominic. "Implementation of a web-based collaborative tool for learning computer programming : a case study /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25148199.
Full text
22
Sarker, Pradipta K., and mikewood@deakin edu au. "Phenomenological inquiry into the experience of web project managers." Deakin University. School of Information Systems, 2003. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20051208.091736.
Full textAbstract:
The advent of the Internet and the World Wide Web has been instrumental in bringing about the growth in the implementation of web-based information systems (WBIS). Such systems are designed with the aim of improving productivity, data accuracy, and the reduction of paperwork and administrative overheads. Moreover, unlike their conventional non-web-based predecessors, the WBIS are commonly aimed at users who are casual and untrained, geographically distributed and non-homogenous. The dissemination of WBIS necessitates additional infrastructure support in the form of a security system, workflow and transaction management, and web administration.
WBIS are commonly developed using an evolutionary approach, whereby the version of the application, acquired from the vendor, is first deployed as a pilot, in order to gather feedback from the target users before the evolutionary cycles commence. While a number of web development methodologies have been proposed by existing research, there is a dearth of empirical evidence that elucidates the experiences of project initiators in pursuing the evolution of web services, a process that undoubtedly involves dealing with stakeholder issues.
This research project presents a phenomenological investigation of the experiences of project managers with the implementation of web-based employee service systems (ESS), a domain that has witnessed a sharp growth in Australia in recent times. However, the project managers rich, multidimensional account of their experiences with the implementation of ESS revealed the social obstacles and fragility of intra-organizational relationships that demanded a cautious and tactful approach. Thus, the study provides a socio-organizational perspective to web projects in contrast to the functionalist paradigm of current web development methodologies. The research also confirms that consideration of the concerns of stakeholders by project managers is crucial to the successive cycles of ESS evolution. Project managers address stakeholder concerns by pursuing actions that are aimed at encouraging ESS usage, but at the same time, such actions can have consequences necessitating subsequent iterations of system enhancement and improvement. Finally, the research also discovered that despite the different socio-political climate prevalent in various organizations, in which ESS are being implemented, the experiences of project managers in dealing with stakeholder concerns can be captured and independently confirmed in terms of their perceived relevance and usefulness in problem-solving within the application domain.
23
Veith, Tamie L. "Netsim: A Java(TM) -Based WWW Simulation Package." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36587.
Full textAbstract:
Use of the World Wide Web (WWW) for transfer of information and ideas is increasingly popular. Java, a programming language for the WWW, provides a simple method of distributing platform-independent, executable programs over the WWW. Such programs allow the expansion of WWW-based computational and analytical tools that support and enhance the existing WWW environment. However, a WWW-based, generalized simulation package is not yet available. Current literature motivates development of a general, WWW-based simulation package with maximum user interactivity and cross-platform capabilities. Advantages of such a package are discussed and explored in three potential applications. Main advantages are wide availability, controlled access, efficient maintenance, and increased integration. Disadvantages, such as variable download times, are also discussed. Netsim, a general, WWW-based simulation package written entirely in Java, is developed and demonstrated. Netsim provides complete model creation and modification capabilities along with graphical animation and data output. Netsim uses the event graph paradigm and object-oriented programming. Java, event graphs and objectoriented programming are discussed briefly. The Java random number generator is verified for uniformity and independence. Netsim is compared to SIGMA, a non-Internet simulation package, using a standard M/M/1 queueing model. Comparison issues and results are discussed. Additionally, tested through hand-tracing for coding validity, Netsim performs as theory prescribes. Netsim documentation and user’s manual are included. Netsim allows expandability for complex modeling and integration with other Java-based programs, such as graphing and analysis packages. Current Netsim limitations and potential customization and expansion issues are explored. Future work in WWW-based simulation is suggested.Master of Science
24
Zhu, Leon Yang. "Dominant strategy double auction mechanisms design and implementation /." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0011354.
Full text
25
Tariq, Muhammad Mukarram Bin. "Modeling performance of internet-based services using causal reasoning." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33927.
Full textAbstract:
The performance of Internet-based services depends on many
server-side, client-side, and network related factors. Often, the
interaction among the factors or their effect on service performance
is not known or well-understood. The complexity of these services
makes it difficult to develop analytical models. Lack of models
impedes network management tasks, such as predicting performance while
planning for changes to service infrastructure, or diagnosing causes
of poor performance.
We posit that we can use statistical causal methods to model
performance for Internet-based services and facilitate performance
related network management tasks. Internet-based services are
well-suited for statistical learning because the inherent variability
in many factors that affect performance allows us to collect
comprehensive datasets that cover service performance under a wide
variety of conditions. These conditional distributions represent the
functions that govern service performance and dependencies that are
inherent in the service infrastructure. These functions and
dependencies are accurate and can be used in lieu of analytical models
to reason about system performance, such as predicting performance of
a service when changing some factors, finding causes of poor
performance, or isolating contribution of individual factors in
observed performance.
We present three systems, What-if Scenario Evaluator (WISE), How to
Improve Performance (HIP), and Network Access Neutrality Observatory
(NANO), that use statistical causal methods to facilitate network
management tasks. WISE predicts performance for what-if configurations
and deployment questions for content distribution networks. For this,
WISE learns the causal dependency structure among the latency-causing
factors, and when one or more factors is changed, WISE estimates
effect on other factors using the dependency structure. HIP extends
WISE and uses the causal dependency structure to invert the
performance function, find causes of poor performance, and help
answers questions about how to improve performance or achieve
performance goals. NANO uses causal inference to quantify the impact
of discrimination policies of ISPs on service performance. NANO is the
only tool to date for detecting destination-based discrimination
techniques that ISPs may use.
We have evaluated these tools by application to large-scale
Internet-based services and by experiments on wide-area Internet.
WISE is actively used at Google for predicting network-level and
browser-level response time for Web search for new datacenter
deployments. We have used HIP to find causes of high-latency Web
search transactions in Google, and identified many cases where
high-latency transactions can be significantly mitigated with simple
infrastructure changes. We have evaluated NANO using experiments on
wide-area Internet and also made the tool publicly available to
recruit users and deploy NANO at a global scale.
26
Eoff, Brian David. "Using genetic programming to quantify the effectiveness of similar user cluster history as a personalized search metric." Auburn, Ala., 2005. http://repo.lib.auburn.edu/Send%2012-16-07/EOFF_BRIAN_7.pdf.
Full text
27
Rammal, Darine. "Memory safety for synchronous reactive programming." Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1002.
Full textAbstract:
Les langages réactifs synchrones constituent un excellent choix pour la programmation de l'IoT en raison de leur sémantique claire pour l'interaction entre le système et l'environnement. Cependant, en ce qui concerne les systèmes critiques en termes de sécurité ou contraints en ressources, des propositions récentes telles que Fairthreads ou ReactiveML font face à un problème bien connu. La gestion manuelle de la mémoire de Fairthreads peut entraîner des erreurs, tandis que la collecte des déchets de ReactiveML assure la sécurité de la mémoire mais introduit une surcharge d'exécution. Cette thèse vise à résoudre le problème de la sécurité de la mémoire en développant un langage de programmation réactif spécifiquement conçu pour les systèmes en temps réel, intégrant des threads coopératifs et une exécution synchrone. En nous appuyant sur le solide système de types du langage de programmation Rust, nous proposons un système de types similaire à Rust pour un langage de programmation réactif de noyau appelé MSSL. MSSL offre un modèle de threads coopératifs et facilite le partage de données mutables entre les threads tout en préservant la sécurité des types et des emprunts. Pour y parvenir, nous introduisons une nouvelle abstraction appelée Trc (Thread Reference Counting), qui combine la sécurité de propriété des références de Rust avec le mécanisme de comptage de références des pointeurs intelligents de Rust. Nous présentons ensuite la sémantique et le système de types de MSSL pour démontrer ses capacités à maintenir la sécurité des types, la sécurité des emprunts et la sécurité de la concurrence. De plus, nous étendons MSSL en introduisant des extensions réactives, en intégrant le concept de signaux qui offrent des moyens de communication puissants, flexibles et fiables. Enfin, nous fournissons une implémentation en Java de l'ensemble complet de MSSL, en basant sur la sémantique et les règles de typage de son système de typesSynchronous Reactive Languages are an excellent choice for IoT programming due to their clear system-environment interaction semantics. However, when it comes to safety- critial or resource-constrained systems, recent proposals like Fairthreads or ReactiveML face a well-known issue. Fairthreads' manual memory management can lead to errors, while ReactiveML's garbage collection ensures memory safety but introduces execution overhead. This thesis aims to address the memory safety issue by developing a reactive programming language specifically designed for real-time systems, incorporating cooperative threads and synchronous execution. Drawing from the robust type system of the Rust programming language, we propose a Rust-like type system for a kernel reactive programming language named MSSL. MSSL features a cooperative threading model and facilitates mutable data sharing between threads while preserving type and borrowing safety. To achieve this, we introduce a novel abstraction called Trc (Thread Reference Counting), which combines the ownership safety of Rust references with the reference counting mechanism of Rust smart pointers. Then, we present the semantics and type system of MSSL to demonstrate its capabilities in maintaining type safety, borrowing safety, and concurrency safety. Furthermore, we extend MSSL by introducing reactive extensions, incorporating the concept of signals that offer powerful, flexible, and reliable means of communication. Finally, we provide a Java implementation of the complete MSSL set, based on the semantic and typing rules of its type system
28
MONGE, ROFFARELLO ALBERTO. "End-User Development in the Internet of Things." Doctoral thesis, Politecnico di Torino, 2020. http://hdl.handle.net/11583/2847152.
Full text
29
Bui, Vinh Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. "A framework for improving internet end-to-end performance and availability using multi-path overlay networks." Awarded by:University of New South Wales - Australian Defence Force Academy, 2008. http://handle.unsw.edu.au/1959.4/39735.
Full textAbstract:
Application-layer overlay networks have recently emerged as a promising platform to deploy additional services over the Internet. A virtual network of overlay nodes can be used to regulate traffic flows of an underlay network, without modifying the underlay network infrastructure. As a result, an opportunity to redeem the inefficiency of IP routing and to improve end-to-end performance of the Internet has arisen, by routing traffic over multiple overlay paths. However, to achieve high end-to-end performance over the Internet by means of overlay networks, a number of challenging issues, including limited knowledge of the underlay network characteristics, fluctuations of overlay path performance, and interactions between overlay and the underlay traffic must be addressed. This thesis provides solutions to some of these issues, by proposing a framework to construct a multi-path overlay architecture for improving Internet end-to-end performance and availability. The framework is formed by posing a series of questions, including i) how to model and forecast overlay path performance characteristics; ii) how to route traffic optimally over multiple overlay paths; and iii) how to place overlay nodes to maximally leverage the Internet resource redundancy, while minimizing the deployment cost. To answer those research questions, analytical and experimental studies have been conducted. As a result, i) a loss model and a hybrid forecasting technique are proposed to capture, and subsequently predict end-to-end loss/delay behaviors; with this predictive capability, overlay agents can, for example, select overlay paths that potentially offer good performance and reliability; ii) to take full advantage of the predictive capability and the availability of multiple paths, a Markov Decision Process based multi-path traffic controller is developed, which can route traffic simultaneously over multiple overlay paths to optimize some performance measures, e.g. average loss rate and latency. As there can be multiple overlay controllers, competing for common resources by making selfish decisions, which could jeopardize performance of the networks, game theory is applied here to turn the competition into cooperation; as a consequence, the network performance is improved; iii) furthermore, to facilitate the deployment of the multi-path overlay architecture, a multi-objective genetic-based algorithm is introduced to place overlay nodes to attain a high level of overlay path diversity, while minimizing the number of overlay nodes to be deployed, and thus reducing the deployment cost. The findings of this thesis indicate that the use of multiple overlay paths can substantially improve end-to-end performance. They uncover the potential of multi-path application-layer overlay networks as an architecture for achieving high end-to-end performance and availability over the Internet.
30
Rönnqvist, Patrik. "Surveillance Applications : Image Recognition on the Internet of Things." Thesis, Mittuniversitetet, Institutionen för informationsteknologi och medier, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-18557.
Full textAbstract:
This is a B.Sc. thesis within the Computer Science programme at the Mid Sweden University. The purpose of this project has been to investigate the possibility of using image based surveillance in smart applications on the Internet-of-Things. The goals involved investigating relevant technologies and designing, implementing and evaluating an application that can perform image recognition. A number of image recognition techniques have been investigated and the use of color histograms has been chosen for its simplicity and low resource requirement. The main source of study material has been the Internet. The solution has been developed in the Java programming language, for use on the Android operating system and using the MediaSense platform for communication. It consists of a camera application that produces image data and a monitor application that performs image recognition and handles user interaction. To evaluate the solution a number of tests have been performed and its pros and cons have been identified. The results show that the solution can differentiate between simple colored stick figures in a controlled environment. Variables such as lighting and the background are significant. The application can reliably send images from the camera to the monitor at a rate of one image every four seconds. The possibility of using streaming video instead of images has been investigated but found to be difficult under the given circumstances. It has been concluded that while the solution cannot differentiate between actual people it has shown that image based surveillance is possible on the IoT and the goals of this project have been satisfied. The results were expected and hold little newsworthiness. Suggested future work involves improvements to the MediaSense platform and infrastructure for processing and storing data.MediaSense
31
Hladiš, Petr. "Platforma pro tvorbu elektronického obchodu." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-264829.
Full textAbstract:
The work describes possibilities, which the electronic store can offer its customers and due to which it is possible to gain a competitive advantage over other stores. Aside from the description of the functioning of the store itself, there are also described the possibilities of the store´s promotion and marketing on the Internet and basic programming techniques, that should be used for the programming of the store.
32
Samson, Rodelyn Reyes. "A multi-agent architecture for internet distributed computing system." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2408.
Full textAbstract:
This thesis presents the developed taxonomy of the agent-based distributed computing systems. Based on this taxonomy, a design, implementation, analysis and distribution protocol of a multi-agent architecture for internet-based distributed computing system was developed. A prototype of the designed architecture was implemented on Spider III using the IBM Aglets software development kit (ASDK 2.0) and the language Java.
33
Rodrigues, Fernando de Assis. "Coleta de dados em redes sociais : privacidade de dados pessoais no acesso via Application Programming Interface /." Marília, 2017. http://hdl.handle.net/11449/149768.
Full textAbstract:
Orientador: Ricardo Cesar Gonçalves Sant'AnaBanca: Silvana Aparecida Borsetti Gregório Vidotti
Banca: Guilherme Ataíde Dias
Banca: Ana Alice Baptista Rodrigues
Banca: José Vicente Rodríguez Muñoz
Resumo: O desenvolvimento das redes sociais é tema de estudos de várias áreas do conhecimento, e com o aumento do uso da Internet em atividades profissionais e de entretenimento, surgiram as redes sociais online: serviços com o intuito de proporcionar uma interface de relacionamento entre indivíduos. Algumas destas redes possuem milhões de usuários, que consentiram acordo aos Termos de Uso. Os Termos de Uso destes serviços contém a delimitação dos processos de coleta de dados por agentes externos, criando um efeito em cascata de identificação do usuário, e pode potencializar atividades prejudiciais à privacidade. O estudo procura verificar se processos sistematizados de coleta de dados sobre documentos que contém características das interfaces de coleta das Application Programming Interfaces (APIs), e os Termos de Uso podem auxiliar a identificação de atividades potencialmente prejudiciais à privacidade dos usuários (referenciados) e revelar pré-requisitos de conhecimentos sobre as tecnologias envolvidas neste processo, conceitos prévios à identificação das características, e áreas profissionais envolvidas no entendimento das informações sobre tecnologias voltadas às APIs e condições dos Termos de Uso. O objetivo é propor um modelo de dados orientado a análise sobre questões de privacidade de dados pessoais, a partir da identificação das características da coleta de dados de referenciados via API, para auxiliar na identificação de potenciais ações e atividades prejudiciais à privacid... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The development of social networks is a topic of study for several areas, and with the increased use of the Internet in professional and leisure activities, online social networks have emerged: services with the goal of providing an interface between individuals. Some of these networks have millions of users, who agree and give their consente to the Terms of Use. The Terms of Use of these services contain the delimitation of the processes of data collection by external agents, creating a cascading effect of user identification and can enhance activities which are detrimental to user privacy. This study looks to verify if the systematic data collection processes for documents which contain characteristics of the Application Programming Interfaces (APIs) data collection and the Terms of Use can help in identifying activities potentially harmful to user privacy (referenced) and reveal prerequisites of knowledge about the technology involved in this process, concepts prior to identifying characteristics and professional areas involved in understanding the technology of the API and the Terms of Use. The objective is to propose an analysis based data model on personal privacy data issues, from the identification of the characteristics of the collection of data from the referenced API to assisting in identifying potential actions and activities which are detrimental to privacy obtained through the data collection process. The research universe is limited to the services available on the Internet that use APIs as interoperability interfaces of their content and the sample was defined in three APIs: from Facebook, Twitter and LinkedIn. The methodology adopted was exploratory analysis, in qualitative form, with combined methods based on the exploitation of the technical characteristics of APIs and the reading of available documents, being segmented by the perspectives: professional ...
Doutor
34
Pavani, Sara Natsuki. "Memes inside and outside the Internet - how digital entertainment mirrors the human psyche." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14187/.
Full textAbstract:
The essay sets out to explain how the meme-sharing mechanism on the Internet is the reflection of human psyche. Starting from Richard Dawkins’ definition of meme, the analysis focuses on the search of what make Internet memes go viral, with the supporting theories of Richard Brodie about the effect of memes on human mind and Limor Shifman’s studies about memes in digital culture.
Having described the elements of adaptability, accessibility, belonging, exclusivity, nonsense, irony, cuteness, contrast, surprise, political incorrectness, and stereotype, meme genres such as image macros, videos and photoshop-edited pictures are analyzed across the spectrum of such factors. The result is subsequently compared to the ones obtained by Shifman in 2014, in order to find common elements to outline a spreading pattern.
The third and last section focus on the effects of memes on human brain, starting from Brodie’s “button pushing” theory, which refers to many mechanisms such as “repetition”, “cognitive dissonance”, and “creating value” that trigger humans’ most basic instincts. By comparing such theory with Shifman’s about memes providing freedom of expression, the suggested solution concentrate on raising awareness the real potential of memes among people and providing them the means to make memes work for a more conscious society.
35
Pineiro, Erik. "The aesthetics of code : on excellence in instrumental action." Doctoral thesis, KTH, Industrial Economics and Management, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3648.
Full textAbstract:
Software systems form an essential part of Western society,serving as tools to uphold institutions, processes andservices. It is understandable, therefore, that the mostfundamental aspects of programs are their function and utility.But they are not, however, the only things programmers areconcerned with when writing them.
On the contrary, programmers also discuss about many otheraspects of software, including the beauty of code. Theydistinguish between different programming styles and expresstheir personal preferences, often by way of admiring andvilifying other people's code. Programmers' identification withaesthetic preferences may give rise to vanity, to disagreementsso entrenched that they deserve the name of 'holy wars' and toother similar phenomena.
This thesis describes and analyses these phenomena, whichultimately originate in the human faculty to create andappreciate nuances, to become attached to them and to engage indisputes because of them - even infields as standardised ascomputer programming. Its aim is to expose the aesthetics ofcode, and in doing so, to discuss the symbolic aspects ofinstrumental action at large.
Keywords:aesthetics, code, instrumental action,internet discussion fora, programming, symbolic action
36
Boersma, Daniel J., and Willie R. Goldschmidt. "An optimization of The Basic School military occupational skill assignment process." Thesis, Monterey, California. Naval Postgraduate School, 2003. http://hdl.handle.net/10945/982.
Full textAbstract:
Approved for public release, distribution is unlimitedThe Basic School (TBS) is the first school assignment for all Marine Officers. While assigned to TBS unrestricted ground officers compete for and are assigned a Military Occupational Skill (MOS). The process of educating the Marine Officers about the different MOSs is primarily accomplished by word of mouth at MOS Mixers (social events) and one-on-one discussions. The assignment of the MOS to the Marine Officer is based on the officer's lineal standing within his/her company. Officers are ranked lineally based on a composite score of academic and leadership grades. To ensure a quality distribution of officers into MOSs, the company is divided into thirds (Top, Middle, Bottom) and the vacancies assigned to the company are divided into thirds (Top, Middle, Bottom). Officers compete for an MOS within their assigned third. The current assignment system has remained virtually unchanged over the last thirty years. It is a mostly manually process that provides little visibility of the data, and does not utilize automated information tools for report generation of statistical information. This joint thesis team has developed a Two-Tier Client/Server Information Management System for use by the lieutenants and staff officers of The Basic School and it is called MyMOS. This system was developed using current industry standards that are compliant with those of the Department of Defense. It is the first of its kind at TBS and is designed to be employed as an operational system. MyMOS was designed with an interface that would maximize acceptance and reduce total ownership cost.
Captain, United States Marine Corps
Lieutenant Colonel, United States Marine Corps
37
Alkmim, Gustavo Prado 1986. "Mapeamento de redes virtuais em substratos de rede." [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275687.
Full textAbstract:
Orientador: Nelson Luis Saldanha da FonsecaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-21T15:43:47Z (GMT). No. of bitstreams: 1 Alkmim_GustavoPrado_M.pdf: 588888 bytes, checksum: 595d027838b31a65d91822b3b1ce04e6 (MD5) Previous issue date: 2012
Resumo: A virtualização de redes é uma tecnologia promissora para ser utilizada como base na Internet do futuro, pois permite a introdução de novas funcionalidades nos elementos da rede a baixo custo. Uma das questões em virtualização de redes é como realizar o mapeamento eficiente de redes virtuais em substratos de redes, que é um problema de mapeamento é NP-Difícil. As soluções existentes na literatura ignoram várias características essenciais para ambientes reais a fim de que o problema possa ser resolvido em um intervalo de tempo razoável. Na presente dissertação, propõem-se oito algoritmos baseados em programação linear inteira 0-1 para resolver o problema de mapeamento que consideram diversas características realistas que não são incluídas em outras modelagens existentes. Seis dos algoritmos minimizam a largura de banda alocada e dois dos algoritmos minimizam o consumo de energia no substrato. Os algoritmos aproximativos propostos são capazes de determinar o mapeamento de redes virtuais em substratos de grande porte em poucos segundos e de encontrar soluções com qualidade, o que possibilita a adoção dos mesmos em mecanismos de controle de admissão em tempo real
Abstract: Network virtualization is a promising technology to be employed in the future Internet, since it allows the introduction of new functionalities in network elements at low cost. One of the open questions in network virtualization is how to perform an efficient mapping of virtual networks in the substrate, which is NP-Hard problem. Existing solutions in the literature ignore several characteristics of real-world environments in order to solve the problem in a reasonable time frame. This paper introduces eight algorithms to solve the mapping problem that are based on 0-1 integer linear programming. One of the main contribution is the consideration of realistic assumptions to the problem that are not considered by others in the literature. Six algorithms minimize the allocated bandwidth and the two others minimize the power consumption in the substrate. The proposed approximative algorithms can map virtual networks in large substrates in few seconds and they find accurate solutions, which make them adequate to be employed in real-time admission control
Mestrado
Ciência da Computação
Mestre em Ciência da Computação
38
Lundahl, Therese. "Socialhållbarhet i webbforum : Hur påverkar deltagarna varandra genom interaktion på Internet." Thesis, Mittuniversitetet, Avdelningen för data- och systemvetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-33235.
Full textAbstract:
Trolling can affect a web forum and the social sustainability of a forum thread through an activity that leads to negative consequences for participants and participation. Trolling means posts with insults and attacks that are intended to provoke and irritate. By studying the consequences of interaction in web forums on programming, a better understanding of social sustainability is created. Social sustainability aspects concern human well-being but also basic needs for survival. A qualitative approach, inspired by netnography, provided the opportunity to interpret the contexts that arise in a forum conversation and how participation is influenced by the contributions of different participants. The approach created the basis for answering the research question: How does the interaction between participants affect social sustainability and what are the consequences of meetings in both national and international web forum for programming discussions? The analysis of data was conducted through interpretation of text and a process adapted to the netnography, which meant abstraction and comparison, control and refinement, generalization and theorizing. The results show that international forum threads, with English as the communication language, are less socially sustainable, than the national ones. Almost half of the forum threads in the study, 8 out of 17, can be assessed socially sustainable. Kudos trolling with interference in the interaction is recorded the most times but is only found in 3 of 17 forum threads. All forum threads that addressed school assignments were influenced by misunderstandings and a lack of understanding regarding the description of the question or answers.Trollning kan påverka ett webbforum och en forumstråds sociala hållbarhet genom en aktivitet som leder till negativa konsekvenser för deltagarna och deltagandet. Trollning innebär inlägg med förolämpningar och påhopp som är avsedda att provocera och irritera. Genom undersökning av konsekvenser av interaktion i webbforum gällande programmering skapas en bättre förståelse för den sociala hållbarheten. Sociala hållbarhetsaspekter berör mänskligt välbefinnande, men även grundläggande behov för överlevnad. En kvalitativ ansats, inspirerad av netnografi, gav möjligheter att tolka de sammanhang som uppstår i en forumskonversation, och hur deltagandet påverkas av olika deltagares inlägg. Ansatsen skapade grunder för att besvara forskningsfrågan: Hur påverkar interaktionen mellan deltagare den sociala hållbarheten, och vilka är konsekvenserna av möten i, både nationella och internationella, webbforum för programmeringsdiskussioner? Analysen av data genomfördes genom tolkning av text, och en process anpassad till netnografin som innebar abstraktion och komparation, kontroll och förfining, generalisering samt teoretiserande. Resultatet visar att internationella forumstrådar, med engelska som kommunikationsspråk, är mindre socialt hållbara än de nationella. Nästan hälften av forumstrådarna i studien, 8 av 17, kan bedömas socialt hållbara. Kudostrollning med störning i interaktionen registreras flest gånger, men återfinns endas i 3 av 17 forumstrådar. Alla forumstrådar som behandlade skoluppgifter påverkades av missförstånd, och en oförståelse rörande beskrivning av frågan eller svaren.
39
Wu, Huaigu 1975. "Adaptable stateful application server replication." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=115903.
Full textAbstract:
In recent years, multi-tier architectures have become the standard computing environment for web- and enterprise applications. The application server tier is often the heart of the system embedding the business logic. Adaptability, in particular the capability to adjust to the load submitted to the system and to handle the failure of individual components, are of outmost importance in order to provide 7/24 access and high performance. Replication is a common means to achieve these reliability and scalability requirements. With replication, the application server tier consists of several server replicas. Thus, if one replica fails, others can take over. Furthermore, the load can be distributed across the available replicas. Although many replication solutions have been proposed so far, most of them have been either developed for fault-tolerance or for scalability. Furthermore, only few have considered that the application server tier is only one tier in a multi-tier architecture, that this tier maintains state, and that execution in this environment can follow complex patterns. Thus, existing solutions often do not provide correctness beyond some basic application scenarios.In this thesis we tackle the issue of replication of the application server tier from ground off and develop a unified solution that provides both fault-tolerance and scalability. We first describe a set of execution patterns that describe how requests are typically executed in multi-tier architectures. They consider the flow of execution across client tier, application server tier, and database tier. In particular, the execution patterns describe how requests are associated with transactions, the fundamental execution units at application server and database tiers. Having these execution patterns in mind, we provide a formal definition of what it means to provide a correct execution across all tiers, even in case failures occur and the application server tier is replicated. Informally, a replicated system is correct if it behaves exactly as a non-replicated that never fails. From there, we propose a set of replication algorithms for fault-tolerance that provide correctness for the execution patterns that we have identified The main principle is to let a primary AS replica to execute all client requests, and to propagate any state changes performed by a transaction to backup replicas at transaction commit time. The challenges occur as requests can be associated in different ways with transactions. Then, we extend our fault-tolerance solution and develop a unified solution that provides both fault-tolerance and load-balancing. In this extended solution, each application server replica is able to execute client requests as a primary and at the same time serves as backup for other replicas. The framework provides a transparent, truly distributed and lightweight load distribution mechanism which takes advantage of the fault-tolerance infrastructure. Our replication tool is implemented as a plug-in of JBoss application server and the performance is carefully evaluated, comparing with JBoss' own replication solutions. The evaluation shows that our protocols have very good performance and compare favorably with existing solutions.
40
Han, Kwon Soo. "Surveygen: A web-based survey editor." CSUSB ScholarWorks, 1998. https://scholarworks.lib.csusb.edu/etd-project/1786.
Full text
41
Bentabol, Muñoz Emilio, Ibáñez Carlos Bosque, Ruiz Pedro González, de Mendoza Jose Manuel Hurtado, and Zúñiga Enrique Ruiz. "Linking Wise-ShopFloor to an ABB IRB-140 Robot : Remote control, monitoring, and programming of an ABB robot IRC 5 through the internet." Thesis, Högskolan i Skövde, Institutionen för ingenjörsvetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-13933.
Full textAbstract:
The aim of this project is integrate the new robot IRB140 from ABB inside the application Wise ShopFloor (Web-based integrated sensor-driven e-ShopFloor) and the integration of a web camera inside the application as well. In order to integrate the ABB IRB140 inside the application, a Java 3D model has to be created, the kinematics and collision constrains have to be defined also and the GUI application modified to fit the virtual model and the camera inside the application. The user has to be able to jog the web camera and zoom it. Changes in the server side have been done in order to introduce new functionalities such as the sessions management, the communication mechanism now is more general using Java inheritance.Wise-ShopFloor
42
Vidal, Colin. "Programmation web réactive." Thesis, Université Côte d'Azur (ComUE), 2018. http://www.theses.fr/2018AZUR4049/document.
Full textAbstract:
Le web est une plate-forme universelle pour développer des applications riches en interactions avec les utilisateurs et des services distants. Ces interactions sont implémentées sous forme d’évènements asynchrones pouvant survenir à n’importe quel instant de l’exécution de l’application. JavaScript, le langage du web, gère les évènements asynchrones de façon peu abstraite, ce qui rend l’écriture, la vérification et la maintenance d’applications interactives difficile. La contribution de cette thèse est l’élaboration et l’implémentation du langage Hiphop.js qui dote JavaScript d’abstractions de plus haut niveau pour gérer les évènements asynchrones. Hiphop.js est une implémentation JavaScript de constructions temporelles du langage réactif synchrone Esterel. Grâce à ces constructions, le flot de contrôle d’une application Hiphop.js est explicite. Il est donc possible de savoir précisément quand et sous quelles conditions un évènement est traité par simple lecture du code source de l’application. Ceci facilite la vérification et la maintenance de l’application. L’intégration profonde du langage Hiphop.js avec l’environnement dynamique du web est une part importante des travaux entrepris dans cette thèse. Les programmes sont construits et compilés pendant l’exécution de l’application JavaScript ce qui permet d’adapter automatiquement le traitement des évènements asynchrones en fonction des changements de l’environnement au cours de l’exécution (par exemple, la connexion ou déconnexion de participants pendant une visioconférence)The web is an universal platform used to develop applications interacting with users and remote services. These interactions are implemented as asynchronous events that can be fired anytime. JavaScript, the mainstream language of the web, handles asynchronous events using low-level abstractions that makes it difficult to write, verify, and maintain interactive applications. We have addressed this problem by designing and implementing a new domain specific language called Hiphop.js. It offers an alternative to JavaScript event handling mechanism by reusing temporal constructions coming from the synchronous programming language Esterel. These constructions make the control flow of the program explicit and deterministic. Hiphop.js is embedded in JavaScript and suits the traditional dynamic programming style of the Web. It is tighly coupled to JavaScript with which it can exchange values and access any data structures. It can also support dynamic modifications of existing programs needed to support on-demand download on the Web. It can run on both end of Web applications, namely on servers and on clients. In this thesis, we present Hiphop.js, its design and implementation. We overview its programming environment and we present the prototypical web applications we have implemented to validate the approach
43
Shah, Vijay Pravin. "An advanced signal processing toolkit for Java applications." Master's thesis, Mississippi State : Mississippi State University, 2002. http://library.msstate.edu/etd/show.asp?etd=etd-11102002-141018.
Full text
44
Maluleke, Enock Vongani. "Satellite-based web server." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/53040.
Full textAbstract:
Thesis (MScEng)--Stellenbosch University, 2002.ENGLISH ABSTRACT: There is a large variety of telemetry recervmg software currently available for the reception of telemetry information from different satellites. Most of the software used in receiving telemetry data is satellite specific. Hence, a user-friendly way is needed to make telemetry data easily accessible. A satellite-based web server is aimed at providing telemetry information to any standard web browser as a way of bringing space technology awareness to the people. Two different satellite-based web server methods are examined in this thesis. Based on the evaluation, the on-board File server with proxy server was proposed for satellite-based web server development. This requires that the File server be ported to the on-board computer of the satellite. The web proxy server is placed on the ground segment with the necessary communication requirements to communicate with the on-board File server. In the absence of satellite, the satellite-based web server was successfully implemented on two computers, laying a good foundation for implementation on the on-board computer of the satellite (OBe).
AFRIKAANSE OPSOMMING: Daar is 'n groot verskeidenheid telemetrie ontvangs sagteware huidiglik beskikbaar vir die ontvangs van telemetrie informasie vanaf verskillende satelliete. Die meeste van die sagteware wat gebruik word om telemetrie data te ontvang is satelliet spesifiek. Gevolglik, 'n gebruikers vriendelike metode is nodig om telemetrie data maklik beskikbaar te maak. 'n Satelliet-gebaseerde web-bediener word beoog om telemetrie informasie te verskaf aan enige standaard web-blaaier as 'n metode om mense bewus te maak van ruimte tegnologie. Twee verskillende satelliet gebaseerde web-bediener metodes salondersoek word in hierdie tesis. Gebaseer op 'n evaluering, word die aanboord leêr-bediener met instaanbediener voorgestel vir satelliet-gebaseerde webbediener ontwikkeling. Hiervoor is dit nodig dat die leêr-bediener na die aanboord rekenaar van die satelliet gepoort word. Die web instaanbediener word op die grond segment geplaas met die nodige kommunikasie benodighede, om te kommunikeer met die aanboord leêr-bediener. In die afwesigheid van die satelliet was die satellietgebaseerde web-bediener met sukses geïmplementeer op twee rekenaars, met die gevolg dat 'n goeie fondasie gelê is vir die implementering op die aanboord rekenaar van die satelliet (OBC).
45
Quiñones, Cesar. "Implementation business-to-consumer electronic commerce website using asp.net web programming framework." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2948.
Full textAbstract:
The purpose of this project is to demonstrate an integration of real world, real time e-commerce with the knowledge and experience gained in participating in the Masters of Business Administration -- Information Management program at California State University, San Bernardino. It is this knowledge and experience that is used to create a Business-To-Consumer (B2C) electronic commerce application (ECA) using available Internet and information management technology. This project presents all aspects of the simulation beginning with the background research of the canine services and supplies industry and ending with an e-commerce simulation and post implementation audit.
46
Kidoň, Marek. "Evoluční návrh hašovacích funkcí." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255344.
Full textAbstract:
Hash tables are fast associative array implementations which became part of modern world of information technology and thanks to its simplicity became very popular among computer programmers. The choice of proper hash function is very important. Improperly selected hash function can result in poor hash table performance and its application. Currently there are many exceptional implementations of general hash functions. Such functions are not constrained to a concrete set of inputs, they perform on any input. On the other hand if we know the input domain we can design a specific hash function for desired application thus reaching better levels of performance compare to a general hash function. However hash function design is not trivial. There are no rules, standards, guides nor automated tools that would help us with such a task. In case of manual design the hash function author has to rely on his/her knowledge, experience, inventiveness and intuition. In case of such complicated tasks there is sometimes advantageous to choose a different path and use techniques such as evolution algorithms. Natural computing is an approach of certain problem solutions that are inspired by the process of species reproduction as defined by Charles Darwin. In this thesis we will design hash functions for the domain of IP addresses, that serve as an unique network device interface identifier in internet protocol networks. The chosen subset of natural computing is the genetic programming, a very specific technique that is an adequate approach to our problem thanks to its properties. Evolutionary designed hash functions offer good properties. They outperform state-of-the-art generic, human-created hash functions in terms of speed and collision resistance.
47
Johnson, Jeremy Charles. "Designing an electron learning Website using ASP." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2528.
Full textAbstract:
The primary purpose of this project is to develop an online forum to facilitate communication among educators, parents, and students resulting in an open environment for more informed decisions by all those involved in the educational process. The second purpose is the personal development of an electronic learning application using online tools needed for an effective online learning environment that will cost the school district little or nothing.
48
Xie, Liquan. "Dynamic Report Generator." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2547.
Full textAbstract:
This project describes DRG (Dynamic Report Generator). This program can be used on the internet to summarize the content of a database based on user criteria. DRG allows the user to choose a database, input the data, and generate a report based on user input, and print out the results in a new format. This paper describes the design and analysis of the DRG program.
49
Рещенко, Євген Юрійович. "Система підтримки життєдіяльності рослин у теплиці." Master's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/40917.
Full textAbstract:
Магістерська дисертація на здобуття ступеня магістру на тему “ Система підтримки життєдіяльності рослин у теплиці ”: 101с., 23 рис., 26 табл., 8 додатки, 21 джерел.
Об'єкт дослідження – автоматизація процесу зрощення рослин.
Мета роботи – розробка системи, що забезпечить можливість покращеного зрощення рослин шляхом підтримки ідеальних параметрів середовища з мінімальним втручанням людини.
У магістерській дисертації розглянуто проблему автоматизації зрощення рослин. Отримано перелік параметрів, зміну та підтримку яких система має автоматизувати. Отримано уяву про взаємодію елементів системи з можливими елементами, зображеними у додатку Д. Також спроектовано діаграму прецедентів, зображену у додатку Ж.
Визначено основні елементи органів системи. Побудована структура на основі якої побудовано функціональну схему. Описано взаємодію кожного елемента для кожного органу системи, їх призначення, методи взаємодії.
Створено алгоритм, за яким система має змінювати параметри суміші. На основі структурної, функціональної схеми, алгоритму та технічного завдання спроектовано програмне забезпечення для мікроконтролера. Розроблено механізм зберігання сценаріїв. Створено «захоплюючий портал» для первинного підключення пристрою до мережі Інтернет. Отримано програмне забезпечення готове до завантаження у МК.
Отримано робочу систему. Отримано результати роботи системи, що задовольняють потреби. Система підтримує параметри кислотності у границях «задана – 0.5 од» < задана < «задана + 0.5 од», що є допустимим для проходження росту рослини, подає потрібні кількості добрив та кількість чистої води.
Проведено аналіз ринку та розробка стратегії запуску стартап-проєтку. враховано всі ризики, маркетингові стратегії та ключові переваги концепції потенційного продукту, побудовано бізнес-план подальшого розвитку системи.Master's thesis for master's degree on the topic " Plant’s life support system in greenhouse": 101p, 23 figures, 26 tables, 8 annexes, 21 sources. Object of study – plant’s grow process automation. The purpose of the work – develop plant automation system to obtain better growing experience by maintaining ideal plant’s environment parameters. Also the goal is to free user from maintaining this parameters manually. In the master's thesis the problem of automation of plant growing is considered. The list of changing parameters which the system should automate is determined. An idea of the interaction of the elements of the system with the possible elements determined. The diagram of precedents is also designed. Identified the main elements of the system. The interaction of each element for each unit of the system, their purpose, methods of interaction are described. An algorithm has been created according to which the system must change the parameters of the mixture. Based on the structural, functional scheme, algorithm and technical task, the software for the microcontroller is designed. A mechanism for storing scripts has been developed. A "captive portal" has been created for the initial connection of the device to the Internet. Got working system able to be tested. The results of the system operation that meet the needs are obtained. The system maintains the acidity parameters within the limits: “set – 0.5 units" < set < "set + 0.5 units", which is acceptable for the growth of the plant, provides the required amount of fertilizers and the amount of clean water. The market analysis and development of the strategy of launching a startup project are carried out. All risks, marketing strategies and key advantages of the potential product concept are taken into account, a business plan for further development of the system is built.
50
Masilela, Mbonisi. "Supporting Data-Intensive Wireless Sensor Applications using Smart Data Fragmentation and Buffer Management." VCU Scholars Compass, 2007. http://scholarscompass.vcu.edu/etd/779.
Full textAbstract:
Recent advances in low power device technology have led to the development of smaller powerful sensors geared for use in Wireless Sensor Networks. Some of these sensors are capable of producing large data packets in a single reading. This becomes a challenging problem given the constraints imposed by current MAC and Transport Layer implementations since a single data packet can exceed the MTU of the protocol stack. Little has been done in the way of addressing this issue in Wireless Sensor Networks. This paper proposes a novel solution to this issue. Proposed is a Lightweight Data Transportation Protocol that uses smart data fragmentation and efficient pipelined transmission and buffer management schemes to solve this problem. The methodology outlined in this paper ensures that data is successfully transmitted from source to destination with minimal delay or packet loss.