XSOFT: estudo de reconhecimento, exploração e prevenção de vulnerabilidades de software através de uma distribuição LINUX

This work aims to give greater visibility to the issue of software security, due to people talk a lot in security conferences, that much of both IT (Information Technology) staff and, more specifically, IS (Information Security) staff does not know this, and, thanks to the spread of the mobile computing and of the cloud computing, this lack of deeper knowledge on this subject is increasingly becoming worrisome. It aims too, make applications to be developed in a security manner, priorizing the security of the information processed. It attempts to demonstrate the secure coding techniques, the principles of software security, the means to identify software vulnerabilities, the cutting-edge software exploitation techniques and the mechanisms of mitigation. Nowadays, the security guys are in charge of the most of the security tests in applications, audits and pentests, and it is undeniable that the so-called security experts, most often come from computer network field, having few experience in software development and programming. Therefore, the development process does not consider the security issue, thanks to the lack of knowledge on the subject by the developer, and the security tests could be improved whether security experts had a greater know-how on application development. Given this problem, the goal here is to integrate information security with software development, spreading out the process of secure software development. To achieve this, a Linux distribution with proof of concept applicati... (Complete abstract click electronic access below)

The use of software Mapavox for teaching graphics and games to blind and low vision students: a development through practices

Current policies on education to visually impaired point for a growing trend of including students with special educational needs in regular schools. However, most often this inclusion is not accompanied by an appropriate professional trained or infrastructure, which has been presented as a big problem for regular school teachers who have students with visual impairments in their classroom. Based on this situation, the Group of Extension in Tactile Cartography from UNESP - University of the State of São Paulo - Campus de Rio Claro - SP - Brazil has been developing educational material of geography and cartography to blind students at a special school. Among the materials developed in this study highlight the development of graphics and board games provided with sound capabilities through MAPAVOX, software developed in partnership with UFRJ - Federal University from Rio de Janeiro - RJ - Brazil. Through this software, sound capabilities can be inserted into built materials, giving them a multi-sensory character. In most cases the necessary conditions for building specific materials to students with visual impairments is expensive and beyond the reach of features from a regular school, so the survey sought to use easy access and low cost materials like Cork, leaf aluminum, material for fixing and others. The development of these materials was supported by preparation in laboratory and its subsequent test through practices involving blind students. The methodology used on the survey is based on qualitative research and non comparative analysis of the results. In other words, the material is built based on the special students perception and reality construction, not being mere adaptations of visual materials, but a construction focused on the reality of the visually impaired. The results proved were quite successful as the materials prepared were effective on mediating the learning process of students with disabilities. Geographical and cartographic concepts were seized by the students through the technology used, associated with the use of materials that took into account in its building process the perception of the students.

The open capacitated arc routing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Allocation of protective devices in distribution circuits using nonlinear programming models and genetic algorithms

The optimized allocation of protective devices in strategic points of the circuit improves the quality of the energy supply and the system reliability index. This paper presents a nonlinear integer programming (NLIP) model with binary variables, to deal with the problem of protective device allocation in the main feeder and all branches of an overhead distribution circuit, to improve the reliability index and to provide customers with service of high quality and reliability. The constraints considered in the problem take into account technical and economical limitations, such as coordination problems of serial protective devices, available equipment, the importance of the feeder and the circuit topology. The use of genetic algorithms (GAs) is proposed to solve this problem, using a binary representation that does (1) or does not (0) show allocation of protective devices (reclosers, sectionalizers and fuses) in predefined points of the circuit. Results are presented for a real circuit (134 busses), with the possibility of protective device allocation in 29 points. Also the ability of the algorithm in finding good solutions while improving significantly the indicators of reliability is shown. (C) 2003 Elsevier B.V. All rights reserved.

Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Open and Standardized Resources for Smart Transducer Networking

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

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Primary power distribution systems planning taking into account reliability, operation and expansion costs

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Java applets para um software educacional distribuído em eletrônica de potência

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

THE INFLUENCE of SHORT-HEATING-CYCLE INVESTMENTS on THE QUALITY of COMMERCIALLY PURE TITANIUM CASTINGS

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Some experiments with high order compact methods using a computer algebra software - Part II (non-uniform grid)

We generalize a procedure proposed by Mancera and Hunt [P.F.A. Mancera, R. Hunt, Some experiments with high order compact methods using a computer algebra software-Part 1, Appl. Math. Comput., in press, doi: 10.1016/j.amc.2005.05.015] for obtaining a compact fourth-order method to the steady 2D Navier-Stokes equations in the streamfunction formulation-vorticity using the computer algebra system Maple, which includes conformal mappings and non-uniform grids. To analyse the procedure we have solved a constricted stepped channel problem, where a fine grid is placed near the re-entrant corner by transformation of the independent variables. (c) 2006 Elsevier B.V. All rights reserved.

Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Optimization Strategies Based on Sequential Quadratic Programming Applied for a Fermentation Process for Butanol Production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)