Challenges of programming apprentice

The present article describes the challenges programming apprentices face and identifies the elements and processes that set them apart from experienced programmers. And also explains why a conventional programming languages teaching approach fails to map the programming mental model. The purpose of this discussion is to benefit from ideas and cognitive philosophies to be embedded in programming learning tools. Cognitive components are modeled as elements to be handled by the apprentices in tutoring systems while performing a programming task. In this process a mental level solution (the mental model of the program) and an implementation level solution (the program) are created. The mapping between these representations is a path followed by the student explicitly in this approach. © 2011 IEEE.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

Transmission network expansion planning considering phase-shifter transformers

This paper presents a novel mathematical model for the transmission network expansion planning problem. Main idea is to consider phase-shifter (PS) transformers as a new element of the transmission system expansion together with other traditional components such as transmission lines and conventional transformers. In this way, PS are added in order to redistribute active power flows in the system and, consequently, to diminish the total investment costs due to new transmission lines. Proposed mathematical model presents the structure of a mixed-integer nonlinear programming (MINLP) problem and is based on the standard DC model. In this paper, there is also applied a specialized genetic algorithm aimed at optimizing the allocation of candidate components in the network. Results obtained from computational simulations carried out with IEEE-24 bus system show an outstanding performance of the proposed methodology and model, indicating the technical viability of using these nonconventional devices during the planning process. Copyright © 2012 Celso T. Miasaki et al.

NCAP embedded using structured programming

This paper presents a network node embedded based on IEEE 1451 standard developed using structured programming to access the transducers in the WTIM. The NCAP was developed using Nios II processor and uClinux, a embedded operating system developed to features restricted hardware. Both hardware and software have dynamics features and they can be configured based in the application features. Based in this features, the NCAP was developed using the minimum components of hardware and software to that being implemented in remote environment like central point of data request. Many NCAP works are implemented with an object oriented structure. This is different from the surrounding implementations. In this project the NCAP was developed using structured programming. The tests of the NCAP were made using a ZigBee interface between NCAP and WTIM and the system demonstrated in areas of difficult access for long period of time due to need for low power consumption. © 2012 IEEE.

Optimal reactive power dispatch using stochastic chance-constrained programming

Deterministic Optimal Reactive Power Dispatch problem has been extensively studied, such that the demand power and the availability of shunt reactive power compensators are known and fixed. Give this background, a two-stage stochastic optimization model is first formulated under the presumption that the load demand can be modeled as specified random parameters. A second stochastic chance-constrained model is presented considering uncertainty on the demand and the equivalent availability of shunt reactive power compensators. Simulations on six-bus and 30-bus test systems are used to illustrate the validity and essential features of the proposed models. This simulations shows that the proposed models can prevent to the power system operator about of the deficit of reactive power in the power system and suggest that shunt reactive sourses must be dispatched against the unavailability of any reactive source. © 2012 IEEE.

BBA: A binary bat algorithm for feature selection

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the bats behaviour, which has never been applied to this context so far. The wrapper approach combines the power of exploration of the bats together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in five public datasets have demonstrated that the proposed approach can outperform some well-known swarm-based techniques. © 2012 IEEE.

Rheological behavior of binary aqueous solutions of poly(ethylene glycol) of 1500 g·mol-1 as affected by temperature and polymer concentration

The rheological behavior of poly(ethylene glycol) of 1500 g·mol -1(PEG1500) aqueous solutions with various polymer concentrations (w = 0.05, 0.10, 0.15, 0.20 and 0.25) was studied at different temperatures (T = 283.15, 288.15, 293.15, 298.15 and 303.15) K. The analyses were carried out considering shear rates ranging from (20 to 350) s-1, using a cone-and-plate rheometer under controlled stress and temperature. Classical rheological models (Newton, Bingham, Power Law, Casson, and Herschel-Bulkley) were tested. The Power Law model was shown suitable to mathematically represent the rheological behavior of these solutions. Well-adjusted empirical models were derived for consistency index variations in function of temperature (Arrhenius-type model; R2 > 0.96), polymer concentration (exponential model; R2 > 0.99) or the combination of both (R 2 > 0.99). Additionally, linear models were used to represent the variations of behavior index in the functions of temperature (R2 > 0.83) and concentration (R2 > 0.87). © 2013 American Chemical Society.

Multiobjective short-term planning of electric power distribution systems using NSGA-II

