The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Tool use constitutes a range of complex behaviors that generally require a sophisticated level of cognition, and is only found in higher mammals and a number of avian species. In this paper, we will examine how different strategies for using a tool emerge during the simulated evolution of a two degree-of-freedom articulated limb in a reaching task environment. The limb is controlled by recurrent neural...
In this paper, we present a new heuristic that generates broadcast schemes in arbitrary networks. The heuristic gives optimal broadcast time for HyperCube, and best results for Cube-Connected Cycles and large Shuffle-Exchange graphs. Extensive simulations show that our new heuristic outperforms the best known broadcast algorithms for two different network models representing Internet generated using...
The cost and reliability of a network are very much affected by its topology. Moreover, the network parameters like path length and link load are also dependent on the topology used for a network. These parameters are vital for any network. Hence constructing a set of topology candidates prior to evaluation is crucial. However, constructing candidate set is a time consuming task and this time is greatly...
The completeness of quasi-metric space is researched in this paper. And the closed ball theorem of quasi-metric space is proved. Finally, the Ekeland theorem, Caristi fixed point theorem.
The downsizing of transistor dimensions enabled in the future nanotechnologies will inevitably increase the number of faults in the complex ULSI chips. To maintain the production yield at acceptable level, several levels of protection mechanisms will have to be implemented to tolerate the permanent and transient faults occurring in the physical layers. In this paper, we study fault tolerance at the...
This paper addresses the segmentation problem in noisy image based on Fast Edge Integration (FEI) method in active contour model (ACM) and proposes a new statistical active contour model (SACM). Two modifications are performed in FEI method. First, in order to handle noisy images, maximum log-likelihood estimation is used to replace the minimal variance term proposed by Chan and Vese. Second, a penalising...
A major issue in software testing is the automatic generation of the inputs to be applied to the programme under test. To solve this problem, a number of approaches based on search methods have been developed in the last few years, offering promising results for adequacy criteria like, for instance, branch coverage. We devise branch coverage as the satisfaction of a number of constraints. This allows...
In recent years, organizations have been shifting focus to their core business competencies, and reducing total cost of ownership (TCO) associated with training and management of their IT infrastructure. In the same motif, organizations are establishing security and survivability frameworks as an integral part of their business strategy so as to provide an acceptable quality-of-service for their clients...
This paper addresses the problem of how to adapt an algorithm designed for fixed topology networks to produce the intended results, when run in a network whose topology changes dynamically, in spite of encountering topological changes during its execution. We present a simple and unified procedure, called a reset procedure, which, when combined with the static algorithm, achieves this adaptation....
We introduce an asymptotic data structure for the relative bilinear complexity of bilinear maps (tensors). It consists of a compact Hausdorff space Δ together with an interpretation of the tensors under consideration as continuous functions on Δ. The asymptotic rank of a tensor is simply the maximum of the associated function. On the way we present a new method for estimating the exponent ω of matrix...
We give an algorithm to construct a cell decomposition of Rd, including adjacency information, defined by any given set of rational polynomials in d variables. The algorithm runs in single exponential parallel time, and in NC for fixed d. The algorithm extends a recent algorithm of Ben-Or, Kozen, and Reif for deciding the theory of real closed fields.
Sublinear signal propagation delay in VLSI circuits carries a far greater penalty in wire area than is commonly realized. Therefore, the global complexity of VLSI circuits is more layout dependent than previously thought. This effect will be truly pronounced in the emerging wafer scale integration technology. We establish lower bounds on the trade-off between sublinear signalling speed and layout...
Given a ring (cycle) of n processes it is required to design the processes so that they will be able to choose a leader (a uniquely designated process) by sending messages along the ring. If the processes are indistiguishable there is no deterministic algorithm, and therefore probabilistic algorithms are proposed. These algorithms need not terminate, but their expected complexity (time or number of...
This study may be viewed from the more general context of a theory of computational problems. An environment E= 〈L,D〉 consists of a class of structures D and a language L for D. A problem in E is a pair of sets of formulas P = 〈Π|Γ〉, with problem predicate Π. Let Ereal = 〈Lreal,{R}〉 and Elin = 〈Llin,Dlin〉 where R are the reals, Dlin is the class of totally ordered structures, Lreal and Llin are the...
We investigate the size of sets of computable functions using category-theoretic methods (in the sense of the Baire Category theorem). Constructive definitions of no-where dense and meagre set are given and applied to several problems. In particular we apply it to subrecursive degree structures and to a comparison of the power of deterministic and nondeterministic time bounded oracle machines.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.