33,160 research outputs found
Adaptive Parallel Iterative Deepening Search
Many of the artificial intelligence techniques developed to date rely on
heuristic search through large spaces. Unfortunately, the size of these spaces
and the corresponding computational effort reduce the applicability of
otherwise novel and effective algorithms. A number of parallel and distributed
approaches to search have considerably improved the performance of the search
process. Our goal is to develop an architecture that automatically selects
parallel search strategies for optimal performance on a variety of search
problems. In this paper we describe one such architecture realized in the
Eureka system, which combines the benefits of many different approaches to
parallel heuristic search. Through empirical and theoretical analyses we
observe that features of the problem space directly affect the choice of
optimal parallel search strategy. We then employ machine learning techniques to
select the optimal parallel search strategy for a given problem space. When a
new search task is input to the system, Eureka uses features describing the
search space and the chosen architecture to automatically select the
appropriate search strategy. Eureka has been tested on a MIMD parallel
processor, a distributed network of workstations, and a single workstation
using multithreading. Results generated from fifteen puzzle problems, robot arm
motion problems, artificial search spaces, and planning problems indicate that
Eureka outperforms any of the tested strategies used exclusively for all
problem instances and is able to greatly reduce the search time for these
applications
The Eureka Programming Model for Speculative Task Parallelism
In this paper, we describe the Eureka Programming Model (EuPM) that simplifies the expression of speculative parallel tasks, and is especially well suited for parallel search and optimization applications. The focus of this work is to provide a clean semantics for, and efficiently support, such "eureka-style" computations (EuSCs) in general structured task parallel programming models. In EuSCs, a eureka event is a point in a program that announces that a result has been found. A eureka triggered by a speculative task can cause a group of related speculative tasks to become redundant, and enable them to be terminated at well-defined program points. Our approach provides a bound on the additional work done in redundant speculative tasks after such a eureka event occurs.
We identify various patterns that are supported by our eureka construct, which include search, optimization, convergence, and soft real-time deadlines. These different patterns of computations can also be safely combined or nested in the EuPM, along with regular task-parallel constructs, thereby enabling high degrees of composability and reusability. As demonstrated by our implementation, the EuPM can also be implemented efficiently. We use a cooperative runtime that uses delimited continuations to manage the termination of redundant tasks and their synchronization at join points. In contrast to current approaches, EuPM obviates the need for cumbersome manual refactoring by the programmer that may (for example) require the insertion of if checks and early return statements in every method in the call chain. Experimental results show that solutions using the EuPM simplify programmability, achieve performance comparable to hand-coded speculative task-based solutions and out-perform non-speculative task-based solutions
New Exoplanet Surveys in the Canadian High Arctic at 80 Degrees North
Observations from near the Eureka station on Ellesmere Island, in the
Canadian High Arctic at 80 degrees North, benefit from 24-hour darkness
combined with dark skies and long cloud-free periods during the winter. Our
first astronomical surveys conducted at the site are aimed at transiting
exoplanets; compared to mid-latitude sites, the continuous darkness during the
Arctic winter greatly improves the survey's detection efficiency for
longer-period transiting planets. We detail the design, construction, and
testing of the first two instruments: a robotic telescope, and a set of very
wide-field imaging cameras. The 0.5m Dunlap Institute Arctic Telescope has a
0.8-square-degree field of view and is designed to search for potentially
habitable exoplanets around low-mass stars. The very wide field cameras have
several-hundred-square-degree fields of view pointed at Polaris, are designed
to search for transiting planets around bright stars, and were tested at the
site in February 2012. Finally, we present a conceptual design for the Compound
Arctic Telescope Survey (CATS), a multiplexed transient and transit search
system which can produce a 10,000-square-degree snapshot image every few
minutes throughout the Arctic winter.Comment: 11 pages, 6 figures, SPIE vol 8444, 201
Approachi Significans
Approachi Significans is a demonstration of the interference patterns created by scientific and artistic logics. It promotes immersion in the everyday world through experimentation and a search for novel experience, as such efforts prime the mind for novel thought. It is loosely based in a search for constellations of experiences that prompt Eureka moments and an effort to illustrate the organic nature of the scientific process. The title is derived from the phrase `approaching significance,\u27 which is used to indicate that experimental data is moving towards the confirmation of a hypothesis
Developing Of The Related Data Search Lsa-based Algorithm And Its Programmed Realization
In this article let\u27s consider the theoretical basis of the data search in large data ordered arrays based on the context of the search request and tracking of semantic relationships. Also the first steps towards the practical implementation of this task are proposed. Simple program to check author\u27s thoughts has been developed. All the researches have been made with the VK social network. Internal API VK was used as retrieving data tool. The final results say that the VK\u27s content has many opportunities to make them more useful and searchable, which means that it is possible to use this ‘property\u27 to create our own, more user-friendly way to search and get important data, in the first, for example, buying-selling information, from many kinds of data sources (official pages, users\u27 profiles etc.). That feature never been presented (and probably won\u27t) in other social networks like Facebook or Instagram. The material in this article will be used later while the author\u27s PhD thesis writing
Albedos and diameters of three Mars Trojan asteroids
We observed the Mars Trojan asteroids (5261) Eureka and (101429) 1998 VF31
and the candidate Mars Trojan 2001 FR127 at 11.2 and 18.1 microns using
Michelle on the Gemini North telescope. We derive diameters of 1.28, 0.78, and
<0.52 km, respectively, with corresponding geometric visible albedos of 0.39,
0.32, and >0.14. The albedos for Eureka and 1998 VF31 are consistent with the
taxonomic classes and compositions (S(I)/angritic and S(VII)/achrondritic,
respectively) and implied histories presented in a companion paper by Rivkin et
al. Eureka's surface likely has a relatively high thermal inertia, implying a
thin regolith that is consistent with predictions and the small size that we
derive.Comment: Icarus, in press. See companion paper 0709.1925 by Rivkin et al; two
minor typos fixe
Grouping Method Of Image Fragments Of Adjacent Dislocation Etch Pits Of The Semiconductor Wafer
An increase in production volumes of gallium arsenide semiconductor devices determines the need for better control of dislocations of semiconductor wafer.The grouping method of image fragments of adjacent dislocation etch pits of the semiconductor wafer is proposed in the article. Adjacent fragments will be allocated in the pre-binarized image of wafer surface, which contains adjacent fragments of etch pits of dislocation loops after treatment by the described method. Improved methods for determining the loop line width determines the edge line width of etch pits of suspected dislocations, given the variability of their display in the binarized image. The current loop line width is compared to the reference line width of the dislocation loop.The grouping method of image fragments of adjacent dislocation etch pits of the semiconductor wafer defines recovery of loop lines branching, takes into account various options of line adjacency and determines the direction of further recovery of loop line of dislocation etch pits. A step by step description of the method is given
The Ways of Improvement of the Tax Control System in Russia in the New Geopolitical Conditions Based on Historical Experience and World Practice
Creation of the financial stability is the main task of any state, in which connection the value of taxes and duties as the sources of profitable part of the state budget explains priority of the tax control as the direction of tax authorities\u27 activity. Economic and social development of any modern state much depends on effectiveness of tax control system that is why the problems of tax control organization, elaboration of the ways of tax control improvement are topical. In the modern world the International relations and connections gain the great value, at the state interaction they can appeal to the experience of each other on the questions of legislation, levy of the taxes and duties in the state budget. In each state the tax control systems are different and have both positive and negative aspects. At analysis of the foreign legislation the detailed analysis of the results of the use of certain measures of regulation and control is needed and it is also necessary to prognosticate an experience that will be gained by our state in the case of introduction of analogous measures. It is also must be noted that for creation of the effective tax control system it is necessary to use the large number of mechanisms of tax administration
- …