This paper presents a mixed integer nonlinear programming multiobjective model for short-term planning of distribution networks that considers in an integrated manner the following planning activities: allocation of capacitor banks; voltage regulators; the cable replacement of branches and feeders. The objective functions considered in the proposed model are: to minimize operational and investment costs and minimize the voltage deviations in the the network buses, subject to a set of technical and operational constraints. A multiobjective genetic algorithm based on a Non-Dominated Sorting Genetic Algorithm (NSGA-II) is proposed to solve this model. The proposed mathematical model and solution methodology is validated testing a medium voltage distribution system with 135 buses. © 2013 Brazilian Society for Automatics - SBA.

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

Irregular satellites of Jupiter: Three-dimensional study of binary-asteroid captures

Among the hidden pieces of the giant puzzle, which is our Solar system, the origins of irregularsatellites of the giant planets stand to be explained, while the origins of regular satellites arewell explained by the in situ formation model through matter accretion. Once they are notlocally formed, the most acceptable theory predicts that they had been formed elsewhere andbecame captured later, most likely during the last stage of planet formation. However, underthe restricted three-body problem theory, captures are temporary and there is still no assistedcapture mechanism which is well established. In a previous work, we showed that the capturemechanism of a binary asteroid under the co-planar four-body scenario yielded permanentcaptured objects with an orbital shape which is very similar to those of the actual progradeirregular Jovian satellites. By extending our previous study to a 3D case, here we demonstratethat the capture mechanism of a binary asteroid can produce permanent captures of objects byitself which have very similar orbits to irregular Jovian satellites. Some of the captured objectswithout aid of gas drag or other mechanisms present a triplet: semi-major axis, eccentricityand inclination, which is comparable to the already known irregular Jovian objects. © 2013 The Authors Published by Oxford University Press on behalf of the Royal Astronomical Society.

When less is better: Insights from the product mix dilemma from the Theory of Constraints perspective

Perhaps due to its origins in a production scheduling software called Optimised Production Technology (OPT), plus the idea of focusing on system constraints, many believe that the Theory of Constraints (TOC) has a vocation for optimal solutions. Those who assess TOC according to this perspective indicate that it guarantees an optimal solution only in certain circumstances. In opposition to this view and founded on a numeric example of a production mix problem, this paper shows, by means of TOC assumptions, why the TOC should not be compared to methods intended to seek optimal or the best solutions, but rather sufficiently good solutions, possible in non-deterministic environments. Moreover, we extend the range of relevant literature on product mix decision by introducing a heuristic based on the uniquely identified work that aims at achieving feasible solutions according to the TOC point of view. The heuristic proposed is tested on 100 production mix problems and the results are compared with the responses obtained with the use of Integer Linear Programming. The results show that the heuristic gives good results on average, but performance falls sharply in some situations. © 2013 Copyright Taylor and Francis Group, LLC.

Binary Bat Algorithm for Feature Selection

Feature selection aims to find the most important information to save computational efforts and data storage. We formulated this task as a combinatorial optimization problem since the exponential growth of possible solutions makes an exhaustive search infeasible. In this work, we propose a new nature-inspired feature selection technique based on bats behavior, namely, binary bat algorithm The wrapper approach combines the power of exploration of the bats together with the speed of the optimum-path forest classifier to find a better data representation. Experiments in public datasets have shown that the proposed technique can indeed improve the effectiveness of the optimum-path forest and outperform some well-known swarm-based techniques. © 2013 Copyright © 2013 Elsevier Inc. All rights reserved.

A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

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

BCS: A Binary Cuckoo Search algorithm for feature selection

Feature selection has been actively pursued in the last years, since to find the most discriminative set of features can enhance the recognition rates and also to make feature extraction faster. In this paper, the propose a new feature selection called Binary Cuckoo Search, which is based on the behavior of cuckoo birds. The experiments were carried out in the context of theft detection in power distribution systems in two datasets obtained from a Brazilian electrical power company, and have demonstrated the robustness of the proposed technique against with several others nature-inspired optimization techniques. © 2013 IEEE.

Optimizing feature selection through binary charged system search

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be inviable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the Charged System Search (CSS), which has never been applied to this context so far. The wrapper approach combines the power of exploration of CSS together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in four public datasets have demonstrated the validity of the proposed approach can outperform some well-known swarm-based techniques. © 2013 Springer-Verlag.