A Dataset for Evaluating Intrusion Detection Systems in IEEE 802.11 Wireless Networks

Internet access by wireless networks has grown considerably in recent years. However, these networks are vulnerable to security problems, especially those related to denial of service attacks. Intrusion Detection Systems(IDS)are widely used to improve network security, but comparison among the several existing approaches is not a trivial task. This paper proposes building a datasetfor evaluating IDS in wireless environments. The data were captured in a real, operating network. We conducted tests using traditional IDS and achieved great results, which showed the effectiveness of our proposed approach.

Sistema de recomendação de produtos online baseado em palavras-chave

This project aims to explore the many methods used for the development of recommendation systems to user ’ s items and apply the content - based recommendation method on a prototype system whose purpose is to recommend books to users. This paper exposes the most popular methods for creating systems capable of providing items (products) according to user preferences, such as collaborat ive filtering and content - based. It also point different techniques that can be applied to calculate the similarity between two entities, for items or users, as the Pearson ’s method, calculating the cosine of vectors and more recently, a proposal to use a Bayesian system under a Dirichlet distribution. In addition, this work has the purpose to go through various points on the design of an online application, or a website, dealing not only oriented algorithms issues, but also the definition of development to ols and techniques to improve the user’s experience. The tools used for the development of the page are listed, and a topic about web design is also discussed in order to emphasize the importance of the layout of the application. At the end, some examples of recommender systems are presented for curiosity , learning and research purposes

An evolutionary approach to improve connectivity prediction in mobile wireless sensor networks

Connectivity is the basic factor for the proper operation of any wireless network. In a mobile wireless sensor network it is a challenge for applications and protocols to deal with connectivity problems, as links might get up and down frequently. In these scenarios, having knowledge of the node remaining connectivity time could both improve the performance of the protocols (e.g. handoff mechanisms) and save possible scarce nodes resources (CPU, bandwidth, and energy) by preventing unfruitful transmissions. The current paper provides a solution called Genetic Machine Learning Algorithm (GMLA) to forecast the remainder connectivity time in mobile environments. It consists in combining Classifier Systems with a Markov chain model of the RF link quality. The main advantage of using an evolutionary approach is that the Markov model parameters can be discovered on-the-fly, making it possible to cope with unknown environments and mobility patterns. Simulation results show that the proposal is a very suitable solution, as it overcomes the performance obtained by similar approaches.

Avaliação de um curso sobre internet para terceira idade

The aim of this study was to evaluate the learning of Senior Citizens after a face-to-face course with the goal of teaching them how to use the internet. The study population was composed of people (n=18), of both genders, aged 50 years or over, from the open university for Senior Citizens UNATI (“Universidade Aberta da Terceira Idade” in Portuguese) at Araraquara. Two hour classes weekly were taught in the computer laboratory - LDI in Portuguese located in the School of Dentistry in Araraquara. The course program content covered the use of e-mail and researches in sites. In order to evaluate the learning acquired, a self-evaluation questionnaire was applied in twice (before and after the course), which enabled the development of students concerning their knowledge and skill in the topics approached in classes. Descriptive statistical analysis was performed. The average performance of participants was calculated per point and interval of confidence of 95% (IC95%) in the beginning and in the end of the course. Comparison between the averages was performed by using the paired Student’s-t test. The level of significance adopted was 5%. It was observed that the students’ learning about computer use improved significantly after the course (Student’s-t test: -5.360, p<0.001, p2=0.628, =0,999), however, 72.2% of them reported that they did not know how to attach a file to a message to be sent by e-mail, as well as having no or little skill to perform this activity. It was concluded that the evaluated course improved the participants knowledge and skills in computer use.

The application of neural networks to the analysis of dissolved gases in insulating oil used in transformers

The state of insulating oils used in transformers is determined through the accomplishment of physical-chemical tests, which determine the state of the oil, as well as the chromatography test, which determines possible faults in the equipment. This article concentrate on determining, from a new methodology, a relationship among the variation of the indices obtained from the physical-chemical tests with those indices supplied by the chromatography tests.The determination of the relationship among the tests is accomplished through the application of neural networks. From the data obtained by physical-chemical tests, the network is capable to determine the relationship among the concentration of the main gases present in a certain sample, which were detected by the chromatography tests.More specifically, the proposed approach uses neural networks of perceptron type constituted of multiple layers. After the process of network training, it is possible to determine the existent relationship between the physical-chemical tests and the amount of gases present in the insulating oil.

Redes sociais na Internet: uma investigação sobre práticas de compartilhamento de arquivos no Facebook

The social networking sites have experienced a large and rapid growth in recent years and bring together millions of users in Brazil and worldwide. Such networks allow adding groups of people with common interests or relationships, enabling members of this group to communicate and exchange information. Some social networks have specific goals, for example, aggregate individuals with common interests and professional relationships. However, they all share information in some way, whether in the form of short texts, photos, videos, among others. Sharing information in files is also a growing activity on the Internet and can be done in various ways, from sending files via email to multiple contacts to make available areas shared by the same contacts. However, applications are not yet available to enable file sharing on Facebook, considered the premier social network today. Given the growing demand for sharing files over the Internet, and a large number of users familiar with the use of these integrated applications for Facebook there is a demand for applications that allow users to share files with their contacts in this social network. This study aims to investigate how users use Facebook, and their practices for file sharing. It is believed that the results will substantiate future projects to develop software for file sharing on Facebook. Due to the exploratory nature of this research, the choice was made for a survey to collect data, applied through the web. From the results obtained, was possible to observe a frequent use of file sharing, but no interest in paid services. Regarding Facebook, was possible to observe their extensive use in both the frequency of access as the hours spent, as well as an increased use of applications (games, quiz, etc.). The full set of results shows a favorable environment for developing applications for sharing files on Facebook.

