Conservation laws for non-potential operators

A study was developed in order to build a function M invariant in time, by means of Hamiltonian's formulation, taking into account the equation associated to the problem, showing that starting from this function the equation of motion of the system with the contour conditions for non-conservative considered problems can be obtained. The Hamiltonian method is extended for these kind of systems in order to validate for non-potential operators through variational approach.

Real, complex, and binary semantic vectors

This paper presents a combined structure for using real, complex, and binary valued vectors for semantic representation. The theory, implementation, and application of this structure are all significant. For the theory underlying quantum interaction, it is important to develop a core set of mathematical operators that describe systems of information, just as core mathematical operators in quantum mechanics are used to describe the behavior of physical systems. The system described in this paper enables us to compare more traditional quantum mechanical models (which use complex state vectors), alongside more generalized quantum models that use real and binary vectors. The implementation of such a system presents fundamental computational challenges. For large and sometimes sparse datasets, the demands on time and space are different for real, complex, and binary vectors. To accommodate these demands, the Semantic Vectors package has been carefully adapted and can now switch between different number types comparatively seamlessly. This paper describes the key abstract operations in our semantic vector models, and describes the implementations for real, complex, and binary vectors. We also discuss some of the key questions that arise in the field of quantum interaction and informatics, explaining how the wide availability of modelling options for different number fields will help to investigate some of these questions.

Dynamic robot path planning using an enhanced simulated annealing approach

Evolutionary computation is an effective tool for solving optimization problems. However, its significant computational demand has limited its real-time and on-line applications, especially in embedded systems with limited computing resources, e.g., mobile robots. Heuristic methods such as the genetic algorithm (GA) based approaches have been investigated for robot path planning in dynamic environments. However, research on the simulated annealing (SA) algorithm, another popular evolutionary computation algorithm, for dynamic path planning is still limited mainly due to its high computational demand. An enhanced SA approach, which integrates two additional mathematical operators and initial path selection heuristics into the standard SA, is developed in this work for robot path planning in dynamic environments with both static and dynamic obstacles. It improves the computing performance of the standard SA significantly while giving an optimal or near-optimal robot path solution, making its real-time and on-line applications possible. Using the classic and deterministic Dijkstra algorithm as a benchmark, comprehensive case studies are carried out to demonstrate the performance of the enhanced SA and other SA algorithms in various dynamic path planning scenarios.

Feature Selection based on Rough Sets and Particle Swarm Optimization

X. Wang, J. Yang, X. Teng, W. Xia, and R. Jensen. Feature Selection based on Rough Sets and Particle Swarm Optimization. Pattern Recognition Letters, vol. 28, no. 4, pp. 459-471, 2007.

Quantization effects in the polyphase N-path IIR structure

Polyphase IIR structures have recently proven themselves very attractive for very high performance filters that can be designed using very few coefficients. This, combined with their low sensitivity to coefficient quantization in comparison to standard FIR and IIR structures, makes them very applicable for very fast filtering when implemented in fixed-point arithmetic. However, although the mathematical description is very simple, there exist a number of ways to implement such filters. In this paper, we take four of these different implementation structures, analyze the rounding noise originating from the limited arithmetic wordlength of the mathematical operators, and check the internal data growth within the structure. These analyses need to be done to ensure that the performance of the implementation matches the performance of the theoretical design. The theoretical approach that we present has been proven by the results of the fixed-point simulation done in Simulink and verified by an equivalent bit-true implementation in VHDL.

On the regularization of mixed complementarity problems

A variational inequality problem (VIP) satisfying a constraint qualification can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity problems is generated. It is shown that, if the original problem is solvable, the sequence of computable inexact solutions of the strictly monotone MCP's is bounded and every accumulation point is a solution. Under an additional condition on the precision used for solving each subproblem, the sequence converges to the minimum norm solution of the MCP. Copyright © 2000 by Marcel Dekker, Inc.

Confined systems through variational supersymmetric quantum mechanics

The energy states of the confined harmonic oscillator and the Hulthén potentials are evaluated using the Variational Method associated to Supersymmetric Quantum Mechanics.

