The one-phase synthesis method using evolutionary or heuristic optimization algorithms can successfully solve the dimensional synthesis problems of path generating four-bar mechanisms discussed in the literature, where the input angles are usually used as design variables and the constraint of the rotational sequence of the input angles is necessary. However, there is still room for improvement...

Musical genre classification has been paramount in the last years, mainly in large multimedia datasets, in which new songs and genres can be added at every moment by anyone. In this context, we have seen the growing of musical recommendation systems, which can improve the benefits for several applications, such as social networks and collective musical libraries. In this work, we have introduce...

Although hyperspectral images acquired by onboard satellites provide information from a wide range of wavelengths in the spectrum, the obtained information is usually highly correlated. This article proposes a novel framework to reduce the computation cost for large amount of data based on the efficiency of the Optimum-Path Forest classifier and the power of meta-heuristic algorithms to solve c...

For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...

A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...

Optimal routing in communication networks is a major issue to be solved. In this paper, the application of Tabu Search (TS) in the optimum routing problem where the aim is to minimize the computational time and improvement of quality of the solution in the communication have been addressed. The goal is to minimize the average delays in the communication. The effectiveness of Tabu Search method ...

We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NP-complete. An algorithm for nding a locally optimum solution is proposed, discussed and tested.

In dispersed, multinational enterprises, complex integrations of information systems are a commonly hated threat as they render difficult fundamental changes of IT structures and standards embedded therein. This paper explores how integrations can turn into a burden and how thereby a company’s technology platform can lock-in to a local optimum. We conceptualize information system architectures ...

We present TangentBug, a new ran.ge-sensor based navigation algorithm for two degrees-o,F-freedom mobile robots. The algorithm combines local reactive planning with globally convergent behavior. For the local planning, TangentBug uses the range d a t a to compute a locally shortest path based on a novel structure termed the local tangent graph, or LTG. The robot uses the LTG for choosing the lo...

This paper proposes a new method for online secondary path modeling in feedback active noise control (ANC) systems. In practical cases, the secondary path is usually time-varying. For these cases, online modeling of secondary path is required to ensure convergence of the system. In literature the secondary path estimation is usually performed offline, prior to online modeling, where in the prop...