PROFIX: método de avaliação on-line da proficiência digital

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Feminismo na internet: o caso do coletivo marcha das vadias e sua página no facebook

This article analyzes how the Brazilian feminist movements utilize online social networks to expand their sphere of action and mobilization in society through understanding how is the activity of the collective Marcha das Vadias of Rio de Janeiro on your Facebook page and as this group is mobilized in the online environment to organize its annual march, here, specifically the 4th Marcha das Vadias of Rio de Janeiro. Through exploratory, descriptive and analytical qualitative research methodology and analysis of social networks on the Internet, it is concluded that the network generated by the topic "4th Marcha das Vadias of Rio de Janeiro" was central dynamic between a public clear feminist, but weak and little to comprehensive dialogue with society in general positions.

Envelhecimento e novas tecnologias: a inclusão digital e tecnológica na preparação para a aposentadoria e sua influência na qualidade de vida

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Multidomain Optical Networks: Issues and Challenges

Today, many leading organizations are undertaking extensive research on a very broad range of new and evolving optical networking technologies. These efforts carry particular significance, especially in light of the “postbubble” dynamics of the optical networking market and have led to the investigation of various cost-efficient optical technologies. Today’s telecom carriers operate several independent optical domains based on diverse technologies, control solutions, standards, and protocols, making interdomain and intercarrier interworking extremely difficult. Standardized interworking across diverse multigranularity network interfaces, and interoperability across disparate vendor equipments and carrier domains are crucial to provisioning end-to-end services and achieving cost-efficient network operation. Needless to say, having an interoperable and standard control plane across multidomain optical networks can benefit carriers through the availability of a wide selection of network elements, platforms, and multiple vendor solutions resulting in faster deployment and reduced CAPEX and OPEX charges.

Survivable Lightpath Provisioning in WDM Mesh Networks Under Shared Path Protection and Signal Quality Constraints

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the present paper, resource-efficient provisioning solutions are achieved with the objective of maximizing resource sharing. The authors propose a resource-sharing scheme that supports three kinds of resource-sharing scenarios, including a conventional wavelength-link sharing scenario, which shares wavelength links between protection lightpaths, and two new scenarios, which share O/E/O modules between protection lightpaths and between working and protection lightpaths. An integer linear programming (ILP)-based solution approach is used to find optimal solutions. The authors also propose a local optimization heuristic approach and a tabu search heuristic approach to solve this problem for real-world, large mesh networks. Numerical results show that our solution approaches work well under a variety of network settings and achieves a high level of resource-sharing rates (over 60% for O/E/O modules and over 30% for wavelength links), which translate into great savings in network costs.

Elimination of All-Optical Cycles in Wavelength-Routed Optical Networks

A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended alloptical cycles in the network (viz., a loop with no terminating electronics in it). If such a cycle contains amplifiers [e.g., Erbium- Doped Fiber Amplifiers (EDFA’s)], there exists the possibility that the net loop gain is greater than the net loop loss. The amplified spontaneous emission (ASE) noise from amplifiers can build up in such a feedback loop to saturate the amplifiers and result in oscillations of the ASE noise in the loop. Such all-optical cycles as defined above (and hereafter referred to as “white” cycles) must be eliminated from an optical network in order for the network to perform any useful operation. Furthermore, for the realistic case in which the wavelength cross-connects result in signal crosstalk, there is a possibility of having closed cycles with oscillating crosstalk signals. We examine algorithms that set up new transparent optical connections upon request while avoiding the creation of such cycles in the network. These algorithms attempt to find a route for a connection and then (in a post-processing fashion) configure switches such that white cycles that might get created would automatically get eliminated. In addition, our call-set-up algorithms can avoid the possibility of crosstalk cycles.

Optical Components for WDM Lightwave Networks

Recently, there has been growing interest in developing optical fiber networks to support the increasing bandwidth demands of multimedia applications, such as video conferencing and World Wide Web browsing. One technique for accessing the huge bandwidth available in an optical fiber is wavelength-division multiplexing (WDM). Under WDM, the optical fiber bandwidth is divided into a number of nonoverlapping wavelength bands, each of which may be accessed at peak electronic rates by an end user. By utilizing WDM in optical networks, we can achieve link capacities on the order of 50 THz. The success of WDM networks depends heavily on the available optical device technology. This paper is intended as a tutorial on some of the optical device issues in WDM networks. It discusses the basic principles of optical transmission in fiber and reviews the current state of the art in optical device technology. It introduces some of the basic components in WDM networks, discusses various implementations of these components, and provides insights into their capabilities and limitations. Then, this paper demonstrates how various optical components can be incorporated into WDM optical networks for both local and wide-area applications. Last, the paper provides a brief review of experimental WDM networks that have been implemented.

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.