Modelo AC para el despacho combinado de contratos bilaterales y bolsa de energía considerando restricciones de seguridad

Reliability is a key aspect in power system design and planning. Maintaining a reliable power system is a very important issue for their design and operation. Under the new competitive framework of the electricity sector, power systems find ever more and more strained to operate near their limits. Under this new scenario, it is crucial for the system operator to use tools that facilitate an energy dispatch that minimizes possible power cuts. This paper presents a mathematical model to calculate an energy dispatch that considers security constraints (single contingencies in transmission lines and transformers). The model involves pool markets and fixed bilateral contracts. Traditional methodologies that include security constraints are usually based in multistage dispatch processes. In this case, we propose a single-stage model that avoids the economic inefficiencies which result when conventional multi-stage dispatch approaches are applied. The proposed model includes an AC representation of the transport system and allows calculating the cost overruns incurred in due to reliability restrictions. We found that complying with fixed bilateral contracts, when they go above certain levels, might lead to congestion problems in transmission lines.

An efficient codification to solve distribution network reconfiguration for loss reduction problem

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

Proposição de rotina morfológica para detecção de malha viária em imagens orbitais

The outdating of cartographic products affects planning. It is important to propose methods to help detect changes in surface. Thus, the combined use of remote sensing image and techniques of digital image processing has contributed significantly to minimize such outdating. Mathematical morphology is an image processing technique which describes quantitatively geometric structures presented in the image and provides tools such as edge detectors and morphological filters. Previous studies have shown that the technique has potential on the detection of significant features. Thus, this paper proposes a routine of morphological operators to detect a road network. The test area corresponds to an excerpt Quickbird image and has as a feature of interest an avenue of the city of Presidente Prudente, SP. In the processing, the main morphological operators used were threshad, areaopen, binary and erosion. To estimate the accuracy with which the linear features were detected, it was done the analysis of linear correlation between vectors of the features detected and the corresponding topographical map of the region. The results showed that the mathematical morphology can be used in cartography, aiming to use them in conventional cartographic updating processes.

Context-sensitive analysis of obfuscated x86 executables

A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in 'calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart. Copyright © 2010 ACM.

Ordered phases in the extended Hubbard model

A novel method to probe the diverse phases for the extended Hubbard model (EHM), including the correlated hopping term, is presented. We extend an effective medium approach [1] to a bipartite lattice, allowing for charge- and/or spin-ordered phases. We calculate the necessary correlation functions to build the EHM phase diagram.

On the eigenvalues and eigenfunctions of some integral operators

Some properties of the eigenvalues of the integral operator Kgt defined as Kτf(x) = ∫0τK(x − y) f (y) dy were studied by [1.], 554–566), with some assumptions on the kernel K(x). In this paper the eigenfunctions of the operator Kτ are shown to be continuous functions of τ under certain circumstances. Also, the results of Vittal Rao and the continuity of eigenfunctions are shown to hold for a larger class of kernels.

Representations and properties of para-Bose oscillator operators. I. Energy position and momentum eigenstates

Para-Bose commutation relations are related to the SL(2,R) Lie algebra. The irreducible representation [script D]alpha of the para-Bose system is obtained as the direct sum Dbeta[direct-sum]Dbeta+1/2 of the representations of the SL(2,R) Lie algebra. The position and momentum eigenstates are then obtained in this representation [script D]alpha, using the matrix mechanical method. The orthogonality, completeness, and the overlap of these eigenstates are derived. The momentum eigenstates are also derived using the wave mechanical method by specifying the domain of the definition of the momentum operator in addition to giving it a formal differential expression. By a careful consideration in this manner we find that the two apparently different solutions obtained by Ohnuki and Kamefuchi in this context are actually unitarily equivalent. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

Spectral analysis of finite section normal integral operators

Some continuity and differentiability properties of the eigenvalues and eigenfunctions of finite section normal integral operators are proved. These are the extension of corresponding results for symmetric operators ([4.], 554–566; K. B. Athreya and R. Vittal Rao, to appear; [10.], 463–471.