WorldWideScience

Sample records for cadsr freestyle search

  1. The freestyle pedicle perforator flap

    DEFF Research Database (Denmark)

    Gunnarsson, Gudjon Leifur; Jackson, Ian T; Westvik, Tormod S; Thomsen, Jorn Bo

    2015-01-01

    not widely performed by the general plastic surgeons. The aim of this paper is to present the simplicity of pedicled perforator flap reconstruction of moderate-sized defects of the extremities and torso. METHODS: We retrospectively reviewed the charts of 34 patients reconstructed using 34 freestyle...... aspects in the context of current literature. RESULTS: The reconstructive goals were achieved in all cases without any total flap loss or major complications. Minor complications occurred in 7/34 (21 %) cases consisting of venous congestion leading to distal tip necrosis or epidermolysis; partial flap...... loss was significant in 4 cases, however never more than 10 % of the total flap size. Reconstruction was performed on the lower limb in 13 cases, upper limb in 12, and 9 cases were on the truncus. The angle of rotation was 90° in 21 cases and 180° in 13 cases. The most common indication was...

  2. The improving of precompetitive training of freestyle young wrestlers

    Directory of Open Access Journals (Sweden)

    Ruchka Yevhen

    2016-06-01

    Full Text Available The author investigated the effect of precompetitive and prelaunch status of young freestyle wrestlers at the performance indicators of their competitive activity. Proved the feasibility of an individualised complex of pedagogical methods and methods of optimisation of precompetitive training of freestyle young wrestlers.

  3. The Role of the Hand During Freestyle Swimming.

    Science.gov (United States)

    Cohen, Raymond C Z; Cleary, Paul W; Mason, Bruce R; Pease, David L

    2015-11-01

    The connections between swimming technique and the fluid dynamical interactions they generate are important for assisting performance improvement. Computational fluid dynamics (CFD) modeling provides a controlled and unobtrusive way for understanding the fundamentals of swimming. A coupled biomechanical-smoothed particle hydrodynamics (SPH) fluid model is used to analyze the thrust and drag generation of a freestyle swimmer. The swimmer model was generated using a three-dimensional laser body scan of the athlete and digitization of multi-angle video footage. Two large distinct peaks in net streamwise thrust are found during the stroke, which coincide with the underwater arm strokes. The hand motions generate vortical structures that travel along the body toward the kicking legs and the hands are shown to produce thrust using both lift and drag. These findings advance understanding of the freestyle stroke and may be used to improve athlete technique. PMID:26372433

  4. RELATIONSHIPS OF FREESTYLE SWIMMING PERFORMANCE WITH DYNAMIC STRENGTH AND SHOULDER ISOKINETIC PARAMETERS

    OpenAIRE

    Erkan M.; Akdogan E.; Kale M.

    2014-01-01

    It is thought that upper body dynamic strength and shoulder isokinetic parameters are related with freestyle swimming performance. The purpose of this study was to investigate relationships of freestyle swimming performance with dynamic strength parameters and shoulder isokinetic parameters. Nine male swimmers of Anadolu University Swimming Team [age (year)= 22.9±2.7, body height (cm)= 170.0±5.25, body weight (kg)= 74.1±7.0, BMI= 22.0±2.62 (kg/m2); body fat percent (%)= 12.4±4.9] voluntary pa...

  5. Freestyle versus butterfly swimming performance – effects of age and sex

    OpenAIRE

    Zingg, Matthias Alexander; Wolfrum, Mathias; Rüst, Christoph Alexander; Rosemann, Thomas; Lepers, Romuald; Knechtle, Beat

    2014-01-01

    Purpose. Recent studies have suggested that the age of peak freestyle swimming speed is reached earlier in life in women than in men. However, no study has investigated the age of peak swimming speed in other swimming styles such as butterfly. The aims of the present study were to investigate the age of peak swimming speed in elite male and female butterfly and freestyle swimmers at the national level (Switzerland) and the sex differences in both the age of peak swimming speed and swimming sp...

  6. Competitive activity of highly skilled freestyle wrestlers at the present stage

    Directory of Open Access Journals (Sweden)

    Boyko V.F.

    2014-07-01

    Full Text Available Purpose: to compare competitive activity of highly skilled freestyle wrestlers after making adjustments to the wrestling rules. Material: the analysis involved 80 bouts performed by high skilled wrestlers at 2011 World Wrestling Championships (Ankara, Turkey and 2012 Olympic Games in London (weight categories 84 and 96 kg. Results: the resultant technical actions have been analyzed in the standing position performed by highly skilled freestyle wrestlers in major events of the annual cycle for the last three years. The characteristic changes in a competitive activity of highly skilled freestyle wrestlers in the weight categories 84 and 96 kg have been determined. We identified the techniques which were used most frequently in different periods of bout by elite athletes: spurt moving, throwing by knock, pressing, pushing the mat, etc. Conclusions: the competitions in the training of athletes are not only a means of controlling the level of preparedness, the process for deciding the winner, but also an important means of improving fitness and sports mastership. In the future, specialists can use these features of competitive activity in determining the overall training strategy of freestyle wrestlers to competitions at various levels.

  7. 75 FR 77878 - Determination of Regulatory Review Period for Purposes of Patent Extension; FREESTYLE NAVIGATOR

    Science.gov (United States)

    2010-12-14

    ... NAVIGATOR (U.S. Patent No. 5,262,035) from Abbott Diabetes Care Inc., and the Patent and Trademark Office... Patent Extension; FREESTYLE NAVIGATOR AGENCY: Food and Drug Administration, HHS. ACTION: Notice. SUMMARY... of Commerce, for the extension of a patent which claims that medical device. ADDRESSES:...

  8. Improving the training of young wrestlers in the conditions of dynamic development of free-style wrestling

    Directory of Open Access Journals (Sweden)

    Ruchka Yevhen

    2016-02-01

    Full Text Available The article focuses on the identification of technical-tactical actions that are most often performed by young freestyle wrestlers during competitions. It defines the peculiarities of competitive activity in connection with the change in the rules of wrestling. The method of teaching the technique of struggle that takes into account the peculiarities of competitive activity of young freestyle wrestlers is well-grounded. The effectiveness of the author's methods of teaching the technique of free-style wrestling is proved

  9. RELATIONSHIPS OF FREESTYLE SWIMMING PERFORMANCE WITH DYNAMIC STRENGTH AND SHOULDER ISOKINETIC PARAMETERS

    Directory of Open Access Journals (Sweden)

    Erkan M.

    2014-07-01

    Full Text Available It is thought that upper body dynamic strength and shoulder isokinetic parameters are related with freestyle swimming performance. The purpose of this study was to investigate relationships of freestyle swimming performance with dynamic strength parameters and shoulder isokinetic parameters. Nine male swimmers of Anadolu University Swimming Team [age (year= 22.9±2.7, body height (cm= 170.0±5.25, body weight (kg= 74.1±7.0, BMI= 22.0±2.62 (kg/m2; body fat percent (%= 12.4±4.9] voluntary participated to the study. Freestyle swimming performances (25m and 50m were tested by a touchpad chronometer system for a semi-Olympic swimming pool (25m. One repetition maximal test for bench press, clean, and push press was used as upper body dynamic strength parameters. Shoulder isokinetic parameters at 60, 180, and 300o.s-1 angular velocities were extension peak torque, flexion peak torque, and flexion/extension peak torque rate of shoulders. Relationships of freestyle swimming performance with upper body dynamic strength parameters and shoulder isokinetic parameters were analysed with Pearson Correlation Coefficient. Probability level was ≤0.05. The results of this study showed that there were no statistically correlations of freestyle swimming performance with upper body dynamic strength parameters and shoulder isokinetic parameters at 60, 180, and 300o.s-1 angular velocities. In conclusion, there are more studies about different angular velocities of shoulder isokinetic parameters and maximal strength of upper body parameters.

  10. When a Mechanical Valve Goes Freestyle: A Patient Tailored Valve-In-Valve Implantation.

    Science.gov (United States)

    François, J; Cathenis, K; Hamerlijnck, R

    2015-01-01

    In case of a redo operation after a full root replacement there are two possible options: replacing the entire root or performing a more conservative valve-in-valve implantation. Regarding the relatively high morbidity and mortality of a redo root replacement, the valve-in-valve implantation is the preferred choice if technically feasible. We present the case of a valve-in-valve implantation with a St. Jude mechanical valve in a Medtronic bioprosthesis in a 57-year old man. Follow-up echocardiography after 1 month showed a mean gradient of 17 mmHg and no paravalvular leakage. The combination of a St. Jude bileaflet mechanical valve implanted in a Freestyle root prosthesis has not been described. This case shows that patient tailored treatment with a St. Jude bileaflet mechanical valve in a Freestyle aortic root valve can be safely performed and might be the preferred choice for younger patients, if technically feasible. PMID:26560005

  11. Keskivartalon lihashallinnan merkitys polven ACL‐ vamman ennaltaehkäisyssä freestyle-­lumilautailussa : Katsaus tutkimuksiin ja kirjallisuuteen

    OpenAIRE

    Ahtikari, Emilia

    2016-01-01

    Opinnäytetyön tarkoitus on selvittää onko keskivartalon lihashallinnalla merkitystä ACL-vamman ennaltaehkäisyssä freestyle‐lumilautailussa. Opinnäytetyössä pyritään vastaamaan kysymyksiin; mikä on freestyle­‐lumilautailijan yleinen ACL­‐vammamekanismi, miten keskivartalon lihashallinta vaikuttaa polven hallintaan ja onko keskivartalon lihashallinnalla vaikutusta ACL-­vamman ennaltaehkäisyssä freestyle-lumilautailussa. Opinnäytetyö on toteutettu kirjallisuuskatsauksena jonka tiedonhaku on tote...

  12. Features of kinematic structure of motor actions technique in the freestyle wrestlers with different qualification

    Directory of Open Access Journals (Sweden)

    Tupeev Y.V.

    2010-02-01

    Full Text Available The sequence of educational steps in teaching basic technique elements in stance for young wrestlers at the initial training stage was determined by the expert assessment method. The biomechanical features of technique of a sprint by an inclination hold of legs for differently qualified wrestlers in freestyle were ascertained by the biomechanical videocomputer analysis. The results of research of kinematic structure of motor actions technique testify that performance duration of phases in sprint by an inclination hold of legs was characterized by the greater values for qualified wrestlers in comparison with highly skilled ones.

  13. STUDY REGARDING THE MEN'S 50M FREESTYLE AT THE 2013 BARCELONA WORLD SWIMMING CHAMPIONSHIP

    Directory of Open Access Journals (Sweden)

    Galeru Ovidiu

    2014-03-01

    Full Text Available The 2013 Barcelona World Swimming Championships have confirmed once again the conclusion of various specialists and statistics that the results recorded at the World Championships following the Summer Olympic Games are more valuable from a performance standpoint. The men's 50m and 100m freestyle events attract the most attention, being considered the most disputed, being the most watched events by the specialists, by the media, and by a larger audience. The chances of each athlete aspiring to the top title are analyzed, their competition strategies, but also the statements of the most valuable swimmers. The pertinent analyses of the races, especially during the late stages of the competition, semifinals and final, represent extremely important sources of information for coaches and researchers, offering data and specific indices that can improve the athletes' future performances, or can predict certain performances. In this study I aim to analyze the men's 50m freestyle final at the 2013 Barcelona World Swimming Championships, and to compare the results with the ones recorded by the athlete I am currently coaching, the Romanian swimmer Norbert Trandafir, an athlete who was qualified in the semifinals for this event, but came out in 13th position in the final, with a new national record (21.98 s, a time that can mean a qualification in the European, World, and why not, even Olympics finals.

  14. Neural correlates of lyrical improvisation: an FMRI study of freestyle rap.

    Science.gov (United States)

    Liu, Siyuan; Chow, Ho Ming; Xu, Yisheng; Erkkinen, Michael G; Swett, Katherine E; Eagle, Michael W; Rizik-Baer, Daniel A; Braun, Allen R

    2012-01-01

    The neural correlates of creativity are poorly understood. Freestyle rap provides a unique opportunity to study spontaneous lyrical improvisation, a multidimensional form of creativity at the interface of music and language. Here we use functional magnetic resonance imaging to characterize this process. Task contrast analyses indicate that improvised performance is characterized by dissociated activity in medial and dorsolateral prefrontal cortices, providing a context in which stimulus-independent behaviors may unfold in the absence of conscious monitoring and volitional control. Connectivity analyses reveal widespread improvisation-related correlations between medial prefrontal, cingulate motor, perisylvian cortices and amygdala, suggesting the emergence of a network linking motivation, language, affect and movement. Lyrical improvisation appears to be characterized by altered relationships between regions coupling intention and action, in which conventional executive control may be bypassed and motor control directed by cingulate motor mechanisms. These functional reorganizations may facilitate the initial improvisatory phase of creative behavior. PMID:23155479

  15. The Free-style Gluteal Perforator Flap in the Thinning and Delay Process for Perineal Reconstruction After Necrotizing Fasciitis.

    Science.gov (United States)

    Horta, Ricardo; Nascimento, Ricardo; Silva, Alvaro; Amarante, Jose

    2016-06-01

    Perineal wounds present a special challenge for reconstructive surgeons. The vacuum-assisted closure device is useful as a temporizing measure or for wounds too large or contaminated for immediate reconstruction. Compared to traditional myocutaneous flaps, perforator flaps provide thinner fasciocutaneous flaps for perineal reconstruction with favorable results and fewer donor site morbidities. The upper and lower gluteal regions are rich in perforators, which allow for more versatile flap design according to the defect. The authors combined the principles of free-style perforator flaps, flap delay, and thinning of perforator flaps to restore perineal function and aesthetics. The procedure was undertaken in a 72-year-old female who was obese with the diagnosis of necrotizing fasciitis secondary to perineal abscess. After 3 months, the flap achieved adequate and durable reconstruction with acceptable aesthetic contour and patient satisfaction; there was no loss of function at donor sites. Clinical applications and technical refinements of freestyle pedicled perforator flaps can be extended to the perineal region. Because of its many advantages and its versatility, freestyle pedicled perforator flaps constitute a valued reconstructive option and, when indicated, an alternative to pedicled axial flaps or even free flaps, in addition to vacuum therapy, to simplify the reconstructive procedure. PMID:27434419

  16. The Association between Anthropometric Variables, Functional Movement Screen Scores and 100 m Freestyle Swimming Performance in Youth Swimmers

    Directory of Open Access Journals (Sweden)

    Daisy Bond

    2015-01-01

    Full Text Available This study examined the association between anthropometric variables, Functional Movement Screen (FMS scores and 100 m freestyle swimming performance in early adolescent swimmers. Fifty competitive, national level, youth swimmers (21 males, 29 females, mean age ± SD = 13.5 ± 1.5 years, age range 11–16 years performed an “all-out” 100 m freestyle (front crawl swim as fast as they could in a 50 m pool. A median divide for 100 m timed swim was also used to divide the sample into faster or slower groups. Height, body mass, skinfolds and limb lengths were also assessed. Maturation was calculated by proxy using anthropometric measures and participants also undertook the FMS as a measure of functional performance. Backwards linear regression indicated a significant model (p = 0.0001, Adjusted R2 = 0.638 explaining 63.8% of the variance in swim performance with total sum of skinfolds, upper leg length, lower leg length, hand length and total height significantly contributing to the model. Swimmers who were classed as fast had lower total sum of skinfolds (p = 0.005 and higher total FMS score (p = 0.005 compared to their slower peers. In summary, this study indicates that anthropometric variables significantly explained the variance in 100 m freestyle swimming performance in youth swimmers.

  17. The Relationship Between Lower Extremity Wingate Anaerobic Test (WAnT and 50m Freestyle Swimming Performance

    Directory of Open Access Journals (Sweden)

    Ayşegül YAPICI

    2015-07-01

    Full Text Available The aim of this study is to analyze the relationship between 50mt freestyle swimming performance and lower extremity Wingate anaerobic power and capacity test. 11 male (age: 13.45 ± 1.0 3 years, height: 166.18 ± 10.12 cm, weight: 55.00 ± 11.13 kg, experience: 6.2 ± 1.1 years swimmers participated in this study voluntarily. The players participated in anthropometric measurements followed by Wingate anaerobic test on the first day. They p erformed 50mt freestyle swimming performance tests on the second day (one days later. In this study, 50mt freestyle swimming performance has not been done from a standart jump. All the swimmers started their performance in the water with a 2 - leg - ged push away from the wall. Also 10mt lap periods were recorded. Data were expressed as mean ± standard deviation. Correlation between anaerobic performance tests and swimming performance tests were studied with Pearson correlation analysis. All analysis were exec uted in SPSS 17.0 and the statistical significance was set at p 0.05. The statistically s ignificant relationship between f atigue index and relative average power, relative minumum peak power and minumum peak power (p0.05. On looking at the relationship between the 10 mt lap period time in swimming and wingate anaerobic test performance, a statistically s ignificant relationship between both relative and absolute values maximum swimming speed and paek power, average speed swimming and average power, minimum swimming speed and minumum power (p0.05. The factors like experience, the level of profession, the difference of fricton between activities in water and land, air conditions (moisture, temperature may have effected the re sults.

  18. Freestyle-Like V-Y Flaps of the Eyebrow: A New Outlook and Indication of an Historical Technique

    Directory of Open Access Journals (Sweden)

    Angelo Alberto Leto Barone

    2013-01-01

    Full Text Available The eyebrow region is of utmost importance for facial movement, symmetry, and the overall cosmetic appearance of the face. Trauma or tumor resection often leave scars that may dislocate the eyebrow producing an alteration both in static symmetry of the face and in the dynamic expressivity. The authors present a technique for eyebrow’s defects repair using the remaining eyebrow advancement by means of a “freestyle-like” V-Y flap. In the past two years a total of eight consecutive patients underwent excision of skin lesions in the superciliary region and immediate reconstruction with this technique. On histology, six patients were affected from basal cell carcinomas, one from squamous cell carcinoma, and one from congenital intradermal melanocytic nevus. The pedicle of the flap included perforators from the supratrochlear, supraorbital, or superficial temporalis artery. Advancement of the entire aesthetic subunit that includes the eyebrow using a V-Y perforator flap was performed successfully in all cases achieving full, tension-free closure of defects up to 3.0 cm. “Freestyle-like” V-Y flaps should be considered as a first-line choice for partial defects of the eyebrow. The greater mobility compared to random subcutaneous flaps allows to reconstruct large defects providing an excellent cosmetic result.

  19. Performance trends in master freestyle swimmers aged 25-89 years at the FINA World Championships from 1986 to 2014.

    Science.gov (United States)

    Knechtle, Beat; Nikolaidis, Pantelis T; König, Stefan; Rosemann, Thomas; Rüst, Christoph A

    2016-02-01

    Performance trends in elite freestyle swimmers are well known, but not for master freestyle swimmers. We investigated trends in participation, performance, and sex difference in performance of 65,584 freestyle master swimmers from 25-29 to 85-89 years competing in FINA World Masters Championships between 1986 and 2014. The men-to-women ratio was calculated for each age group, and the trend across age groups was analyzed using single linear regression analysis. Trends in performance changes were investigated using a mixed-effects regression model with sex, distance, and calendar year as fixed variables. Participation increased in women and men in older age groups (i.e., 40 years and older). Women and men improved race times across years in all age groups and distances. For age groups 25-29 to 75-79 years, women were slower than men, but not for age groups 80-84 to 85-89 years. In 50, 100, and 200 m, women reduced the sex difference from 1986 to 2014 in age groups 30-34 to 75-79 years. In 400 m, women reduced the gap to men across time in age groups 40-44, 45-49, and 55-59 years. In 800 m, sex difference became reduced across time in age groups 55-59 and 70-74 years. In summary, participation increased from 1986 to 2014 in women and men in older age groups, women and men improved across time performance in all distances, and women were not slower compared to men in age groups 80-84 to 85-89 years. We expect a continuous trend in increasing participation and improved performance in master freestyle swimmers. PMID:26833033

  20. Freestyle race pacing strategies (400 m) of elite able-bodied swimmers and swimmers with disability at major international championships.

    Science.gov (United States)

    Taylor, Joseph B; Santi, Giampaolo; Mellalieu, Stephen D

    2016-10-01

    Freestyle race pacing strategies (400 m) were compared between elite able-bodied swimmers and those with minimal physical (International Paralympic Committee S10 classification) and visual disabilities (International Paralympic Committee S13 classification). Data comprised 50-m lap splits and overall race times from 1176 400-m freestyle swims from World Championships, European Championships and Olympic/Paralympic Games between 2006 and 2012. Five pacing strategies were identified across groups (even, fast start, negative, parabolic and parabolic fast start), with negative and even strategies the most commonly adopted. The negative pacing strategy produced the fastest race times for all groups except for female S13 swimmers where an even strategy was most effective. Able-bodied groups swam faster than their S10 and S13 counterparts, with no differences between S10 and S13 groups. The results suggest adoption of multiple pacing strategies across groups, and even where impairments are considered minimal they are still associated with performance detriments in comparison to their able-bodied counterparts. The findings have implications for the planning and implementation of training related to pacing strategies to ensure optimal swimmer preparation for competition. Analogous performance levels in S10 and S13 swimmers also suggest a case for integrated competition of these classifications in 400-m freestyle swimming. PMID:26854943

  1. Venous-supercharged freestyle posterior thigh flap without a descending branch of the inferior gluteal artery for reconstruction in the infragluteal region.

    Science.gov (United States)

    Fukunaga, Yutaka; Miyamoto, Shimpei; Kobayashi, Eisuke; Sakuraba, Minoru

    2014-12-01

    The posterior thigh flap is a workhorse flap for reconstruction in the gluteal region. The main vascular pedicle of the flap is commonly the descending branch of the inferior gluteal artery, although it is at risk for transection during sarcoma resection. We report successful reconstruction of an infragluteal defect resulting from sarcoma resection with a venous-supercharged freestyle posterior thigh flap in the absence of the descending branch of the inferior gluteal artery. A 77-year-old man underwent sarcoma resection in the infragluteal region. The descending branch of the inferior gluteal artery was sacrificed. We found a sizable perforator through the long head of the biceps femoris and harvested a posterior thigh flap on the basis of that perforator with a freestyle approach. The flap gradually developed a congestive appearance after transfer. We therefore anastomosed the vein of the second perforator to an accompanying vein of the sciatic nerve at the recipient site. The complete flap survived, and the postoperative course was uneventful. We believe that combined use of the freestyle approach and the perforator-supercharging technique can enhance the versatility and the safety of pedicled perforator flap transfer. PMID:25193397

  2. Freestyle swimming technique variations using a parachute Variaciones en la técnica de crol durante el nado resistido con paracaídas

    Directory of Open Access Journals (Sweden)

    J.M. García

    2010-09-01

    Full Text Available

    The appearance of new assistance materials like the parachute make it necessary for coaches to know about the impact that such devices have in swimming. To study this theme 16 national and international swimmers between 19 and 24 years old have been selected. The swimmers participated in four tests that consisted in freestyle (crawl stroke swimming for 10 and 45 seconds at maximum intensity, both with and without the parachute. These tests analysed stroke frequency and stroke length. A within-subjects design has been applied and a study of the facts has been made with an AVAR with repeat measures. The results indicate that the stroke frequency decreases (p<0.05 in the parachute swim during the 10 and 45 second tests, compared with the normal swim. It was also observed that the stroke frequency is higher (p<0.01 in the 10 second test than in the 45 second test. The stroke length is higher (p<0.01 in the normal swim test than in the parachute test. With respect to the swim periods of time, the stroke length is higher (p<0.01 in the 45 second test than in the 10 second test. The parachute swim produces important changes in stroke frequency and stroke length in both the 10 and 45 second tests in subjects swimming the freestyle at maximum intensity.
    KEY WORDS: swimming, swim resistance, parachute, crawl, freestyle,. stroke frequency, stroke length.

    La aparición de nuevos materiales auxiliares, como el paracaídas, hace necesario que los entrenadores conozcan las modificaciones que estos producen durante el nado. Para conseguir este objetivo se seleccionaron a 16 nadadores de nivel nacional e internacional comprendidos entre los 19 y 24 años. Éstos realizaron cuatro pruebas que consistieron en nadar a crol durante 10 y 45 segundos a máxima intensidad, utilizando el nado normal (NN y el nado resistido con paracaídas (NRCP. En estas pruebas se analizaron las variables

  3. Effect of surgeon on transprosthetic gradients after aortic valve replacement with Freestyle® stentless bioprosthesis and its consequences: A follow-up study in 587 patients

    Directory of Open Access Journals (Sweden)

    Bauer Stefan

    2007-10-01

    Full Text Available Abstract Background The implantation of stentless valves is technically demanding and the outcome may depend on the performance of surgeons. We studied systematically the role of surgeons and other possible determinants for mid-term survival, postoperative gradients and Quality of Life (QoL after aortic valve replacement (AVR with Freestyle® stentless bioprostheses. Methods Between 1996 and 2003, 587 patients (mean 75 years underwent AVR with stentless Medtronic Freestyle® bioprostheses. Follow-up was 99% complete. Determinants of morbidity, mortality, survival time and QoL were evaluated by multiple, time-related, regression analysis. Risk models were built for all sections of the Nottingham Health Profile (NHP: energy, pain, emotional reaction, sleep, social isolation and physical mobility Results Actuarial freedom from aortic valve re-operation, structural valve deterioration, non-structural valve dysfunction, prosthetic valve endocarditis and thromboembolic events at 6 years were 95.9 ± 2.1%, 100%, 98.7 ± 0.5%, 97.0 ± 1.5%, 79.6 ± 4.3%, respectively. The actuarial freedom from bleeding events at 6 years was 93.1 ± 1.9%. Estimated survival at 6 years was similar to the age-matched German population (61.4 ± 3.8 %. Predictors of survival time were: diabetes mellitus, atrial fibrillation, peripheral vascular disease, renal dysfunction, female gender > 80 years and patients 0.7 for each of the 6 QoL sections. Early transvalvular gradients were identified as independent risk factors for impaired physical mobility (c-index 0.77, p Conclusion In addition to the valve size (in relation to body size, subcoronary technique (versus total root and various patient-related factors the risk of elevated gradients after stentless valve implantation depends, considerably on the individual surgeon. Although there was no effect on survival time and most aspects of QoL, higher postoperative transvalvular gradients affect physical mobility after AVR.

  4. SEARCHING FOR CRITERIA IN EVALUATING THE MONOFIN SWIMMING TURN FROM THE PERSPECTIVE OF COACHING AND IMPROVING TECHNIQUE

    Directory of Open Access Journals (Sweden)

    Marek Rejman

    2008-03-01

    Full Text Available This study aims to analysise the selected kinematic parameters of the monofin swimming turn. The high complexity of performing turns is hindered by the large surface of the monofin, which disturbs control and sense of the body in water. A lack of objective data available on monofin swimming turns has resulted in field research connected with the specification of parameters needed for the evaluation of the technique. Therefore, turns observed in elite swimmers contain underlying conclusions for objective criteria, ensuring the highest level of coaching and the improving of turns in young swimmers. Six, high level, male swimmers participated in the study. The subject of the analysis was the fastest turn, from one out of three trial turns made after swimming a distance of 25 m. Images of the turns were collected from two cameras located under water in accordance with the procedures of the previous analyses of freestyle turns. The images were digitized and analysed by the SIMI®- Movement Analysis System. The interdependency of the total turn time and the remaining recorded parameters, constituted the basis for analysis of the kinematic parameters of five turn phases. The interdependency was measured using r- Pearson's correlation coefficients. The novel character of the subject covered in this study, forced interpretation of the results on the basis of turn analyses in freestyle swimming. The results allow for the creation of a diagram outlinig area of search for an effective and efficient monofin swimming turn mechanism. The activities performed from the moment of wall contact until the commencement of stroking seem to be crucial for turn improvement. A strong belief has resulted that, the correct monofin swimming turn, is more than just a simple consequence of the fastest performance of all its components. The most important criteria in evaluating the quality of the monofin swimming turn are: striving for the optimal extension of wall contact

  5. Concept Search

    OpenAIRE

    Giunchiglia, Fausto; Kharkevich, Uladzimir; Zaihrayeu, Ilya

    2008-01-01

    In this paper we present a novel approach, called Concept Search, which extends syntactic search, i.e., search based on the computation of string similarity between words, with semantic search, i.e., search based on the computation of semantic relations between concepts. The key idea of Concept Search is to operate on complex concepts and to maximally exploit the semantic information available, reducing to syntactic search only when necessary, i.e., when no semantic information is available. ...

  6. Professional Microsoft search fast search, Sharepoint search, and search server

    CERN Document Server

    Bennett, Mark; Kehoe, Miles; Voskresenskaya, Natalya

    2010-01-01

    Use Microsoft's latest search-based technology-FAST search-to plan, customize, and deploy your search solutionFAST is Microsoft's latest intelligent search-based technology that boasts robustness and an ability to integrate business intelligence with Search. This in-depth guide provides you with advanced coverage on FAST search and shows you how to use it to plan, customize, and deploy your search solution, with an emphasis on SharePoint 2010 and Internet-based search solutions.With a particular appeal for anyone responsible for implementing and managing enterprise search, this book presents t

  7. Search Cloud

    Science.gov (United States)

    ... https://www.nlm.nih.gov/medlineplus/cloud.html Search Cloud To use the sharing features on this page, please enable JavaScript. Share the MedlinePlus search cloud with your users by embedding our search ...

  8. Search Tips

    Science.gov (United States)

    ... do not need to use AND because the search engine automatically finds resources containing all of your search ... Use as a wildcard when you want the search engine to fill in the blank for you; you ...

  9. Search Cloud

    Science.gov (United States)

    ... this page: https://medlineplus.gov/cloud.html Search Cloud To use the sharing features on this page, ... Top 110 zoster vaccine Share the MedlinePlus search cloud with your users by embedding our search cloud ...

  10. Search Patterns

    CERN Document Server

    Morville, Peter

    2010-01-01

    What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

  11. 我国自由式滑雪雪上技巧项目索契冬奥会成绩展望与技术改进方向%Achievements Prospect and Technical Improvement Aim of Chinese Freestyle Skiing Moguls in Sochi Olympic Winter Games

    Institute of Scientific and Technical Information of China (English)

    银刚; 邓立平

    2013-01-01

    Freestyle skiing moguls is suitable for national conditions and national strength of China .It can make exercise performance improve significantly in a short period and has the characteristics of attending po -tential advantaged projects of Winter Olympic Games .By comparative analysis of achievements and technical characteristics of international and Chinese skiers , the paper puts forward the achievement goal of freestyle skiing moguls for the Winter Olympics in Sochi .And based on this goal, it puts forward the following aspects to improve rotary skills:train athletes the stability of basic positions and the ability to exchange the center of gravity quickly and accurately, strengthen the controlling ability of athletes ’ upper part of body and the hip joint, skillfully grasp the technique of turning time and rhythm change , improve the technique of edge skis and carving snow of jointing board, planting pole and lifting pole.At the same time, improve skiers’ sliding speed of completing competitive movements , the difficulty and completion quality of technical movements in the air to increase the scores of competition movements and realize the breakthrough of Chinese freestyle ski-ing moguls of Winter Olympics in Sochi .%  自由式滑雪空中技巧运动适合我国的国情、国力,在较短时间内运动成绩提高显著,具有参加冬奥会潜优势项目的特征。通过对该项目中外运动员成绩和技术特点的分析比较,提出我国自由式滑雪空中技巧运动备战索契冬奥会的成绩目标,并以此目标为训练依据,从培养运动员基本姿势的稳定性与快速准确交换重心能力,加强运动员上体、髋关节控制能力,熟练把握转弯时机与转弯节奏变化技术,提高拼板立刃刻雪、点杖、提杖技术等几个方面改进回转技术;同时提高运动员完成比赛动作的滑行速度、空中技术动作的难度与完成的质量,从而提高

  12. Personalized Search

    CERN Document Server

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

  13. Analytical Searching.

    Science.gov (United States)

    Pappas, Marjorie L.

    1995-01-01

    Discusses analytical searching, a process that enables searchers of electronic resources to develop a planned strategy by combining words or phrases with Boolean operators. Defines simple and complex searching, and describes search strategies developed with Boolean logic and truncation. Provides guidelines for teaching students analytical…

  14. Faceted Search

    CERN Document Server

    Tunkelang, Daniel

    2009-01-01

    We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

  15. Are search committees really searching?

    Science.gov (United States)

    Hoffmeir, Patricia A

    2003-02-01

    Academic chair searches are admittedly a labor-intensive process, but they are made more difficult and often lead to less-than-optimal outcomes because search committees spend their time "advertising," "looking," but not truly searching for academic chairs. At the onset, certain "realities" must be acknowledged, including (1) understanding that unless your organization is renowned in the specialty for which you are conducting the search, candidates won't be pounding at your door for a job, (2) searches that fail to include an overall assessment of the department in question are likely to miss the mark, (3) chairs must have demonstrated not only clinical expertise but also business savvy, (4) the best candidate is not necessarily someone who is already a department chair, (5) when it comes to chair searches, it's a buyer's market, and (6) the search process is inextricably linked to the success of the search. Key to the process of conducting an academic chair search are the judicious formation of the search committee; committee members' willingness to do their homework, attend all committee meeting, and keep the committee's activities confidential; crafting, not revising, the current job description for the open chair position; interviewing viable candidates rather than all candidates and adhering to a coordinated interviewing process; and evaluating internal and external candidates according to the same parameters. PMID:12584089

  16. Analysis on the Effects of the Physical Ability Training on Land on the Improvement of the Result of Men's Short-distance Free-style Swimming%陆上基础体能训练方法对提高青年男子短距离自由泳成绩的研究

    Institute of Scientific and Technical Information of China (English)

    李鑫; 李刚; 潘立聪

    2011-01-01

    在基础体能训练中通过运用几项科学有效的训练内容进行针对性训练,提高身体体能方面的能力,即心率储备、耗氧储备、身体各部肌力比的能力等。在教练的指导下进行科学针对性训练,即固定的时间内完成固定的运动量,在固定的间隔时间里完成固定的运动强度,这样可以在一段时间里提高运动员的运动能力。通过数据证明陆上基础体能训练在提高青年男子短距离自由泳成绩上的作用。%Physical ability training is carrying on by selecting several simple sports events to find out the deficiencies of physical ability,which are the heart rate reserves,the oxygen reserves and the difference of the ratio muscle to weight on the every part of the body.Train scientifically under the guidance of coach,finish the fixed total amount of exercise in the fixed time and achieve the fixed exercise intension in the fixed interval.In this way,we can improve our athletics ability in a period of time.Through the data we can prove that the effects of basic physical training on land on the improvement of the result of young men's short-distance free-style swimming.

  17. Internet Search Engines

    OpenAIRE

    Fatmaa El Zahraa Mohamed Abdou

    2004-01-01

    A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

  18. Internet Search Engines

    Directory of Open Access Journals (Sweden)

    Fatmaa El Zahraa Mohamed Abdou

    2004-09-01

    Full Text Available A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

  19. Quantum search followed by classical search versus quantum search alone

    OpenAIRE

    Sousa, P. R. M.; Mendes, F. V.; Ramos, R. V.

    2015-01-01

    In this work, we show that the usage of a quantum gate that gives extra information about the solution searched permits to improve the performance of the search algorithm by switching from quantum to classical search in the appropriated moment. A comparison to the case where only quantum search is used is also realized.

  20. Improved Scatter Search Using Cuckoo Search

    OpenAIRE

    Ahmed T.Sadiq Al-Obaidi

    2013-01-01

    The Scatter Search (SS) is a deterministic strategy that has been applied successfully to some combinatorial and continuous optimization problems. Cuckoo Search (CS) is heuristic search algorithm which is inspired by the reproduction strategy of cuckoos. This paper presents enhanced scatter search algorithm using CS algorithm. The improvement provides Scatter Search with random exploration for search space of problem and more of diversity and intensification for promising solutions. The origi...

  1. Search for $\

    CERN Document Server

    Astier, Pierre; Baldisseri, Alberto; Baldo-Ceolin, Massimilla; Banner, M; Bassompierre, Gabriel; Benslama, K; Besson, N; Bird, I; Blumenfeld, B; Bobisut, F; Bouchez, J; Boyd, S; Bueno, A G; Bunyatov, S; Camilleri, L L; Cardini, A; Cattaneo, Paolo Walter; Cavasinni, V; Cervera-Villanueva, A; Challis, R C; Chukanov, A; Collazuol, G; Conforto, G; Conta, C; Contalbrigo, M; Cousins, R; Daniels, D; Degaudenzi, H M; Del Prete, T; De Santo, A; Dignan, T; Di Lella, L; do Couto e Silva, E; Dumarchez, J; Ellis, M; Feldman, G J; Ferrari, R; Ferrère, D; Flaminio, Vincenzo; Fraternali, M; Gaillard, J M; Gangler, E; Geiser, A; Geppert, D; Gibin, D; Gninenko, S N; Godley, A; Gómez-Cadenas, J J; Gosset, J; Gössling, C; Gouanère, M; Grant, A; Graziani, G; Guglielmi, A M; Hagner, C; Hernando, J A; Hubbard, D B; Hurst, P; Hyett, N; Iacopini, E; Joseph, C L; Juget, F R; Kent, N; Kirsanov, M M; Klimov, O; Kokkonen, J; Kovzelev, A; Krasnoperov, A V; Kustov, D; Lacaprara, S; Lachaud, C; Lakic, B; Lanza, A; La Rotonda, L; Laveder, M; Letessier-Selvon, A A; Lévy, J M; Linssen, Lucie; Ljubicic, A; Long, J; Lupi, A; Marchionni, A; Martelli, F; Méchain, X; Mendiburu, J P; Meyer, J P; Mezzetto, Mauro; Mishra, S R; Moorhead, G F; Naumov, D V; Nédélec, P; Nefedov, Yu A; Nguyen-Mau, C; Orestano, D; Pastore, F; Peak, L S; Pennacchio, E; Pessard, H; Petti, R; Placci, A; Polesello, G; Pollmann, D; Polyarush, A Yu; Popov, B; Poulsen, C; Rebuffi, L; Renò, R; Rico, J; Riemann, P; Roda, C; Rubbia, André; Salvatore, F; Schahmaneche, K; Schmidt, B; Schmidt, T; Sconza, A; Sevior, M E; Sillou, D; Soler, F J P; Sozzi, G; Steele, D; Stiegler, U; Stipcevic, M; Stolarczyk, T; Tareb-Reyes, M; Taylor, G; Tereshchenko, V V; Toropin, A N; Touchard, A M; Tovey, Stuart N; Tran, M T; Tsesmelis, E; Ulrichs, J; Vacavant, L; Valdata-Nappi, M; Valuev, V Y; Vannucci, François; Varvell, K E; Veltri, M; Vercesi, V; Vidal-Sitjes, G; Vieira, J M; Vinogradova, T G; Weber, F V; Weisse, T; Wilson, F F; Winton, L J; Yabsley, B D; Zaccone, Henri; Zuber, K; Zuccon, P

    2001-01-01

    We present the results of a search for nu(mu)-->nu(e) oscillations in the NOMAD experiment at CERN. The experiment looked for the appearance of nu(e) in a predominantly nu(mu) wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are delta m^2 10 eV^2.

  2. Search for $\

    CERN Document Server

    Astier, Pierre; Baldisseri, Alberto; Baldo-Ceolin, Massimilla; Banner, M; Bassompierre, Gabriel; Benslama, K; Besson, N; Bird, I; Blumenfeld, B; Bobisut, F; Bouchez, J; Boyd, S; Bueno, A G; Bunyatov, S A; Camilleri, L L; Cardini, A; Cattaneo, Paolo Walter; Cavasinni, V; Cervera-Villanueva, A; Challis, R C; Chukanov, A; Collazuol, G; Conforto, G; Conta, C; Contalbrigo, M; Cousins, R D; Daniels, D; De Santo, A; Degaudenzi, H M; Del Prete, T; Di Lella, L; Dignan, T; Dumarchez, J; Feldman, G J; Ferrari, A; Ferrari, R; Ferrère, D; Flaminio, Vincenzo; Fraternali, M; Gaillard, J M; Gangler, E; Geiser, A; Geppert, D; Gibin, D; Gninenko, S N; Godley, A; Gosset, J; Gouanère, M; Grant, A; Graziani, G; Guglielmi, A M; Gómez-Cadenas, J J; Gössling, C; Hagner, C; Hernando, J; Hong, T M; Hubbard, D B; Hurst, P; Hyett, N; Iacopini, E; Joseph, C L; Juget, F R; Kent, N; Kirsanov, M M; Klimov, O; Kokkonen, J; Kovzelev, A; Krasnoperov, A V; Kustov, D; La Rotonda, L; Lacaprara, S; Lachaud, C; Lakic, B; Lanza, A; Laveder, M; Letessier-Selvon, A A; Linssen, Lucie; Ljubicic, A; Long, J; Lupi, A; Lévy, J M; Marchionni, A; Martelli, F; Mendiburu, J P; Meyer, J P; Mezzetto, Mauro; Mishra, S R; Moorhead, G F; Méchain, X; Naumov, D V; Nefedov, Yu A; Nguyen-Mau, C; Nédélec, P; Orestano, D; Pastore, F; Peak, L S; Pennacchio, E; Pessard, H; Petti, R; Placci, A; Polesello, G; Pollmann, D; Polyarush, A Yu; Popov, B; Poulsen, C; Rebuffi, L; Renò, R; Rico, J; Riemann, P; Roda, C; Rubbia, André; Salvatore, F; Schahmaneche, K; Schmidt, B; Schmidt, T; Sconza, A; Sevior, M E; Shih, D; Sillou, D; Soler, F J P; Sozzi, G; Steele, D; Stiegler, U; Stipcevic, M; Stolarczyk, T; Tareb-Reyes, M; Taylor, G N; Tereshchenko, V V; Toropin, A N; Touchard, A M; Tovey, Stuart N; Tran, M T; Tsesmelis, E; Ulrichs, J; Vacavant, L; Valdata-Nappi, M; Valuev, V Yu; Vannucci, François; Varvell, K E; Veltri, M; Vercesi, V; Vidal-Sitjes, G; Vieira, J M; Vinogradova, T G; Weber, F V; Weisse, T; Wilson, F F; Winton, L J; Yabsley, B D; Zaccone, Henri; Zuber, K; Zuccon, P; do Couto e Silva, E

    2003-01-01

    We present the results of a search for nu_mu → nu_e oscillations in the NOMAD experiment at Cern. The experiment looked for the appearance of nu_e in a predominantly nu_mu wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are Delta m^2 ~ 10 eV^2.

  3. Autonomous Search

    CERN Document Server

    Hamadi, Youssef; Saubion, Frédéric

    2012-01-01

    Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners. Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the

  4. Web Search Engines: Search Syntax and Features.

    Science.gov (United States)

    Ojala, Marydee

    2002-01-01

    Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)

  5. Improved Scatter Search Using Cuckoo Search

    Directory of Open Access Journals (Sweden)

    Ahmed T.Sadiq Al-Obaidi

    2013-02-01

    Full Text Available The Scatter Search (SS is a deterministic strategy that has been applied successfully to some combinatorial and continuous optimization problems. Cuckoo Search (CS is heuristic search algorithm which is inspired by the reproduction strategy of cuckoos. This paper presents enhanced scatter search algorithm using CS algorithm. The improvement provides Scatter Search with random exploration for search space of problem and more of diversity and intensification for promising solutions. The original and improved Scatter Search has been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the improved Scatter Search algorithms produce better performance than original Scatter Search algorithm. The improvement in the value of average fitness is 23.2% comparing with original SS. The developed algorithm has been compared with other algorithms for the same problem, and the result was competitive with some algorithm and insufficient with another.

  6. The effect of swimsuit resistance on freestyle swimming race time.

    OpenAIRE

    Webb, A.P.; Taunton, D.J.; Hudson, D.A.; Forrester, A.I.J.; Turnock, S.R.

    2014-01-01

    It is known that swimming equipment (suit, cap and goggles) can affect the total resistance of a swimmer, and therefore impact the resulting swimming speed and race time. After the 2009 swimming world championships (WC) the international swimming federation (FINA) banned a specific type of full body suit, which resulted in an increase in race times for subsequent WC events. This study proposes that the 2009 suits provided a reduction in swimming resistance and aims to quantify this resistance...

  7. Faceted Semantic Search for Personalized Social Search

    OpenAIRE

    Mas, Massimiliano Dal

    2012-01-01

    Actual social networks (like Facebook, Twitter, Linkedin, ...) need to deal with vagueness on ontological indeterminacy. In this paper is analyzed the prototyping of a faceted semantic search for personalized social search using the "joint meaning" in a community environment. User researches in a "collaborative" environment defined by folksonomies can be supported by the most common features on the faceted semantic search. A solution for the context-aware personalized search is based on "join...

  8. Search Engine Marketing a Search Engine Optimization

    OpenAIRE

    Šmidrkal, Jan

    2012-01-01

    Thesis is monitoring general status in promoting of web pages, area of internet marketing a in internet search engines. It is examining dissect current tendencies in area of internet pages optimization for search engines and way of paid promotion in search engines especially in PPC systems. In theoretical part is focusing on effect of particular factors and methods of optimization on final position of pages in Search engines result page and summary of possibilities of paid promotion by the he...

  9. Internet search. Types of search engines

    OpenAIRE

    Kralina, Anna Sergeevna

    2010-01-01

    For effective search in the Internet it is necessary to know: what types of search machines exist. First form a machine with classified lists of resources. The second type consists of machines that use queries about the resource. The third type of search machines consists of machines-catalogs. The fourth type is represented by meta-machines.

  10. Tabu Search Based Strategies for Conformational Search

    Science.gov (United States)

    Stepanenko, Svetlana; Engels, Bernd

    2009-09-01

    This paper presents an application of the new nonlinear global optimization routine gradient only tabu search (GOTS) to conformational search problems. It is based on the tabu search strategy which tries to determine the global minimum of a function by the steepest descent-modest ascent strategy. The refinement of ranking procedure of the original GOTS method and the exploitation of simulated annealing elements are described, and the modifications of the GOTS algorithm necessary to adopt it to conformation searches are explained. The utility of the GOTS for conformational search problems is tested using various examples.

  11. Sound Search Engine Concept

    DEFF Research Database (Denmark)

    2006-01-01

    Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...

  12. Recommending search experiences

    OpenAIRE

    Saaya, Zurina; Smyth, Barry; Coyle, Maurice; Briggs, Peter

    2011-01-01

    In this paper we focus on a multi-case case-based reasoning system to support users during collaborative search tasks. In particular we describe how repositories of search experiences/knowledge can be recommended to users at search time. These recommendations are evaluated using real-world search data.

  13. Web Search Engines

    OpenAIRE

    Rajashekar, TB

    1998-01-01

    The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

  14. How doctors search

    DEFF Research Database (Denmark)

    Lykke, Marianne; Price, Susan; Delcambre, Lois

    2012-01-01

    context-specific aspects of the main topic of the documents. We have tested the model in an interactive searching study with family doctors with the purpose to explore doctors’ querying behaviour, how they applied the means for specifying a search, and how these features contributed to the search outcome....... In general, the doctors were capable of exploiting system features and search tactics during the searching. Most searchers produced well-structured queries that contained appropriate search facets. When searches failed it was not due to query structure or query length. Failures were mostly caused by...

  15. Large Neighborhood Search

    DEFF Research Database (Denmark)

    Pisinger, David; Røpke, Stefan

    2010-01-01

    Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...... search....

  16. Collaborative Search Trails for Video Search

    OpenAIRE

    Hopfgartner, Frank; Vallet, David; Halvey, Martin; Jose, Joemon

    2009-01-01

    In this paper we present an approach for supporting users in the difficult task of searching for video. We use collaborative feedback mined from the interactions of earlier users of a video search system to help users in their current search tasks. Our objective is to improve the quality of the results that users find, and in doing so also assist users to explore a large and complex information space. It is hoped that this will lead to them considering search options that they may not have co...

  17. Search for neutral leptons

    International Nuclear Information System (INIS)

    At present we know of three kinds of neutral leptons: the electron neutrino, the muon neutrino, and the tau neutrino. This paper reviews the search for additional neutral leptons. The method and significance of a search depends upon the model used for the neutral lepton being sought. Some models for the properties and decay modes of proposed neutral leptons are described. Past and present searches are reviewed. The limits obtained by some completed searches are given, and the methods of searches in progress are described. Future searches are discussed. 41 references

  18. Searching Online for 'Hemorrhoids'?

    Science.gov (United States)

    ... For Consumers Home For Consumers Consumer Updates Searching Online for 'Hemorrhoids'? Share Tweet Linkedin Pin it More ... he believes most people would rather search anonymously online for information about hemorrhoids than ask their doctors, ...

  19. Integrated vs. Federated Search

    DEFF Research Database (Denmark)

    Løvschall, Kasper

    2009-01-01

    Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009.......Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009....

  20. Search engine credibility

    OpenAIRE

    2005-01-01

    While search engines have become increasingly popular over the past years, little research is concerned with how they attend to credibility. Through interviews with six Norwegian search engine companies; this study reveals how search engines attend to areas affecting credibility. Search engines appear focused towards areas affecting credibility, yet their understanding of online credibility appears to be low. The study then compares the findings with a previous study of how users assess credi...

  1. Search Based Software Engineering

    OpenAIRE

    Jaspreet Bedi; Kuljit Kaur

    2014-01-01

    This paper reviews the search based software engineering research and finds the major milestones in this direction. The SBSE approach has been the topic of several surveys and reviews. Search Based Software Engineering (SBSE) consists of the application of search-based optimization to software engineering. Using SBSE, a software engineering task is formulated as a search problem by defining a suitable candidate solution representation and a fitness function to differentiate be...

  2. Searching Databases with Keywords

    Institute of Scientific and Technical Information of China (English)

    Shan Wang; Kun-Long Zhang

    2005-01-01

    Traditionally, SQL query language is used to search the data in databases. However, it is inappropriate for end-users, since it is complex and hard to learn. It is the need of end-user, searching in databases with keywords, like in web search engines. This paper presents a survey of work on keyword search in databases. It also includes a brief introduction to the SEEKER system which has been developed.

  3. Tales from the Field: Search Strategies Applied in Web Searching

    OpenAIRE

    Soohyung Joo; Iris Xie

    2010-01-01

    In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on...

  4. Book Review: Web Search-Public Searching of the Web

    OpenAIRE

    Yazdan Mansourian

    2004-01-01

    The book consists of four sections including (1) the context of web search, (2) how people search the web, (3) subjects of web search and (4) conclusion: trends and future directions. The first section includes three chapters addressing a brief but informative introduction about the main involved elements of web search process and web search research including search engines mechanism, human computer interaction in web searching and research design in web search studies.

  5. Where and how to search? Search paths in open innovation

    OpenAIRE

    Lopez-Vega, Henry; Tell, Fredrik; VANHAVERBEKE, Wim

    2015-01-01

    Search for external knowledge is vital for firms' innovative activities. To understand search, we propose two knowledge search dimensions: search space (local or distant) and search heuristics (experiential or cognitive). Combining these two dimensions, we distinguish four search paths - situated paths, analogical paths, sophisticated paths, and scientific paths - which respond to recent calls to move beyond "where to search" and to investigate the connection with "how to search." Also, we hi...

  6. University Students' Online Information Searching Strategies in Different Search Contexts

    Science.gov (United States)

    Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung

    2012-01-01

    This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…

  7. Keyword Search in Databases

    CERN Document Server

    Yu, Jeffrey Xu; Chang, Lijun

    2009-01-01

    It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from

  8. Faceted Semantic Search for Personalized Social Search

    CERN Document Server

    Mas, Massimiliano Dal

    2012-01-01

    Actual social networks (like Facebook, Twitter, Linkedin, ...) need to deal with vagueness on ontological indeterminacy. In this paper is analyzed the prototyping of a faceted semantic search for personalized social search using the "joint meaning" in a community environment. User researches in a "collaborative" environment defined by folksonomies can be supported by the most common features on the faceted semantic search. A solution for the context-aware personalized search is based on "joint meaning" understood as a joint construal of the creators of the contents and the user of the contents using the faced taxonomy with the Semantic Web. A proof-of concept prototype shows how the proposed methodological approach can also be applied to existing presentation components, built with different languages and/or component technologies.

  9. Collaborative Search Trails for Video Search

    CERN Document Server

    Hopfgartner, Frank; Halvey, Martin; Jose, Joemon

    2009-01-01

    In this paper we present an approach for supporting users in the difficult task of searching for video. We use collaborative feedback mined from the interactions of earlier users of a video search system to help users in their current search tasks. Our objective is to improve the quality of the results that users find, and in doing so also assist users to explore a large and complex information space. It is hoped that this will lead to them considering search options that they may not have considered otherwise. We performed a user centred evaluation. The results of our evaluation indicate that we achieved our goals, the performance of the users in finding relevant video clips was enhanced with our system; users were able to explore the collection of video clips more and users demonstrated a preference for our system that provided recommendations.

  10. Memory support for desktop search

    OpenAIRE

    Chen, Yi; Kelly, Liadh; Jones, Gareth J.F.

    2010-01-01

    The user's memory plays a very important role in desktop search. A search query with insufficiently or inaccurately recalled information may make the search dramatically less effective. In this paper, we discuss three approaches to support user’s memory during desktop search. These include extended types of well remembered search options, the use of past search queries and results, and search from similar items. We will also introduce our search system which incorporates these featur...

  11. Search Engine Optimization and Search Engine Marketing

    OpenAIRE

    Stárek, Pavel

    2012-01-01

    This thesis addresses website optimization for search engines and their promotion through PPC ads. The theoretical part describes all of the important aspects and principles necessary for a correct optimization and combines them with principles related to search engine marketing. The practical part describes the whole process of optimization from the analysis of competition and link-building to the set up and evaluation of PPC ads. It is trying to find any important differences between the tw...

  12. INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

    OpenAIRE

    Fadhilah Mat Yamin; RAMAYAH, T.

    2013-01-01

    The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...

  13. Hybrid Search: Effectively Combining Keywords and Semantic Searches

    OpenAIRE

    Bhagdev, R.; S. Chapman; Ciravegna, F.; Lanfranchi, V.; Petrelli, D.

    2008-01-01

    This paper describes hybrid search, a search method supporting both document and knowledge retrieval via the flexible combination of ontologybased search and keyword-based matching. Hybrid search smoothly copes with lack of semantic coverage of document content, which is one of the main limitations of current semantic search methods. In this paper we define hybrid search formally, discuss its compatibility with the current semantic trends and present a reference implementation: K-Search. W...

  14. Adaptive Large Neighbourhood Search

    DEFF Research Database (Denmark)

    Røpke, Stefan

    Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution. This...... tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers that...

  15. Mobile Search and Advertising

    OpenAIRE

    Lovitskii, Vladimir; McCaffery, Colin; Thrasher, Michael; Traynor, David; Wright, Peter

    2009-01-01

    Mobile advertising is a rapidly growing sector providing brands and marketing agencies the opportunity to connect with consumers beyond traditional and digital media and instead communicate directly on their mobile phones. Mobile advertising will be intrinsically linked with mobile search, which has transported from the internet to the mobile and is identified as an area of potential growth. The result of mobile searching show that as a general rule such search result exceed 1...

  16. Federated Search Scalability

    OpenAIRE

    Txurruka Alberdi, Beñat

    2015-01-01

    The search of images on the internet has become a natural process for the internet surfer. Most of the search engines use complex algorithms to look up for images but their metadata is mostly ignored, in part because many image hosting sites remove metadata when the image is uploaded. The JPSearch standard has been developed to handle interoperability in metadata based searches, but it seems that the market is not interested on supporting it. The starting point of this proje...

  17. Approximate similarity search

    OpenAIRE

    Amato, Giuseppe

    2000-01-01

    Similarity searching is fundamental in various application areas. Recently it has attracted much attention in the database community because of the growing need to deal with large volume of data. Consequently, efficiency has become a matter of concern in design. Although much has been done to develop structures able to perform fast similarity search, results are still not satisfactory, and more research is needed. The performance of similarity search for complex features deteriorates and does...

  18. ElasticSearch cookbook

    CERN Document Server

    Paro, Alberto

    2013-01-01

    Written in an engaging, easy-to-follow style, the recipes will help you to extend the capabilities of ElasticSearch to manage your data effectively.If you are a developer who implements ElasticSearch in your web applications, manage data, or have decided to start using ElasticSearch, this book is ideal for you. This book assumes that you've got working knowledge of JSON and Java

  19. Mastering ElasticSearch

    CERN Document Server

    Kuc, Rafal

    2013-01-01

    A practical tutorial that covers the difficult design, implementation, and management of search solutions.Mastering ElasticSearch is aimed at to intermediate users who want to extend their knowledge about ElasticSearch. The topics that are described in the book are detailed, but we assume that you already know the basics, like the query DSL or data indexing. Advanced users will also find this book useful, as the examples are getting deep into the internals where it is needed.

  20. Supporting complex search tasks

    DEFF Research Database (Denmark)

    Gäde, Maria; Hall, Mark; Huurdeman, Hugo;

    2015-01-01

    fragmented at best. The workshop addressed the many open research questions: What are the obvious use cases and applications of complex search? What are essential features of work tasks and search tasks to take into account? And how do these evolve over time? With a multitude of information, varying from...... introductory to specialized, and from authoritative to speculative or opinionated, when to show what sources of information? How does the information seeking process evolve and what are relevant differences between different stages? With complex task and search process management, blending searching, browsing...

  1. Google Power Search

    CERN Document Server

    Spencer, Stephan

    2011-01-01

    Behind Google's deceptively simple interface is immense power for both market and competitive research-if you know how to use it well. Sure, basic searches are easy, but complex searches require specialized skills. This concise book takes you through the full range of Google's powerful search-refinement features, so you can quickly find the specific information you need. Learn techniques ranging from simple Boolean logic to URL parameters and other advanced tools, and see how they're applied to real-world market research examples. Incorporate advanced search operators such as filetype:, intit

  2. Consumer Search on the Internet

    OpenAIRE

    Babur De los Santos

    2008-01-01

    This paper uses consumer search data to explain search frictions in online markets, within the context of an equilibrium search model. I use a novel dataset of consumer online browsing and purchasing behavior, which tracks all consumer search prior to each transaction. Using observed search intensities from the online book industry, I estimate search cost distributions that allow for asymmetric consumer sampling. Research on consumer search often assumes a symmetric sampling rule for analytic...

  3. How Users Search the Library from a Single Search Box

    Science.gov (United States)

    Lown, Cory; Sierra, Tito; Boyer, Josh

    2013-01-01

    Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…

  4. Efficiency of local search

    NARCIS (Netherlands)

    Brueggemann, Tobias

    2006-01-01

    Local search heuristics are an important class of algorithms for obtaining good solutions for hard combinatorial optimization problems. Important issues for these heuristics are solution quality and the time needed to obtain a good solution. Roughly speaking, a local search heuristic starts with an

  5. With News Search Engines

    Science.gov (United States)

    Gunn, Holly

    2005-01-01

    Although there are many news search engines on the Web, finding the news items one wants can be challenging. Choosing appropriate search terms is one of the biggest challenges. Unless one has seen the article that one is seeking, it is often difficult to select words that were used in the headline or text of the article. The limited archives of…

  6. Fixing Dataset Search

    Science.gov (United States)

    Lynnes, Chris

    2014-01-01

    Three current search engines are queried for ozone data at the GES DISC. The results range from sub-optimal to counter-intuitive. We propose a method to fix dataset search by implementing a robust relevancy ranking scheme. The relevancy ranking scheme is based on several heuristics culled from more than 20 years of helping users select datasets.

  7. Search on Rugged Landscapes

    DEFF Research Database (Denmark)

    Billinger, Stephan; Stieglitz, Nils; Schumacher, Terry

    2014-01-01

    This paper presents findings from a laboratory experiment on human decision-making in a complex combinatorial task. We find strong evidence for a behavioral model of adaptive search. Success narrows down search to the neighborhood of the status quo, while failure promotes gradually more explorati...

  8. Distributed deep web search

    NARCIS (Netherlands)

    Tjin-Kam-Jet, Kien-Tsoi Theodorus Egbert

    2013-01-01

    The World Wide Web contains billions of documents (and counting); hence, it is likely that some document will contain the answer or content you are searching for. While major search engines like Bing and Google often manage to return relevant results to your query, there are plenty of situations in

  9. ElasticSearch cookbook

    CERN Document Server

    Paro, Alberto

    2015-01-01

    If you are a developer who implements ElasticSearch in your web applications and want to sharpen your understanding of the core elements and applications, this is the book for you. It is assumed that you've got working knowledge of JSON and, if you want to extend ElasticSearch, of Java and related technologies.

  10. Finding solution by Tabu search

    Directory of Open Access Journals (Sweden)

    Ratanamanee, W.

    2003-11-01

    Full Text Available In this paper, the method of finding the solution by Tabu search is addressed. Tabu search is one of the local search heuristics, which has been applied extensively in operations research works. In this paper, the basic concepts of the Tabu search heuristic and some examples of applying this search technique in operations research problems are presented.

  11. Custom Search Engines: Tools & Tips

    Science.gov (United States)

    Notess, Greg R.

    2008-01-01

    Few have the resources to build a Google or Yahoo! from scratch. Yet anyone can build a search engine based on a subset of the large search engines' databases. Use Google Custom Search Engine or Yahoo! Search Builder or any of the other similar programs to create a vertical search engine targeting sites of interest to users. The basic steps to…

  12. Search and Disrupt

    DEFF Research Database (Denmark)

    Ørding Olsen, Anders

    This paper analyzes how external search is affected by strategic interest alignment among knowledge sources. I focus on misalignment arising from the heterogeneous effects of disruptive technologies by analyzing the influence of incumbents on 2,855 non-incumbents? external knowledge search efforts....... The efforts most likely to solve innovation problems obtained funding from the European Commission?s 7th Framework Program (2007-2013). The results show that involving incumbents improves search in complementary technologies, while demoting it when strategic interests are misaligned in disruptive...... technologies. However, incumbent sources engaged in capability reconfiguration to accommodate disruption improve search efforts in disruptive technologies. The paper concludes that the value of external sources is contingent on more than their knowledge. Specifically, interdependence of sources in search gives...

  13. Model Specification Searches in Structural Equation Modeling Using Tabu Search.

    Science.gov (United States)

    Marcoulides, George A.; Drezner, Zvi; Schumacker, Randall E.

    1998-01-01

    Introduces an alternative structural equation modeling (SEM) specification search approach based on the Tabu search procedure. Using data with known structure, the procedure is illustrated, and its capabilities for specification searches in SEM are demonstrated. (Author/SLD)

  14. [Advanced online search techniques and dedicated search engines for physicians].

    Science.gov (United States)

    Nahum, Yoav

    2008-02-01

    In recent years search engines have become an essential tool in the work of physicians. This article will review advanced search techniques from the world of information specialists, as well as some advanced search engine operators that may help physicians improve their online search capabilities, and maximize the yield of their searches. This article also reviews popular dedicated scientific and biomedical literature search engines. PMID:18357673

  15. INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

    Directory of Open Access Journals (Sweden)

    Fadhilah Mat Yamin

    2013-06-01

    Full Text Available The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utilizing different types of queries. These queries are then classified as breadth and depth search query.

  16. Quantum searching application in search based software engineering

    Science.gov (United States)

    Wu, Nan; Song, FangMin; Li, Xiangdong

    2013-05-01

    The Search Based Software Engineering (SBSE) is widely used in software engineering for identifying optimal solutions. However, there is no polynomial-time complexity solution used in the traditional algorithms for SBSE, and that causes the cost very high. In this paper, we analyze and compare several quantum search algorithms that could be applied for SBSE: quantum adiabatic evolution searching algorithm, fixed-point quantum search (FPQS), quantum walks, and a rapid modified Grover quantum searching method. The Grover's algorithm is thought as the best choice for a large-scaled unstructured data searching and theoretically it can be applicable to any search-space structure and any type of searching problems.

  17. Axion Searches, Old and New

    CERN Document Server

    CERN. Geneva

    2005-01-01

    Outline of the lecture: Constraints from laboratory searches and astrophysics, axion cosmology, the cavity detector of dark matter axions, solar axion searches, laser experiments, a telescope search, macroscopic forces mediated by axions.

  18. Skewed Binary Search Trees

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Moruz, Gabriel

    2006-01-01

    It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees. For...... all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

  19. Myanmar Language Search Engine

    Directory of Open Access Journals (Sweden)

    Pann Yu Mon

    2011-03-01

    Full Text Available With the enormous growth of the World Wide Web, search engines play a critical role in retrieving information from the borderless Web. Although many search engines are available for the major languages, but they are not much proficient for the less computerized languages including Myanmar. The main reason is that those search engines are not considering the specific features of those languages. A search engine which capable of searching the Web documents written in those languages is highly needed, especially when more and more Web sites are coming up with localized content in multiple languages. In this study, the design and the architecture of language specific search engine for Myanmar language is proposed. The main feature of the system are, (1 it can search the multiple encodings of the Myanmar Web page, (2 the system is designed to comply with the specific features of the Myanmar language. Finally the experiment has been done to prove whether it meets the design requirements.

  20. SEARCH ENGINE OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Jakub Zilincan

    2015-09-01

    Full Text Available Search engine optimization techniques, often shortened to “SEO,” should lead to first positions in organic search results. Some optimization techniques do not change over time, yet still form the basis for SEO. However, as the Internet and web design evolves dynamically, new optimization techniques flourish and flop. Thus, we looked at the most important factors that can help to improve positioning in search results. It is important to emphasize that none of the techniques can guarantee high ranking because search engines have sophisticated algorithms, which measure the quality of webpages and derive their position in search results from it. Next, we introduced and examined the object of the optimization, which is a particular website. This web site was created for the sole purpose of implementing and testing all the main SEO techniques. The main objective of this article was to determine whether search engine optimization increases ranking of website in search results and subsequently leads to higher traffic. This research question is supported by testing and verification of results. The last part of our article concludes the research results and proposes further recommendations.

  1. Search features of digital libraries

    OpenAIRE

    Smith, Alastair G.

    2000-01-01

    Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc). This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital li...

  2. Optimal Search with Costly Recall

    OpenAIRE

    Janssen, Maarten; Parakhonyak, Alexei

    2007-01-01

    textabstractThis paper builds a consumer search model where the cost of going back to stores already searched is explicitly taken into account. We show that the optimal search rule under costly recall is very different from the optimal search rule under perfect recall. Under costly recall, the optimal search behaviour is nonstationary and, moreover, the reservation price is not independent of previously sampled prices. We fully characterize the optimal search rule under costly recall when a f...

  3. Searching low and high

    DEFF Research Database (Denmark)

    Laursen, Keld; Salter, Ammon

    2003-01-01

    .The results suggest that firms who adopt `open' search strategies and invest in R&D are morelikely than other firms to draw from universities, indicating that managerial choice matters inshaping the propensity of firms to draw from universities.Key words: University-industry links, innovation, external search......AbstractThis paper examines the factors that influence whether firms draw from universities in theirinnovative activities. The link between the universities and industrial innovation, and the role ofdifferent search strategies in influencing the propensity of firms to use universities is explored...... strategiesJEL Codes: C25, C42, O31, O32...

  4. Gradient tabu search.

    Science.gov (United States)

    Stepanenko, Svetlana; Engels, Bernd

    2007-01-30

    This paper presents a modification of the tabu search called gradient tabu search (GTS). It uses analytical gradients for a fast minimization to the next local minimum and analytical diagonal elements of the Hessian to escape local minima. For an efficient blocking of already visited areas tabu regions and tabu directions are introduced into the tabu list (TL). Trials with various well-known test functions indicate that the GTS is a very promising approach to determine local and global minima of differentiable functions. Possible application areas could be optimization routines for force field parameters or conformational searches for large molecules. PMID:17186482

  5. Improving Search Engine Reliability

    Science.gov (United States)

    Pruthi, Jyoti; Kumar, Ela

    2010-11-01

    Search engines on the Internet are used daily to access and find information. While these services are providing an easy way to find information globally, they are also suffering from artificially created false results. This paper describes two techniques that are being used to manipulate the search engines: spam pages (used to achieve higher rankings on the result page) and cloaking (used to feed falsified data into search engines). This paper also describes two proposed methods to fight this kind of misuse, algorithms for both of the formerly mentioned cases of spamdexing.

  6. ElasticSearch server

    CERN Document Server

    Rogozinski, Marek

    2014-01-01

    This book is a detailed, practical, hands-on guide packed with real-life scenarios and examples which will show you how to implement an ElasticSearch search engine on your own websites.If you are a web developer or a user who wants to learn more about ElasticSearch, then this is the book for you. You do not need to know anything about ElastiSeach, Java, or Apache Lucene in order to use this book, though basic knowledge about databases and queries is required.

  7. Web searching, search engines and Information Retrieval

    OpenAIRE

    Lewandowski, Dirk

    2005-01-01

    This article discusses Web search engines; mainly the challenges in indexing the World Wide Web, the user behaviour, and the ranking factors used by these engines. Ranking factors are divided into query-dependent and query-independent factors, the latter of which have become more and more important within recent years. The possibilities of these factors are limited, mainly of those that are based on the widely used link popularity measures. The article concludes with an overview of factors th...

  8. Collaboration during visual search.

    Science.gov (United States)

    Malcolmson, Kelly A; Reynolds, Michael G; Smilek, Daniel

    2007-08-01

    Two experiments examine how collaboration influences visual search performance. Working with a partner or on their own, participants reported whether a target was present or absent in briefly presented search displays. We compared the search performance of individuals working together (collaborative pairs) with the pooled responses of the individuals working alone (nominal pairs). Collaborative pairs were less likely than nominal pairs to correctly detect a target and they were less likely to make false alarms. Signal detection analyses revealed that collaborative pairs were more sensitive to the presence of the target and had a more conservative response bias than the nominal pairs. This pattern was observed even when the presence of another individual was matched across pairs. The results are discussed in the context of task-sharing, social loafing and current theories of visual search. PMID:17972737

  9. Search and Recommendation

    DEFF Research Database (Denmark)

    Bogers, Toine

    2014-01-01

    In just a little over half a century, the field of information retrieval has experienced spectacular growth and success, with IR applications such as search engines becoming a billion-dollar industry in the past decades. Recommender systems have seen an even more meteoric rise to success with wide......-scale application by companies like Amazon, Facebook, and Netflix. But are search and recommendation really two different fields of research that address different problems with different sets of algorithms in papers published at distinct conferences? In my talk, I want to argue that search and recommendation are...... more similar than they have been treated in the past decade. By looking more closely at the tasks and problems that search and recommendation try to solve, at the algorithms used to solve these problems and at the way their performance is evaluated, I want to show that there is no clear black and white...

  10. Automated search for supernovae

    Energy Technology Data Exchange (ETDEWEB)

    Kare, J.T.

    1984-11-15

    This thesis describes the design, development, and testing of a search system for supernovae, based on the use of current computer and detector technology. This search uses a computer-controlled telescope and charge coupled device (CCD) detector to collect images of hundreds of galaxies per night of observation, and a dedicated minicomputer to process these images in real time. The system is now collecting test images of up to several hundred fields per night, with a sensitivity corresponding to a limiting magnitude (visual) of 17. At full speed and sensitivity, the search will examine some 6000 galaxies every three nights, with a limiting magnitude of 18 or fainter, yielding roughly two supernovae per week (assuming one supernova per galaxy per 50 years) at 5 to 50 percent of maximum light. An additional 500 nearby galaxies will be searched every night, to locate about 10 supernovae per year at one or two percent of maximum light, within hours of the initial explosion.

  11. Searches for supersymmetry

    International Nuclear Information System (INIS)

    Recent searches for supersymmetric particles, particularly in e+e- interactions, are reviewed and compared. The mass domains experimentally excluded are turned into limits on the supersymmetry breaking parameters of a minimal N=1 supergravity model

  12. Transplant Center Search Form

    Science.gov (United States)

    ... Your Story Give Us Feedback - A + A Transplant Center Search Form Welcome to the Blood & Marrow Transplant ... centers for patients with a particular disease. Transplant Center login Username: * Password: * Request new password Join BMT ...

  13. Chemical Search Web Utility

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Chemical Search Web Utility is an intuitive web application that allows the public to easily find the chemical that they are interested in using, and which...

  14. Automated search for supernovae

    International Nuclear Information System (INIS)

    This thesis describes the design, development, and testing of a search system for supernovae, based on the use of current computer and detector technology. This search uses a computer-controlled telescope and charge coupled device (CCD) detector to collect images of hundreds of galaxies per night of observation, and a dedicated minicomputer to process these images in real time. The system is now collecting test images of up to several hundred fields per night, with a sensitivity corresponding to a limiting magnitude (visual) of 17. At full speed and sensitivity, the search will examine some 6000 galaxies every three nights, with a limiting magnitude of 18 or fainter, yielding roughly two supernovae per week (assuming one supernova per galaxy per 50 years) at 5 to 50 percent of maximum light. An additional 500 nearby galaxies will be searched every night, to locate about 10 supernovae per year at one or two percent of maximum light, within hours of the initial explosion

  15. Leptoquark searches in TESLA

    International Nuclear Information System (INIS)

    Leptoquark searches are considered for possible future e+e- and e±γ experiments at TESLA. Expected exclusion limits from direct leptoquark searches are compared with indirect limits expected from the contact interaction analysis. If the leptoquark signal suggested by the existing data is detected at LHC, with mass below 1 TeV, TESLA will be an ideal place to study its properties, provided that the leptoquark Yukawa coupling is not too small

  16. SUSY Searches in ATLAS

    CERN Document Server

    Zhuang, Xuai; The ATLAS collaboration

    2016-01-01

    Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles, with focus on those obtained using proton-proton collisions at a centre of mass energy of 13 TeV using 2015+2016 data. The searches with final states including jets, missing transverse momentum, light leptons will be presented.

  17. Search for glueballs

    International Nuclear Information System (INIS)

    In these Summer School lectures, the author reviews the results of recent glueball searches. He begins with a brief review of glueball phenomenology and meson spectroscopy, including a discussion of resonance behavior. The results on the fo(1500) and fJ(1700) resonances from proton-antiproton experiments and radiative J/Ψ decays are discussed. Finally, ππ and ηπ studies from Ds decays and exotic meson searches are reviewed. 46 refs., 40 figs

  18. Holdup, Search and Inefficiency

    OpenAIRE

    Shingo Ishiguro

    2007-01-01

    This paper investigates the holdup problem in the dynamic search market where buyers and sellers search for their trading partners and specific investments are made after match but before trade. We show that frictionless (competitive) market imposes severe limitations on attainable efficiencies: Markets with small friction make the holdup problem more serious than those with large friction because in any equilibrium, whether stationary or non-stationary, investment must be dropped down to the...

  19. Interactive Video Search

    OpenAIRE

    Schoeffmann, Klaus; Hopfgartner, Frank

    2015-01-01

    With an increasing amount of video data in our daily life, the need for content-based search in videos increases as well. Though a lot of research has been spent on video retrieval tools and methods which allow for automatic search in videos through content-based queries, still the performance of automatic video retrieval is far from optimal. In this tutorial we discussed (i) proposed solutions for improved video content navigation, (ii) typical interaction of content-based querying features,...

  20. Better searching through science.

    Science.gov (United States)

    Voss, D

    2001-09-14

    The explosive growth of the World Wide Web has produced frustration for researchers seeking quality content and pinpoint results among the noise and spam. Now, a handful of companies and academic researchers are working on a new breed of search engines to undo this second curse of Babel. These next-generation search tools will let scientists drill deeper into the billion-page Web. PMID:11557874

  1. SEARCH Project Delphi

    OpenAIRE

    Tanja Sinozic

    2012-01-01

    This paper describes a plan to implement the Delphi method to obtain consensus of expert opinions on policy statements derived from research evidence. The evidence is based on a three-year large-scale European Union (EU) research project ("SEARCH"). The SEARCH project focuses on trade, migration, innovation and institutional issues on relationships between the European Union (EU) and its neighbouring countries (NCs). The main objective of the use of Delphi in this context is to...

  2. Supersymmetry Searches in ATLAS

    CERN Document Server

    Romero Adam, Elena; The ATLAS collaboration

    2015-01-01

    Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures.

  3. Peppy: Proteogenomic Search Software

    OpenAIRE

    Risk, Brian A.; Spitzer, Wendy J; Giddings, Morgan C

    2013-01-01

    Proteogenomic searching is a useful method for identifying novel proteins, annotating genes and detecting peptides unique to an individual genome. The approach, however, can be laborious, as it often requires search segmentation and the use of several unintegrated tools. Furthermore, many proteogenomic efforts have been limited to small genomes, as large genomes can prove impractical due to the required amount of computer memory and computation time. We present Peppy, a software tool designed...

  4. Search engine optimization

    OpenAIRE

    Jež, Tomáš

    2012-01-01

    This diploma thesis deals with the analysis of optimizing websites for search engines (Search Engine Optimization – SEO), summarizes history and evolution in this area and describes current trends in the given topic. The practical part of the thesis consists of case study, which applies knowledge gained from the literal research to a practical example. It includes analysis of an existing company’s website and suggestions for a complex optimization strategy.

  5. Search and Disrupt

    OpenAIRE

    Ørding Olsen, Anders

    2015-01-01

    This paper analyzes how external search is affected by strategic interest alignment among knowledge sources. I focus on misalignment arising from the heterogeneous effects of disruptive technologies by analyzing the influence of incumbents on 2,855 non-incumbents? external knowledge search efforts. The efforts most likely to solve innovation problems obtained funding from the European Commission?s 7th Framework Program (2007-2013). The results show that involving incumbents improv...

  6. Searching for the Evidence

    OpenAIRE

    Parkhill, Anne

    2004-01-01

    Background: Chiropractic and Osteopathy are categorised within the family of Complementary and Alternative Medicine (CAM) by most indexers and database managers. CAM therapies can be difficult to search because relevant resources are spread over a number of databases. Objective: This paper aims to introduce basic searching skills for six databases which offer CAM literature. Methods: Six readily available databases which can be used by a busy clinician to remain informed about best practice w...

  7. SearchResultFinder: federated search made easy

    NARCIS (Netherlands)

    Trieschnigg, Dolf; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

    2013-01-01

    Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up dete

  8. Improved Search Techniques

    Science.gov (United States)

    Albornoz, Caleb Ronald

    2012-01-01

    Thousands of millions of documents are stored and updated daily in the World Wide Web. Most of the information is not efficiently organized to build knowledge from the stored data. Nowadays, search engines are mainly used by users who rely on their skills to look for the information needed. This paper presents different techniques search engine users can apply in Google Search to improve the relevancy of search results. According to the Pew Research Center, the average person spends eight hours a month searching for the right information. For instance, a company that employs 1000 employees wastes $2.5 million dollars on looking for nonexistent and/or not found information. The cost is very high because decisions are made based on the information that is readily available to use. Whenever the information necessary to formulate an argument is not available or found, poor decisions may be made and mistakes will be more likely to occur. Also, the survey indicates that only 56% of Google users feel confident with their current search skills. Moreover, just 76% of the information that is available on the Internet is accurate.

  9. Mastering Search Analytics Measuring SEO, SEM and Site Search

    CERN Document Server

    Chaters, Brent

    2011-01-01

    Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt

  10. Semantic Search: Reconciling Expressive Querying and Exploratory Search

    OpenAIRE

    Ferré, Sébastien; Hermann, Alice

    2011-01-01

    International audience Faceted search and querying are two well-known paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching RDF datasets, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, ...

  11. Quantum mechanism of Biological Search

    OpenAIRE

    Kwon, Younghun

    2006-01-01

    We wish to suggest an algorithm for biological search including DNA search. Our argument supposes that biological search be performed by quantum search.If we assume this, we can naturally answer the following long lasting puzzles such that "Why does DNA use the helix structure?" and "How can the evolution in biological system occur?".

  12. SUSY Searches at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Zivkovic, L.

    2011-07-01

    In this article results from supersymmetry searches at D0 and CDF are reported. Searches for third generation squarks, searches for gauginos, and searches for models with R-parity violation are described. As no signs of supersymmetry for these models are observed, the most stringent limits to date are presented.

  13. Online Patent Searching: The Realities.

    Science.gov (United States)

    Kaback, Stuart M.

    1983-01-01

    Considers patent subject searching capabilities of major online databases, noting patent claims, "deep-indexed" files, test searches, retrieval of related references, multi-database searching, improvements needed in indexing of chemical structures, full text searching, improvements needed in handling numerical data, and augmenting a subject search…

  14. Optimal Search with Costly Recall

    NARCIS (Netherlands)

    M.C.W. Janssen (Maarten); A. Parakhonyak (Alexei)

    2008-01-01

    textabstractThis paper builds a consumer search model where the cost of going back to stores already searched is explicitly taken into account. We show that the optimal search rule under costly recall is very different from the optimal search rule under perfect recall. Under costly recall, the optim

  15. Complete local search with memory

    OpenAIRE

    Sierksma, G.; Ghosh, D.

    2000-01-01

    Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic that makes effctive use of memory structures in a way that is different from tabu search. We report computational experiments with this heuristic on the traveling salesperson problem and the subse...

  16. The outcomes and correlates of job search objectives: searching to leave or searching for leverage?

    Science.gov (United States)

    Boswell, Wendy R; Boudreau, John W; Dunford, Benjamin B

    2004-12-01

    The authors investigate a previously overlooked yet important objective for employee job search--seeking leverage against the current employer. They explore the outcomes and correlates of leverage-seeking search and how it may differ from the more traditional objective for engaging in job search--to change jobs. Results show that leverage-seeking and separation-seeking search objectives associate with different outcomes. The authors also find that characteristics of the work situation and individual differences associate with leverage-seeking search and relate differently with the 2 job search objectives. Implications for practice and the advancement of job search research are discussed. PMID:15584843

  17. Searching for Movies

    DEFF Research Database (Denmark)

    Bogers, Toine

    2015-01-01

    Despite a surge in popularity of work on casual leisure search, some leisure domains are still relatively underrepresented. Movies are good example of such a domain, which is peculiar given the popularity of movie-centered websites and discovery services such as IMDB, RottenTomatoes, and Netflix....... In this paper, we present an exploratory analysis of IMDB movie discussion threads that contain requests for movies to watch. Through emergent coding we produce a taxonomy of relevance aspects for movie search and selection. Our analysis shows that topical aspects, such as content, metadata, and...... known-item search, are important for movie selection practices. Other requests focus more on recommendation and feature many subjective relevance aspects, such as the tone of a movie or its intended audience. This suggests efficient access to movies is likely to require different information access...

  18. Supersymmetry Searches with ATLAS

    CERN Document Server

    Hill, Ewan; The ATLAS collaboration

    2015-01-01

    Supersymmetry is one of the best motivated and studied theories of physics beyond the Standard Model. This document summarises recent ATLAS results of searches for supersymmetric particles using LHC proton--proton collision data at $\\sqrt{s} = 7$ and 8 TeV. Weak and strong production Supersymmetry scenarios are considered, with particular attention to direct production of third generation supersymmetric particles. The searches involve final states including jets, missing transverse momentum, leptons, and long-lived particles. Sensitivity projections for the $\\sqrt{s} = 13$ TeV data are also presented.

  19. Distributed deep web search

    OpenAIRE

    Tjin-Kam-Jet, Kien-Tsoi Theodorus Egbert

    2013-01-01

    The World Wide Web contains billions of documents (and counting); hence, it is likely that some document will contain the answer or content you are searching for. While major search engines like Bing and Google often manage to return relevant results to your query, there are plenty of situations in which they are less capable of doing so. Specifically, there is a noticeable shortcoming in situations that involve the retrieval of data from the deep web. Deep web data is difficult to crawl and ...

  20. Search for glueballs

    Energy Technology Data Exchange (ETDEWEB)

    Toki, W. [Colorado State Univ., Ft. Collins, CO (United States). Dept. of Physics

    1997-06-01

    In these Summer School lectures, the author reviews the results of recent glueball searches. He begins with a brief review of glueball phenomenology and meson spectroscopy, including a discussion of resonance behavior. The results on the f{sub o}(1500) and f{sub J}(1700) resonances from proton-antiproton experiments and radiative J/{Psi} decays are discussed. Finally, {pi}{pi} and {eta}{pi} studies from D{sub s} decays and exotic meson searches are reviewed. 46 refs., 40 figs.

  1. Supersymmetry searches in ATLAS

    CERN Document Server

    Kuwertz, Emma Sian; The ATLAS collaboration

    2015-01-01

    Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, including those those tagged as originating from b-quark decays, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures. An overview of the constraints on supersymmetry from the run1 results is presented, as well as sensitivity projections for the data that will be collected in 2015.

  2. Robust quantum spatial search

    Science.gov (United States)

    Tulsi, Avatar

    2016-07-01

    Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers significant robustness to certain systematic errors. To search N items, our recursive algorithm can tolerate errors of size O(1{/}√{ln N}) which is exponentially better than quantum walk algorithms for which tolerable error size is only O(ln N{/}√{N}). Also, our algorithm does not need any ancilla qubit. Thus our algorithm is much easier to implement experimentally compared to quantum walk algorithms.

  3. Searching for excellence

    Science.gov (United States)

    Yager, Robert E.

    Visits to six school districts which were identified by the National Science Teachers Association's Search for Excellence program were made during 1983 by teams of 17 researchers. The reports were analyzed in search for common characteristics that can explain the requirements necessary for excellent science programs. The results indicate that creative ideas, administrative and community involvement, local ownership and pride, and well-developed in-service programs and implementation strategies are vital. Exceptional teachers with boundless energies also seem to exist where exemplary science programs are found.

  4. Supersymmetry searches in ATLAS

    CERN Document Server

    Meloni, Federico; The ATLAS collaboration

    2015-01-01

    This document summarises recent ATLAS results for searches for supersymmetric particles using LHC proton-proton collision data. Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. We consider both R-Parity conserving and R-Parity violating SUSY scenarios. The searches involve final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures. Sensitivity projections for the data that will be collected in 2015 are also presented.

  5. Supersymmetry searches in ATLAS

    CERN Document Server

    Meloni, Federico; The ATLAS collaboration

    2015-01-01

    Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures. Sensitivity projections for the data that will be collected in 2015 are also presented.

  6. Search for $2\

    CERN Document Server

    :,; Auty, D J; Barbeau, P S; Beck, D; Belov, V; Breidenbach, M; Brunner, T; Burenkov, A; Cao, G F; Chambers, C; Chaves, J; Cleveland, B; Coon, M; Craycraft, A; Daniels, T; Danilov, M; Daugherty, S J; Davis, J; Delaquis, S; Der Mesrobian-Kabakian, A; DeVoe, R; Didberidze, T; Dilling, J; Dolgolenko, A; Dolinski, M J; Dunford, M; Fairbank, W; Farine, J; Feldmeier, W; Feyzbakhsh, S; Fierlinger, P; Fudenberg, D; Gornea, R; Graham, K; Gratta, G; Hall, C; Hughes, M; Jewell, M J; Johnson, A; Johnson, T N; Johnston, S; Karelin, A; Kaufman, L J; Killick, R; King, J; Koffas, T; Kravitz, S; Krücken, R; Kuchenkov, A; Kumar, K S; Leonard, D S; Licciardi, C; Lin, Y H; Ling, J; MacLellan, R; Marino, M G; Mong, B; Moore, D; Njoya, O; Nelson, R; Odian, A; Ostrovskiy, I; Piepke, A; Pocar, A; Prescott, C Y; Retière, F; Rowson, P C; Russell, J J; Schubert, A; Sinclair, D; Smith, E; Stekhanov, V; Tarka, M; Tolba, T; Tsang, R; Twelker, K; Vogel, P; Vuilleumier, J -L; Waite, A; Walton, J; Walton, T; Weber, M; Wen, L J; Wichoski, U; Winick, T A; Wood, J; Xu, Q Y; Yang, L; Yen, Y -R; Zeldovich, O Ya

    2015-01-01

    EXO-200 is a single phase liquid xenon detector designed to search for neutrinoless double-beta decay of $^{136}$Xe to the ground state of $^{136}$Ba. We report here on a search for the two-neutrino double-beta decay of $^{136}$Xe to the first $0^+$ excited state, $0^+_1$, of $^{136}$Ba based on a 100 kg$\\cdot$yr exposure of $^{136}$Xe. Using a specialized analysis employing a machine learning algorithm, we obtain a 90% CL half-life sensitivity of $1.7 \\times 10^{24}$ yr. We find no statistically significant evidence for the $2\

  7. Searching for supersymmetry scalelessly

    CERN Document Server

    Schlaffer, Matthias; Weiler, Andreas

    2016-01-01

    In this paper we propose a scale invariant search strategy for hadronic top or bottom plus missing energy final states. We present a method which shows flat efficiencies and background rejection factors over broad ranges of parameters and masses. The resulting search can be easily recast into a limit on alternative models. We show the strength of the method in a natural SUSY setup where stop and sbottom squarks are pair produced and decay into hadronically decaying top quarks or bottom quarks and higgsinos.

  8. Exotics searches in ATLAS

    CERN Document Server

    Vranjes, N; The ATLAS collaboration

    2016-01-01

    We report on the latest searches for (non-SUSY) Beyond Standard Model phenomena performed with the ATLAS detector. The searches have been performed with the data from proton-proton collisions at a centre-of-mass energy of 7 TeV collected in 2010 and 2011. Various experimental signatures have been studied involving reconstruction and measurement of leptons, photons, jets, missing transverse energy, as well as reconstruction of top quarks. For most of the signatures, the experimental reach is significantly increased with respect to previous results.

  9. Adaptive Parallel Iterative Deepening Search

    CERN Document Server

    Cook, D J; 10.1613/jair.518

    2011-01-01

    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, Eu...

  10. Search features of digital libraries

    Directory of Open Access Journals (Sweden)

    Alastair G. Smith

    2000-01-01

    Full Text Available Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc. This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries, for instance by: providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc.

  11. Search Analytics for Your Site

    CERN Document Server

    Rosenfeld, Louis

    2011-01-01

    Any organization that has a searchable web site or intranet is sitting on top of hugely valuable and usually under-exploited data: logs that capture what users are searching for, how often each query was searched, and how many results each query retrieved. Search queries are gold: they are real data that show us exactly what users are searching for in their own words. This book shows you how to use search analytics to carry on a conversation with your customers: listen to and understand their needs, and improve your content, navigation and search performance to meet those needs.

  12. Job search with nonpaticipation

    NARCIS (Netherlands)

    P. Frijters; B. van der Klaauw

    2006-01-01

    In a non-stationary job search model we allow unemployed workers to have a permanent option to leave the labour force. Transitions into nonparticipation occur when reservation wages drop below the utility of being nonparticipant. Taking account of these transitions allows the identification of durat

  13. High sensitivity pulsar search

    International Nuclear Information System (INIS)

    The planning, implementation, and results from a highly sensitive, automated search for new pulsars are discussed. This research effort was begun with a study of the relevant signal detection theory, and the conclusions reached are presented. The general procedures developed were specifically tailored for use on a high speed minicomputer, and produced a search relatively free from observational selection effects. The actual computer coding of these procedures is also described, with emphasis on how the required speed and efficiency of these routines was obtained. The final system applied over half a million different matched digital filters to the data obtained from each successive telescope beam area. Use of this search system at the 1000 foot telescope of the Arecibo Observatory resulted in the detection of 50 pulsars, 40 of which were not previously known. Parameters are presented for these new pulsars. The relatively limited range in dispersion measure exhibited by this pulsar sample is used, along with other evidence, to infer a reduced number density of pulsars at distances beyond approximately 10 kpc from the galactic center. By far the most interesting individual pulsar discovered in the course of this search was PSR 1913+16. Large periodic variations in the observed pulsation period of this pulsar are interpreted in terms of doppler shifts associated with its orbital motion about some companion object. The data analysis methods employed to arrive at the current observational description of this system are discussed, along with a review of the theoretical conclusions that are based on this description

  14. Google Search Mastery Basics

    Science.gov (United States)

    Hill, Paul; MacArthur, Stacey; Read, Nick

    2014-01-01

    Effective Internet search skills are essential with the continually increasing amount of information available on the Web. Extension personnel are required to find information to answer client questions and to conduct research on programs. Unfortunately, many lack the skills necessary to effectively navigate the Internet and locate needed…

  15. Search for intervalmodels

    DEFF Research Database (Denmark)

    Høskuldsson, Agnar

    1996-01-01

    Methods are presented that carry out sorting of data according to some criteria, and investigate the possibilities of finding intervals that give separate models relative to the given data. The methods presented are more reliable than related clustering methods, because the search is carried out...

  16. The Job Search.

    Science.gov (United States)

    Rolf, Marilyn

    1982-01-01

    Describes a college-level job search teaching unit that is a practical method of preparing appropriate resumes, participating in effective job interviews, and getting and keeping the job. The unit's four phases are explained: securing job leads, writing resumes and letters of application, the interview, and the postinterview. (CT)

  17. Higgs searches at Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Sonnenschein, Lars; /Paris U., VI-VII

    2006-09-01

    SM and MSSM Higgs Searches at the proton anti-proton collider Tevatron in Run II are presented. The performance of the collider and the two experiments D0 and CDF is shown. No deviation from SM background expectation and no MSSM Higgs signal has been observed.

  18. Next Generation Search Interfaces

    Science.gov (United States)

    Roby, W.; Wu, X.; Ly, L.; Goldina, T.

    2015-09-01

    Astronomers are constantly looking for easier ways to access multiple data sets. While much effort is spent on VO, little thought is given to the types of User Interfaces we need to effectively search this sort of data. For instance, an astronomer might need to search Spitzer, WISE, and 2MASS catalogs and images then see the results presented together in one UI. Moving seamlessly between data sets is key to presenting integrated results. Results need to be viewed using first class, web based, integrated FITS viewers, XY Plots, and advanced table display tools. These components should be able to handle very large datasets. To make a powerful Web based UI that can manage and present multiple searches to the user requires taking advantage of many HTML5 features. AJAX is used to start searches and present results. Push notifications (Server Sent Events) monitor background jobs. Canvas is required for advanced result displays. Lesser known CSS3 technologies makes it all flow seamlessly together. At IPAC, we have been developing our Firefly toolkit for several years. We are now using it to solve this multiple data set, multiple queries, and integrated presentation problem to create a powerful research experience. Firefly was created in IRSA, the NASA/IPAC Infrared Science Archive (http://irsa.ipac.caltech.edu). Firefly is the core for applications serving many project archives, including Spitzer, Planck, WISE, PTF, LSST and others. It is also used in IRSA's new Finder Chart and catalog and image displays.

  19. The Pulsar Search Collaboratory

    Science.gov (United States)

    Rosen, R.; Heatherly, S.; McLaughlin, M. A.; Kondratiev, V. I.; Boyles, J. R.; Wilson, M.; Lorimer, D. R.; Lynch, R.; Ransom, S.

    2010-01-01

    The Pulsar Search Collaboratory (PSC) (NSF #0737641) is a joint project between the National Radio Astronomy Observatory and West Virginia University designed to interest high school students in science, technology, engineering, and mathematics related career paths by helping them to conduct authentic scientific research. The 3 year PSC program,…

  20. In Search of Wisdom

    Science.gov (United States)

    Vaccaro, Louis C.

    1975-01-01

    Arguing that students' demand for relevance is for wisdom rather than for utilitarian knowledge, and that it is caused by poor teaching, particularly in the liberal arts, the author emphasizes the individual teacher's responsibility to communicate the proper view of education, to lead students in their search for wisdom. (JT)

  1. Exotic searches at ATLAS

    CERN Document Server

    Turra, Ruggero; The ATLAS collaboration

    2016-01-01

    The ATLAS detector has collected 3.2 fb^-1 of proton-proton collisions at 13 TeV centre of mass energy during the 2015 LHC run. A selected review of the recent result are presented in the context of the direct search for BSM, not SUSY, not BSM Higgs.

  2. Biased predecessor search

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Fagerberg, Rolf; Howat, John; Morin, Pat

    We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic in...

  3. SUPERSYMMETRY SEARCHES IN ATLAS

    CERN Document Server

    Romero Adam, Elena; The ATLAS collaboration

    2016-01-01

    Weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This contribution summarises recent ATLAS results for searches for supersymmetric (SUSY) particles with the LHC Run 1 data at √s = 8 TeV. A sensitivity study for the √s = 13 TeV data is also briefly presented.

  4. Excited lepton search

    International Nuclear Information System (INIS)

    Using the CELLO detector at PETRA a search has been made for excited leptons by studying e+e- interactions which yield l+l-γγ, l+l-γ and γγ final states, where l = e, μ or tau. Good agreement with QED is observed and new limits are set on esup(*), μsup(*), and tausup(*) production.

  5. Excited lepton search

    International Nuclear Information System (INIS)

    Using the CELLO detector at PETRA we have searched for excited leptons by studying e+e- interactions which yield rho+rho-γγ, rho+rho-γ and γγ final states, where l=e, μ or tau. We observe good agreement with QED and set new limits on e*, μ* and tau* production

  6. SEARCHING FOR SUPREMACY

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    When it comes to why people go online in China, it’s a tossup between news browsing and using search engines for most netizens. Almost 70 percent and 66 percent, respectively, according to statistics from the 17th China Internet Development Statistic Report released in January this year. In 2005, almost 98 million, making up

  7. Spinning a Web Search.

    Science.gov (United States)

    Lager, Mark A.

    This paper focuses on techniques for retrieval used in information sciences and in World Wide Web search engines. The purpose of reference service and information science is to provide useful information in response to a query. The two metrics of recall and precision serve to express information retrieval performance. There are two major…

  8. Multimedia Search Engines : Concept, Performance, and Types

    Directory of Open Access Journals (Sweden)

    Sayed Rabeh Sayed

    2005-12-01

    Full Text Available A Research about multimedia search engines, it starts with definition of search engines at general and multimedia search engines, then explains how they work, and divided them into: Video search engines, Images search engines, and Audio search engines. Finally, it reviews a samples to multimedia search engines.

  9. Multimedia Search Engines : Concept, Performance, and Types

    OpenAIRE

    Sayed Rabeh Sayed

    2005-01-01

    A Research about multimedia search engines, it starts with definition of search engines at general and multimedia search engines, then explains how they work, and divided them into: Video search engines, Images search engines, and Audio search engines. Finally, it reviews a samples to multimedia search engines.

  10. Subject search study. Final report

    International Nuclear Information System (INIS)

    The study gathered information on how users search the database of the International Nuclear Information System (INIS), using indicators such as Subject categories, Controlled terms, Subject headings, Free-text words, combinations of the above. Users participated from the Australian, French, Russian and Spanish INIS Centres, that have different national languages. Participants, both intermediaries and end users, replied to a questionnaire and executed search queries. The INIS Secretariat at the IAEA also participated. A protocol of all search strategies used in actual searches in the database was kept. The thought process for Russian and Spanish users is predominantly non-English and also the actual initial search formulation is predominantly non-English among Russian and Spanish users while it tends to be more in English among French users. A total of 1002 searches were executed by the five INIS centres including the IAEA. The search protocols indicate the following search behaviour: 1) free text words represent about 40% of search points on an average query; 2) descriptors used as search keys have the widest range as percentage of search points, from a low of 25% to a high of 48%; 3) search keys consisting of free text that coincides with a descriptor account for about 15% of search points; 4) Subject Categories are not used in many searches; 5) free text words are present as search points in about 80% of all searches; 6) controlled terms (descriptors) are used very extensively and appear in about 90% of all searches; 7) Subject Headings were used in only a few percent of searches. From the results of the study one can conclude that there is a greater reluctance on the part of non-native English speakers in initiating their searches by using free text word searches. Also: Subject Categories are little used in searching the database; both free text terms and controlled terms are the predominant types of search keys used, whereby the controlled terms are used more

  11. SCIBS (Subset Count Index Based Search) indexing algorithm to reduce the time complexity of search algorithms

    OpenAIRE

    Dr. R.Manicka chezian; Nishad Pm

    2012-01-01

    There are several algorithms like binary search, linear search, Interpolation search, Ternary search and, etc used for search. Search algorithms locate the position of an item in a sorted. But the time taken for the search is huge. The search algorithm initially set the first and last index for the search; this directly leads to thetime complexity. This paper proposes a new prefix search indexing algorithm is called Subset Count Index Based Search Algorithm (SCIBS). This algorithm achieved th...

  12. Search Tips: MedlinePlus

    Science.gov (United States)

    ... niño or nino . Will the search check my spelling? Yes, the search engine suggests replacements when it ... you suggestions, consult a dictionary for the correct spelling. You can try the medical dictionary on MedlinePlus. ...

  13. Professional Search in Pharmaceutical Research

    OpenAIRE

    Kohn, Alex

    2010-01-01

    In the mid 90s, visiting libraries – as means of retrieving the latest literature – was still a common necessity among professionals. Nowadays, professionals simply access information by ‘googling’. Indeed, the name of the Web search engine market leader “Google” became a synonym for searching and retrieving information. Despite the increased popularity of search as a method for retrieving relevant information, at the workplace search engines still do not deliver satisfying results to profess...

  14. Searching publications on operating systems

    OpenAIRE

    Middelburg, C.A.

    2010-01-01

    This note concerns a search for publications in which one can find statements that explain the concept of an operating system, reasons for introducing operating systems, a formalization of the concept of an operating system or theory about operating systems based on such a formalization. It reports on the way in which the search has been carried out and the outcome of the search. The outcome includes not only what the search was meant for, but also some added bonuses.

  15. Attribute Search in Online Retailing

    OpenAIRE

    Richards, Timothy J.; Hamilton, Stephen F; Empen, Janine

    2015-01-01

    Online shopping is common in many categories of retail goods. The recent trend towards online retailing has created an unprecedented empirical opportunity to examine consumer search behavior using click stream data. In this paper we examine consumer search intensity across a wide range of grocery products that differ in the depth of product assortment. We develop a model of attribute search in which consumers search within a chosen retailer for products that match their tastes, and that equil...

  16. Switching strategies to optimize search

    Science.gov (United States)

    Shlesinger, Michael F.

    2016-03-01

    Search strategies are explored when the search time is fixed, success is probabilistic and the estimate for success can diminish with time if there is not a successful result. Under the time constraint the problem is to find the optimal time to switch a search strategy or search location. Several variables are taken into account, including cost, gain, rate of success if a target is present and the probability that a target is present.

  17. Job Search Behaviour and Job Search Success of the Unemployed

    OpenAIRE

    Eppel, Rainer; Mahringer, Helmut; Weber, Andrea

    2014-01-01

    We combine information from a job-seeker survey and two sources of administrative data to shed light on the job search behaviour and job search success of the unemployed. Our particular focus is on the way the Public Employment Service (AMS) shapes job search effort and outcomes in terms of the exit rate to work and of post-unemployment job match quality. Job-seekers attach a high value to internet job search, but social networks are by far the most promising job search channel. The AMS has a...

  18. Wilderness search strategy and tactics.

    Science.gov (United States)

    Phillips, Ken; Longden, Maura J; Vandergraff, Bil; Smith, William R; Weber, David C; McIntosh, Scott E; Wheeler, Albert R

    2014-06-01

    Reports of overdue persons are common for search and rescue personnel. Search incidents for missing persons are conducted following established industry standard practices, which are continuously refined through experience and the analysis of previous search operations. Throughout this process, elements of uncertainty exist, and the knowledge and experience of the searchers and search managers may influence the outcome significantly. A sound knowledge of current search tactics will help search and rescue medical providers function more effectively during search operations. Initial actions during a search incident include 3 primary tasks that must be accomplished on any search: investigation, containment, and then hasty search efforts. Concurrent with these initial actions are the establishment of the search area and a formal US National Incident Management System incident command system. That is essential for an efficient operation and will lay the groundwork for expanding the operation past the initial operational period. The goal of applying these standard search management practices is to allow searchers to maximize their efforts, reduce some of the inherent uncertainty, and most importantly, place searchers in a position to detect the missing person. PMID:24792134

  19. Search Engines for Tomorrow's Scholars

    Science.gov (United States)

    Fagan, Jody Condit

    2011-01-01

    Today's scholars face an outstanding array of choices when choosing search tools: Google Scholar, discipline-specific abstracts and index databases, library discovery tools, and more recently, Microsoft's re-launch of their academic search tool, now dubbed Microsoft Academic Search. What are these tools' strengths for the emerging needs of…

  20. Non-Stationary Search Equilibrium

    OpenAIRE

    Fabien Postel-Vinay; Giuseppe Moscarini

    2009-01-01

    We study aggregate equilibrium dynamics of a frictional labor market where firms post employment contracts and workers search randomly on and off the job for such contracts, while the economy is hit by aggregate productivity shocks. Our exercise provides the first analysis of aggregate dynamics of a popular class of search wage-posting models with undirected job search.

  1. Search for Hidden Particles

    CERN Multimedia

    The SHiP Experiment is a new general-purpose fixed target facility at the SPS to search for hidden particles as predicted by a very large number of recently elaborated models of Hidden Sectors which are capable of accommodating dark matter, neutrino oscillations, and the origin of the full baryon asymmetry in the Universe. Specifically, the experiment is aimed at searching for very weakly interacting long lived particles including Heavy Neutral Leptons - right-handed partners of the active neutrinos; light supersymmetric particles - sgoldstinos, etc.; scalar, axion and vector portals to the hidden sector. The high intensity of the SPS and in particular the large production of charm mesons with the 400 GeV beam allow accessing a wide variety of light long-lived exotic particles of such models and of SUSY. Moreover, the facility is ideally suited to study the interactions of tau neutrinos.

  2. Direct policy search

    DEFF Research Database (Denmark)

    Heidrich-Meisner, V.; Igel, Christian

    2010-01-01

    Reinforcement learning (RL) is a biological inspired learning paradigm based on trial-and-error learning. A successful RL algorithm has to balance exploration of new behavioral strategies and exploitation of already obtained knowledge. In the initial learning phase exploration is the dominant...... process. Exploration is realized by stochastic perturbations, which can be applied at different levels. When considering direct policy search in the space of neural network policies, exploration can be applied on the synaptic level or on the level of neuronal activity. We propose neuroevolution strategies...... (NeuroESs) for direct policy search in RL. Learning using NeuroESs can be interpreted as modelling of extrinsic perturbations on the level of synaptic weights. In contrast, policy gradient methods (PGMs) can be regarded as intrinsic perturbation of neuronal activity. We compare these two approaches...

  3. Berkeley automated supernova search

    International Nuclear Information System (INIS)

    The Berkeley automated supernova search employs a computer controlled 36-inch telescope and charge coupled device (CCD) detector to image 2500 galaxies per night. A dedicated minicomputer compares each galaxy image with stored reference data to identify supernovae in real time. The threshold for detection is m/sub v/ = 18.8. We plan to monitor roughly 500 galaxies in Virgo and closer every night, and an additional 6000 galaxies out to 70 Mpc on a three night cycle. This should yield very early detection of several supernovae per year for detailed study, and reliable premaximum detection of roughly 100 supernovae per year for statistical studies. The search should be operational in mid-1982

  4. Axion Dark Matter Searches

    CERN Document Server

    Stern, I

    2014-01-01

    Nearly all astrophysical and cosmological data point convincingly to a large component of cold dark matter in the Universe. The axion particle, first theorized as a solution to the strong charge-parity problem of quantum chromodynamics, has been established as a prominent CDM candidate. Cosmic observation and particle physics experiments have bracketed the unknown mass of the axion between approximately a $\\mu$eV and a meV. The Axion Dark Matter eXperiement (ADMX) has successfully completed searches between 1.9 and 3.7 $\\mu$eV down to the KSVZ photon-coupling limit. ADMX and the Axion Dark Matter eXperiement High-Frequency (ADMX-HF) will search for axions at weaker coupling and/or higher frequencies within the next few years. Status of the experiments, current research and development, and projected mass-coupling exclusion limits are presented.

  5. SUSY Searches at ATLAS

    CERN Document Server

    Lorenz, Jeanette; The ATLAS collaboration

    2016-01-01

    Analyzing 3.2 fb$^{-1}$ of proton--proton collision data at $\\sqrt{s} = 13$ TeV, delivered by the LHC and recorded by the ATLAS detector in Run 2, various SUSY searches for gluinos, stops and sbottoms were pursued. The analyses focus on simple and robust analyses techniques and are optimized for specific benchmark signatures. Stringent limits significantly superseding the Run 1 limits are obtained.

  6. Advanced Intranet Search Engine

    OpenAIRE

    Narayan, Nitesh

    2009-01-01

    Information retrieval has been a prevasive part of human society since its existence.With the advent of internet and World wide Web it became an extensive area of researchand major foucs, which lead to development of various search engines to locate the de-sired information, mostly for globally connected computer networks viz. internet.Butthere is another major part of computer network viz. intranet, which has not seen muchof advancement in information retrieval approaches, in spite of being ...

  7. Job Search with Nonparticipation

    OpenAIRE

    Frijters, P.; Klaauw, van der, B.

    2004-01-01

    In a non-stationary job search model we allow unemployed workers to have a permanent option to leave the labor force. Transitions into non-participation occur when reservation wages drop below the utility of being nonparticipant. Taking account of these transitions allows the identification of the duration dependence in the job offer arrival rate and the wage offer distribution. We estimate the structural model with individual data from the German Socio-Economic Panel and use simulated maximu...

  8. The Pulsar Search Collaboratory

    OpenAIRE

    Rosen, Rachel; Heatherly, Sue Ann; McLaughlin, Maura A.; Lynch, Ryan; Kondratiev, Vlad I.; Boyles, Jason R.; Wilson, M. Terry; Lorimer, Duncan R.; Ransom, Scott

    2010-01-01

    The Pulsar Search Collaboratory [PSC, NSF #0737641] is a joint project between the National Radio Astronomy Observatory (NRAO) and West Virginia University (WVU) designed to interest high school students in science, technology, engineering, and mathematics [STEM] related career paths by helping them to conduct authentic scientific research. The 3- year PSC program, which began in summer 2008, teaches students to analyze astronomical radio data acquired with the 100-m Robert C. Byrd Green Bank...

  9. Search for the decay

    Science.gov (United States)

    Aaij, R.; Adeva, B.; Adinolfi, M.; Affolder, A.; Ajaltouni, Z.; Akar, S.; Albrecht, J.; Alessio, F.; Alexander, M.; Ali, S.; Alkhazov, G.; Alvarez Cartelle, P.; Alves, A. A.; Amato, S.; Amerio, S.; Amhis, Y.; An, L.; Anderlini, L.; Anderson, J.; Andreotti, M.; Andrews, J. E.; Appleby, R. B.; Aquines Gutierrez, O.; Archilli, F.; d'Argent, P.; Artamonov, A.; Artuso, M.; Aslanides, E.; Auriemma, G.; Baalouch, M.; Bachmann, S.; Back, J. J.; Badalov, A.; Baesso, C.; Baldini, W.; Barlow, R. J.; Barschel, C.; Barsuk, S.; Barter, W.; Batozskaya, V.; Battista, V.; Bay, A.; Beaucourt, L.; Beddow, J.; Bedeschi, F.; Bediaga, I.; Bel, L. J.; Belyaev, I.; Ben-Haim, E.; Bencivenni, G.; Benson, S.; Benton, J.; Berezhnoy, A.; Bernet, R.; Bertolin, A.; Bettler, M.-O.; van Beuzekom, M.; Bien, A.; Bifani, S.; Bird, T.; Birnkraut, A.; Bizzeti, A.; Blake, T.; Blanc, F.; Blouw, J.; Blusk, S.; Bocci, V.; Bondar, A.; Bondar, N.; Bonivento, W.; Borghi, S.; Borsato, M.; Bowcock, T. J. V.; Bowen, E.; Bozzi, C.; Braun, S.; Brett, D.; Britsch, M.; Britton, T.; Brodzicka, J.; Brook, N. H.; Bursche, A.; Buytaert, J.; Cadeddu, S.; Calabrese, R.; Calvi, M.; Calvo Gomez, M.; Campana, P.; Campora Perez, D.; Capriotti, L.; Carbone, A.; Carboni, G.; Cardinale, R.; Cardini, A.; Carniti, P.; Carson, L.; Carvalho Akiba, K.; Casanova Mohr, R.; Casse, G.; Cassina, L.; Castillo Garcia, L.; Cattaneo, M.; Cauet, Ch.; Cavallero, G.; Cenci, R.; Charles, M.; Charpentier, Ph.; Chefdeville, M.; Chen, S.; Cheung, S.-F.; Chiapolini, N.; Chrzaszcz, M.; Cid Vidal, X.; Ciezarek, G.; Clarke, P. E. L.; Clemencic, M.; Cliff, H. V.; Closier, J.; Coco, V.; Cogan, J.; Cogneras, E.; Cogoni, V.; Cojocariu, L.; Collazuol, G.; Collins, P.; Comerma-Montells, A.; Contu, A.; Cook, A.; Coombes, M.; Coquereau, S.; Corti, G.; Corvo, M.; Couturier, B.; Cowan, G. A.; Craik, D. C.; Crocombe, A.; Cruz Torres, M.; Cunliffe, S.; Currie, R.; D'Ambrosio, C.; Dalseno, J.; David, P. N. Y.; Davis, A.; De Bruyn, K.; De Capua, S.; De Cian, M.; De Miranda, J. M.; De Paula, L.; De Silva, W.; De Simone, P.; Dean, C.-T.; Decamp, D.; Deckenhoff, M.; Del Buono, L.; Déléage, N.; Derkach, D.; Deschamps, O.; Dettori, F.; Dey, B.; Di Canto, A.; Di Ruscio, F.; Dijkstra, H.; Donleavy, S.; Dordei, F.; Dorigo, M.; Dosil Suárez, A.; Dossett, D.; Dovbnya, A.; Dreimanis, K.; Dujany, G.; Dupertuis, F.; Durante, P.; Dzhelyadin, R.; Dziurda, A.; Dzyuba, A.; Easo, S.; Egede, U.; Egorychev, V.; Eidelman, S.; Eisenhardt, S.; Eitschberger, U.; Ekelhof, R.; Eklund, L.; El Rifai, I.; Elsasser, Ch.; Ely, S.; Esen, S.; Evans, H. M.; Evans, T.; Falabella, A.; Färber, C.; Farinelli, C.; Farley, N.; Farry, S.; Fay, R.; Ferguson, D.; Fernandez Albor, V.; Ferrari, F.; Ferreira Rodrigues, F.; Ferro-Luzzi, M.; Filippov, S.; Fiore, M.; Fiorini, M.; Firlej, M.; Fitzpatrick, C.; Fiutowski, T.; Fol, P.; Fontana, M.; Fontanelli, F.; Forty, R.; Francisco, O.; Frank, M.; Frei, C.; Frosini, M.; Fu, J.; Furfaro, E.; Gallas Torreira, A.; Galli, D.; Gallorini, S.; Gambetta, S.; Gandelman, M.; Gandini, P.; Gao, Y.; García Pardiñas, J.; Garofoli, J.; Garra Tico, J.; Garrido, L.; Gascon, D.; Gaspar, C.; Gastaldi, U.; Gauld, R.; Gavardi, L.; Gazzoni, G.; Geraci, A.; Gerick, D.; Gersabeck, E.; Gersabeck, M.; Gershon, T.; Ghez, Ph.; Gianelle, A.; Gianì, S.; Gibson, V.; Giubega, L.; Gligorov, V. V.; Göbel, C.; Golubkov, D.; Golutvin, A.; Gomes, A.; Gotti, C.; Grabalosa Gándara, M.; Graciani Diaz, R.; Granado Cardoso, L. A.; Graugés, E.; Graverini, E.; Graziani, G.; Grecu, A.; Greening, E.; Gregson, S.; Griffith, P.; Grillo, L.; Grünberg, O.; Gui, B.; Gushchin, E.; Guz, Yu.; Gys, T.; Hadjivasiliou, C.; Haefeli, G.; Haen, C.; Haines, S. C.; Hall, S.; Hamilton, B.; Hampson, T.; Han, X.; Hansmann-Menzemer, S.; Harnew, N.; Harnew, S. T.; Harrison, J.; He, J.; Head, T.; Heijne, V.; Hennessy, K.; Henrard, P.; Henry, L.; Hernando Morata, J. A.; van Herwijnen, E.; Heß, M.; Hicheur, A.; Hill, D.; Hoballah, M.; Hombach, C.; Hulsbergen, W.; Humair, T.; Hussain, N.; Hutchcroft, D.; Hynds, D.; Idzik, M.; Ilten, P.; Jacobsson, R.; Jaeger, A.; Jalocha, J.; Jans, E.; Jawahery, A.; Jing, F.; John, M.; Johnson, D.; Jones, C. R.; Joram, C.; Jost, B.; Jurik, N.; Kandybei, S.; Kanso, W.; Karacson, M.; Karbach, T. M.; Karodia, S.; Kelsey, M.; Kenyon, I. R.; Kenzie, M.; Ketel, T.; Khanji, B.; Khurewathanakul, C.; Klaver, S.; Klimaszewski, K.; Kochebina, O.; Kolpin, M.; Komarov, I.; Koopman, R. F.; Koppenburg, P.; Korolev, M.; Kravchuk, L.; Kreplin, K.; Kreps, M.; Krocker, G.; Krokovny, P.; Kruse, F.; Kucewicz, W.; Kucharczyk, M.; Kudryavtsev, V.; Kurek, K.; Kvaratskheliya, T.; La Thi, V. N.; Lacarrere, D.; Lafferty, G.; Lai, A.; Lambert, D.; Lambert, R. W.; Lanfranchi, G.; Langenbruch, C.; Langhans, B.; Latham, T.; Lazzeroni, C.; Le Gac, R.; van Leerdam, J.; Lees, J.-P.; Lefèvre, R.; Leflat, A.; Lefrançois, J.; Leroy, O.; Lesiak, T.; Leverington, B.; Li, Y.; Likhomanenko, T.; Liles, M.; Lindner, R.; Linn, C.; Lionetto, F.; Liu, B.; Lohn, S.; Longstaff, I.; Lopes, J. H.; Lucchesi, D.; Lucio Martinez, M.; Luo, H.; Lupato, A.; Luppi, E.; Lupton, O.; Machefert, F.; Maciuc, F.; Maev, O.; Malde, S.; Malinin, A.; Manca, G.; Mancinelli, G.; Manning, P.; Mapelli, A.; Maratas, J.; Marchand, J. F.; Marconi, U.; Marin Benito, C.; Marino, P.; Märki, R.; Marks, J.; Martellotti, G.; Martinelli, M.; Martinez Santos, D.; Martinez Vidal, F.; Martins Tostes, D.; Massafferri, A.; Matev, R.; Mathad, A.; Mathe, Z.; Matteuzzi, C.; Matthieu, K.; Mauri, A.; Maurin, B.; Mazurov, A.; McCann, M.; McCarthy, J.; McNab, A.; McNulty, R.; Meadows, B.; Meier, F.; Meissner, M.; Merk, M.; Milanes, D. A.; Minard, M.-N.; Mitzel, D. S.; Molina Rodriguez, J.; Monteil, S.; Morandin, M.; Morawski, P.; Mordà, A.; Morello, M. J.; Moron, J.; Morris, A. B.; Mountain, R.; Muheim, F.; Müller, J.; Müller, K.; Müller, V.; Mussini, M.; Muster, B.; Naik, P.; Nakada, T.; Nandakumar, R.; Nasteva, I.; Needham, M.; Neri, N.; Neubert, S.; Neufeld, N.; Neuner, M.; Nguyen, A. D.; Nguyen, T. D.; Nguyen-Mau, C.; Niess, V.; Niet, R.; Nikitin, N.; Nikodem, T.; Ninci, D.; Novoselov, A.; O'Hanlon, D. P.; Oblakowska-Mucha, A.; Obraztsov, V.; Ogilvy, S.; Okhrimenko, O.; Oldeman, R.; Onderwater, C. J. G.; Osorio Rodrigues, B.; Otalora Goicochea, J. M.; Otto, A.; Owen, P.; Oyanguren, A.; Palano, A.; Palombo, F.; Palutan, M.; Panman, J.; Papanestis, A.; Pappagallo, M.; Pappalardo, L. L.; Parkes, C.; Passaleva, G.; Patel, G. D.; Patel, M.; Patrignani, C.; Pearce, A.; Pellegrino, A.; Penso, G.; Pepe Altarelli, M.; Perazzini, S.; Perret, P.; Pescatore, L.; Petridis, K.; Petrolini, A.; Petruzzo, M.; Picatoste Olloqui, E.; Pietrzyk, B.; Pilař, T.; Pinci, D.; Pistone, A.; Playfer, S.; Plo Casasus, M.; Poikela, T.; Polci, F.; Poluektov, A.; Polyakov, I.; Polycarpo, E.; Popov, A.; Popov, D.; Popovici, B.; Potterat, C.; Price, E.; Price, J. D.; Prisciandaro, J.; Pritchard, A.; Prouve, C.; Pugatch, V.; Puig Navarro, A.; Punzi, G.; Qian, W.; Quagliani, R.; Rachwal, B.; Rademacker, J. H.; Rakotomiaramanana, B.; Rama, M.; Rangel, M. S.; Raniuk, I.; Rauschmayr, N.; Raven, G.; Redi, F.; Reichert, S.; Reid, M. M.; dos Reis, A. C.; Ricciardi, S.; Richards, S.; Rihl, M.; Rinnert, K.; Rives Molina, V.; Robbe, P.; Rodrigues, A. B.; Rodrigues, E.; Rodriguez Lopez, J. A.; Rodriguez Perez, P.; Roiser, S.; Romanovsky, V.; Romero Vidal, A.; Rotondo, M.; Rouvinet, J.; Ruf, T.; Ruiz, H.; Ruiz Valls, P.; Saborido Silva, J. J.; Sagidova, N.; Sail, P.; Saitta, B.; Salustino Guimaraes, V.; Sanchez Mayordomo, C.; Sanmartin Sedes, B.; Santacesaria, R.; Santamarina Rios, C.; Santovetti, E.; Sarti, A.; Satriano, C.; Satta, A.; Saunders, D. M.; Savrina, D.; Schiller, M.; Schindler, H.; Schlupp, M.; Schmelling, M.; Schmelzer, T.; Schmidt, B.; Schneider, O.; Schopper, A.; Schune, M.-H.; Schwemmer, R.; Sciascia, B.; Sciubba, A.; Semennikov, A.; Sepp, I.; Serra, N.; Serrano, J.; Sestini, L.; Seyfert, P.; Shapkin, M.; Shapoval, I.; Shcheglov, Y.; Shears, T.; Shekhtman, L.; Shevchenko, V.; Shires, A.; Silva Coutinho, R.; Simi, G.; Sirendi, M.; Skidmore, N.; Skillicorn, I.; Skwarnicki, T.; Smith, E.; Smith, E.; Smith, J.; Smith, M.; Snoek, H.; Sokoloff, M. D.; Soler, F. J. P.; Soomro, F.; Souza, D.; Souza De Paula, B.; Spaan, B.; Spradlin, P.; Sridharan, S.; Stagni, F.; Stahl, M.; Stahl, S.; Steinkamp, O.; Stenyakin, O.; Sterpka, F.; Stevenson, S.; Stoica, S.; Stone, S.; Storaci, B.; Stracka, S.; Straticiuc, M.; Straumann, U.; Stroili, R.; Sun, L.; Sutcliffe, W.; Swientek, K.; Swientek, S.; Syropoulos, V.; Szczekowski, M.; Szczypka, P.; Szumlak, T.; T'Jampens, S.; Tekampe, T.; Teklishyn, M.; Tellarini, G.; Teubert, F.; Thomas, C.; Thomas, E.; van Tilburg, J.; Tisserand, V.; Tobin, M.; Todd, J.; Tolk, S.; Tomassetti, L.; Tonelli, D.; Topp-Joergensen, S.; Torr, N.; Tournefier, E.; Tourneur, S.; Trabelsi, K.; Tran, M. T.; Tresch, M.; Trisovic, A.; Tsaregorodtsev, A.; Tsopelas, P.; Tuning, N.; Ukleja, A.; Ustyuzhanin, A.; Uwer, U.; Vacca, C.; Vagnoni, V.; Valenti, G.; Vallier, A.; Vazquez Gomez, R.; Vazquez Regueiro, P.; Vázquez Sierra, C.; Vecchi, S.; Velthuis, J. J.; Veltri, M.; Veneziano, G.; Vesterinen, M.; Viaud, B.; Vieira, D.; Vieites Diaz, M.; Vilasis-Cardona, X.; Vollhardt, A.; Volyanskyy, D.; Voong, D.; Vorobyev, A.; Vorobyev, V.; Voß, C.; de Vries, J. A.; Waldi, R.; Wallace, C.; Wallace, R.; Walsh, J.; Wandernoth, S.; Wang, J.; Ward, D. R.; Watson, N. K.; Websdale, D.; Weiden, A.; Whitehead, M.; Wiedner, D.; Wilkinson, G.; Wilkinson, M.; Williams, M.; Williams, M. P.; Williams, M.; Wilson, F. F.; Wimberley, J.; Wishahi, J.; Wislicki, W.; Witek, M.; Wormser, G.; Wotton, S. A.; Wright, S.; Wyllie, K.; Xie, Y.; Xu, Z.; Yang, Z.; Yuan, X.; Yushchenko, O.; Zangoli, M.; Zavertyaev, M.; Zhang, L.; Zhang, Y.; Zhelezov, A.; Zhokhov, A.; Zhong, L.

    2015-08-01

    A search for decays is performed using 3 .0 fb1- of pp collision data recorded by the LHCb experiment during 2011 and 2012. The f 0(980) meson is reconstructed through its decay to the π + π - final state in the mass window 900 MeV /c 2 1080 MeV /c 2. No significant signal is observed. The first upper limits on the branching fraction of are set at 90 % (95 %) confidence level. [Figure not available: see fulltext.

  10. Search engine optimization

    OpenAIRE

    Jakub Zilincan

    2013-01-01

    This diploma thesis deals with Search Engine Optimization, or shortly SEO. For years had this phenomenon been a part of a wide spectrum of activities which are a part of marketing, as we know it today. The internet environment is full of competition in all different fields of interest; the correct use of the channels for marketing communication towards the potential customers is often the key to gaining the competitive advantage, which the companies are looking for. The author is taking into ...

  11. MINOS Sterile Neutrino Search

    Energy Technology Data Exchange (ETDEWEB)

    Koskinen, David Jason [Univ. College London, Bloomsbury (United Kingdom)

    2009-02-01

    The Main Injector Neutrino Oscillation Search (MINOS) is a long-baseline accelerator neutrino experiment designed to measure properties of neutrino oscillation. Using a high intensity muon neutrino beam, produced by the Neutrinos at Main Injector (NuMI) complex at Fermilab, MINOS makes two measurements of neutrino interactions. The first measurement is made using the Near Detector situated at Fermilab and the second is made using the Far Detector located in the Soudan Underground laboratory in northern Minnesota. The primary goal of MINOS is to verify, and measure the properties of, neutrino oscillation between the two detectors using the v μ→ Vτ transition. A complementary measurement can be made to search for the existence of sterile neutrinos; an oft theorized, but experimentally unvalidated particle. The following thesis will show the results of a sterile neutrino search using MINOS RunI and RunII data totaling ~2.5 x 1020 protons on target. Due to the theoretical nature of sterile neutrinos, complete formalism that covers transition probabilities for the three known active states with the addition of a sterile state is also presented.

  12. Accelerated Profile HMM Searches.

    Directory of Open Access Journals (Sweden)

    Sean R Eddy

    2011-10-01

    Full Text Available Profile hidden Markov models (profile HMMs and probabilistic inference methods have made important contributions to the theory of sequence database homology search. However, practical use of profile HMM methods has been hindered by the computational expense of existing software implementations. Here I describe an acceleration heuristic for profile HMMs, the "multiple segment Viterbi" (MSV algorithm. The MSV algorithm computes an optimal sum of multiple ungapped local alignment segments using a striped vector-parallel approach previously described for fast Smith/Waterman alignment. MSV scores follow the same statistical distribution as gapped optimal local alignment scores, allowing rapid evaluation of significance of an MSV score and thus facilitating its use as a heuristic filter. I also describe a 20-fold acceleration of the standard profile HMM Forward/Backward algorithms using a method I call "sparse rescaling". These methods are assembled in a pipeline in which high-scoring MSV hits are passed on for reanalysis with the full HMM Forward/Backward algorithm. This accelerated pipeline is implemented in the freely available HMMER3 software package. Performance benchmarks show that the use of the heuristic MSV filter sacrifices negligible sensitivity compared to unaccelerated profile HMM searches. HMMER3 is substantially more sensitive and 100- to 1000-fold faster than HMMER2. HMMER3 is now about as fast as BLAST for protein searches.

  13. Diphoton searches in ATLAS

    CERN Document Server

    Delmastro, Marco; The ATLAS collaboration

    2016-01-01

    Searches for new resonances decaying into two photons in the ATLAS experiment at the LHC are described. The analysis is based on $pp$ collision data corresponding to an integrated luminosity of 3.2 fb$^{-1}$ at $\\sqrt{s}$ = 13 TeV recorded in 2015. Two different searches are performed, one targeted for a spin-2 particle, using Randall-Sundrum graviton states as a benchmark model, and one optimized for a spin-0 particle. The most significant deviation from the background predictions is observed at a diphoton invariant mass around 750 GeV with local significances of 3.6 and 3.9 standard deviations in the searches optimized for a spin-2 and spin-0 particle, respectively. The global significances are estimated to be 1.8 and 2.0 standard deviations. The consistency between the data collected at 13 TeV and 8 TeV is also evaluated. Limits on the production cross-section for the two benchmark resonances are reported.

  14. Higgs searches in CMS

    CERN Document Server

    Newman, Harvey

    2012-01-01

    I review searches for standard model (SM) and beyond the standard model (BSM) Higgs bosons in proton-proton collisions at $\\sqrt{s}=7$~and~8\\TeV in the Compact Muon Solenoid experiment at the LHC, using data samples corresponding to integrated luminosities of up to 5.1\\fbinv at 7\\TeV and 5.3\\fbinv at 8\\TeV. The SM Higgs boson search is performed in five decay modes: $\\Pgg\\Pgg$, $\\cPZ\\cPZ$, $\\PWp\\PWm$, $\\Pgt^+\\Pgt^-$, and $\\bbbar$. An excess of events is observed in this search above the expected background, with a local significance of 5.0 standard deviations, at a mass near 125\\GeV, signalling the production of a new particle. The expected significance for a standard model Higgs boson of that mass is 5.8 standard deviations. The excess is most significant in the two decay modes with the best mass resolution, $\\Pgg\\Pgg$ and $\\cPZ\\cPZ$; a fit to these signals gives a mass of $125.3\\pm 0.4\\,(\\text{stat.})\\pm 0.5\\,(\\text{syst.})\\GeV$. The decay to two photons indicates that the new particle is a boson with spin ...

  15. SmartSearch steganalysis

    Science.gov (United States)

    Bloom, Jeffrey A.; Alonso, Rafael

    2003-06-01

    There are two primary challenges to monitoring the Web for steganographic media: finding suspect media and examining those found. The challenge that has received a great deal of attention is the second of these, the steganalysis problem. The other challenge, and one that has received much less attention, is the search problem. How does the steganalyzer get the suspect media in the first place? This paper describes an innovative method and architecture to address this search problem. The typical approaches to searching the web for covert communications are often based on the concept of "crawling" the Web via a smart "spider." Such spiders find new pages by following ever-expanding chains of links from one page to many next pages. Rather than seek pages by chasing links from other pages, we find candidate pages by identifying requests to access pages. To do this we monitor traffic on Internet backbones, identify and log HTTP requests, and use this information to guide our process. Our approach has the advantages that we examine pages to which no links exist, we examine pages as soon as they are requested, and we concentrate resources only on active pages, rather than examining pages that are never viewed.

  16. MINOS Sterile Neutrino Search

    Energy Technology Data Exchange (ETDEWEB)

    Koskinen, David Jason; /University Coll. London

    2009-09-01

    The Main Injector Neutrino Oscillation Search (MINOS) is a long-baseline accelerator neutrino experiment designed to measure properties of neutrino oscillation. Using a high intensity muon neutrino beam, produced by the Neutrinos at Main Injector (NuMI) complex at Fermilab, MINOS makes two measurements of neutrino interactions. The first measurement is made using the Near Detector situated at Fermilab and the second is made using the Far Detector located in the Soudan Underground laboratory in northern Minnesota. The primary goal of MINOS is to verify, and measure the properties of, neutrino oscillation between the two detectors using the {nu}{sub {mu}} {yields} V{sub {tau}} transition. A complementary measurement can be made to search for the existence of sterile neutrinos; an oft theorized, but experimentally unvalidated particle. The following thesis will show the results of a sterile neutrino search using MINOS RunI and RunII data totaling {approx}2.5 x 10{sup 20} protons on target. Due to the theoretical nature of sterile neutrinos, complete formalism that covers transition probabilities for the three known active states with the addition of a sterile state is also presented.

  17. Enabling Federated Search with Heterogeneous Search Engines: Combining FAST Data Search and Lucene

    OpenAIRE

    Chernov, Sergey; Fehling, Bernd; Kohlschütter, Christian; Nejdl, Wolfgang; Pieper, Dirk; Summann, Friedrich

    2006-01-01

    This report analyses Federated Search in the VASCODA context, specifically focusing on the existing TIB Hannover and UB Bielefeld search infrastructures. We first describe general requirements for a seamless integration of the two full-text search systems FAST (Bielefeld) and Lucene (Hannover), and evaluate possible scenarios, types of queries, and different ranking procedures. We then proceed to describe a Federated Search infrastructure to be implemented on top of these existing systems. An...

  18. Semantic Search Engine: A Survey

    OpenAIRE

    Anusree.ramachandran; R Sujatha

    2011-01-01

    The semantic search engines have some advantages on the web search engines from the users view. In this fast life everybody need the answer for their queries very fast .In this scenario semantic searching engines will be helpful. It deals with the actual meaning of the queries. The tremendous growth in the volume of data or the information lead the traditional search engines to get the answers syntactically correct but large in amount. That might be the reason to get into the semantic search ...

  19. Noisy Search with Comparative Feedback

    CERN Document Server

    Lim, Shiau Hong

    2012-01-01

    We present theoretical results in terms of lower and upper bounds on the query complexity of noisy search with comparative feedback. In this search model, the noise in the feedback depends on the distance between query points and the search target. Consequently, the error probability in the feedback is not fixed but varies for the queries posed by the search algorithm. Our results show that a target out of n items can be found in O(log n) queries. We also show the surprising result that for k possible answers per query, the speedup is not log k (as for k-ary search) but only log log k in some cases.

  20. Search Engine Optimization For Dummies

    CERN Document Server

    Kent, Peter

    2012-01-01

    Increase your online ranking with this beginner guide to SEO! Search engine optimization (SEO) is an integral part of getting a site to rank high in the various search engines in order to attract potential customers. With this new edition of a bestseller, you?ll learn the ins and outs and best practices of successful SEO in order to make your website content more search-engine friendly so that it ranks higher among search engines and draws high-volume traffic. Covers search engine basics to help you get started Introduces new coverage on content marketing and reuse, new tracking tools, platfor

  1. Search engine optimization with Google

    OpenAIRE

    Vinit Kumar Gunjan

    2012-01-01

    Search engine optimization is a strategical technique to take a web document in top search results of a search engine. Online presence of an organisation is not only an easy way to reach among the target users but it may be profitable too if optimization is done keeping in view of the target users as of the reason that most of the time users search out with the keywords of their use (Say; PhD in web technology) rather than searching the organisation name, and if the page link comes in the top...

  2. Search 3.0: Present, Personal, Precise

    Science.gov (United States)

    Spivack, Nova

    The next generation of Web search is already beginning to emerge. With it we will see several shifts in the way people search, and the way major search engines provide search functionality to consumers.

  3. Policy implications for familial searching

    Directory of Open Access Journals (Sweden)

    Kim Joyce

    2011-11-01

    Full Text Available Abstract In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforcement agencies a powerful tool for developing investigative leads, apprehending criminals, revitalizing cold cases and exonerating wrongfully convicted individuals. As familial searching involves a range of logistical, social, ethical and legal considerations, states are now grappling with policy options for implementing familial searching to balance crime fighting with its potential impact on society. When developing policies for familial searching, legislators should take into account the impact of familial searching on select populations and the need to minimize personal intrusion on relatives of individuals in the DNA database. This review describes the approaches used to narrow a suspect pool from a partial match search of CODIS and summarizes the economic, ethical, logistical and political challenges of implementing familial searching. We examine particular US state policies and the policy options adopted to address these issues. The aim of this review is to provide objective background information on the controversial approach of familial searching to inform policy decisions in this area. Herein we highlight key policy options and recommendations regarding effective utilization of familial searching that minimize harm to and afford maximum protection of US citizens.

  4. Undergraduate students’ information search practices

    Directory of Open Access Journals (Sweden)

    Kleopatra Nikolopoulou

    2011-01-01

    Full Text Available This paper investigates undergraduate students’ information search practices.The subjects were 250 undergraduate students from two university departments in Greece, and a questionnaire was used to document their search practices. The results showed that the Web was the primary information system searched in order to findinformation for university assignments, while the level of database searching was verylow. In particular, the search engine Google was used very frequently either foruniversity assignments or for personal purposes. Regarding students’ practices inevaluating Web‐based information, the top criteria reported were ‘relevance ofinformation’ and ‘easy to understand’. Students’ self‐efficacy concerning Web‐searchingwas found to be high and positively related to the variables ‘frequency of Web use’ and‘years of internet use’. Implications for students’ training are discussed. Students’ search behaviour needs to be expanded beyond the Web search engines, to include a wider range of information retrieval systems.

  5. Measuring Personalization of Web Search

    DEFF Research Database (Denmark)

    Hannak, Aniko; Sapiezynski, Piotr; Kakhki, Arash Molavi;

    2013-01-01

    Web search is an integral part of our daily lives. Recently, there has been a trend of personalization in Web search, where different users receive different results for the same search query. The increasing personalization is leading to concerns about Filter Bubble effects, where certain users...... are simply unable to access information that the search engines’ algorithm decidesis irrelevant. Despitetheseconcerns, there has been little quantification of the extent of personalization in Web search today, or the user attributes that cause it. In light of this situation, we make three contributions....... First, we develop a methodology for measuring personalization in Web search results. While conceptually simple, there are numerous details that our methodology must handle in order to accurately attribute differences in search results to personalization. Second, we apply our methodology to 200 users...

  6. Parallel Processing in Visual Search Asymmetry

    Science.gov (United States)

    Dosher, Barbara Anne; Han, Songmei; Lu, Zhong-Lin

    2004-01-01

    The difficulty of visual search may depend on assignment of the same visual elements as targets and distractors-search asymmetry. Easy C-in-O searches and difficult O-in-C searches are often associated with parallel and serial search, respectively. Here, the time course of visual search was measured for both tasks with speed-accuracy methods. The…

  7. 29 CFR 4050.4 - Diligent search.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than...

  8. Open Source Software for Federated Search

    OpenAIRE

    Shamkant Deshmukh,; Sonia Bhavsar,; Sandeep Bhavsar

    2012-01-01

    The article explains the concept of federated search and demarcates the difference between federatedsearch and other search engines. Advantages of federated search have been described with technologiesused for federated searching. Article also covers open source software available for federated search andgiven some federated search applications of public domain.

  9. Multitasking Web Searching and Implications for Design.

    Science.gov (United States)

    Ozmutlu, Seda; Ozmutlu, H. C.; Spink, Amanda

    2003-01-01

    Findings from a study of users' multitasking searches on Web search engines include: multitasking searches are a noticeable user behavior; multitasking search sessions are longer than regular search sessions in terms of queries per session and duration; both Excite and AlltheWeb.com users search for about three topics per multitasking session and…

  10. The search for the top quark

    International Nuclear Information System (INIS)

    This paper discusses the following topics: top search in the near future, general remarks, top search at HERA, searching for the top quarks at the Z0 machines, finding the top at Lep II, top search in UA2, top search in UA1, and top search at CDF. 58 refs., 38 figs

  11. Ranking XPaths for extracting search result records

    NARCIS (Netherlands)

    Trieschnigg, Dolf; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

    2012-01-01

    Extracting search result records (SRRs) from webpages is useful for building an aggregated search engine which combines search results from a variety of search engines. Most automatic approaches to search result extraction are not portable: the complete process has to be rerun on a new search result

  12. Brasofensine NeuroSearch.

    Science.gov (United States)

    Yu, P

    2000-12-01

    Brasofensine (NS-2214) is a dopamine reuptake inhibitor under development by NeuroSearch for the potential treatment of Parkinson's disease (PD) [178224]. The compound entered phase II trials in Denmark in November 1996, and phase I trials in the US in January 1996 [195505], [206604]. Bristol-Myers Squibb (BMS) had been codeveloping the compound until June 1999, when it decided to withdraw from the collaboration due to financial restraints of further regulatory requirements (such as additional toxicology documentation) [318365], [329665]. NeuroSearch was seeking licensing agreements with one or more international pharmaceutical companies to accelerate the development and marketing of brasofensine [187758] and had plans to meet with new potential partners for discussions concerning brasofensine licensing in late 1999 [337221]. A more complete evaluation of the effects of brasofensine was anticipated to be obtained through controlled trials, of at least 3 months duration, comparing it with a placebo and the marketed anti-Parkinson's drug, L-DOPA [317406]. In addition, further animal (monkey) tests were planned in order to document the safety of the drug in long-term treatment. These studies were expected to be discussed with the US FDA in October 1999 and, if satisfactory, the 3-month clinical trials were planned to commence in mid-2000 [337221]. At a meeting with the FDA during 1999, NeuroSearch presented plans for developing brasofensine alone. These were found to be satisfactory on condition that further preclinical studies were performed prior to any more clinical development [371542]. In August 2000, Lehman Brothers predicted worldwide sales of US $45 million in 2002 and US $175 million in 2003 [389229]. In February 1999, Lehman Brothers predicted the drug had a 35% probability of reaching market, with an estimated first launch date in 2002. The analysts predicted peak sales would occur in 2009, with sales of $250 million at that time [319225]. PMID:11249705

  13. Search Engine Optimization

    CERN Document Server

    Davis, Harold

    2006-01-01

    SEO--short for Search Engine Optimization--is the art, craft, and science of driving web traffic to web sites. Web traffic is food, drink, and oxygen--in short, life itself--to any web-based business. Whether your web site depends on broad, general traffic, or high-quality, targeted traffic, this PDF has the tools and information you need to draw more traffic to your site. You'll learn how to effectively use PageRank (and Google itself); how to get listed, get links, and get syndicated; and much more. The field of SEO is expanding into all the possible ways of promoting web traffic. This

  14. Solar Hidden Photon Search

    OpenAIRE

    Schwarz, Matthias; Wiedemann, Guenter; Lindner, Axel; Redondo, Javier; Ringwald, Andreas; Wiedemann, Gunter

    2011-01-01

    The Solar Hidden Photon Search (SHIPS) is a joint astroparticle project of the Hamburger Sternwarte and DESY. The main target is to detect the solar emission of a new species of particles, so called Hidden Photons (HPs). Due to kinetic mixing, photons and HPs can convert into each other as they propagate. A small number of solar HPs - originating from photon to HP oscillations in the interior of the Sun - can be converted into photons in a long vacuum pipe pointing to the Sun - the SHIPS heli...

  15. Pentaquark Searches at Jlab

    Energy Technology Data Exchange (ETDEWEB)

    Rossi, Patrizia

    2007-01-01

    Since LEPS collaboration reported the first evidence for a S=+1 baryon resonance in early 2003 with a mass of 1.54 GeV, dubbed Θ+, more than ten experiments have confirmed this exotic state, among these two carried out at Jefferson Laboratory. At the same time, there are a number of experiments, mostly at high energies, that report null results. To try to clarify this situation, during the past year, The CLAS Collaboration at Jefferson Laboratory has undertaken a second generation high-statistics experimental program to search for exotics baryons. Here the preliminary results from these experiments are reported.

  16. ATLAS Exotic Searches

    Directory of Open Access Journals (Sweden)

    Bousson Nicolas

    2012-06-01

    Full Text Available Thanks to the outstanding performance of the Large Hadron Collider (LHC that delivered more than 2 fb−1 of proton-proton collision data at center-of-mass energy of 7 TeV, the ATLAS experiment has been able to explore a wide range of exotic models trying to address the questions unanswered by the Standard Model of particle physics. Searches for leptoquarks, new heavy quarks, vector-like quarks, black holes, hidden valley and contact interactions are reviewed in these proceedings.

  17. Search engine and optimization

    OpenAIRE

    Costa, Francisco Miguel de Sá Pereira

    2011-01-01

    A relevância do Search Engine Optimization (SEO), traduzindo para Português “Optimização de Sites para Motores de Pesquisa”, hoje em dia revela-se um tema muito importante para quem pretende ter um site atraente, com muitas visitas e mais tráfego. Todos já se perguntaram porque é que alguns sites por exemplo o sapo se encontra em primeiro lugar na pesquisa do Google. Existem técnicas para que um site fique em primeiro lugar nos resultados obtidos nos motores de pesquisa, ...

  18. ATLAS Exotic Searches

    CERN Document Server

    Bousson, Nicolas

    2012-01-01

    Thanks to the outstanding performance of the Large Hadron Collider (LHC) that delivered more than 2 fb^-1 of proton-proton collision data at center-of-mass energy of 7 TeV, the ATLAS experiment has been able to explore a wide range of exotic models trying to address the questions unanswered by the Standard Model of particle physics. Searches for leptoquarks, new heavy quarks, vector-like quarks, black holes, hidden valley and contact interactions are reviewed in these proceedings.

  19. The Pulsar Search Collaboratory

    CERN Document Server

    Rosen, Rachel; McLaughlin, Maura A; Lynch, Ryan; Kondratiev, Vlad I; Boyles, Jason R; Wilson, M Terry; Lorimer, Duncan R; Ransom, Scott; 10.3847/AER2010004

    2010-01-01

    The Pulsar Search Collaboratory [PSC, NSF #0737641] is a joint project between the National Radio Astronomy Observatory (NRAO) and West Virginia University (WVU) designed to interest high school students in science, technology, engineering, and mathematics [STEM] related career paths by helping them to conduct authentic scientific research. The 3- year PSC program, which began in summer 2008, teaches students to analyze astronomical radio data acquired with the 100-m Robert C. Byrd Green Bank Telescope for the purpose of discovering new pulsars. We present the results of the first complete year of the PSC, which includes two astronomical discoveries.

  20. Searching for uranium

    International Nuclear Information System (INIS)

    In the not-so-distant past, the search for uranium usually followed a conceptual approach in which an unexplored terrain was selected because of its presumed similarities with one that is known to contain one or more deposits. A description, in general terms, is given of the methodology adopted during the different stages of the exploration programme, up to the point of a discovery. Three case histories prove that, in order to reach this point, a certain amount of improvisation and luck is usually required. (author)

  1. Solar Hidden Photon Search

    CERN Document Server

    Schwarz, Matthias; Redondo, Javier; Ringwald, Andreas; Wiedemann, Guenter

    2011-01-01

    The Solar Hidden Photon Search (SHIPS) is a joint astroparticle project of the Hamburger Sternwarte and DESY. The main target is to detect the solar emission of a new species of particles, so called Hidden Photons (HPs). Due to kinetic mixing, photons and HPs can convert into each other as they propagate. A small number of solar HPs - originating from photon to HP oscillations in the interior of the Sun - can be converted into photons in a long vacuum pipe pointing to the Sun - the SHIPS helioscope.

  2. Search for scalar mesons

    International Nuclear Information System (INIS)

    The search for I = 0 0++ mesons is described. The crucial role played by the states in the 1 GeV region is highlighted. An analysis program that with unimpeachable data would produce definitive results on these is outlined and shown with present data to provide prima facie evidence for dynamics beyond that of the quark model. The authors briefly speculate on the current status of the lowest mass scalar mesons and discuss how experiment can resolve the unanswered issues. 30 references, 6 figures, 1 table

  3. Strangelet Search at RHIC

    CERN Document Server

    Adams, J; Ahammed, Z; Amonett, J; Anderson, B D; Arkhipkin, D; Averichev, G S; Badyal, S K; Bai, Y; Balewski, J; Barannikova, O; Barnby, L S; Baudot, J; Bekele, S; Belaga, V V; Bellingeri-Laurikainen, A; Bellwied, R; Berger, J; Bezverkhny, B I; Bharadwaj, S; Bhasin, A; Bhati, A K; Bhatia, V S; Bichsel, H; Bielcik, J; Bielcikova, J; Billmeier, A; Bland, L C; Blyth, C O; Blyth, S L; Bonner, B E; Botje, M; Boucham, A; Bouchet, J; Brandin, A V; Bravar, A; Bystersky, M; Cadman, R V; Cai, X Z; Caines, H; Calderón de la Barca-Sanchez, M; Castillo, J; Catu, O; Cebra, D; Chajecki, Z; Chaloupka, P; Chattopadhyay, S; Chen, H F; Chen, J H; Chen, Y; Cheng, J; Cherney, M; Chikanian, A; Choi, H A; Christie, W; Coffin, J P; Cormier, T M; Cosentino, M R; Cramer, J G; Crawford, H J; Das, D; Das, S; Daugherity, M; De Moura, M M; De Phillips, M; Dedovich, T G; Derevshchikov, A A; Didenko, L; Dietel, T; Dogra, S M; Dong, W J; Dong, X; Draper, J E; Du, F; Dubey, A K; Dunin, V B; Dunlop, J C; Dutta-Majumdar, M R; Eckardt, V; Edwards, W R; Efimov, L G; Emelianov, V; Engelage, J; Eppley, G; Erazmus, B; Estienne, M; Fachini, P; Faivre, J; Fatemi, R; Fedorisin, J; Filimonov, K; Filip, P; Finch, E; Fine, V; Fisyak, Yu; Fornazier, K S F; Fu, J; Gagliardi, C A; Gaillard, L; Gans, J; Ganti, M S; Geurts, F; Ghazikhanian, V; Ghosh, P; González, J E; Gorbunov, Y G; Gos, H; Grachov, O; Grebenyuk, O; Grosnick, D P; Guertin, S M; Guo, Y; Gupta, N; Gutíerrez, T D; Hallman, T J; Hamed, A; Hardtke, D; Harris, J W; Heinz, M; Henry, T W; Hepplemann, S; Hippolyte, B; Hirsch, A; Hjort, E; Hoffmann, G W; Horner, M J; Huang, H Z; Huang, S L; Hughes, E W; Humanic, T J; Igo, G; Ishihara, A; Jacobs, P; Jacobs, W W; Jiang, H; Jones, P G; Judd, E G; Kabana, S; Kang, K; Kaplan, M; Keane, D; Kechechyan, A; Khodyrev, V Yu; Kim, B C; Kiryluk, J; Kisiel, A; Kislov, E M; Klay, J; Klein, S R; Koetke, D D; Kollegger, T; Kopytine, M; Kotchenda, L; Kowalik, K L; Kravtsov, P; Kravtsov, V I; Krämer, M; Krüger, K; Kuhn, C; Kulikov, A I; Kumar, A; Kutuev, R K; Kuznetsov, A A; Lamont, M A C; Landgraf, J M; Lange, S; Laue, F; Lauret, J; Le Vine, M J; Lebedev, A; Lednicky, R; Lee, C H; Lehocka, S; Li, C; Li, Q; Li, Y; Lin, G; Lindenbaum, S J; Lisa, M A; Liu, F; Liu, H; Liu, J; Liu, L; Liu, Q J; Liu, Z; Ljubicic, T; Llope, W J; Long, H; Longacre, R S; Love, W A; Lu, Y; Ludlam, T; Lynn, D; López-Noriega, M; Ma, G L; Ma, J G; Ma, Y G; Magestro, D; Mahajan, S; Mahapatra, D P; Majka, R; Mangotra, L K; Manweiler, R; Margetis, S; Markert, C; Martin, L; Marx, J N; Matis, H S; Matulenko, Yu A; McClain, C J; McShane, T S; Meissner, F; Melnik, Yu M; Meschanin, A; Miller, M L; Minaev, N G; Mironov, C; Mischke, A; Mishra, D K; Mitchell, J; Mohanty, B; Molnár, L; Moore, C F; Morozov, D A; Munhoz, M G; Nandi, B K; Nayak, S K; Nayak, T K; Nelson, J M; Netrakanti, P K; Nikitin, V A; Nogach, L V; Nurushev, S B; Odyniec, Grazyna Janina; Ogawa, A; Okorokov, V; Oldenburg, M; Olson, D; Pal, S K; Panebratsev, Yu A; Panitkin, S Y; Pavlinov, A I; Pawlak, T; Peitzmann, T; Perevozchikov, V; Perkins, C; Peryt, W; Petrov, V A; Phatak, S C; Picha, R; Planinic, M; Pluta, J; Porile, N; Porter, J; Poskanzer, A M; Potekhin, M V; Potrebenikova, E V; Potukuchi, B V K S; Prindle, D; Pruneau, C A; Putschke, J; Rakness, G; Raniwala, R; Raniwala, S; Ravel, O; Ray, R L; Razin, S V; Reichhold, D M; Reid, J G; Reinnarth, J; Renault, G; Retière, F; Ridiger, A; Ritter, H G; Roberts, J B; Rogachevski, O V; Romero, J L; Rose, A; Roy, C; Ruan, L; Russcher, M J; Sahoo, R; Sakrejda, I; Salur, S; Sandweiss, J; Sarsour, M; Savin, I; Sazhin, P S; Schambach, J; Scharenberg, R P; Schmitz, N; Schweda, K; Seger, J; Selyuzhenkov, I; Sen-Gupta, A; Seyboth, P; Shahaliev, E; Shao, M; Shao, W; Sharma, M; Shen, W Q; Shestermanov, K E; Shimansky, S S; Sichtermann, E P; Simon, F; Singaraju, R N; Smirnov, N; Snellings, R; Sood, G; Sowinski, J; Speltz, J; Spinka, H M; Srivastava, B; Stadnik, A; Stanislaus, T D S; Stock, R; Stolpovsky, A; Strikhanov, M N; Stringfellow, B C; Suaide, A A P; Sugarbaker, E R; Sumbera, M; Surrow, B; Swanger, M; Symons, T J M; Szanto de Toledo, A; Szeliga, B; Sørensen, P; Tai, A; Takahashi, J; Tang, A H; Tarnowsky, T J; Thein, D; Thomas, J H; Timmins, A R; Timoshenko, S; Tokarev, M; Trainor, T A; Trentalange, S; Tribble, R E; Tsai, O D; Ulery, J; Ullrich, T; Underwood, D G; Van Buren, G; Van Leeuwen, M; Van der Kolk, N; Van der Molen, A M; Varma, R; Vasilev, A N; Vasilevski, I M; Vernet, R; Vigdor, S E; Viyogi, Y P; Vokal, S; Voloshin, S A; Waggoner, W T; Wang, F; Wang, G; Wang, X L; Wang, Y; Wang, Z M; Ward, H; Watson, J W; Webb, J C; Westfall, G D; Wetzler, A; Whitten, C; Wieman, H; Wissink, S W; Witt, R; Wood, J; Wu, J; Xu, N; Xu, Z; Xu, Z Z; Yamamoto, E; Yepes, P; Yoo, I K; Yurevich, V I; Zborovský, I; Zhang, H; Zhang, W M; Zhang, Y; Zhang, Z P; Zhong, C; Zoulkarneev, R; Zoulkarneeva, Y; Zubarev, A N; Zuo, J X

    2005-01-01

    We report results of the first strangelet search at RHIC. The measurement was done using a triggered data-set that sampled 61 million top 4% most central (head-on) Au+Au collisions at $\\sNN= 200 $GeV in the very forward rapidity region at the STAR detector. Upper limits at a level of a few $10^{-6}$ to $10^{-7}$ per central Au+Au collision are set for strangelets with mass ${}^{>}_{\\sim}30$ GeV/$c^{2}$.

  4. Searching for extraterrestrial civilizations

    Science.gov (United States)

    Kuiper, T. B. H.; Morris, M.

    1977-01-01

    Three interrelated assumptions are critically examined in an attempt to outline a productive strategy for a search for extraterrestrial intelligence. Questions concerning the feasibility of interstellar travel are investigated. It is concluded that the probability of interstellar travel is high enough that, given a modest number of advanced civilizations, at least one of them will engage in interstellar voyages and colonize the galaxy. Assuming, however, that technological civilizations are rare the galaxy would be essentially unpopulated. Attention is given to the present lack of contact with extraterrestrial beings and frequencies for interstellar beacons.

  5. A New Search for $ \

    CERN Multimedia

    Dore, U; Kodama, K; Ushida, N; Loverre, P F

    2002-01-01

    % WA95\\\\ \\\\ The question whether neutrino flavours mix at some level - and the related question whether neutrinos have non-zero mass - is one of the remaining great challenges of experimental physics. Neutrinos from supernovae, from the sun, from the earth's atmosphere, from nuclear reactors and from radioactive decays are currently under study; in this frame, experiments using accelerators play a privileged role because the well known neutrino source properties allow high precision measurements and background control.\\\\ \\\\The main goal of the CHORUS experiment is to search for neutrino oscillations in the $\

  6. Optimised search heuristic combining valid inequalities and tabu search

    OpenAIRE

    Fernandes, Susana; Ramalhinho-Louren??o, Helena

    2008-01-01

    This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling problem is presented.

  7. Email search visualization: An efficient way for searching email

    OpenAIRE

    Thanh Tung, Vuong

    2014-01-01

    Originally email was designed for messaging channel between individuals. However, it is now being used as personal file archiving. The growth of email quantity over time makes searching email hard and time-consuming. It even becomes extremely frustrating for people who have huge amount of emails. Firstly, when searching an email, people often look for a piece of information which is temporarily forgotten. If we can remind of them some related information, searching activity will become faster...

  8. CONTEXT INDEXING IN SEARCH ENGINE USING BINARY SEARCH TREE

    Directory of Open Access Journals (Sweden)

    Charu Kathuria

    2013-06-01

    Full Text Available Indexing in search engines is an active area of current researches and the aim of search engines is to provide the most relevant documents to the users in least possible time. In this paper a context based indexing is proposed where the index list stores the available context along with the keywords. Thus the information will be more relevant as the context of the topic is also made available to the retrieval system. For indexing the keyword extracted from the web documents along with their contexts are stored in Binary Search Tree (BST, to enhance the performance of the search engine.

  9. Searching for heavy leptons

    International Nuclear Information System (INIS)

    This frankly speculative paper discusses ways in which leptons heavier than the tau (if they exist) might be found. The status of the tau is briefly reviewed, and methods for searching for sequential charged leptons beyond the tau and other charged leptons at PEP, PETRA, and CESR are sketched. Charged leptons with mass greater than 20 GeV/c2 might be found at proton accelerators in hadron-hadron, photon-hadron, or ν-hadron collisions. Unstable, neutral heavy leptons might have unique, conserved lepton number or nonunique lepton number. The most difficult leptons to detect are stable neutral heavy leptons; nevertheless, a possible detection method is suggested. The obvious solution to seeking the postulated leptons is an e+e- colliding beam storage ring with c.m. energy = several hundred GeV. Until such a machine is built, one can employ Z0 → L+ + L-; the use of R/sub Z0/ and GAMMA/sub Z0/ in this connection is discussed. If heavier Z0's exist, the heavy lepton search can be extended to higher energies. Another solution for producing these leptons involves the use of clashing e+e- linear accelerators. Characteristics of storage rings are compared with those of clashing linacs; a general description is given of the proposed SLAC Linac-Collider, along with the physics that could be done at such a machine. 6 figures

  10. Resource Allocation Using Metaheuristic Search

    Directory of Open Access Journals (Sweden)

    Andy M. Connor

    2014-02-01

    Full Text Available This research is focused on solving problems in the area of software project management using metaheuristic search algorithmsand as such is resea rch in the field of search based software engineering. The main aim of this research is to ev aluate the performance of different metaheuristic search techniques in resource allocat ion and scheduling problemsthat would be typical of software development projects.This paper reports a set of experiments which evaluate the performance of three algorithms, namely simulat ed annealing, tabu search and genetic algorithms. The experimental results indicate thata ll of themetaheuristics search techniques can be used to solve problems in resource allocation an d scheduling within a software project. Finally, a comparative analysis suggests that overa ll the genetic algorithm had performed better than simulated annealing and tabu search.

  11. Resource allocation using metaheuristic search

    OpenAIRE

    Connor, Andy M.; Amit Shah

    2016-01-01

    This research is focused on solving problems in the area of software project management using metaheuristic search algorithmsand as such is resea rch in the field of search based software engineering. The main aim of this research is to ev aluate the performance of different metaheuristic search techniques in resource allocat ion and scheduling problemsthat would be typical of software development projects.This paper reports...

  12. Spectral library searching in proteomics.

    Science.gov (United States)

    Griss, Johannes

    2016-03-01

    Spectral library searching has become a mature method to identify tandem mass spectra in proteomics data analysis. This review provides a comprehensive overview of available spectral library search engines and highlights their distinct features. Additionally, resources providing spectral libraries are summarized and tools presented that extend experimental spectral libraries by simulating spectra. Finally, spectrum clustering algorithms are discussed that utilize the same spectrum-to-spectrum matching algorithms as spectral library search engines and allow novel methods to analyse proteomics data. PMID:26616598

  13. Policy implications for familial searching

    OpenAIRE

    Kim Joyce; Mammo Danny; Siegel Marni B; Katsanis Sara H

    2011-01-01

    Abstract In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforce...

  14. Credibility in Web Search Engines

    OpenAIRE

    Lewandowski, Dirk

    2012-01-01

    Web search engines apply a variety of ranking signals to achieve user satisfaction, i.e., results pages that provide the best-possible results to the user. While these ranking signals implicitly consider credibility (e.g., by measuring popularity), explicit measures of credibility are not applied. In this chapter, credibility in Web search engines is discussed in a broad context: credibility as a measure for including documents in a search engine's index, credibility as a ranking signal, cred...

  15. LHCb Exotica and Higgs searches

    CERN Multimedia

    Lucchesi, Donatella

    2016-01-01

    The unique phase space coverage and features of the LHCb detector at the LHC makes it an ideal environment to probe complementary New Physics parameter regions. In particular, recently developed jet tagging algorithms are ideal for searches involving $b$ and $c$ jets. This poster will review different jet-related exotica searches together with the efforts in the search for a Higgs boson decaying to a pair of heavy quarks.

  16. Evaluative Measures of Search Engines

    OpenAIRE

    Jitendra Nath Singh; Dr. S.K. Dwivedi

    2012-01-01

    The ability to search and retrieve information from the web efficiently and effectively is great challenge of search engine. Information retrieval on the Web is very different from retrieval in traditional indexed databases because it’s hyper-linked character, the heterogeneity of document types and authoring styles. Thus, since Web retrieval is substantially different from information retrieval, new or revised evaluative measures are required to assess retrieval performance using search engi...

  17. Axions - Motivation, limits and searches

    OpenAIRE

    Raffelt, Georg G.

    2006-01-01

    The axion solution of the strong CP problem provides a number of possible windows to physics beyond the standard model, notably in the form of searches for solar axions and for galactic axion dark matter, but in a broader context also inspires searches for axion-like particles in pure laboratory experiments. We briefly review the motivation for axions, astrophysical limits, their possible cosmological role, and current searches for axions and axion-like particles.

  18. Branding and search engine marketing

    OpenAIRE

    Yeung, Man; Nisar, Tahir

    2014-01-01

    The paper investigates the role of paid search advertising in delivering optimal conversion rates in brand-related search engine marketing (SEM) strategies. We specifically examine the impact of the rank of sponsored links, as well as various metrics of “ad creative” that provide a vehicle for advertisers to communicate and measure brand value within the context of paid search advertising. Using a randomized variation of a firm’s SEM strategy, we find that ad creatives contain significant bra...

  19. Workers Search for Columbia's Debris

    Science.gov (United States)

    2003-01-01

    Members of a US Forest Service search team walk a grid during a Columbia recovery search near the Hemphill, Texas site. The group is accompanied by a space program worker able to identify potential hazards of Shuttle parts. Workers from every NASA Center and numerous federal, state, and local agencies searched for Columbia's debris in the recovery effort. For more information on STS-107, please see GRIN Columbia General Explanation

  20. Distributed search engine architecture based on topic specific searches

    Science.gov (United States)

    Abudaqqa, Yousra; Patel, Ahmed

    2015-05-01

    Indisputably, search engines (SEs) abound. The monumental growth of users performing online searches on the Web is a contending issue in the contemporary world nowadays. For example, there are tens of billions of searches performed everyday, which typically offer the users many irrelevant results which are time consuming and costly to the user. Based on the afore-going problem it has become a herculean task for existing Web SEs to provide complete, relevant and up-to-date information response to users' search queries. To overcome this problem, we developed the Distributed Search Engine Architecture (DSEA), which is a new means of smart information query and retrieval of the World Wide Web (WWW). In DSEAs, multiple autonomous search engines, owned by different organizations or individuals, cooperate and act as a single search engine. This paper includes the work reported in this research focusing on development of DSEA, based on topic-specific specialised search engines. In DSEA, the results to specific queries could be provided by any of the participating search engines, for which the user is unaware of. The important design goal of using topic-specific search engines in the research is to build systems that can effectively be used by larger number of users simultaneously. Efficient and effective usage with good response is important, because it involves leveraging the vast amount of searched data from the World Wide Web, by categorising it into condensed focused topic -specific results that meet the user's queries. This design model and the development of the DSEA adopt a Service Directory (SD) to route queries towards topic-specific document hosting SEs. It displays the most acceptable performance which is consistent with the requirements of the users. The evaluation results of the model return a very high priority score which is associated with each frequency of a keyword.

  1. Search engine optimization with Google

    Directory of Open Access Journals (Sweden)

    Vinit Kumar Gunjan

    2012-01-01

    Full Text Available Search engine optimization is a strategical technique to take a web document in top search results of a search engine. Online presence of an organisation is not only an easy way to reach among the target users but it may be profitable too if optimization is done keeping in view of the target users as of the reason that most of the time users search out with the keywords of their use (Say; PhD in web technology rather than searching the organisation name, and if the page link comes in the top positions then the page may be profitable. This work describes the tweaks of taking the page on top position in Google by increasing the Page rank which may result in the improved visibility and profitable deal for an organisation. Google is most user friendly search engine proved for the Indian users which give user oriented results .In addition, most of other search engines use Google search patterns so we have concentrated on it. So, if a page is optimised in Google it is optimised for most of the search engines.

  2. Evaluative Measures of Search Engines

    Directory of Open Access Journals (Sweden)

    Jitendra Nath Singh

    2012-03-01

    Full Text Available The ability to search and retrieve information from the web efficiently and effectively is great challenge of search engine. Information retrieval on the Web is very different from retrieval in traditional indexed databases because it’s hyper-linked character, the heterogeneity of document types and authoring styles. Thus, since Web retrieval is substantially different from information retrieval, new or revised evaluative measures are required to assess retrieval performance using search engines. In this paper we suggested a number of evaluative measures to evaluate the effectiveness of search engines. The motivation behind each of these measures is presented, along with their descriptions and definitions.

  3. The Jungle Database Search Engine

    DEFF Research Database (Denmark)

    Bøhlen, Michael Hanspeter; Bukauskas, Linas; Dyreson, Curtis

    1999-01-01

    Information spread in in databases cannot be found by current search engines. A database search engine is capable to access and advertise database on the WWW. Jungle is a database search engine prototype developed at Aalborg University. Operating through JDBC connections to remote databases, Jungle...... extracts and indexes database data and meta-data, building a data store of database information. This information is used to evaluate and optimize queries in the AQUA query language. AQUA is a natural and intuitive database query language that helps users to search for information without knowing how...

  4. Dark Matter Searches at ATLAS

    CERN Document Server

    CERN. Geneva

    2016-01-01

    The astrophysical evidence of dark matter provides some of the most compelling clues to the nature of physics beyond the Standard Model. From these clues, ATLAS has developed a broad and systematic search program for dark matter production in LHC collisions. These searches are now entering their prime, with the LHC now colliding protons at the increased 13 TeV centre-of-mass energy and set to deliver much larger datasets than ever before. The results of these searches on the first 13 TeV data, their interpretation, and the design and possible evolution of the search program will be presented.

  5. Illuminating search spaces by mapping elites

    OpenAIRE

    Mouret, Jean-Baptiste; Clune, Jeff

    2015-01-01

    Many fields use search algorithms, which automatically explore a search space to find high-performing solutions: chemists search through the space of molecules to discover new drugs; engineers search for stronger, cheaper, safer designs, scientists search for models that best explain data, etc. The goal of search algorithms has traditionally been to return the single highest-performing solution in a search space. Here we describe a new, fundamentally different type of algorithm that is more u...

  6. Concept Search: Semantics Enabled Information Retrieval

    OpenAIRE

    Giunchiglia, Fausto; Kharkevich, Uladzimir; Zaihrayeu, Ilya

    2010-01-01

    In this paper we present a novel approach, called Concept Search, which extends syntactic search, i.e., search based on the computation of string similarity between words, with semantic search, i.e., search based on the computation of semantic relations between concepts. The key idea of Concept Search is to operate on complex concepts and to maximally exploit the semantic information available, reducing to syntactic search only when necessary, i.e., when no semantic information is available. ...

  7. Online Demand Under Limited Consumer Search

    OpenAIRE

    Jun B. Kim; Paulo Albuquerque; Bronnenberg, Bart J.

    2010-01-01

    Using aggregate product search data from Amazon.com, we jointly estimate consumer information search and online demand for consumer durable goods. To estimate the demand and search primitives, we introduce an optimal sequential search process into a model of choice and treat the observed market-level product search data as aggregations of individual-level optimal search sequences. The model builds on the dynamic programming framework by Weitzman [Weitzman, M. L. 1979. Optimal search for the b...

  8. Ranking XPaths for extracting search result records

    OpenAIRE

    Trieschnigg, Dolf; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

    2012-01-01

    Extracting search result records (SRRs) from webpages is useful for building an aggregated search engine which combines search results from a variety of search engines. Most automatic approaches to search result extraction are not portable: the complete process has to be rerun on a new search result page. In this paper we describe an algorithm to automatically determine XPath expressions to extract SRRs from webpages. Based on a single search result page, an XPath expression is determined whi...

  9. Search for hadronic axions

    International Nuclear Information System (INIS)

    The existence of axions, proposed as very light neutral pseudoscalar bosons, would solve the strong CP problem in the QCD. Axions also arise in supersymmetric and superstring theories and are candidates for dark matter in the universe. Cosmological and astrophysical arguments restrict the masses (ma) of invisible axions to rather narrow 10-5 eV → ma → 10-22 eV range, but with large uncertainties on either side. The KSVZ or hadronic axion is one version of invisible axions, which predicts small coupling of axions to electrons. Models of hadronic axions with E/N ≅ 2 allow for a near or complete cancellation of the axion-photon coupling constant. In this case there is no stellar-evolution limits on ma and for hadronic axions there exists a small window 10 eV ≤ ma ≤ 40 eV between supernova cooling and axion burst arguments. So far the best and only discussed candidate for hot dark matter has been the massive neutrino with a mass of a few eV. Because the Super-Kamiokande experiment suggests the tau neutrino mass of only 0.03-0.1 eV, the hadronic axion in the so-called hadronic axion window could be a good candidate for a cosmological hot dark matter within the mixed dark matter scenario. To verify this window one can search for axions by appealing only to their coupling to nucleons. The most promising methods are the observation of an axion burst from a future supernova and the resonant absorption of almost monochromatic solar axions. We have performed the first experiment along this new line of solar axion investigations. Using a small target of 0.03 g of 57Fe we have made a search for 14.4 keV gamma rays induced by resonant absorption of almost monochromatic solar axions. These Doppler broadened axions could be emitted from the Sun, in M1 transition between the first, thermally excited state and the ground state of 57Fe. An upper limit on hadronic axion mass of 745 eV is obtained at the 95 % confidence level. Search for solar axions is beginning to become

  10. Image Searching on the Excite Web Search Engine.

    Science.gov (United States)

    Goodrum, Abby; Spink, Amanda

    2001-01-01

    Examines visual information needs as expressed in users' Web image queries on the Excite search engine. Discusses metadata; content-based image retrieval; user interaction with images; terms per query; term frequency; and implications for the development of models for visual information retrieval and for the design of Web search engines.…

  11. Using Advanced Search Operators on Web Search Engines.

    Science.gov (United States)

    Jansen, Bernard J.

    Studies show that the majority of Web searchers enter extremely simple queries, so a reasonable system design approach would be to build search engines to compensate for this user characteristic. One hundred representative queries were selected from the transaction log of a major Web search service. These 100 queries were then modified using the…

  12. Efficiency of tabu-search-based conformational search algorithms.

    Science.gov (United States)

    Grebner, Christoph; Becker, Johannes; Stepanenko, Svetlana; Engels, Bernd

    2011-07-30

    Efficient conformational search or sampling approaches play an integral role in molecular modeling, leading to a strong demand for even faster and more reliable conformer search algorithms. This article compares the efficiency of a molecular dynamics method, a simulated annealing method, and the basin hopping (BH) approach (which are widely used in this field) with a previously suggested tabu-search-based approach called gradient only tabu search (GOTS). The study emphasizes the success of the GOTS procedure and, more importantly, shows that an approach which combines BH and GOTS outperforms the single methods in efficiency and speed. We also show that ring structures built by a hydrogen bond are useful as starting points for conformational search investigations of peptides and organic ligands with biological activities, especially in structures that contain multiple rings. PMID:21541959

  13. Visual Representation Determines Search Difficulty: Explaining Visual Search Asymmetries

    Directory of Open Access Journals (Sweden)

    Neil Bruce

    2011-07-01

    Full Text Available In visual search experiments there exist a variety of experimental paradigms in which a symmetric set of experimental conditions yields asymmetric corresponding task performance. There are a variety of examples of this that currently lack a satisfactory explanation. In this paper, we demonstrate that distinct classes of asymmetries may be explained by virtue of a few simple conditions that are consistent with current thinking surrounding computational modeling of visual search and coding in the primate brain. This includes a detailed look at the role that stimulus familiarity plays in the determination of search performance. Overall, we demonstrate that all of these asymmetries have a common origin, namely, they are a consequence of the encoding that appears in the visual cortex. The analysis associated with these cases yields insight into the problem of visual search in general and predictions of novel search asymmetries.

  14. In Search of Exomoons

    CERN Document Server

    Kipping, David M

    2014-01-01

    Two decades ago, astronomers began detecting planets orbiting stars other than our Sun, so-called exoplanets. Since that time, the rate of detections and the sensitivity to ever-smaller planets has improved dramatically with several Earth-sized planets now known. As our sensitivity dives into the terrestrial regime, increasingly the community has wondered if the moons of exoplanets may also be detectable, so-called "exomoons". Their detection represents an outstanding challenge in modern astronomy and would provide deep insights into the uniqueness of our Solar System and perhaps even expand the definition of habitability. Here, I will briefly review theoretical studies exploring the formation and evolution of exomoons, which serve to guide observational searches and provide testable hypotheses. Next, I will outline the different methods which have been proposed to accomplish this challenging feat and their respective merits. Finally, initial results from observational efforts will be summarized with a view t...

  15. Search and Disrupt

    DEFF Research Database (Denmark)

    Ørding Olsen, Anders

    Extant research on external knowledge search and open innovation assumes that collaborators are aligned in their strategic interests towards solving innovation problems. However, disruptive innovation is known to threaten the competitive advantage of incumbent firms, thereby creating a potential...... conflict of interest between these firms and their collaborators. This paper explores the extent to which strategic interests influence joint problem solving in both complementary and disruptive technologies by analyzing the effects of incumbent collaboration. The analysis disentangles inability and...... strategic intent to find that non-incumbents experience suppression of problem solving likelihood within disruptive technologies when incumbent collaborators are not strategically committed. The paper contributes to extant theory by showing the influence of firms’ underlying strategic interests on their...

  16. Music Search and Recommendation

    Science.gov (United States)

    Brandenburg, Karlheinz; Dittmar, Christian; Gruhne, Matthias; Abeßer, Jakob; Lukashevich, Hanna; Dunker, Peter; Gärtner, Daniel; Wolter, Kay; Grossmann, Holger

    In the last ten years, our ways to listen to music have drastically changed: In earlier times, we went to record stores or had to use low bit-rate audio coding to get some music and to store it on PCs. Nowadays, millions of songs are within reach via on-line distributors. Some music lovers already got terabytes of music on their hard disc. Users are now no longer desparate to get music, but to select, to find the music they love. A number of technologies has been developed to adress these new requirements. There are techniques to identify music and ways to search for music. Recommendation today is a hot topic as well as organizing music into playlists.

  17. Learning about Job Search

    DEFF Research Database (Denmark)

    Altmann, Steffen; Falk, Armin; Jäger, Simon;

    We conduct a large-scale field experiment in the German labor market to investigate how information provision affects job seekers’ employment prospects and labor market outcomes. Individuals assigned to the treatment group of our experiment received a brochure that informed them about job search...... strategies and the consequences of unemployment, and motivated them to actively look for new employment. We study the causal impact of the brochure by comparing labor market outcomes of treated and untreated job seekers in administrative data containing comprehensive information on individuals’ employment...... status and earnings. While our treatment yields overall positive effects, these tend to be concentrated among job seekers who are at risk of being unemployed for an extended period of time. Specifically, the treatment effects in our overall sample are moderately positive but mostly insignificant. At the...

  18. Comparing NEO Search Telescopes

    CERN Document Server

    Myhrvold, Nathan

    2015-01-01

    Multiple terrestrial and space-based telescopes have been proposed for detecting and tracking near-Earth objects (NEOs). Detailed simulations of the search performance of these systems have used complex computer codes that are not widely available, which hinders accurate cross- comparison of the proposals and obscures whether they have consistent assumptions. Moreover, some proposed instruments would survey infrared (IR) bands, whereas others would operate in the visible band, and differences among asteroid thermal and visible light models used in the simulations further complicate like-to-like comparisons. I use simple physical principles to estimate basic performance metrics for the ground-based Large Synoptic Survey Telescope and three space-based instruments - Sentinel, NEOCam, and a Cubesat constellation. The performance is measured against two different NEO distributions, the Bottke et al. distribution of general NEOs, and the Veres et al. distribution of earth impacting NEO. The results of the comparis...

  19. Beyond the search process

    DEFF Research Database (Denmark)

    Hyldegård, Jette

    2009-01-01

    concluded that the ISP-model does not fully comply with group members' problem solving process and the involved information seeking behavior. Further, complex academic problem solving seems to be even more complex when it is performed in a group based setting. The study contributes with a new conceptual......This paper reports on the findings from a longitudinal case study exploring Kuhlthau's information search process (ISP)-model in a group based academic setting. The research focus is on group members' activities and cognitive and emotional experiences during the task process of writing an...... assignment. It is investigated if group members' information behavior differ from the individual information seeker in the ISP-model and to what extent this behavior is influenced by contextual (work task) and social (group work) factors. Three groups of LIS students were followed during a 14 weeks period in...

  20. Recursive Lexicographical Search

    DEFF Research Database (Denmark)

    Iskhakov, Fedor; Rust, John; Schjerning, Bertel

    2016-01-01

    We define a class of dynamic Markovian games, directional dynamic games (DDG), where directionality is represented by a strategy-independent partial order on the state space. We show that many games are DDGs, yet none of the existing algorithms are guaranteed to find any Markov perfect equilibrium...... (MPE) of these games, much less all of them. We propose a fast and robust generalization of backward induction we call state recursion that operates on a decomposition of the overall DDG into a finite number of more tractable stage games, which can be solved recursively. We provide conditions under...... which state recursion finds at least one MPE of the overall DDG and introduce a recursive lexicographic search (RLS) algorithm that systematically and efficiently uses state recursion to find all MPE of the overall game in a finite number of steps. We apply RLS to find all MPE of a dynamic model of...

  1. CMS searches for EWKinos

    CERN Document Server

    Bakhshiansohi, Hamed

    2016-01-01

    A review of recent results from CMS on searches for the electroweak production of supersymmetry particles is presented. All possible production scenarios including $\\chi^\\pm\\chi^\\mp$, $\\chi^0\\chi^\\pm$, $\\chi^0\\chi^0$, $\\tilde{l}\\tilde{l}$ and also the vector boson fusion (VBF) production mechanism are investigated. The full 2012 data sample which comprises $19.6 \\ fb^{-1}$ of proton-proton collisions at $\\sqrt{s} = 8 \\ $~TeV is used. In all studied decay modes, the observed yields agree well with the expectation of the standard model (SM) predictions and limits are set on the rates of the direct production of charginos, neutralinos and sleptons.

  2. Comparing NEO Search Telescopes

    Science.gov (United States)

    Myhrvold, Nathan

    2016-04-01

    Multiple terrestrial and space-based telescopes have been proposed for detecting and tracking near-Earth objects (NEOs). Detailed simulations of the search performance of these systems have used complex computer codes that are not widely available, which hinders accurate cross-comparison of the proposals and obscures whether they have consistent assumptions. Moreover, some proposed instruments would survey infrared (IR) bands, whereas others would operate in the visible band, and differences among asteroid thermal and visible-light models used in the simulations further complicate like-to-like comparisons. I use simple physical principles to estimate basic performance metrics for the ground-based Large Synoptic Survey Telescope and three space-based instruments—Sentinel, NEOCam, and a Cubesat constellation. The performance is measured against two different NEO distributions, the Bottke et al. distribution of general NEOs, and the Veres et al. distribution of Earth-impacting NEO. The results of the comparison show simplified relative performance metrics, including the expected number of NEOs visible in the search volumes and the initial detection rates expected for each system. Although these simplified comparisons do not capture all of the details, they give considerable insight into the physical factors limiting performance. Multiple asteroid thermal models are considered, including FRM, NEATM, and a new generalized form of FRM. I describe issues with how IR albedo and emissivity have been estimated in previous studies, which may render them inaccurate. A thermal model for tumbling asteroids is also developed and suggests that tumbling asteroids may be surprisingly difficult for IR telescopes to observe.

  3. A Framework for Structured Quantum Search

    CERN Document Server

    Hogg, T

    1998-01-01

    A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces, and is analytically simpler than previous structured search methods. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It also exhibits the same phase transition in search difficulty as found for sophisticated classical search methods, indicating it is effectively using the problem structure.

  4. Personalization in professional academic search

    NARCIS (Netherlands)

    Verberne, S.; Sappelli, M.; Sørensen, D.R.; Kraaij, W.

    2013-01-01

    In this paper, we investigated how academic search can profit from personalization by incorporating query history and background knowledge in the ranking of the results. We implemented both techniques in a language modelling framework, using the Indri search engine. For our experiments, we used the

  5. Internet multimedia and search mining

    CERN Document Server

    Hua, Xian-Sheng

    2013-01-01

    With the explosion of video and image data available on the Internet, desktops and mobile devices, multimedia search has gained immense importance. This is the first reference book on the subject of internet multimedia search and mining and it will be extremely useful for graduates, researchers and working professionals in the field of information technology and multimedia content analysis.

  6. About AgEcon Search

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    <正>AgEcon Search is a free,open access repository of full-text scholarly literature in agricultural and applied economics,including working papers,conference papers,and journal articles. AgEcon Search is co-sponsored by the Department of Applied Economics and the University Libraries at University of Minnesota and the Agricultural and Applied Economics Association. Research

  7. Diversity, intent, and aggregated search

    NARCIS (Netherlands)

    M. de Rijke

    2014-01-01

    Diversity, intent and aggregated search are three core retrieval concepts that receive significant attention. In search result diversification one typically considers the relevance of a document in light of other retrieved documents. The goal is to identify the probable "aspects" of an ambiguous que

  8. Assessing Bias in Search Engines.

    Science.gov (United States)

    Mowshowitz, Abbe; Kawaguchi, Akira

    2002-01-01

    Addresses the measurement of bias in search engines on the Web, defining bias as the balance and representation of items in a collection retrieved from a database for a set of queries. Assesses bias by measuring the deviation from the ideal of the distribution produced by a particular search engine. (Author/LRW)

  9. Search engines that learn online

    NARCIS (Netherlands)

    K. Hofmann

    2011-01-01

    The goal of my research is to develop self-learning search engines, that can learn online, i.e., directly from interactions with actual users. Such systems can continuously adapt to user preferences throughout their lifetime, leading to better search performance in settings where expensive manual tu

  10. Searching for the GUT monopole

    International Nuclear Information System (INIS)

    The GUT prediction of super-heavy magnetic monopoles has stimulated an intense activity to search for them. The recent observation of a candidate event by Cabrera suggests a very large flux. Energy loss processes are discussed, including several which are unique to monopoles. A large scintillation-counter telescope is being constructed to search for slow monopoles

  11. Evaluating aggregated search using interleaving

    NARCIS (Netherlands)

    A. Chuklin; A. Schuth; K. Hofmann; P. Serdyukov; M. de Rijke

    2013-01-01

    A result page of a modern web search engine is often much more complicated than a simple list of "ten blue links." In particular, a search engine may combine results from different sources (e.g., Web, News, and Images), and display these as grouped results to provide a better user experience. Such a

  12. Next-Gen Search Engines

    Science.gov (United States)

    Gupta, Amardeep

    2005-01-01

    Current search engines--even the constantly surprising Google--seem unable to leap the next big barrier in search: the trillions of bytes of dynamically generated data created by individual web sites around the world, or what some researchers call the "deep web." The challenge now is not information overload, but information overlook.…

  13. DNA breakage drives nuclear search

    OpenAIRE

    Ira, Grzegorz; Hastings, Philip J.

    2012-01-01

    The search for a homologous template is a fundamental, yet largely uncharacterized, reaction in DNA double-strand break repair. Two reports now demonstrate that broken chromosomes increase their movement and explore large volumes of nuclear space searching for a homologous template. Break mobility requires resection and recombination enzymes, as well as damage-checkpoint components.

  14. Semantic Search of Web Services

    Science.gov (United States)

    Hao, Ke

    2013-01-01

    This dissertation addresses semantic search of Web services using natural language processing. We first survey various existing approaches, focusing on the fact that the expensive costs of current semantic annotation frameworks result in limited use of semantic search for large scale applications. We then propose a vector space model based service…

  15. Search Models: Who Does the Looking?

    Science.gov (United States)

    Duffield, Judith A.

    1996-01-01

    Describes two search models for school libraries. Models include searches defined by the student but conducted by a trained searcher, and student-conducted searches which teach search skills. Decisions about which model (or combination) to use should be based on the available resources and the purposes for conducting the search. (AEF)

  16. Searching LEXIS and WESTLAW: Part II.

    Science.gov (United States)

    Franklin, Carl

    1986-01-01

    This second of a three-part series compares search features (i.e., truncation symbols, boolean operators, proximity operators, phrase searching, save searches) of two databases providing legal information. Search tips concerning charges and effective searching and tables listing functions of commands and proximity operators for both databases are…

  17. TwisterSearch : a distributed user interface for collaborative web search

    OpenAIRE

    Rädle, Roman; Jetter, Hans-Christian; Reiterer, Harald

    2013-01-01

    Although a Web search is typically regarded as a solitary activity, col-laborative search approaches are becoming an increasingly relevant topic for HCI and distributed user interfaces (DUIs). Today’s collaborative search systems lack comprehensive search support that also involves pre- or post-search activities such as preparing for a search or making sense of search results. We believe that post-WIMP DUIs can help to better support social searches and have identified four design goals that ...

  18. Proposal of Tabu Search Algorithm Based on Cuckoo Search

    Directory of Open Access Journals (Sweden)

    Ahmed T. Sadiq Al-Obaidi

    2014-03-01

    Full Text Available This paper presents a new version of Tabu Search (TS based on Cuckoo Search (CS called (Tabu-Cuckoo Search TCS to reduce the effect of the TS problems. The proposed algorithm provides a more diversity to candidate solutions of TS. Two case studies have been solved using the proposed algorithm, 4-Color Map and Traveling Salesman Problem. The proposed algorithm gives a good result compare with the original, the iteration numbers are less and the local minimum or non-optimal solutions are less.

  19. OpenSearch and SRU: A Continuum of Searching

    OpenAIRE

    LeVan, Ralph

    2006-01-01

    Not all library content can be exposed as HTML pages for harvesting by search engines such as Google and Yahoo!. If a library instead exposes its content through a local search interface, that content can then be found by users of metasearch engines such as A9 and Vivísimo. The functionality provided by the local search engine will affect the functionality of the metasearch engine and the findability of the library’s content. This paper describes that situation and some emerging standards in ...

  20. Visual search in barn owls: from feature to conjunction search

    OpenAIRE

    Orlowski, Julius

    2015-01-01

    Visual search is the process of searching for something interesting in a cluttered environment. It is well studied in humans, but not in non-primate species. This study provides a comprehensive overview of visual search in barn owls using a novel methodology: the OwlCam. The OwlCam is a tiny, lightweight camera that can be mounted onto the head of barn owls to record first person videos from these birds. Due to the very limited eye movements of barn owls this provides an easy method of gaze t...

  1. Proposal of Tabu Search Algorithm Based on Cuckoo Search

    OpenAIRE

    Ahmed T.Sadiq Al-Obaidi; Ahmed Badre Al-Deen Majeed

    2014-01-01

    This paper presents a new version of Tabu Search (TS) based on Cuckoo Search (CS) called (Tabu-Cuckoo Search TCS) to reduce the effect of the TS problems. The proposed algorithm provides a more diversity to candidate solutions of TS. Two case studies have been solved using the proposed algorithm, 4-Color Map and Traveling Salesman Problem. The proposed algorithm gives a good result compare with the original, the iteration numbers are less and the local minimum or non-optimal solutions are less.

  2. Web Search Engines: (More) Features and Commands.

    Science.gov (United States)

    Hock, Randolph

    2000-01-01

    Provides a summary look at the features provided by nine major World Wide Web search engines. Examines size, Boolean operators, phrase searching capabilities, media searching, format options, and special features. (LRW)

  3. MedlinePlus FAQ: Search Cloud

    Science.gov (United States)

    ... faq/searchcloud.html Question: How does the search cloud work? To use the sharing features on this page, please enable JavaScript. Answer: The search cloud displays the top 100 search terms typed into ...

  4. New particle searches

    International Nuclear Information System (INIS)

    The Standard Model is a remarkable result of decades of work in particle physics, but it is clearly an incomplete representation of the world. Exploring possibilities beyond the Standard Model is a major preoccupation of both theorists and experimentalists. Despite the many suggestions that are extant about the missing links within the Standard Model as well as extensions beyond it, no hard experimental evidence exists. In particular, in more than five years of experimentation both at PETRA and PEP no new particles have been found that would indicate new physics. Several reasons are possible for these negative results: the particles may be too heavy; the experiments may not be looking in the proper way; the cross sections may be too small or finally the particles may not exist. A continuing PEP program, at high luminosity will ensure that the second and third reason continue to be addressed. The higher energy e+e- storage rings such as TRISTAN and LEP will extend the mass limits. High mass particles can also be produced at the CERN collider and soon with the Tevatron collider. A concise summary of the mass limits from the PETRA experiments has been given in a recent Mark J publication. The results shown provide a convenient yardstick against which to measure future search experiments

  5. Hybrid Keyword Search Auctions

    CERN Document Server

    Goel, Ashish

    2008-01-01

    Search auctions have become a dominant source of revenue generation on the Internet. Such auctions have typically used per-click bidding and pricing. We propose the use of hybrid auctions where an advertiser can make a per-impression as well as a per-click bid, and the auctioneer then chooses one of the two as the pricing mechanism. We assume that the advertiser and the auctioneer both have separate beliefs (called priors) on the click-probability of an advertisement. We first prove that the hybrid auction is truthful, assuming that the advertisers are risk-neutral. We then show that this auction is superior to the existing per-click auction in multiple ways: 1) It takes into account the risk characteristics of the advertisers. 2) For obscure keywords, the auctioneer is unlikely to have a very sharp prior on the click-probabilities. In such situations, the hybrid auction can result in significantly higher revenue. 3) An advertiser who believes that its click-probability is much higher than the auctioneer's es...

  6. Search for neutrino oscillations

    International Nuclear Information System (INIS)

    The present paper reports on preliminary results from the E 816 experiment at Brookhaven National Laboratory. E 816 is the continuation of a 1984 experiment (PS 191) which was devoted to a neutrino decay search in the CERN PS neutrino beam. No candidate was seen, but a study of neutrino interactions in the calorimeter indicated an anomalous electron production. The statistics was too low and the experiment has been rerun in spring 86 at BNL to look specifically, with an improved detector for nu/sub e/ arising from a low energy nu/sub μ/ beam. The results presented here are preliminary for at least two reasons: first the collaboration is presently running a calibration test which results are not included here; second, only 1/3 of the neutrino data is used, and no mention will be made to antineutrino data for which the analysis is still going on. This report will directly start with a description of our apparatus, followed by the data analysis

  7. Medical literature search dot com

    Directory of Open Access Journals (Sweden)

    Vivek Jain

    2011-01-01

    Full Text Available The Internet provides a quick access to a plethora of the medical literature, in the form of journals, databases, dictionaries, textbooks, indexes, and e-journals, thereby allowing access to more varied, individualized, and systematic educational opportunities. Web search engine is a tool designed to search for information on the World Wide Web, which may be in the form of web pages, images, information, and other types of files. Search engines for internet-based search of medical literature include Google, Google scholar, Yahoo search engine, etc., and databases include MEDLINE, PubMed, MEDLARS, etc. Commercial web resources (Medscape, MedConnect, MedicineNet add to the list of resource databases providing some of their content for open access. Several web-libraries (Medical matrix, Emory libraries have been developed as meta-sites, providing useful links to health resources globally. Availability of specific dermatology-related websites (DermIs, DermNet, and Genamics Jornalseek is useful addition to the ever growing list of web-based resources. A researcher must keep in mind the strengths and limitations of a particular search engine/database while searching for a particular type of data. Knowledge about types of literature and levels of detail available, user interface, ease of access, reputable content, and period of time covered allow their optimal use and maximal utility in the field of medicine.

  8. Medical literature search dot com.

    Science.gov (United States)

    Jain, Vivek; Raut, Deepak K

    2011-01-01

    The Internet provides a quick access to a plethora of the medical literature, in the form of journals, databases, dictionaries, textbooks, indexes, and e-journals, thereby allowing access to more varied, individualized, and systematic educational opportunities. Web search engine is a tool designed to search for information on the World Wide Web, which may be in the form of web pages, images, information, and other types of files. Search engines for internet-based search of medical literature include Google, Google scholar, Yahoo search engine, etc., and databases include MEDLINE, PubMed, MEDLARS, etc. Commercial web resources (Medscape, MedConnect, MedicineNet) add to the list of resource databases providing some of their content for open access. Several web-libraries (Medical matrix, Emory libraries) have been developed as meta-sites, providing useful links to health resources globally. Availability of specific dermatology-related websites (DermIs, DermNet, and Genamics Jornalseek) is useful addition to the ever growing list of web-based resources. A researcher must keep in mind the strengths and limitations of a particular search engine/database while searching for a particular type of data. Knowledge about types of literature and levels of detail available, user interface, ease of access, reputable content, and period of time covered allow their optimal use and maximal utility in the field of medicine. PMID:21393941

  9. Academic search engines: librarian's friend, researcher's delight

    OpenAIRE

    Chakravarty, Rupak; Randhawa, Sukhwinder

    2006-01-01

    Search engines are about excitement, optimism, hope and enrichment. Search engines are also about despair and disappointment. A researcher while using search engines for resource discovery might have experienced one or the other sentiments. One may say that user satisfaction depends much upon the search strategies deployed by the user. But at the same time its also depends upon the quality of search engine used for information retrieval. Today, there are many search engines used for resource ...

  10. The development of organized visual search

    OpenAIRE

    Woods, Adam J.; Goksun, Tilbe; Chatterjee, Anjan; Zelonis, Sarah; Mehta, Anika; Smith, Sabrina E.

    2013-01-01

    Visual search plays an important role in guiding behavior. Children have more difficulty performing conjunction search tasks than adults. The present research evaluates whether developmental differences in children's ability to organize serial visual search (i.e., search organization skills) contribute to performance limitations in a typical conjunction search task. We evaluated 134 children between the ages of 2 and 17 on separate tasks measuring search for targets defined by a conjunction o...

  11. Knowledge Acquisition for Semantic Search Systems

    OpenAIRE

    W. Wei; Barnaghi, PM; Bargiela, A

    2008-01-01

    Semantic search extends the scope of conventional information search and retrieval paradigms from documentoriented and to entity and knowledge-centric search and retrieval. By attempting to provide direct and intuitive answers such systems alleviate information overload problem and reduce information seekers’ cognitive overhead. Ontologies and knowledge bases are fundamental cornerstones in semantic search systems based on which sophisticated search mechanisms and efficient search services ar...

  12. New perspectives on Web search engine research

    OpenAIRE

    Lewandowski, Dirk

    2012-01-01

    Purpose–The purpose of this chapter is to give an overview of the context of Web search and search engine-related research, as well as to introduce the reader to the sections and chapters of the book. Methodology/approach–We review literature dealing with various aspects of search engines, with special emphasis on emerging areas of Web searching, search engine evaluation going beyond traditional methods, and new perspectives on Webs earching. Findings–The approaches to studying Web search eng...

  13. Mechanism Design for Federated Sponsored Search Auctions

    OpenAIRE

    Ceppi, Sofia; Gatti, Nicola; Gerding, Enrico

    2011-01-01

    Recently there is an increase in smaller, domain-specific search engines that scour the deep web finding information that general-purpose engines are unable to discover. These search engines play a crucial role in the new generation of search paradigms where federated search engines (FSEs) integrate search results from heterogeneous sources. In this paper we pose, for the first time, the problem to design a revenue mechanism that ensures profits both to individual search engines and FSEs as a...

  14. Date restricted queries in web search engines

    OpenAIRE

    Lewandowski, Dirk

    2004-01-01

    Search engines usually offer a date restricted search on their advanced search pages. But determining the actual update of a web page is not without problems. We conduct a study testing date restricted queries on the search engines Google, Teoma and Yahoo!. We find that these searches fail to work properly in the examined engines. We discuss implications of this for further research and search engine development.

  15. Mechanism design for federated sponsored search auctions

    OpenAIRE

    Ceppi, Sofia; Gatti, Nicola; Gerding, Enrico H.

    2011-01-01

    Recently there is an increase in smaller, domain-specific search engines that scour the deep web finding information that general-purpose engines are unable to discover. These search engines play a crucial role in the new generation of search paradigms where federated search engines (FSEs) integrate search results from heterogeneous sources. In this paper we pose, for the first time, the problem to design a revenue mechanism that ensures profits both to individual search engines and FSEs as a...

  16. Intelligent Peer Networks for Collaborative Web Search

    OpenAIRE

    Menczer, Filippo; Wu, Le-Shin; Akavipat, Ruj

    2008-01-01

    Collaborative query routing is a new paradigm for Web search that treats both established search engines and other publicly available indices as intelligent peer agents in a search network. The approach makes it transparent for anyone to build their own (micro) search engine, by integrating established Web search services, desktop search, and topical crawling techniques. The challenge in this model is that each of these agents must learn about its environment— the existence, knowledge, divers...

  17. Search Behaviour On Photo Sharing Platforms

    OpenAIRE

    Maniu S.; O'Hare N.; Aiello L.M.; Chiarandini L.; Jaimes A.

    2013-01-01

    The behaviour, goals, and intentions of users while searching for images in large scale online collections are not well understood, with image search log analysis providing limited insights, in part because they tend only to have access to user search and result click information. In this paper we study user search behaviour in a large photo-sharing platform, analyzing all user actions during search sessions (i.e. including post result-click pageviews). Search accounts for a significant part ...

  18. Web Search Studies: Multidisciplinary Perspectives on Web Search Engines

    Science.gov (United States)

    Zimmer, Michael

    Perhaps the most significant tool of our internet age is the web search engine, providing a powerful interface for accessing the vast amount of information available on the world wide web and beyond. While still in its infancy compared to the knowledge tools that precede it - such as the dictionary or encyclopedia - the impact of web search engines on society and culture has already received considerable attention from a variety of academic disciplines and perspectives. This article aims to organize a meta-discipline of “web search studies,” centered around a nucleus of major research on web search engines from five key perspectives: technical foundations and evaluations; transaction log analyses; user studies; political, ethical, and cultural critiques; and legal and policy analyses.

  19. The Anatomy of Web Search Result Clustering and Search Engines

    Directory of Open Access Journals (Sweden)

    V.JAWAHAR SENTHIL KUMAR

    2010-12-01

    Full Text Available World Wide Web is a very large distributed digital information space. The ability to search and retrieve information from the Webefficiently and effectively is an enabling technology for realizing its full potential. Current search tools retrieve too many documents, of which only a small fraction are relevant to the user query. Furthermore, the most relevant documents do not necessarily appear at the top of the query output order. Clustering Techniques are now being used to give a meaningful search result on web. Text document clustering has been traditionally investigated as a means of improving the performance of search engines. We present a thorough comparison of the algorithms based on the various facets of their features and functionality. Furthermore, we highlight the main characteristics of a number of existing Web clustering engines and also discuss how to evaluate their retrieval performance.

  20. Search systems and computer-implemented search methods

    Energy Technology Data Exchange (ETDEWEB)

    Payne, Deborah A.; Burtner, Edwin R.; Bohn, Shawn J.; Hampton, Shawn D.; Gillen, David S.; Henry, Michael J.

    2015-12-22

    Search systems and computer-implemented search methods are described. In one aspect, a search system includes a communications interface configured to access a plurality of data items of a collection, wherein the data items include a plurality of image objects individually comprising image data utilized to generate an image of the respective data item. The search system may include processing circuitry coupled with the communications interface and configured to process the image data of the data items of the collection to identify a plurality of image content facets which are indicative of image content contained within the images and to associate the image objects with the image content facets and a display coupled with the processing circuitry and configured to depict the image objects associated with the image content facets.

  1. Searching for existing nuclear data

    International Nuclear Information System (INIS)

    As an example of finding existing data useful for high energy and heavy ion materials analysis the Nuclear Structure References of Brookhaven National Laboratory's National Nuclear Data Center was searched. The search was limited to incident ions of mass ≤ 7 amu (excluding alphas) with energies under 100 MeV, and the target nuclei were limited to mass ≤ 30 amu. Ease of use, time necessary for retrieval as well as pertinence was explored. Examples of applicable data found during the search are presented. 8 refs., 1 tab

  2. Computational Search in Architectural Design

    OpenAIRE

    Mendez Echenagucia, Tomas Ignacio

    2014-01-01

    The objective of this PhD research is to investigate how best to use computational search processes in the early phase of design. Search algorithms are implemented in combination with parametric models of different kinds of geometry, with the purpose of studying various building performances. The early phase of design and the nature of the design problem are stud-ied to get an idea of the kind of search process that would best accompany architects during this phase. Multi-disciplinarity and c...

  3. Dark matter searches in ATLAS

    CERN Document Server

    Diehl, Edward; The ATLAS collaboration

    2016-01-01

    Dark matter particles may be produced at the LHC in combination with other particles, typically from initial state radiation. We present results from the ATLAS experiment from searches for phenomena with jets, photons, heavy quarks, electroweak gauge bosons, or Higgs bosons recoiling against large missing transverse momentum. The measurements are interpreted using several theoretical frameworks including simplified models with pair production of Weakly Interacting Massive Particles, effective field theories, and other beyond the Standard Model scenarios. Constraints from dijet searches are compared with results from the “Mono-X” searches to provide a combined interpretation in the context of simplified models.

  4. Visual Representation Determines Search Difficulty: Explaining Visual Search Asymmetries

    OpenAIRE

    Neil Bruce

    2011-01-01

    In visual search experiments there exist a variety of experimental paradigms in which a symmetric set of experimental conditions yields asymmetric corresponding task performance. There are a variety of examples of this that currently lack a satisfactory explanation. In this paper, we demonstrate that distinct classes of asymmetries may be explained by virtue of a few simple conditions that are consistent with current thinking surrounding computational modeling of visual search and coding in t...

  5. The Anatomy of Web Search Result Clustering and Search Engines

    OpenAIRE

    V.JAWAHAR SENTHIL KUMAR; R.SUBHASHINI

    2010-01-01

    World Wide Web is a very large distributed digital information space. The ability to search and retrieve information from the Webefficiently and effectively is an enabling technology for realizing its full potential. Current search tools retrieve too many documents, of which only a small fraction are relevant to the user query. Furthermore, the most relevant documents do not necessarily appear at the top of the query output order. Clustering Techniques are now being used to give a meaningful ...

  6. ArraySearch: A Web-Based Genomic Search Engine

    OpenAIRE

    Wilson, Tyler J; Ge, Steven X

    2012-01-01

    Recent advances in microarray technologies have resulted in a flood of genomics data. This large body of accumulated data could be used as a knowledge base to help researchers interpret new experimental data. ArraySearch finds statistical correlations between newly observed gene expression profiles and the huge source of well-characterized expression signatures deposited in the public domain. A search query of a list of genes will return experiments on which the genes are significantly up- or...

  7. A framework for structured quantum search

    Science.gov (United States)

    Hogg, Tad

    1998-09-01

    A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It also exhibits the same phase transition in search difficulty as found for sophisticated classical search methods, indicating that it is effectively using the problem structure.

  8. Searching for extraterrestrial civilizations.

    Science.gov (United States)

    Kuiper, T B; Morris, M

    1977-05-01

    We have argued that planning for a search for extraterrestrial intelligence should involve a minimum number of assumptions. In view of the feasibility (at our present level of understanding) of using nuclear fusion to effect interstellar travel at a speed of 0.1c, it appears unwarranted (at this time) to assume that it would not occur for at least some technologically advanced civilizations. One cannot even conclude that humans would not attempt this within the next few centuries. On the contrary, the most likely future situation, given the maintenance of technological growth and the absence of extraterrestrial interference, is that our civilization will explore and colonize our galactic neighborhood. A comparison of the time scales of galactic evolution and interstellar travel leads to the conclusion that the galaxy is either essentially empty with respect to technological civilizations or extensively colonized. In the former instance, a SETI would be unproductive. In the latter, a SETI could be fruitful if a signal has been deliberately directed at the earth or at an alien outpost, probe, or communication relay station in our solar system. In the former case, an existing antenna would probably be sufficient to detect the signal. In the latter case, success would depend on the way in which the communications were coded. Failure to detect a signal could permit any of the following conclusions: (i) the galaxy is devoid of technological civilizations, advanced beyond our own, (ii) such civilizations exist, but cannot (for some reason which is presently beyond our ken) engage in interstellar colonization, or (iii) such civilizations are not attempting overt contact with terrestrial civilizations and their intercommunications, if present, are not coded in a simple way. To plan at this time for a high-cost, large-array SETI based on the last two possibilities appears to be rather premature. PMID:17760037

  9. Search Result Merging and Ranking Strategies in Meta-Search Engines: A Survey

    OpenAIRE

    Hossein Jadidoleslamy

    2012-01-01

    MetaSearch is utilizing multiple other search systems to perform simultaneous search. A MetaSearch Engine (MSE) is a search system that enables MetaSearch. To perform a MetaSearch, user query is sent to multiple search engines; once the search results returned, they are received by the MSE, then merged into a single ranked list and the ranked list is presented to the user. When a query is submitted to a MSE, decisions are made with respect to the underlying search engines to be used, what mod...

  10. Tag Based Audio Search Engine

    Directory of Open Access Journals (Sweden)

    Parameswaran Vellachu

    2012-03-01

    Full Text Available The volume of the music database is increasing day by day. Getting the required song as per the choice of the listener is a big challenge. Hence, it is really hard to manage this huge quantity, in terms of searching, filtering, through the music database. It is surprising to see that the audio and music industry still rely on very simplistic metadata to describe music files. However, while searching audio resource, an efficient "Tag Based Audio Search Engine" is necessary. The current research focuses on two aspects of the musical databases 1. Tag Based Semantic Annotation Generation using the tag based approach.2. An audio search engine, using which the user can retrieve the songs based on the users choice. The proposed method can be used to annotation and retrieve songs based on musical instruments used , mood of the song, theme of the song, singer, music director, artist, film director, instrument, genre or style and so on.

  11. Zebra: Searching for Rare Diseases

    DEFF Research Database (Denmark)

    Dragusin, Radu; Petcu, Paula; Lioma, Christina;

    2012-01-01

    disease diagnostic hypotheses in the domain of medical IR. In this work, we build upon an existing vertical medical search engine, Zebra, that is focused on rare disease diagnosis. In previous work, Zebra has been evaluated using real-life medical cases of rare and difficult diseases, and has been found...... to be a useful and competitive tool for clinicians. In this work, we extend Zebra’s functionalities to optimise the task of medical diagnosis through search as follows: we add the option of grouping retrieved documents into clusters based on disease name occurrence, and we offer a ‘disease......Task-based search addresses situations where standard off-the-shelf Information Retrieval (IR) technology may not suffice to satisfy users in their tasks. In these situations, IR systems should be tailored to the user’s task-specific needs and requirements. One such task is searching for rare...

  12. Location-based Web Search

    Science.gov (United States)

    Ahlers, Dirk; Boll, Susanne

    In recent years, the relation of Web information to a physical location has gained much attention. However, Web content today often carries only an implicit relation to a location. In this chapter, we present a novel location-based search engine that automatically derives spatial context from unstructured Web resources and allows for location-based search: our focused crawler applies heuristics to crawl and analyze Web pages that have a high probability of carrying a spatial relation to a certain region or place; the location extractor identifies the actual location information from the pages; our indexer assigns a geo-context to the pages and makes them available for a later spatial Web search. We illustrate the usage of our spatial Web search for location-based applications that provide information not only right-in-time but also right-on-the-spot.

  13. The Search for Directed Intelligence

    CERN Document Server

    Lubin, Philip

    2016-01-01

    We propose a search for sources of directed energy systems such as those now becoming technologically feasible on Earth. Recent advances in our own abilities allow us to foresee our own capability that will radically change our ability to broadcast our presence. We show that systems of this type have the ability to be detected at vast distances and indeed can be detected across the entire horizon. This profoundly changes the possibilities for searches for extra-terrestrial technology advanced civilizations. We show that even modest searches can be extremely effective at detecting or limiting many civilization classes. We propose a search strategy that will observe more than 10 12 stellar and planetary systems with possible extensions to more than 10 20 systems allowing us to test the hypothesis that other similarly or more advanced civilization with this same capability, and are broadcasting, exist.

  14. Levy flights and random searches

    International Nuclear Information System (INIS)

    In this work we discuss some recent contributions to the random search problem. Our analysis includes superdiffusive Levy processes and correlated random walks in several regimes of target site density, mobility and revisitability. We present results in the context of mean-field-like and closed-form average calculations, as well as numerical simulations. We then consider random searches performed in regular lattices and lattices with defects, and we discuss a necessary criterion for distinguishing true superdiffusion from correlated random walk processes. We invoke energy considerations in relation to critical survival states on the edge of extinction, and we analyze the emergence of Levy behavior in deterministic search walks. Finally, we comment on the random search problem in the context of biological foraging.

  15. Searches for new macroscopic forces

    International Nuclear Information System (INIS)

    The search for new interactions and their associated bosons is a central theme in modern physics. Such searches are particularly topical today, when there is a consensus that the Standard Model cannot be complete, and that new interactions and their mediating particles are required. However, because of the wide variety of theoretical ideas for overcoming the perceived difficulties of the Standard Model, there is no consensus on the expected properties of mediating particles. One normally supposes that the bosons mediating these new interactions have not been observed because they are too massive to have been produced by existing accelerators. Therefore particle searches are usually conducted at the highest energy accelerators. However, it has recently been recognized that there is another quite different and largely unexplored window on possible new physics, namely the search for new bosons with masses so low that they would generate a macroscopic force. This paper covers recent theoretical and experimental work that addresses this possibility

  16. New Physics Searches at BABAR

    Energy Technology Data Exchange (ETDEWEB)

    Renga, Francesco

    2008-09-30

    We will present the most recent results from the BABAR Collaboration concerning New Physics searches in rare B and Lepton Flavour Violating (LFV) decays, including b {yields} s transitions, purely leptonic B decays and LFV {tau} decays.

  17. Generalized Quantum Search with Parallelism

    CERN Document Server

    Gingrich, R M; Cerf, N J; Gingrich, Robert; Williams, Colin P.; Cerf, Nicolas

    2000-01-01

    We generalize Grover's unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover's algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use the generalized formula to determine the optimal strategy for using the unstructured quantum search algorithm. On average the optimal strategy is about 12% better than the naive use of Grover's algorithm. The speedup obtained is not dramatic but it illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. We extend the analysis to the case of a society of k quantum searches acting in parallel. We derive an analytic formula that connects the degree of parallelism with the optimal strategy for k-parallel quantum search. We then derive th...

  18. Firm Search for External Knowledge

    DEFF Research Database (Denmark)

    Sofka, Wolfgang; Grimpe, Christoph

    2012-01-01

    to experience the negative performance effects of oversearch. Based on a comprehensive sample of almost 8,000 firms from ten European countries, we find that institutions matter considerably for firms' search activity. Higher market orientation of institutions increases the effectiveness of firms' search...... ignored the institutional context that provides or denies access to external knowledge at the country level. Combining institutional and knowledge search theory, we suggest that the market orientation of the institutional environment and the magnitude of institutional change influence when firms begin...... for external knowledge while higher magnitudes of institutional change decrease it. Our results provide important insights for management on how to adapt search strategies to the institutional context....

  19. The Internal Pudendal Artery Perforator Thigh Flap: A New Freestyle Pedicle Flap for the Ischial Region

    Directory of Open Access Journals (Sweden)

    Ichiro Hashimoto, MD

    2014-05-01

    Conclusions: The perforator vessels of the internal pudendal artery are very close to the ischial tuberosity. Blood flow to the flap is reliable when careful debridement of the pressure sore is performed. The iPap thigh flap is a new option for soft-tissue defects in the ischial region, including ischial pressure sores.

  20. Freestyle facial perforator flaps-a safe reconstructive option for moderate-sized facial defects

    DEFF Research Database (Denmark)

    Gunnarsson, Gudjon Leifur; Jackson, Ian Thomas; Thomsen, Jorn Bo

    2014-01-01

    BACKGROUND: Perforators are a constant anatomical finding in the facial area and any known flap can in theory be based on the first perforator located at the flap rotation axis. METHODS: A case series of single stage reconstruction of moderate sized facial defects using 21 perforator based local...... flaps in 19 patients from 2008-2013. RESULTS: A sufficient perforator was located in every case and the flap rotated along its axis (76 %) or advanced (24 %). Reconstruction was successfully achieved with a high self reported patient satisfaction. Two minor complications occurred early on in the series...... and corrective procedures were performed in four patients. CONCLUSIONS: The random facial perforator flap seems to be a good and reliable option for the reconstruction of facial subunits, especially the periorbital, nasal and periocular area with a minimal morbidity and a pleasing result in a one...

  1. Between Formula and Freestyle. Nicolai Abildgaard and Eighteenth-Century Painting Technique

    DEFF Research Database (Denmark)

    Filtenborg, Troels; Vila Espuna, Anna

    of young artists. Abildgaard has been the subject of a number of studies through the years. Within this considerable body of research, however, little attention has been given to the technical, material aspect of his art. This book presents results of a paint technical study of his oeuvre, from early...... student paintings to mature works from his late years. As a result of the composite nature of his training in Copenhagen as well as in Rome in the 1760ies and 70ies, a number of factors in Abildgaard’s formative years were influential in shaping his painting methods and choice of materials. Defying a...

  2. Internet Search and Hotel Revenues

    OpenAIRE

    Das, P.

    2015-01-01

    We examine if online information search trends reflect public interest in purchasing hotel rooms. We introduce the trends into univariate forecasting models and conventional structural models of room night stays and occupancy rates. We find that on a monthly frequency, search trends are significantly reflective of future room night stays and occupancy rates after controlling for known determinants of these variables. Inclusion the trends significantly improve the weekly forecasts of the perfo...

  3. About AgEcon Search

    Institute of Scientific and Technical Information of China (English)

    2013-01-01

    <正>AgEcon Search is a free,open access repository of full-text scholarly literature in agricultural and applied economics,including working papers,conference papers,and journal articles. AgEcon Search is co-sponsored by the Department of Applied Economics and the University Libraries at University of Minnesota and the Agricultural and Applied Economics Association. Research in Agricultural

  4. Direct dark matter searches review

    Directory of Open Access Journals (Sweden)

    Gascon Jules

    2015-01-01

    Full Text Available Direct Dark Matter Searches are experiments looking for the energetic recoils due to the scattering of Weakly Interacting Massive Particles (WIMPs from our galactic halo on nuclei in a terrestrial target. The principles of these type of searches is described, and the status and results of the leading experiments in that field are presented, as well as their prospects in the coming years.

  5. Search for strange quark matter

    CERN Document Server

    Hill, J C

    2000-01-01

    We present results of a search for charged and neutral strangelets produced on collisions of 11.6 A GeV/c Au beams with Pt or Pb targets. Yields of light nuclei and hypernuclei produced by coalescence were measured. Penalty factors were measured for the addition to a fragment of a nucleon or strange hadron. These are useful in planning future searches for strange quark matter.

  6. Directed Search and Job Rotation

    OpenAIRE

    Li, Fei; Tian, Can

    2012-01-01

    In this note, we consider the impact of job rotation in a directed search model in which firm sizes are endogenously determined, and match quality is initially unknown. A large firm benefits from the opportunity of rotating workers so as to partially overcome mismatch loss. As a result, in the unique symmetric subgame perfect equilibrium, large firms have higher labor productivity and lower separation rate. In contrast to the standard directed search model with multi-vacancy firms, this model...

  7. Open Mass Spectrometry Search Algorithm

    CERN Document Server

    Geer, L Y; Kowalak, J A; Wagner, L; Xu, M; Maynard, D M; Yang, X; Shi, W; Bryant, S H; Geer, Lewis Y.; Markey, Sanford P.; Kowalak, Jeffrey A.; Wagner, Lukas; Xu, Ming; Maynard, Dawn M.; Yang, Xiaoyu; Shi, Wenyao; Bryant, Stephen H.

    2004-01-01

    Large numbers of MS/MS peptide spectra generated in proteomics experiments require efficient, sensitive and specific algorithms for peptide identification. In the Open Mass Spectrometry Search Algorithm [OMSSA], specificity is calculated by a classic probability score using an explicit model for matching experimental spectra to sequences. At default thresholds, OMSSA matches more spectra from a standard protein cocktail than a comparable algorithm. OMSSA is designed to be faster than published algorithms in searching large MS/MS datasets.

  8. A Search Model of Discouragement

    DEFF Research Database (Denmark)

    Rosholm, Michael; Toomet, Ott

    psychological consequences of unemployement affecting search effectiveness. This model enables us to analyse the issue of discouragement, as the returns to search will gradually decline. Even so, the model is actually stationary from the point of view of the individual, which implies that many interesting...... to analyse theoretically the impact of changes in unemployment insurance and social assistance benefits, and we conduct some simulation exercises based on a calibrated model....

  9. Compression in XML search engines

    OpenAIRE

    Natvig, Ola

    2010-01-01

    The structure of XML documents can be used by search engines to answer structured queries or to provide better relevancy. Several index structures exist for search in XML data. This study focuses on inverted lists with dictionary coded path types and dewey coded path instances. The dewey coded path index is large, but could be compressed. This study examines query processing with indexes encoded using well known integer coding methods VByte and PFor(delta) and methods tailored for the dewey i...

  10. SUSY searches at D0

    International Nuclear Information System (INIS)

    Searches for evidence of supersymmetric particles, and other phenomena beyond the Standard Model, are well underway with the D0 detector at the Tevatron. The D0 detector has good central tracking, excellent energy and missing ET resolution, hermetic calorimetry, and wide muon coverage. Preliminary results from searches for gluino/squark production and first generation leptoquark production are presented, based on a small fraction of the data taken to date

  11. Searches for supersymmetry at CMS

    CERN Document Server

    Giordano, Ferdinando

    2016-01-01

    Among the most promising prospects for a theory of physics beyond the standard model is supersymmetry. In this talk, the latest results from the CMS experiment at the LHC on searches for supersymmetry produced through through strong production and electroweak production channels are presented using 20/fb of data from the 8 TeV LHC run, with particular focus on gluino and stop searches.

  12. Dark Matter searches at CMS

    CERN Document Server

    Kumar, Ashok

    2016-01-01

    This talk describes searches for directly produced Dark Matter particles in CMS. The searches are performed using the datasets recorded with the CMS detector in proton-proton collisions at center-of-mass energies of 8 and 13 TeV. Final states with a monojet, monophoton, and monolepton signature are among the final states considered, as well as dark-matter particles produced in association with bottom and top quarks.

  13. Connected searching of weighted trees

    CERN Document Server

    Dereniowski, Dariusz

    2010-01-01

    In this paper we consider the problem of connected edge searching of weighted trees. It is shown that there exists a polynomial-time algorithm for finding optimal connected search strategy for bounded degree trees with arbitrary weights on the edges and vertices of the tree. The problem is NP-complete for general node-weighted trees (the weight of each edge is 1).

  14. Quantum theory-inspired search

    OpenAIRE

    Aerts, D.; Bruza, P.; Hou, Y.; Jose, J; Melucci, M.; Nie, J.-Y.; Song, D.

    2011-01-01

    With the huge number and diversity of the users, the advertising products and services, the rapid growth of online multimedia resources, the context of information needs are even more broad and complex. Although research in search engine technology has led to various models over the past three decades, the investigation for effectively integrating the dimensions of context to deploy advanced search technology has been limited due to the lack of a unified modeling and evaluation framework. Qua...

  15. Intelligent spider for Internet searching

    OpenAIRE

    Chung, YM; Ramsey, M; Yang, CC; Ma, PC; Yen, JCH; H Chen

    1997-01-01

    As World Wide Web (WWW) based Internet services become more popular, information overload also becomes a pressing research problem. Difficulties with searching on the Internet get worse as the amount of information that is available increases. A scalable approach to support Internet search is critical to the success of Internet services and other current or future national information infrastructure (NII) applications. A new approach to build an intelligent personal spider (agent), which is b...

  16. Conceptual Models for Search Engines

    Science.gov (United States)

    Hendry, D. G.; Efthimiadis, E. N.

    Search engines have entered popular culture. They touch people in diverse private and public settings and thus heighten the importance of such important social matters as information privacy and control, censorship, and equitable access. To fully benefit from search engines and to participate in debate about their merits, people necessarily appeal to their understandings for how they function. In this chapter we examine the conceptual understandings that people have of search engines by performing a content analysis on the sketches that 200 undergraduate and graduate students drew when asked to draw a sketch of how a search engine works. Analysis of the sketches reveals a diverse range of conceptual approaches, metaphors, representations, and misconceptions. On the whole, the conceptual models articulated by these students are simplistic. However, students with higher levels of academic achievement sketched more complete models. This research calls attention to the importance of improving students' technical knowledge of how search engines work so they can be better equipped to develop and advocate policies for how search engines should be embedded in, and restricted from, various private and public information settings.

  17. Hybrid keyword search auctions

    KAUST Repository

    Goel, Ashish

    2009-01-01

    Search auctions have become a dominant source of revenue generation on the Internet. Such auctions have typically used per-click bidding and pricing. We propose the use of hybrid auctions where an advertiser can make a per-impression as well as a per-click bid, and the auctioneer then chooses one of the two as the pricing mechanism. We assume that the advertiser and the auctioneer both have separate beliefs (called priors) on the click-probability of an advertisement. We first prove that the hybrid auction is truthful, assuming that the advertisers are risk-neutral. We then show that this auction is superior to the existing per-click auction in multiple ways: 1. We show that risk-seeking advertisers will choose only a per-impression bid whereas risk-averse advertisers will choose only a per-click bid, and argue that both kind of advertisers arise naturally. Hence, the ability to bid in a hybrid fashion is important to account for the risk characteristics of the advertisers. 2. For obscure keywords, the auctioneer is unlikely to have a very sharp prior on the click-probabilities. In such situations, we show that having the extra information from the advertisers in the form of a per-impression bid can result in significantly higher revenue. 3. An advertiser who believes that its click-probability is much higher than the auctioneer\\'s estimate can use per-impression bids to correct the auctioneer\\'s prior without incurring any extra cost. 4. The hybrid auction can allow the advertiser and auctioneer to implement complex dynamic programming strategies to deal with the uncertainty in the click-probability using the same basic auction. The per-click and per-impression bidding schemes can only be used to implement two extreme cases of these strategies. As Internet commerce matures, we need more sophisticated pricing models to exploit all the information held by each of the participants. We believe that hybrid auctions could be an important step in this direction. The

  18. Searching for Primordial Antimatter

    Science.gov (United States)

    2008-10-01

    Scientists are on the hunt for evidence of antimatter - matter's arch nemesis - leftover from the very early Universe. New results using data from NASA's Chandra X-ray Observatory and Compton Gamma Ray Observatory suggest the search may have just become even more difficult. Antimatter is made up of elementary particles, each of which has the same mass as their corresponding matter counterparts --protons, neutrons and electrons -- but the opposite charges and magnetic properties. When matter and antimatter particles collide, they annihilate each other and produce energy according to Einstein's famous equation, E=mc2. According to the Big Bang model, the Universe was awash in particles of both matter and antimatter shortly after the Big Bang. Most of this material annihilated, but because there was slightly more matter than antimatter - less than one part per billion - only matter was left behind, at least in the local Universe. Trace amounts of antimatter are believed to be produced by powerful phenomena such as relativistic jets powered by black holes and pulsars, but no evidence has yet been found for antimatter remaining from the infant Universe. How could any primordial antimatter have survived? Just after the Big Bang there was believed to be an extraordinary period, called inflation, when the Universe expanded exponentially in just a fraction of a second. "If clumps of matter and antimatter existed next to each other before inflation, they may now be separated by more than the scale of the observable Universe, so we would never see them meet," said Gary Steigman of The Ohio State University, who conducted the study. "But, they might be separated on smaller scales, such as those of superclusters or clusters, which is a much more interesting possibility." X-rayChandra X-ray Image In that case, collisions between two galaxy clusters, the largest gravitationally-bound structures in the Universe, might show evidence for antimatter. X-ray emission shows how much hot

  19. Solar System Object Image Search: A precovery search engine

    Science.gov (United States)

    Gwyn, Stephen D. J.; Hill, Norman; Kavelaars, Jj

    2016-01-01

    While regular astronomical image archive searches can find images at a fixed location, they cannot find images of moving targets such as asteroids or comets. The Solar System Object Image Search (SSOIS) at the Canadian Astronomy Data Centre allows users to search for images of moving objects, allowing precoveries. SSOIS accepts as input either an object designation, a list of observations, a set of orbital elements, or a user-generated ephemeris for an object. It then searches for observations of that object over a range of dates. The user is then presented with a list of images containing that object from a variety of archives. Initially created to search the CFHT MegaCam archive, SSOIS has been extended to other telescopes including Gemini, Subaru/SuprimeCam, WISE, HST, the SDSS, AAT, the ING telescopes, the ESO telescopes, and the NOAO telescopes (KPNO/CTIO/WIYN), for a total of 24.5 million images. As the Pan-STARRS and Hyper Suprime-Cam archives become available, they will be incorporated as well. The SSOIS tool is located on the web at http://www.cadc-ccda.hia-iha.nrc-cnrc.gc.ca/en/ssois/.

  20. End User Searching of Medline. Final Report.

    Science.gov (United States)

    Wildemuth, Barbara M.; Moore, Margaret E.

    One hundred sixty-one MEDLINE searches conducted by third year medical students were analyzed and evaluated to determine which search behaviors were used, whether those individual moves are effective, and whether there is a relationship between specific search behaviors and the effectiveness of the search strategy as a whole. The typical search…

  1. A COMPARATIVE STUDY OF BYG SEARCH ENGINES

    OpenAIRE

    Kailash Kumar

    2013-01-01

    This paper compares the retrieval effectiveness of the Bing, Yahoo and Google (BYG) Search Engines. The precision and relative recall of each search engine was considered for evaluating the effectiveness of the search engines. General Queries were tested. Results of the study showed that the precision of Google was high as compared to other two search engines and Yahoo has better precision than Bing

  2. Searching CLEF-IP by Strategy

    NARCIS (Netherlands)

    Alink, W.; Cornacchia, R.; Vries, A.P. de

    2010-01-01

    Tasks performed by intellectual property specialists are often ad hoc, and continuously require new approaches to search a collection of documents. We therefore investigate the benets of a visual `search strategy builder' to allow IP search experts to express their approach to searching the patent c

  3. Web Search Engines: Features and Commands.

    Science.gov (United States)

    Hock, Randolph

    1999-01-01

    Presents a chart comparing Web search engines. Discusses features covered in the chart: size; Boolean Operators and Parentheses; phrase searching; proximity; truncation; title, date and URL fields; links to a URL; language; media searching; name; case sensitivity; searches all common words; directory attached; gives count for answer; gives term…

  4. Antecedents and Consequences of Job Search Behaviors.

    Science.gov (United States)

    Steffy, Brian D.; And Others

    1989-01-01

    Evaluated impact of individual difference variables (gender, school performance, Type A behavior) on job search and influence of search on recruitment, interview performance, job offers, and job placement outcomes (search stress and job satisfaction). Results suggest link between job search, interview outcomes, number of job offers, and placement…

  5. Statistical templates for visual search.

    Science.gov (United States)

    Ackermann, John F; Landy, Michael S

    2014-01-01

    How do we find a target embedded in a scene? Within the framework of signal detection theory, this task is carried out by comparing each region of the scene with a "template," i.e., an internal representation of the search target. Here we ask what form this representation takes when the search target is a complex image with uncertain orientation. We examine three possible representations. The first is the matched filter. Such a representation cannot account for the ease with which humans can find a complex search target that is rotated relative to the template. A second representation attempts to deal with this by estimating the relative orientation of target and match and rotating the intensity-based template. No intensity-based template, however, can account for the ability to easily locate targets that are defined categorically and not in terms of a specific arrangement of pixels. Thus, we define a third template that represents the target in terms of image statistics rather than pixel intensities. Subjects performed a two-alternative, forced-choice search task in which they had to localize an image that matched a previously viewed target. Target images were texture patches. In one condition, match images were the same image as the target and distractors were a different image of the same textured material. In the second condition, the match image was of the same texture as the target (but different pixels) and the distractor was an image of a different texture. Match and distractor stimuli were randomly rotated relative to the target. We compared human performance to pixel-based, pixel-based with rotation, and statistic-based search models. The statistic-based search model was most successful at matching human performance. We conclude that humans use summary statistics to search for complex visual targets. PMID:24627458

  6. A Feedback-Based Web Search Engine

    Institute of Scientific and Technical Information of China (English)

    ZHANG Wei-feng; XU Bao-wen; ZHOU Xiao-yu

    2004-01-01

    Web search engines are very useful information service tools in the Internet.The current web search engines produce search results relating to the search terms and the actual information collected by them.Since the selections of the search results cannot affect the future ones, they may not cover most people's interests.In this paper, feedback information produced by the users' accessing lists will be represented by the rough set and can reconstruct the query string and influence the search results.And thus the search engines can provide self-adaptability.

  7. New product introduction with costly search

    OpenAIRE

    Tse, CY

    2006-01-01

    In the usual model of product market search, a low search cost can turn out to have detrimental incentives on new product introduction as the low search cost erodes firms' market power, attenuating the profit from innovation. This paper studies a model of monopolistic competition with costly search, where the point of departure is that of a fixed cost of initiating search. In this environment, a low search cost could turn out to be favorable to innovation. At a low search cost, more consumers...

  8. ArraySearch: A Web-Based Genomic Search Engine

    Directory of Open Access Journals (Sweden)

    Tyler J. Wilson

    2012-01-01

    Full Text Available Recent advances in microarray technologies have resulted in a flood of genomics data. This large body of accumulated data could be used as a knowledge base to help researchers interpret new experimental data. ArraySearch finds statistical correlations between newly observed gene expression profiles and the huge source of well-characterized expression signatures deposited in the public domain. A search query of a list of genes will return experiments on which the genes are significantly up- or downregulated collectively. Searches can also be conducted using gene expression signatures from new experiments. This resource will empower biological researchers with a statistical method to explore expression data from their own research by comparing it with expression signatures from a large public archive.

  9. I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

    DEFF Research Database (Denmark)

    Lauritsen, Thomas; Kolenda, Thomas

    2002-01-01

    We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....

  10. Consistent Neighborhood Search for Combinatorial Optimization.

    OpenAIRE

    Michel Vasquez; Nicolas Zufferey

    2012-01-01

    Many optimization problems (from academia or industry) require the use of a local search to find a satisfying solution in a reasonable amount of time, even if the optimality is not guaranteed. Usually, local search algorithms operate in a search space which contains complete solutions (feasible or not) to the problem. In contrast, in Consistent Neighborhood Search (CNS), after each variable assignment, the conflicting variables are deleted to keep the partial solution feasible, and the search...

  11. Aggregated search: a new information retrieval paradigm

    OpenAIRE

    Kopliku, Arlind; Pinel-Sauvagnat, Karen; Boughanem, Mohand

    2014-01-01

    Traditional search engines return ranked lists of search results. It is up to the user to scroll this list, scan within different documents and assemble information that fulfill his/her information need. Aggregated search represents a new class of approaches where the information is not only retrieved but also assembled. This is the current evolution in Web search, where diverse content (images, videos, ...) and relational content (similar entities, features) are included in search results. I...

  12. How Do Search Engines Handle Chinese Queries?

    OpenAIRE

    Hong Cui; Haidar Moukdad

    2005-01-01

    The use of languages other than English has been growing exponentially on the Web. However, the major search engines have been lagging behind in providing indexes and search features to handle these languages. This article explores the characteristics of the Chinese language and how queries in this language are handled by different search engines. Queries were entered in two major search engines (Google and AlltheWeb) and two search engines developed for Chinese (Sohu and Baidu). Criteria suc...

  13. Scaling Internet Search Engines - Methods and Analysis

    OpenAIRE

    Risvik, Knut Magne

    2004-01-01

    This thesis focuses on methods and analysis for building scalable Internet Search Engines. In this work, we have developed a search kernel, an architecture framework and applications that are being used in industrial and commercial products. Furthermore, we present both analysis and design of key elements. Essential to building a large-scale search engine is to understand the dynamics of the content in which we are searching. For the challenging case of searching the web, there are multiple d...

  14. Automatic Reformulation of Children's Search Queries

    OpenAIRE

    Kalsbeek, van, A.; De, Wit, A.; Trieschnigg, Dolf; Vet, de, H.C.W.; Huibers, Theo; Hiemstra, Djoerd

    2010-01-01

    The number of children that have access to an Internet connection (at home or at school) is large and growing fast. Many of these children search the web by using a search engine. These search engines do not consider their skills and preferences however, which makes searching difficult. This paper tries to uncover methods and techniques that can be used to automatically improve search results on queries formulated by children. In order to achieve this, a prototype of a query expander is built...

  15. Assessing Cognitive Load on Web Search Tasks

    OpenAIRE

    Gwizdka, Jacek

    2010-01-01

    Assessing cognitive load on web search is useful for characterizing search system features and search tasks with respect to their demands on the searcher's mental effort. It is also helpful for examining how individual differences among searchers (e.g. cognitive abilities) affect the search process. We examined cognitive load from the perspective of primary and secondary task performance. A controlled web search study was conducted with 48 participants. The primary task performance components...

  16. Social Search: A Taxonomy of, and a User-Centred Approach to, Social Web Search

    Science.gov (United States)

    McDonnell, Michael; Shiri, Ali

    2011-01-01

    Purpose: The purpose of this paper is to introduce the notion of social search as a new concept, drawing upon the patterns of web search behaviour. It aims to: define social search; present a taxonomy of social search; and propose a user-centred social search method. Design/methodology/approach: A mixed method approach was adopted to investigate…

  17. People searching for people: analysis of a people search engine log

    NARCIS (Netherlands)

    W. Weerkamp; R. Berendsen; B. Kovachev; E. Meij; K. Balog; M. de Rijke

    2011-01-01

    Recent years show an increasing interest in vertical search: searching within a particular type of information. Understanding what people search for in these "verticals" gives direction to research and provides pointers for the search engines themselves. In this paper we analyze the search logs of o

  18. Cover times of random searches

    Science.gov (United States)

    Chupeau, Marie; Bénichou, Olivier; Voituriez, Raphaël

    2015-10-01

    How long must one undertake a random search to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not only the discovery of a single target. Examples range from immune-system cells chasing pathogens to animals harvesting resources, from robotic exploration for cleaning or demining to the task of improving search algorithms. Despite its broad relevance, the cover time has remained elusive and so far explicit results have been scarce and mostly limited to regular random walks. Here we determine the full distribution of the cover time for a broad range of random search processes, including Lévy strategies, intermittent strategies, persistent random walks and random walks on complex networks, and reveal its universal features. We show that for all these examples the mean cover time can be minimized, and that the corresponding optimal strategies also minimize the mean search time for a single target, unambiguously pointing towards their robustness.

  19. High-speed data search

    Science.gov (United States)

    Driscoll, James N.

    1994-01-01

    The high-speed data search system developed for KSC incorporates existing and emerging information retrieval technology to help a user intelligently and rapidly locate information found in large textual databases. This technology includes: natural language input; statistical ranking of retrieved information; an artificial intelligence concept called semantics, where 'surface level' knowledge found in text is used to improve the ranking of retrieved information; and relevance feedback, where user judgements about viewed information are used to automatically modify the search for further information. Semantics and relevance feedback are features of the system which are not available commercially. The system further demonstrates focus on paragraphs of information to decide relevance; and it can be used (without modification) to intelligently search all kinds of document collections, such as collections of legal documents medical documents, news stories, patents, and so forth. The purpose of this paper is to demonstrate the usefulness of statistical ranking, our semantic improvement, and relevance feedback.

  20. Quantum walks and search algorithms

    CERN Document Server

    Portugal, Renato

    2013-01-01

    This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting d...

  1. Organizational search and market orientation

    DEFF Research Database (Denmark)

    Sørensen, Hans Eibe; Stieglitz, Nils

    2008-01-01

    to explain performance differentials among firms (Day, 1994). We open up the black box of market-sensing capabilities by treating the issue of choosing marketing attributes of products as a problem of organizational search. Despite much robust research on organizational search in the strategy...... and organization literature (Cyert & March, 1963; Nelson & Winter, 1982; March, 1988; Levinthal, 1997; Sorenson, 2002), the organizational search processes underlying market orientation has received little, if any, attention in marketing research. Our research thus contributes to the growing body of marketing......  Market orientation has evolved into a key construct in the marketing and strategy literature. While much progress has been made in empirical research, the concept lacks a coherent theoretical foundation. Essentially, much prior research has pointed to the role of market-sensing capabilities...

  2. Dark Matter searches at ATLAS

    CERN Document Server

    Cortes-Gonzalez, Arely; The ATLAS collaboration

    2016-01-01

    If Dark Matter interacts weakly with the Standard Model it can be produced at the LHC. It can be identified via initial state radiation (ISR) of the incoming partons, leaving a signature in the detector of the ISR particle (jet, photon, Z or W) recoiling off of the invisible Dark Matter particles, resulting in a large momentum imbalance. Many signatures of large missing transverse momentum recoiling against jets, photons, heavy-flavor quarks, weak gauge bosons or Higgs bosons provide an interesting channel for Dark Matter searches. These LHC searches complement those from (in)direct detection experiments. Results of these searches with the ATLAS experiment, in both effective field theory and simplified models with pair WIMP production are discussed. Both 8TeV and 13TeV pp collision data has been used in these results.

  3. GRAPHITE: A GRAPH SEARCH FRAMEWORK

    Directory of Open Access Journals (Sweden)

    Sushanta Pradhan

    2014-07-01

    Full Text Available With the recent data deluge, search applications are confronted with the complexity of data they handle in terms of volume, velocity and variety. Traditional frameworks such as Lucene [1], index text for efficient searching but do not consider relationships/semantics of data. Any structural change in data demands re-modelling and re-indexing. This paper presents an indexing model that addresses the challenge. Data is modelled as graph in accordance to object-oriented principles such that the system learns the possible queries that can be executed on the indexed data. The model is generic and flexible enough to adapt to the structural changes in data without the need of additional re-modelling & re-indexing. The result is a framework that enables applications to search domain objects, their relationships and related objects using simple APIs without the structural knowledge of underlying data.

  4. Refining search terms for nanotechnology

    International Nuclear Information System (INIS)

    The ability to delineate the boundaries of an emerging technology is central to obtaining an understanding of the technology's research paths and commercialization prospects. Nowhere is this more relevant than in the case of nanotechnology (hereafter identified as 'nano') given its current rapid growth and multidisciplinary nature. (Under the rubric of nanotechnology, we also include nanoscience and nanoengineering.) Past efforts have utilized several strategies, including simple term search for the prefix nano, complex lexical and citation-based approaches, and bootstrapping techniques. This research introduces a modularized Boolean approach to defining nanotechnology which has been applied to several research and patenting databases. We explain our approach to downloading and cleaning data, and report initial results. Comparisons of this approach with other nanotechnology search formulations are presented. Implications for search strategy development and profiling of the nanotechnology field are discussed

  5. Light WIMP search in XMASS

    International Nuclear Information System (INIS)

    A search for light dark matter using low-threshold data from the single phase liquid xenon scintillation detector XMASS, has been conducted. Using the entire 835 kg inner volume as target, the analysis threshold can be lowered to 0.3 keVee (electron-equivalent) to search for light dark matter. With low-threshold data corresponding to a 5591.4 kg day exposure of the detector and without discriminating between nuclear-recoil and electronic events, XMASS excludes part of the parameter space favored by other experiments

  6. Light WIMP search in XMASS

    Energy Technology Data Exchange (ETDEWEB)

    Abe, K. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Kavli Institute for the Physics and Matematics of the Universe, the University of Tokyo, Kashiwa, Chiba 277-8582 (Japan); Hieda, K. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Hiraide, K. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Kavli Institute for the Physics and Matematics of the Universe, the University of Tokyo, Kashiwa, Chiba 277-8582 (Japan); Hirano, S. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Kishimoto, Y.; Kobayashi, K.; Moriyama, S. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Kavli Institute for the Physics and Matematics of the Universe, the University of Tokyo, Kashiwa, Chiba 277-8582 (Japan); Nakagawa, K. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Nakahata, M.; Ogawa, H. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Kavli Institute for the Physics and Matematics of the Universe, the University of Tokyo, Kashiwa, Chiba 277-8582 (Japan); Oka, N. [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Sekiya, H., E-mail: sekiya@icrr.u-tokyo.ac.jp [Kamioka Observatory, Institute for Cosmic Ray Research, the University of Tokyo, Higashi-Mozumi, Kamioka, Hida, Gifu 506-1205 (Japan); Kavli Institute for the Physics and Matematics of the Universe, the University of Tokyo, Kashiwa, Chiba 277-8582 (Japan); and others

    2013-02-12

    A search for light dark matter using low-threshold data from the single phase liquid xenon scintillation detector XMASS, has been conducted. Using the entire 835 kg inner volume as target, the analysis threshold can be lowered to 0.3 keVee (electron-equivalent) to search for light dark matter. With low-threshold data corresponding to a 5591.4 kg day exposure of the detector and without discriminating between nuclear-recoil and electronic events, XMASS excludes part of the parameter space favored by other experiments.

  7. Goiania 1987: searching for radiation

    International Nuclear Information System (INIS)

    The founding of the Searching for Radiation Group following the radiation accident in Goiania, Brazil, in 1987, is described. Particulars on the equipment and detector used, the number of people monitored, the techniques used to gather information on the probable date of the accident, about possibly contaminated places and people are provided and communicating with the general public is addressed. The discussion is divided into three main parts: 1) how the Searching for Radiation Group was formed; 2) the participation of the state Health Secretariat and the street children in the Group and 3) the lessons learned. (author)

  8. About AgEcon Search

    Institute of Scientific and Technical Information of China (English)

    2014-01-01

    <正>AgEcon Search is a free,open access repository of full-text scholarly literature in agricultural and applied economics,including working papers,conference papers,and journal articles.AgEcon Search is co-sponsored by the Department of Applied Economics and the University Libraries at University of Minnesota and the Agricultural and Applied Economics Association.Research in Agricultural and Applied Economics collects,indexes,and electronically distributes full text copies of scholarly research in the broadly defined field of agricultural economics including sub disciplines such as agribusiness,food supply,natural resource economics,environmental eco-

  9. About AgEcon Search

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    <正>AgEcon Search is a free,open access repository of full-text scholarly literature in agricultural and applied economics,inclu-ding working papers,conference papers,and journal articles. AgEcon Search is co-sponsored by the Department of Applied Eco-nomics and the University Libraries at University of Minnesota and the Agricultural and Applied Economics Association. Researchin Agricultural and Applied Economics collects,indexes,and electronically distributes full text copies of scholarly research in the

  10. About AgEcon Search

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    <正>AgEcon Search is a free,open access repository of full-text scholarly literature in agricultural and applied economics,inclu-ding working papers,conference papers,and journal articles. AgEcon Search is co-sponsored by the Department of Applied Eco-nomics and the University Libraries at University of Minnesota and the Agricultural and Applied Economics Association. Research in Agricultural and Applied Economics collects,indexes,and electronically distributes full text copies of scholarly research in the

  11. Statistical templates for visual search

    OpenAIRE

    Ackermann, John F.; Michael S Landy

    2014-01-01

    How do we find a target embedded in a scene? Within the framework of signal detection theory, this task is carried out by comparing each region of the scene with a “template,” i.e., an internal representation of the search target. Here we ask what form this representation takes when the search target is a complex image with uncertain orientation. We examine three possible representations. The first is the matched filter. Such a representation cannot account for the ease with which humans can ...

  12. "Dark Matter searches at ATLAS"

    CERN Document Server

    Gustavino, Giuliano; The ATLAS collaboration

    2016-01-01

    Although the existence of Dark Matter is a well-established hypothesis to explain a range of astrophysical and cosmological measurements, its nature and particle properties still remain one of the greatest unsolved puzzles of particle and astro-particle physics. The collider experiments have developed a comprehensive search program in this sector looking at a wide spectrum of channels in which a Dark Matter evidence can be traced. In this context the last results using the data sample collected at LHC at the new centre-of-mass energy of 13 TeV will be presented giving an outlook of the Dark Matter search status in the ATLAS experiment.

  13. Indirect searches for dark matter

    Indian Academy of Sciences (India)

    Marco Cirelli

    2012-11-01

    The current status of indirect searches for dark matter has been reviewed in a schematic way here. The main relevant experimental results of the recent years have been listed and the excitements and disappointments that their phenomenological interpretations in terms of almost-standard annihilating dark matter have brought along have been discussed. The main sources of uncertainties that affect this kind of searches are also listed. [Report number: Saclay T11/206, CERN-PH-TH/2011-257, extended version in arXiv:1202.1454], [Prepared for the Proceedings of Lepton–Photon 2011, Mumbai, India, 22–27 Aug. 2011].

  14. Genetic Algorithms and Local Search

    Science.gov (United States)

    Whitley, Darrell

    1996-01-01

    The first part of this presentation is a tutorial level introduction to the principles of genetic search and models of simple genetic algorithms. The second half covers the combination of genetic algorithms with local search methods to produce hybrid genetic algorithms. Hybrid algorithms can be modeled within the existing theoretical framework developed for simple genetic algorithms. An application of a hybrid to geometric model matching is given. The hybrid algorithm yields results that improve on the current state-of-the-art for this problem.

  15. Search-User Interface Design

    CERN Document Server

    Wilson, Max

    2011-01-01

    Search User Interfaces (SUIs) represent the gateway between people who have a task to complete, and the repositories of information and data stored around the world. Not surprisingly, therefore, there are many communities who have a vested interest in the way SUIs are designed. There are people who study how humans search for information, and people who study how humans use computers. There are people who study good user interface design, and people who design aesthetically pleasing user interfaces. There are also people who curate and manage valuable information resources, and people who desi

  16. The CRESST Dark Matter Search

    CERN Document Server

    Bravin, M; Bucci, C

    1999-01-01

    The current status of CRESST (Cryogenic Rare Event Search using Superconducting Thermometers) and new results concerning the detector development are presented. The basic technique of CRESST is to search for particle Dark Matter (WIMPS, Weakly Interacting Massive particles) by the measurement of non-thermal phonons as created by WIMP-induced nuclear recoils. Combined with the newly developed method of simultaneous measurement of scintillation light, strong background discrimination is possible, resulting in a substantial increase in WIMP detection sensitivity. The short and long term perspectives of CRESST are discussed.

  17. Engineering Optimisation by Cuckoo Search

    CERN Document Server

    Yang, Xin-She

    2010-01-01

    A new metaheuristic optimisation algorithm, called Cuckoo Search (CS), was developed recently by Yang and Deb (2009). This paper presents a more extensive comparison study using some standard test functions and newly designed stochastic test functions. We then apply the CS algorithm to solve engineering design optimisation problems, including the design of springs and welded beam structures. The optimal solutions obtained by CS are far better than the best solutions obtained by an efficient particle swarm optimiser. We will discuss the unique search features used in CS and the implications for further research.

  18. Semantic search log analysis: a method and a study on professional image search

    NARCIS (Netherlands)

    Hollink, V.; Tsikrika, T.; Vries, A.P. de

    2011-01-01

    Existing methods for automatically analyzing search logs describe search behavior on the basis of syntactic differences (overlapping terms) between queries. Although these analyses provide valuable insights into the complexity and successfulness of search interactions, they offer a limited interpret

  19. I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

    OpenAIRE

    Lauritsen, Thomas; Kolenda, Thomas

    2002-01-01

    We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online. It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible sear...

  20. Dyniqx: a novel meta-search engine for metadata based cross search

    OpenAIRE

    Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan

    2008-01-01

    The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based cross search. Dyniqx exploits the availability of metadata in academic search services such as PubMed and Google Scholar etc for fusing search results from heterogeneous search engines. In addition, metadata from these search engines are used for generating dynamic query controls such as sliders and tick boxes etc which are ...

  1. Searches for new physics at Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    C. Pagliarone

    2004-03-15

    This paper reviews the most recent results on searches for physics beyond the Standard Model at Tevatron. Both the collider experiments: CDF and D0 are performing a large variety of searches such as searches for scalar top and scalar bottom particles, search for new gauge bosons, search for long-lived massive particles and general searches for new particles decaying into dijets. The results, summarized here, are a selection of what obtained recently by both the collaborations using the Run II data, collected so far.

  2. Relevance of Search Engines for Modern Generations

    Directory of Open Access Journals (Sweden)

    Trilok Gupta

    2014-02-01

    Full Text Available Web search engines have major impact in people‟s everyday life . It is of great i m p o r t a n c e to test the retrieval effectiveness of search e n g i n e s. However, it is labour-intensive to judge the relevance of search results for a large number of queries, and these relevance judgments may not be reusable since the Web data change all the time. Experiments on major search engines show that our approach mines many high- confidence rules that help understand search engines and detect suspicious search results.

  3. The Cost of Cache-Oblivious Searching

    DEFF Research Database (Denmark)

    Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf;

    2011-01-01

    This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than lg elog  B N memory transfers between any two levels of the memory hierarchy. This lower bound holds even if all......-oblivious model. The DAM model naturally extends to k levels. The paper also shows that as k grows, the search costs of the optimal k-level DAM search structure and the optimal cache-oblivious search structure rapidly converge. This result demonstrates that for a multilevel memory hierarchy, a simple cache...

  4. The Cost of Cache-Oblivious Searching

    DEFF Research Database (Denmark)

    Bender, Michael A.; Brodal, Gert Stølting; Fagerberg, Rolf;

    2003-01-01

    Tight bounds on the cost of cache-oblivious searching are proved. It is shown that no cache-oblivious search structure can guarantee that a search performs fewer than lg e log B N block transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes......, multilevel memory hierarchies can be modelled. It is shown that as k grows, the search costs of the optimal k-level DAM search structure and of the optimal cache-oblivious search structure rapidly converge. This demonstrates that for a multilevel memory hierarchy, a simple cache-oblivious structure almost...

  5. Interfacial Molecular Searching Using Forager Dynamics

    Science.gov (United States)

    Monserud, Jon H.; Schwartz, Daniel K.

    2016-03-01

    Many biological and technological systems employ efficient non-Brownian intermittent search strategies where localized searches alternate with long flights. Coincidentally, molecular species exhibit intermittent behavior at the solid-liquid interface, where periods of slow motion are punctuated by fast flights through the liquid phase. Single-molecule tracking was used here to observe the interfacial search process of DNA for complementary DNA. Measured search times were qualitatively consistent with an intermittent-flight model, and ˜10 times faster than equivalent Brownian searches, suggesting that molecular searches for reactive sites benefit from similar efficiencies as biological organisms.

  6. Open Meta-search with OpenSearch: A Case Study

    OpenAIRE

    O'Riordan, Adrian P.

    2007-01-01

    The goal of this project was to demonstrate the possibilities of open source search engine and aggregation technology in a Web environment by building a meta-search engine which employs free open search engines and open protocols. In contrast many meta-search engines on the Internet use proprietary search systems. The search engines employed in this case study are all based on the OpenSearch protocol. OpenSearch-compliant systems support XML technologies such as RSS and Atom for aggregation a...

  7. Optimizing Selective Search in Chess

    CERN Document Server

    David-Tabibi, Omid; Netanyahu, Nathan S

    2010-01-01

    In this paper we introduce a novel method for automatically tuning the search parameters of a chess program using genetic algorithms. Our results show that a large set of parameter values can be learned automatically, such that the resulting performance is comparable with that of manually tuned parameters of top tournament-playing chess programs.

  8. Turning Search into Knowledge Management.

    Science.gov (United States)

    Kaufman, David

    2002-01-01

    Discussion of knowledge management for electronic data focuses on creating a high quality similarity ranking algorithm. Topics include similarity ranking and unstructured data management; searching, categorization, and summarization of documents; query evaluation; considering sentences in addition to keywords; and vector models. (LRW)

  9. SUSY searches at the CMS

    CERN Document Server

    Kazana, Malgorzata

    2016-01-01

    Results of the 2015 early searches for supersymmetric particles obtained by the CMS experiment with 13\\,TeV data are reviewed.With an integrated luminosity of 2.2\\,fb$^{-1}$, limits on the gluino mass have been lifted up to higher values with respect to previous limits from 19.5\\,fb$^{-1}$ of 8\\,TeV data.

  10. New Physics Searches with ATLAS

    Directory of Open Access Journals (Sweden)

    Serhan Mete Alaettin

    2014-04-01

    Full Text Available Highlights from new physics searches with the ATLAS detector at the CERN Large Hadron Collider are presented. Results are based on the analysis of data collected in pp collisions at a center-of-mass energy of 7 TeV corresponding to integrated luminosities of 1-5 fb−1. No excess beyond the Standard Model expectations is observed.

  11. Cryptographically enforced search pattern hiding

    NARCIS (Netherlands)

    Bösch, Christoph Tobias

    2015-01-01

    Searchable encryption is a cryptographic primitive that allows a client to out- source encrypted data to an untrusted storage provider, while still being able to query the data without decrypting. To allow the server to perform the search on the encrypted data, a so-called trapdoor is generated by t

  12. The search for dark matter

    International Nuclear Information System (INIS)

    Experiments housed deep underground are searching for new particles that could simultaneously solve one of the biggest mysteries in astrophysics and reveal what lies beyond the Standard Model of particle physics. Physicists are very particular about balancing budgets. Energy, charge and momentum all have to be conserved and often money as well. Astronomers were therefore surprised and disturbed to learn in the 1930s that our own Milky Way galaxy behaved as if it contained more matter than could be seen with telescopes. This puzzling non-luminous matter became known as ''dark matter'' and we now know that over 90% of the matter in the entire universe is dark. In later decades the search for this dark matter shifted from the heavens to the Earth. In fact, the search for dark matter went underground. Today there are experiments searching for dark matter hundreds and thousands of metres below ground in mines, road tunnels and other subterranean locations. These experiments are becoming more sensitive every year and are beginning to test various new models and theories in particle physics and cosmology. (UK)

  13. Search for chameleons with CAST

    DEFF Research Database (Denmark)

    Anastassopoulos, V.; Arik, M.; Aune, S.;

    2015-01-01

    In this work we present a search for (solar) chameleons with the CERN Axion Solar Telescope (CAST). This novel experimental technique, in the field of dark energy research, exploits both the chameleon coupling to matter (βm) and to photons (βΥ) via the Primako eect. By reducing the X-ray detectio...

  14. The GMRT Search for Reionization

    CERN Document Server

    Pen, Ue-Li; Peterson, Jeff B; Roy, Jayanta; Gupta, Yashwant; Bandura, Kevin

    2008-01-01

    We present an overview for the reionization search at GMRT. The forecast sensitivities are promising for an early detection. RFI mitigation has been successful. Several hundred hours of telescope time have already been invested in this ongoing effort, and analysis of the data is in progress.

  15. ATLAS Searches in Run I

    CERN Document Server

    Kagan, Michael; The ATLAS collaboration

    2015-01-01

    Title: Searches for di-Higgs production in 4b final states and new phenomena with boosted Higgs using the ATLAS detector at LHC Run I Abstract : Measurement of Higgs boson pair production has a fundamental importance in understanding the nature of the Higgs boson and electroweak symmetry breaking. TeVscale resonances decaying to a pair of Higgs boson are also predicted in various extensions of the Standard Models, e.g, Kaluza-Klein excitation of the gravitons in the bulk Randall- Sundrum extra dimensions, heavy scalar particles in two-Higgs-doublet models. This talk highlights ATLAS Run I searches for di-Higgs production in 4b final states with resolved topology using small-radius jets and boosted topology using large-radius jets with associated b-tagged track-jets. Other Run I searches employing techniques to identify boosted Higgs bosons are also presented in this talk. Title: Searches for vector-like quarks and resonances decaying into top-quarks with the ATLAS detector at LHC Run I Abstract : In theories ...

  16. Dark matter searches at ATLAS

    CERN Document Server

    Gramling, Johanna; The ATLAS collaboration

    2016-01-01

    Compelling astrophysical evidence for dark matter makes it important and interesting to look for signatures of missing energies at the LHC. This talk presents the different searches carried out with the ATLAS detector at the LHC, and there results and interpretations in the context of dark matter production.

  17. Search for SUSY at LHC

    CERN Document Server

    Dova, MT; The ATLAS collaboration

    2012-01-01

    This is a talk on Search for SUSY at LHC (ATLAS + CMS) to be presented at SILAFAE2012 (IX Simposio Latinoamericano de Fisica de Altas Energías) to be held in Sao Paulo, Brazil (10-14 December) . The content of the slides is mainly with results presented at SUSY2012 with a few updates from HCP results.

  18. Darwin on the Web: The Evolution of Search Tools.

    Science.gov (United States)

    Vidmar, Dale J.

    1999-01-01

    Discusses various search strategies and tools that can be used for searching on the Internet, including search engines and search directories; Boolean searching; metasearching; relevancy ranking; automatic phrase detection; backlinks; natural-language searching; clustering and cataloging information; image searching; customization and portals;…

  19. DYNIQX: A novel meta-search engine for the web

    OpenAIRE

    Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan

    2009-01-01

    The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based search. Dyniqx integrates search results from search services of documents, images, and videos for generating a unified list of ranked search results. Dyniqx exploits the availability of metadata in search services such as PubMed, Google Scholar, Google Image Search, and Google Video Search etc for fusing search results from...

  20. Searching for unpublished data for Cochrane reviews

    DEFF Research Database (Denmark)

    Schroll, Jeppe Bennekou; Bero, Lisa; Gøtzsche, Peter C

    2013-01-01

    To describe the experiences of authors of Cochrane reviews in searching for, getting access to, and using unpublished data.......To describe the experiences of authors of Cochrane reviews in searching for, getting access to, and using unpublished data....

  1. A Novel Personalized Web Search Model

    Institute of Scientific and Technical Information of China (English)

    ZHU Zhengyu; XU Jingqiu; TIAN Yunyan; REN Xiang

    2007-01-01

    A novel personalized Web search model is proposed.The new system, as a middleware between a user and a Web search engine, is set up on the client machine. It can learn a user's preference implicitly and then generate the user profile automatically. When the user inputs query keywords, the system can automatically generate a few personalized expansion words by computing the term-term associations according to the current user profile, and then these words together with the query keywords are submitted to a popular search engine such as Yahoo or Google.These expansion words help to express accurately the user's search intention. The new Web search model can make a common search engine personalized, that is, the search engine can return different search results to different users who input the same keywords. The experimental results show the feasibility and applicability of the presented work.

  2. Ridgefield Complex - Invasive Plant EDRR Search 2014

    Data.gov (United States)

    US Fish and Wildlife Service, Department of the Interior — Much of this search will be conducted in woodland and forest habitat on foot. Some areas will be searched comprehensively for the first time, especially oak,...

  3. Google and the culture of search

    CERN Document Server

    Hillis, Ken; Jarrett, Kylie

    2013-01-01

    What did you do before Google? The rise of Google as the dominant Internet search provider reflects a generationally-inflected notion that everything that matters is now on the Web, and should, in the moral sense of the verb, be accessible through search. In this theoretically nuanced study of search technology's broader implications for knowledge production and social relations, the authors shed light on a culture of search in which our increasing reliance on search engines influences not only the way we navigate, classify, and evaluate Web content, but also how we think about ourselves and the world around us, online and off. Ken Hillis, Michael Petit, and Kylie Jarrett seek to understand the ascendancy of search and its naturalization by historicizing and contextualizing Google's dominance of the search industry, and suggest that the contemporary culture of search is inextricably bound up with a metaphysical longing to manage, order, and categorize all knowledge. Calling upon this nexus between political e...

  4. Search for New Physics at CDF

    Energy Technology Data Exchange (ETDEWEB)

    Strologas, John; /New Mexico U.

    2009-06-01

    We present the current status of the search for new physics at CDF, using integrated luminosity up to 3.2 fb{sup -1}. We cover searches for supersymmetry, extra dimensions, new heavy bosons, and generic dilepton resonances.

  5. How Do Search Engines Handle Chinese Queries?

    Directory of Open Access Journals (Sweden)

    Hong Cui

    2005-10-01

    Full Text Available The use of languages other than English has been growing exponentially on the Web. However, the major search engines have been lagging behind in providing indexes and search features to handle these languages. This article explores the characteristics of the Chinese language and how queries in this language are handled by different search engines. Queries were entered in two major search engines (Google and AlltheWeb and two search engines developed for Chinese (Sohu and Baidu. Criteria such as handling word segmentation, number of retrieved documents, and correct display and identification of Chinese characters were used to examine how the search engines handled the queries. The results showed that the performance of the two major search engines was not on a par with that of the search engines developed for Chinese.

  6. Search Engines: Gateway to a New ``Panopticon''?

    Science.gov (United States)

    Kosta, Eleni; Kalloniatis, Christos; Mitrou, Lilian; Kavakli, Evangelia

    Nowadays, Internet users are depending on various search engines in order to be able to find requested information on the Web. Although most users feel that they are and remain anonymous when they place their search queries, reality proves otherwise. The increasing importance of search engines for the location of the desired information on the Internet usually leads to considerable inroads into the privacy of users. The scope of this paper is to study the main privacy issues with regard to search engines, such as the anonymisation of search logs and their retention period, and to examine the applicability of the European data protection legislation to non-EU search engine providers. Ixquick, a privacy-friendly meta search engine will be presented as an alternative to privacy intrusive existing practices of search engines.

  7. Mathematical programming solver based on local search

    CERN Document Server

    Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain

    2014-01-01

    This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...

  8. TPX: Biomedical literature search made easy

    OpenAIRE

    Joseph, Thomas; Saipradeep, Vangala G; Raghavan, Ganesh Sekar Venkat; Srinivasan, Rajgopal; Rao, Aditya; Kotte, Sujatha; Sivadasan, Naveen

    2012-01-01

    TPX is a web-based PubMed search enhancement tool that enables faster article searching using analysis and exploration features. These features include identification of relevant biomedical concepts from search results with linkouts to source databases, concept based article categorization, concept assisted search and filtering, query refinement. A distinguishing feature here is the ability to add user-defined concept names and/or concept types for named entity recognition. The tool allows co...

  9. Buyer Search Costs and Endogenous Product Design

    OpenAIRE

    Dmitri Kuksov

    2004-01-01

    Buyer search costs for price are changing in many markets. Through a model of buyer and seller behavior, I consider the effects of changing search costs on prices both when product differentiation is fixed and when it is endogenously determined in equilibrium. If firms cannot change product design, lower buyer search costs for price lead to increased price competition. However, if product design is a decision variable, lower search costs for price may also lead to higher product differentiati...

  10. TECHNIQUES USED IN SEARCH ENGINE MARKETING

    OpenAIRE

    Assoc. Prof. Liviu Ion Ciora Ph. D; Lect. Ion Buligiu Ph. D

    2010-01-01

    Search engine marketing (SEM) is a generic term covering a variety of marketing techniques intended for attracting web traffic in search engines and directories. SEM is a popular tool since it has the potential of substantial gains with minimum investment. On the one side, most search engines and directories offer free or extremely cheap listing. On the other side, the traffic coming from search engines and directories tends to be motivated for acquisitions, making these visitors some of the ...

  11. Search engines that learn from their users

    OpenAIRE

    Schuth, A.G.

    2016-01-01

    More than half the world’s population uses web search engines, resulting in over half a billion search queries every single day. For many people web search engines are among the first resources they go to when a question arises. Moreover, search engines have for many become the most trusted route to information, more so even than traditional media such as newspapers, news websites or news channels on television. With this in mind, from an information retrieval (IR) research perspective, two t...

  12. HARMONY SEARCH OPTIMIZATION FOR UPFC PLACEMENT

    OpenAIRE

    A. SAKTHIDASAN; S. GEETHANJALI

    2014-01-01

    This article presents a harmony search optimization based method for optimal placement of UPFCs with a view of reducing the network loss. Harmony search optimization is inspired the musical process of searching for a perfect state of harmony. The harmony in music is analogous to the optimization solution vector, and the musician’s improvisations are analogous to local and global search schemes in optimization techniques. The method determines the optimal locations and the parameters of the UP...

  13. Intelligent Search Optimization using Artificial Fuzzy Logics

    OpenAIRE

    Manral, Jai

    2015-01-01

    Information on the web is prodigious; searching relevant information is difficult making web users to rely on search engines for finding relevant information on the web. Search engines index and categorize web pages according to their contents using crawlers and rank them accordingly. For given user query they retrieve millions of webpages and display them to users according to web-page rank. Every search engine has their own algorithms based on certain parameters for ranking web-pages. Searc...

  14. Attribute Search in Online Retail Grocery Markets

    OpenAIRE

    Timothy Richards; Stephen Hamilton

    2015-01-01

    Online shopping is common in many categories of retail goods. The recent trend towards online retailing has created an unprecedented empirical opportunity to examine consumer search behavior using click stream data. In this paper we examine consumer search intensity across a wide range of grocery products that differ in the depth of product assortment. We develop a model of attribute search in which consumers search within a chosen retailer for products that match their tastes, and that equil...

  15. SARMApp: Search and Rescue Mapping Application

    OpenAIRE

    Burkinshaw, Joseph P.

    2010-01-01

    In Search and Rescue (SAR) operations, the search team must know how to scan their search area efficiently with limited resources. Advances in mobile technology are driving the rapid growth of location based services (LBS) and this dissertation project investigates the feasibility of an LBS to support SAR operations. The LBS requires the ability to locate search team members, perform visibility analysis on-the-fly, and dynamically convey this information back to the user on a variety of mobil...

  16. Efficient Query Processing in Distributed Search Engines

    OpenAIRE

    Jonassen, Simon

    2013-01-01

    Web search engines have to deal with a rapidly increasing amount of information, high query loads and tight performance constraints. The success of a search engine depends on the speed with which it answers queries (efficiency) and the quality of its answers (effectiveness). These two metrics have a large impact on the operational costs of the search engine and the overall user satisfaction, which determine the revenue of the search engine. In this context, any improvement in query processing...

  17. A COMPARATIVE STUDY OF BYG SEARCH ENGINES

    Directory of Open Access Journals (Sweden)

    Kailash Kumar

    2013-01-01

    Full Text Available This paper compares the retrieval effectiveness of the Bing, Yahoo and Google (BYG Search Engines. The precision and relative recall of each search engine was considered for evaluating the effectiveness of the search engines. General Queries were tested. Results of the study showed that the precision of Google was high as compared to other two search engines and Yahoo has better precision than Bing

  18. Comparison and Evaluation of Semantic Search Engines

    OpenAIRE

    Raheleh Dorri

    2015-01-01

    In this study, we evaluate the performance of five semantic search engines that are available on the web, using 45 criteria, in the form of a researcher-made checklist. Criteria provided in the checklist included both common and semantic features. Common criteria or features are those applicable to all search engines and semantic ones are those only applicable to semantic search engines. Findings show that the selected search engines do not have suitable performance and expected efficiency. D...

  19. Google Patents: The global patent search engine

    OpenAIRE

    Alireza Noruzi; Mohammadhiwa Abdekhoda

    2014-01-01

    Google Patents (www.google.com/patents) includes over 8 million full-text patents. Google Patents works in the same way as the Google search engine. Google Patents is the global patent search engine that lets users search through patents from the USPTO (United States Patent and Trademark Office), EPO (European Patent Office), etc. This study begins with an overview of how to use Google Patent and identifies advanced search techniques not well-documented by Google Patent. It makes several sug...

  20. Capacity Planning for Vertical Search Engines

    OpenAIRE

    Badue, Claudine; Almeida, Jussara; Almeida, Virgilio; Baeza-Yates, Ricardo; Ribeiro-Neto, Berthier; Ziviani, Artur; Ziviani, Nivio

    2010-01-01

    Vertical search engines focus on specific slices of content, such as the Web of a single country or the document collection of a large corporation. Despite this, like general open web search engines, they are expensive to maintain, expensive to operate, and hard to design. Because of this, predicting the response time of a vertical search engine is usually done empirically through experimentation, requiring a costly setup. An alternative is to develop a model of the search engine for predicti...

  1. Children's evaluation criteria of search engines

    OpenAIRE

    Hornung, Eva

    2000-01-01

    Search engines on the Internet are widely used as a starting point for Information Retrieval. Children are increasingly users of the Internet and therefore also of search engines. Some companies and institutions have responded to that demand and have created search engines with a young target group in mind. Still, there is no study to date on how children themselves judge these search features with regards to design and functionality without having given them pre-defined "adult" criteria. Thi...

  2. Biosequence Similarity Search on the Mercury System

    OpenAIRE

    Krishnamurthy, Praveen; Buhler, Jeremy; Chamberlain, Roger; Franklin, Mark; Gyang, Kwame; Jacob, Arpith; Lancaster, Joseph

    2007-01-01

    Biosequence similarity search is an important application in modern molecular biology. Search algorithms aim to identify sets of sequences whose extensional similarity suggests a common evolutionary origin or function. The most widely used similarity search tool for biosequences is BLAST, a program designed to compare query sequences to a database. Here, we present the design of BLASTN, the version of BLAST that searches DNA sequences, on the Mercury system, an architecture that supports high...

  3. Cuckoo search for business optimization applications

    OpenAIRE

    Yang, Xin-She; Deb, Suash; Karamanoglu, Mehmet; He, Xingshi

    2012-01-01

    Cuckoo search has become a popular and powerful metaheuristic algorithm for global optimization. In business optimization and applications, many studies have focused on support vector machine and neural networks. In this paper, we use cuckoo search to carry out optimization tasks and compare the performance of cuckoo search with support vector machine. By testing benchmarks such as project scheduling and bankruptcy predictions, we conclude that cuckoo search can perform better than support ve...

  4. Monojet Searches for MSSM Simplified Models

    CERN Document Server

    Arbey, A; Mahmoudi, F

    2015-01-01

    We explore the implications of monojet searches at hadron colliders in the MSSM. To quantify the impact of monojet searches, we consider simplified MSSM scenarios with neutralino dark matter. The monojet results of the LHC Run 1 are reinterpreted in the context of several MSSM simplified scenarios, and the complementarity with direct SUSY search results is highlighted. We also investigate the reach of monojet searches for the Run 2, as well as for future higher energy hadron colliders.

  5. A study of Web search trends

    Directory of Open Access Journals (Sweden)

    Bernard J. Jansen

    2004-12-01

    Full Text Available This article provides an overview of recent research conducted from 1997 to 2003 that explored how people search the Web. The article reports selected findings from many research studies conducted by the co-authors of the paper from 1997 to 2003 using large-scale Web query transaction logs provided by commercial Web companies, including Excite, Alta Vista, Ask Jeeves, and AlltheWeb.com. The many studies are also synthesized in the recent book "Web Search: Public Searching of the Web" by Amanda Spink and Bernard J. Jansen (Kluwer Academic Publishers. The researchers examined the topics of Web searches; how users search the Web using terms in queries during search sessions; and the diverse types of searches, including medical, sex, e-commerce, multimedia, etc. information. Key findings include changes in search topics since 1997, including a shift from entertainment to e-commerce queries. Further findings show little change in many aspects of Web searching from 1997-2003, including query and search session length. The studies also show more complex Web search behaviors by a minority of users who conduct multitasking and successive searches.

  6. ATLAS $t\\bar{t}$ Resonance Searches

    CERN Document Server

    Sosa, David; The ATLAS collaboration

    2016-01-01

    In this talk the search for new resonances decaying to ttbar is presented. The search is performed with the ATLAS experiment at the LHC using proton-proton collision data. The current status of the ATLAS searches will be reviewed, addressing the used analysis techniques, in particular the selection criteria, the background modelling and the related experimental uncertainties.

  7. Relation Inclusive Search for Hindi Documents

    Directory of Open Access Journals (Sweden)

    Pooja Arora

    2013-08-01

    Full Text Available Information retrieval (IR techniques become a challenge to researchers due to huge growth of digital and information retrieval. As a wide variety of Hindi Data and Literature is now available on web, we have developed information retrieval system for Hindi documents. This paper presents a new searching technique that has promising results in terms of F-measure. Historically, there have been two major approaches to IR - keyword based search and concept based search. We have introduced new relation inclusive search which performs searching of documents using case role relation, spatial relation and temporal relation of query terms and gives results better than previously used approaches. In this method we have used new indexing technique which stores information about relation between terms along with its position. We have compared four types of searching: Keyword Based search without Relation Inclusive, Keyword Based search with Relation Inclusive, Concept Based search without Relation Inclusive and Concept Based search with Relation Inclusive. Our proposed searching method gave significant improvement in terms of F-measure. For experiments we have used Hindi document corpus, Gyannidhi from C-DAC. This technique effectively improves search performance for documents in English as well.

  8. Search Engines for Tomorrow's Scholars, Part Two

    Science.gov (United States)

    Fagan, Jody Condit

    2012-01-01

    This two-part article considers how well some of today's search tools support scholars' work. The first part of the article reviewed Google Scholar and Microsoft Academic Search using a modified version of Carole L. Palmer, Lauren C. Teffeau, and Carrier M. Pirmann's framework (2009). Microsoft Academic Search is a strong contender when…

  9. The Serial Process in Visual Search

    Science.gov (United States)

    Gilden, David L.; Thornton, Thomas L.; Marusich, Laura R.

    2010-01-01

    The conditions for serial search are described. A multiple target search methodology (Thornton & Gilden, 2007) is used to home in on the simplest target/distractor contrast that effectively mandates a serial scheduling of attentional resources. It is found that serial search is required when (a) targets and distractors are mirror twins, and (b)…

  10. Visual Search for Faces with Emotional Expressions

    Science.gov (United States)

    Frischen, Alexandra; Eastwood, John D.; Smilek, Daniel

    2008-01-01

    The goal of this review is to critically examine contradictory findings in the study of visual search for emotionally expressive faces. Several key issues are addressed: Can emotional faces be processed preattentively and guide attention? What properties of these faces influence search efficiency? Is search moderated by the emotional state of the…

  11. Cumulative Intertrial Inhibition in Repeated Visual Search

    Science.gov (United States)

    Takeda, Yuji

    2007-01-01

    In the present study the author examined visual search when the items remain visible across trials but the location of the target varies. Reaction times for inefficient search cumulatively increased with increasing numbers of repeated search trials, suggesting that inhibition for distractors carried over successive trials. This intertrial…

  12. New physics and DM searches from ATLAS

    CERN Document Server

    Ould-Saada, Farid; The ATLAS collaboration

    2016-01-01

    Recent new physics results from the ATLAS experiment are presented. This includes searches for Dark Matter, in particular mono-X searches, interpreted within simplified models, effective field theory and supersymmetry. Other exotic searches are mentioned, including the few channels where small excess was reported.

  13. Lepton flavour violation searches at the LHC

    CERN Document Server

    Dawe, Edmund; The ATLAS collaboration

    2015-01-01

    Recent results from searches for lepton flavour violation performed by ATLAS and CMS in the $\\sqrt{s}=8~\\text{TeV}$ data are presented. The search for $Z\\rightarrow e\\mu$ and lepton flavour violating heavy neutral particle decays are summarized before covering the search for $H\\rightarrow \\mu \\tau$ in greater detail.

  14. Music Search Engines: Specifications and Challenges

    DEFF Research Database (Denmark)

    Nanopoulos, Alexandros; Rafilidis, Dimitrios; Manolopoulos, Yannis;

    2009-01-01

    Nowadays we have a proliferation of music data available over the Web. One of the imperative challenges is how to search these vast, global-scale musical resources to find preferred music. Recent research has envisaged the notion of music search engines (MSEs) that allow for searching preferred...

  15. STAIRS Search Strategy: Ideas and Opinions.

    Science.gov (United States)

    Quinn, Karen Takle

    1980-01-01

    Concentrates on the practical, everyday aspects of online search strategy, specifically offering ideas and comments on search strategies for STAIRS users. Included are tables listing the logical operators available on the system and the search level (document, paragraph, sentence, word) of each. (Author/JD)

  16. Multilingual Federated Searching Across Heterogeneous Collections.

    Science.gov (United States)

    Powell, James; Fox, Edward A.

    1998-01-01

    Describes a scalable system for searching heterogeneous multilingual collections on the World Wide Web. Details Searchable Database Markup Language (SearchDB-ML) for describing the characteristics of a search engine and its interface, and a protocol for requesting word translations between languages. (Author)

  17. Supporting reflective web searching in elementary schools

    NARCIS (Netherlands)

    Vries, de Bregje; Meij, van der Hans; Lazonder, Ard W.

    2008-01-01

    In this contribution, two design experiments are presented in which reflective web searching is implemented in six elementary classrooms. Reflective web searching is viewed to comprise three steps: (1) develop ownership over search questions, (2) interpret and personalize web content, and (3) adapt

  18. Search and Stockpiling in Retail Gasoline Markets

    OpenAIRE

    David P. Byrne; Nicolas de Roos

    2014-01-01

    This note presents some simple, direct tests for search and dynamic demand behavior in retail gasoline markets. We exploit a unique market-level dataset that allows us to directly measure search intensity with daily web traffic data from a gasoline price reporting website, and perfectly measure daily changes in price levels and dispersion. We find stark evidence of both search and stockpiling behavior.

  19. Self-Directed Job Search: An Introduction.

    Science.gov (United States)

    Employment and Training Administration (DOL), Washington, DC.

    This document provides an introduction to a job search training activity--self-directed job search--which can be implemented by Private Industry Councils (PICs) or Comprehensive Employment and Training Act (CETA) Prime Sponsors. The first section introduces self-directed job search for the economically disadvantaged. The next section describes…

  20. Searching Chemical Abstracts Online in Undergraduate Chemistry.

    Science.gov (United States)

    Krumpolc, Miroslav; And Others

    1987-01-01

    Discusses the advantages of conducting online computer searches of "Chemical Abstracts." Introduces the logical sequences involved in searching an online database. Explains Boolean logic, proximity operators, truncation, searchable fields, and command language, as they relate to the use of online searches in undergraduate chemistry programs. (TW)

  1. Measuring Search Frictions Using Japanese Microdata

    DEFF Research Database (Denmark)

    Sasaki, Masaru; Kohara, Miki; Machikita, Tomohiro

    This paper estimates matching functions to measure search frictions in the Japanese labor market and presents determinants of search duration to explain the effect of unemployment benefits on a job seeker’s behavior. We employ administrative micro data that track the job search process of...

  2. Measuring Search Frictions Using Japanese Microdata

    DEFF Research Database (Denmark)

    Sasaki, Masaru; Kohara, Miki; Machikita, Tomohiro

    2013-01-01

    This paper estimates individual-level matching functions to measure search frictions in the Japanese labour market and presents the determinants of search duration. We employ administrative microdata that track the job search process of job seekers who left or lost their job in August 2005 and...

  3. Paragraph Qualification: A Search Approach with BRS/Search System Features.

    Science.gov (United States)

    Atkinson, Steven D.

    1983-01-01

    Discusses paragraph qualification, a search strategy used to retrieve information from computerized databases. Positive and negative paragraph qualification, after-the-fact qualification, multifile searching, and free text searching are described, using examples from the Bibliographic Retrieval Services (BRS)/Search System. (EJS)

  4. Needle custom search recall-oriented search on the web using semantic annotations

    NARCIS (Netherlands)

    Kaptein, R.; Koot, G.; Huis in 't Veld, M.A.A.; Broek, E.L. van den

    2014-01-01

    Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency o

  5. Needle custom search: recall-oriented search on the Web using semantic annotations

    NARCIS (Netherlands)

    Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; Broek, van den Egon L.; Rijke, de Maarten; Kenter, Tom; Vries, de Arjen P.; Zhai, Chen Xiang; Jong, de Franciska; Radinsky, Kira; Hofmann, Katja

    2014-01-01

    Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency o

  6. Needle Custom Search : Recall-oriented search on the web using semantic annotations

    NARCIS (Netherlands)

    Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon L.

    2014-01-01

    Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency o

  7. Federated search in the wild: the combined power of over a hundred search engines

    NARCIS (Netherlands)

    Nguyen, Dong-Phuong; Demeester, Thomas; Trieschnigg, Dolf; Hiemstra, Djoerd

    2012-01-01

    Federated search has the potential of improving web search: the user becomes less dependent on a single search provider and parts of the deep web become available through a unified interface, leading to a wider variety in the retrieved search results. However, a publicly available dataset for federa

  8. Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search

    Directory of Open Access Journals (Sweden)

    Mustafa Aksu

    2016-02-01

    Full Text Available Our new algorithm, priority search, was created with the help of skip list data structure and algorithms. Skip list data structure consists of linked lists formed in layers, which were linked in a pyramidal way. The time complexity of searching algorithm is equal to O(lgN in an N-element skip list data structure. The new developed searching algorithm was based on the hit search number for each searched data. If a datum has greater hit search number, then it was upgraded in the skip list data structure to the upper level. That is, the mostly searched data were located in the upper levels of the skip list data structure and rarely searched data were located in the lower levels of the skip list data structure. The pyramidal structure of data was constructed by using the hit search numbers, in another word, frequency of each data. Thus, the time complexity of searching was almost ?(1 for N records data set. In this paper, the applications of searching algorithms like linear search, binary search, and priority search were realized, and the obtained results were compared. The results demonstrated that priority search algorithm was better than the binary search algorithm.

  9. Improved Range Searching Lower Bounds

    DEFF Research Database (Denmark)

    Larsen, Kasper Green; Nguyen, Huy L.

    2012-01-01

    range reporting problem. In approximate simplex range reporting, points that lie within a distance of ε ⋅ Diam(s) from the border of a query simplex s, are free to be included or excluded from the output, where ε ≥ 0 is an input parameter to the range searching problem. We prove our lower bounds......Table of Contents -------------------------------------------------------------------------------- In this paper we present a number of improved lower bounds for range searching in the pointer machine and the group model. In the pointer machine, we prove lower bounds for the approximate simplex...... by constructing a hard input set and query set, and then invoking Chazelle and Rosenberg's [CGTA'96] general theorem on the complexity of navigation in the pointer machine. For the group model, we show that input sets and query sets that are hard for range reporting in the pointer machine (i.e. by Chazelle...

  10. Quantum search with trapped ions

    International Nuclear Information System (INIS)

    Full text: We propose an ion trap implementation of Grover's quantum search algorithm for an unstructured database of arbitrary length N. The experimental implementation is appealingly simple because the linear ion trap allows for a straightforward construction, in a single interaction step and without a multitude of Hadamard transforms, of the reflection operator, which is the engine of the Grover algorithm. Consequently, a dramatic reduction in the number of the required physical steps takes place, to just Ο(√N), the same as the number of the mathematical steps. The proposed setup allows for demonstration of both the original (probabilistic) Grover search and its deterministic variation, and is remarkably robust to imperfections in the register initialization. (author)

  11. Target-Searching on Percolation

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    We study target-searching processes on a percolation, on which a hunter tracks a target by smelling odors it emits. The odor intensity is supposed to be inversely proportional to the distance it propagates. The Monte Carlo simulation is performed on a 2-dimensional bond-percolation above the threshold. Having no idea of the location of the target, the hunter determines its moves only by random attempts in each direction. For lager percolation connectivity p (>~) 0.90, it reveals a scaling law for the searching time versus the distance to the position of the target. The scaling exponent is dependent on the sensitivity of the hunter. For smaller p, the scaling law is broken and the probability of finding out the target significantly reduces. The hunter seems trapped in the cluster of the percolation and can hardly reach the goal.

  12. Searching for Displaced Higgs Decays

    CERN Document Server

    Csaki, Csaba; Lombardo, Salvator; Slone, Oren

    2015-01-01

    We study a simplified model of the SM Higgs boson decaying to a degenerate pair of scalars which travel a macroscopic distance before decaying to SM particles. This is the leading signal for many well-motivated solutions to the hierarchy problem that do not propose additional light colored particles. Bounds for displaced Higgs decays below $10$ cm are found by recasting existing tracker searches from Run I. New tracker search strategies, sensitive to the characteristics of these models and similar decays, are proposed with sensitivities projected for Run II at $\\sqrt{s} = 13 $ TeV. With 20 fb$^{-1}$ of data, we find that Higgs branching ratios down to $7 \\times 10^{-4}$ can be probed for centimeter decay lengths.

  13. Dark Matter search at LHC

    CERN Document Server

    Pazzini, Jacopo

    2016-01-01

    The results of recent searches for dark matter at the Large Hadron Collider at CERN are reported.The searches for dark matter performed with the first data collected during the LHC Run-2 by the CMS and ATLAS collaborations, corresponding to 2.1~\\fb and 3.2~\\fb of proton-proton collisions at $\\sqrt{s}=13~\\TeV$ respectively, are presented and categorized according to the event topology characteristics.No excesses are found above the standard model expectations and the results are interpreted in terms of upper limits in the production of dark matter using simplified theory models.The results are also translated into limits on the dark matter-nucleon spin-dependent and spin-independent cross section to compare with the results of direct detection experiments.

  14. The Search for Another Earth

    Indian Academy of Sciences (India)

    2016-07-01

    Is there life anywhere else in the vast cosmos?Are there planets similar to the Earth? For centuries,these questions baffled curious minds. Eithera positive or negative answer, if found oneday, would carry a deep philosophical significancefor our very existence in the universe. Althoughthe search for extra-terrestrial intelligence wasinitiated decades ago, a systematic scientific andglobal quest towards achieving a convincing answerbegan in 1995 with the discovery of the firstconfirmed planet orbiting around the solar-typestar 51 Pegasi. Since then, astronomers have discoveredmany exoplanets using two main techniques,radial velocity and transit measurements.In the first part of this article, we shall describethe different astronomical methods through whichthe extrasolar planets of various kinds are discovered.In the second part of the article we shalldiscuss the various kinds of exoplanets, in particularabout the habitable planets discovered tilldate and the present status of our search for ahabitable planet similar to the Earth.

  15. Collider searches for extra dimensions

    Energy Technology Data Exchange (ETDEWEB)

    Landsberg, Greg; /Brown U.

    2004-12-01

    Searches for extra spatial dimensions remain among the most popular new directions in our quest for physics beyond the Standard Model. High-energy collider experiments of the current decade should be able to find an ultimate answer to the question of their existence in a variety of models. Until the start of the LHC in a few years, the Tevatron will remain the key player in this quest. In this paper, we review the most recent results from the Tevatron on searches for large, TeV{sup -1}-size, and Randall-Sundrum extra spatial dimensions, which have reached a new level of sensitivity and currently probe the parameter space beyond the existing constraints. While no evidence for the existence of extra dimensions has been found so far, an exciting discovery might be just steps away.

  16. DARK MATTER SEARCH AT LHC

    CERN Document Server

    Kanaya, N; The ATLAS collaboration

    2013-01-01

    The existence of significant amount of dark matter in the Universe is one of strongest motivations to expect new physics beyond the Standard Model. The observation of dark matter at the LHC is a grand challenge next to the discovery of the Higgs boson. Following sections present latest LHC results on the search for dark matter in various final states with large missing transverse energy using data collected in 2011 and 2012.

  17. Phase matching in quantum searching

    OpenAIRE

    Long, Gui Lu; Li, Yan Song; Zhang, Wei Lin; Niu, Li

    1999-01-01

    Each iteration in Grover's original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation \\theta and the inversion for the prepared state |\\gamma> is replaced by rotation through \\phi, we found that these phase rotations must satisfy a matching condition \\theta=\\phi. Approximate formula for the amplitude of the marked state after an arbitrary number of iteratio...

  18. Cuckoo Search via Levy Flights

    CERN Document Server

    Yang, Xin-She

    2010-01-01

    In this paper, we intend to formulate a new metaheuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Levy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the results and suggestion for further research.

  19. Cuckoo Search via Levy Flights

    OpenAIRE

    Yang, Xin-She; Deb, Suash

    2010-01-01

    In this paper, we intend to formulate a new metaheuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Levy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the ...

  20. Flippers in housing market search

    OpenAIRE

    Charles Ka Yui Leung; Chung-Yi Tse

    2012-01-01

    We add flippers-specialist investors who attempt to profit from buying low and selling high to a canonical housing market search model. These agents facilitate the turnover of mismatched houses on behalf of end-users and they may survive even if they face an arbitrarily large cost of financing vis-a-vis ordinary households. Multiple equilibrium may exist. In one equilibrium, most, if not all, transactions are intermediated by flippers, resulting in rapid turnover, a high vacancy rate, and hig...

  1. New phenomena searches at CDF

    Energy Technology Data Exchange (ETDEWEB)

    Soha, Aron; /UC, Davis

    2006-04-01

    The authors report on recent results from the Collider Detector at Fermilab (CDF) experiment, which is accumulating data from proton-antiproton collisions with {radical}s = 1.96 TeV at Run II of the Fermilab Tevatron. The new phenomena being explored include Higgs, Supersymmetry, and large extra dimensions. They also present the latest results of searches for heavy objects, which would indicate physics beyond the Standard Model.

  2. Insurance search and switching behavior

    OpenAIRE

    Bolhaar, J.A.; Klaauw, van der, B.; Lindeboom, M.

    2010-01-01

    This discussion paper resulted in a publication in 'De Economist' , 2015, 163, 25-60. This paper looks into the search behavior of consumers in the market for health insurance contracts. We consider the recent health insurance reform in The Netherlands, where a private-public mix of insurance provision was replaced by a system based on managed competition. Although all insurers offer the same basic package (determined by the government), there is substantial premium dispersion. We develop a s...

  3. Searching for better plasmonic materials

    DEFF Research Database (Denmark)

    West, P.; Ishii, S.; Naik, G.;

    2010-01-01

    Plasmonics is a research area merging the fields of optics and nanoelectronics by confining light with relatively large free-space wavelength to the nanometer scale - thereby enabling a family of novel devices. Current plasmonic devices at telecommunication and optical frequencies face significan...... for realizing optimal plasmonic material properties for specific frequencies and applications, thereby providing a reference for those searching for better plasmonic materials....

  4. Search Based Software Project Management

    OpenAIRE

    Ren, J

    2013-01-01

    This thesis investigates the application of Search Based Software Engineering (SBSE) approach in the field of Software Project Management (SPM). With SBSE approaches, a pool of candidate solutions to an SPM problem is automatically generated and gradually evolved to be increasingly more desirable. The thesis is motivated by the observation from industrial practice that it is much more helpful to the project manager to provide insightful knowledge than exact solutions. We investigate whether S...

  5. Individual Search and Social Networks

    OpenAIRE

    GOYAL, Sanjeev; Rosenkranz, Stephanie; Weitzel, Utz; Buskens, Vincent

    2014-01-01

    The explosion in online social networks motivates an enquiry into their structure and their welfare effects. A central feature of these networks is information sharing: online social networks lower the cost of getting information from others. These lower costs affect the attractiveness of individual search vis-a-vis a reliance on social networks. The paper reports the findings of an experiment on these effects. Our experiment shows that online networks can have large effects. Information acqu...

  6. Direct search for dark matter

    Energy Technology Data Exchange (ETDEWEB)

    Yoo, Jonghee; /Fermilab

    2009-12-01

    Dark matter is hypothetical matter which does not interact with electromagnetic radiation. The existence of dark matter is only inferred from gravitational effects of astrophysical observations to explain the missing mass component of the Universe. Weakly Interacting Massive Particles are currently the most popular candidate to explain the missing mass component. I review the current status of experimental searches of dark matter through direct detection using terrestrial detectors.

  7. Search for strange dibaryon systems

    International Nuclear Information System (INIS)

    The authors present preliminary results of an experiment which is being run at the CERN Proton Synchrotron (PS). The experiment is designed to search for dibaryon systems with strangeness -2, produced in the reaction K- + d→K+ + MM at 1.4 GeV/c incident K- momentum. The missing mass (MM) sensitivity ranges from 2.1 up to 2.4 GeV/c2, the resolution being approximately +- 3.5 MeV/c2. (Auth.)

  8. Labeling Clusters of Search Results

    OpenAIRE

    Nycander, Martin

    2013-01-01

    This project evaluates different algorithms which could be used in a summary information retrieval (IR) application for Swedish texts. Instead of the traditional search results the summary application would generate a summary document of the various subtopics of an IR query. First it is noted that in order to nd subtopics of a query, some kind of document clustering is needed. k-means is chosen as a candidate document clustering algorithm and evaluated in the environment of an IR application....

  9. Dark matter searches with CMS

    CERN Document Server

    Jeitler, Manfred

    2016-01-01

    The existence of dark matter, indicated by astronomical observations, is one of the main proofs of physics beyond the standard model. Despite its abundance, dark matter has not been directly observed yet. This talk presents several searches for dark matter production in proton-proton collisions at 7, 8, and 13 TeV at the LHC, performed by the CMS collaboration. They are interpreted in terms of simplified models with different structures and mediators, as well as generic effective theory terms.

  10. Search Techniques for Code Generation

    OpenAIRE

    Gvero, Tihomir

    2015-01-01

    This dissertation explores techniques that synthesize and generate program fragments and test inputs. The main goal of these techniques is to improve and support automation in program synthesis and test input generation. This is important because performing those processes manually is often tedious, time consuming and error prone. The main challenge that these techniques face is exploring the search space in efficient and scalable ways. In the first part of the dissertation, we present tools ...

  11. Multivariate Time Series Similarity Searching

    OpenAIRE

    Jimin Wang; Yuelong Zhu; Shijin Li; Dingsheng Wan; Pengcheng Zhang

    2014-01-01

    Multivariate time series (MTS) datasets are very common in various financial, multimedia, and hydrological fields. In this paper, a dimension-combination method is proposed to search similar sequences for MTS. Firstly, the similarity of single-dimension series is calculated; then the overall similarity of the MTS is obtained by synthesizing each of the single-dimension similarity based on weighted BORDA voting method. The dimension-combination method could use the existing similarity searchin...

  12. Scaling Group Testing Similarity Search

    OpenAIRE

    Iscen, Ahmet; Amsaleg, Laurent; Furon, Teddy

    2016-01-01

    The large dimensionality of modern image feature vectors, up to thousands of dimensions, is challenging the high dimensional indexing techniques. Traditional approaches fail at returning good quality results within a response time that is usable in practice. However, similarity search techniques inspired by the group testing framework have recently been proposed in an attempt to specifically defeat the curse of dimensionality. Yet, group testing does not scale and fails at indexing very large...

  13. Database searches for qualitative research

    OpenAIRE

    Evans, David

    2002-01-01

    Interest in the role of qualitative research in evidence-based health care is growing. However, the methods currently used to identify quantitative research do not translate easily to qualitative research. This paper highlights some of the difficulties during searches of electronic databases for qualitative research. These difficulties relate to the descriptive nature of the titles used in some qualitative studies, the variable information provided in abstracts, and the differences in the ind...

  14. The CRESST dark matter search

    CERN Document Server

    Jochum, J; Bruckmayer, M; Bucci, C; Cooper, S; Cozzini, C; Di Stefano, P; Von Feilitzsch, F; Frank, T; Jagemann, T; Keeling, R; Kraus, H; Lush, G J; Marchese, J; Meier, O; Meunier, P; Nagel, U; Pergolesi, D; Pröbst, F; Ramachers, Y; Schnagl, J; Seidel, W; Sergeyev, I; Stark, M; Stodolsky, L; Uchaikin, S V; Wulandari, H

    2000-01-01

    We present the current status of CRESST(Cryogenic Rare Event Search using Superconducting Thermometers) project and new results concerning the development of new detectors based on the simultaneous measurement of phonons and scintillation light. A significant reduction in the background rate could recently be achieved. With our newly developed method for the simultaneous measurement of scintillation light, strong background discrimination is possible also in larger detectors, resulting in a substantial increase in WIMP detection sensitivity.

  15. Engineering Optimisation by Cuckoo Search

    OpenAIRE

    Yang, Xin-She; Deb, Suash

    2010-01-01

    A new metaheuristic optimisation algorithm, called Cuckoo Search (CS), was developed recently by Yang and Deb (2009). This paper presents a more extensive comparison study using some standard test functions and newly designed stochastic test functions. We then apply the CS algorithm to solve engineering design optimisation problems, including the design of springs and welded beam structures. The optimal solutions obtained by CS are far better than the best solutions obtained by an efficient p...

  16. New Physics Search at LHCB

    OpenAIRE

    A. Hicheur

    2008-01-01

    Although direct detection of new particles will be the main focus of the LHC, indirect New Physics searches are expected to provide useful complementary information. In particular, precision measurements of rare processes occurring in flavour physics are of utmost importance in constraining the structure of the New physics low energy effective Lagrangian. In this paper, few key LHCb studies, including $B_s-\\bar{B}_s$ mixing and rare decays through the quark level $b\\to s$ loop transition, are...

  17. Searching for partial Hadamard matrices

    CERN Document Server

    Álvarez, Víctor; Frau, María-Dolores; Gudiel, Félix; Güemes, María-Belén; Martín, Elena; Osuna, Amparo

    2012-01-01

    Three algorithms looking for pretty large partial Hadamard matrices are described. Here "large" means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [dLa00]) is achieved. The first one performs some kind of local exhaustive search, and consequently is expensive from the time consuming point of view. The second one comes from the adaptation of the best genetic algorithm known so far searching for cliques in a graph, due to Singh and Gupta [SG06]. The last one consists in another heuristic search, which prioritizes the required processing time better than the final size of the partial Hadamard matrix to be obtained. In all cases, the key idea is characterizing the adjacency properties of vertices in a particular subgraph G_t of Ito's Hadamard Graph Delta (4t) [Ito85], since cliques of order m in G_t can be seen as (m+3)*4t partial Hadamard matrices.

  18. Stop searches in flavourful supersymmetry

    CERN Document Server

    Crivellin, Andreas; Tunstall, Lewis C

    2016-01-01

    Natural realisations of supersymmetry require light stops ${\\tilde t}_1$, making them a prime target of LHC searches for physics beyond the Standard Model. Depending on the kinematic region, the main search channels are ${\\tilde t_1}\\to t \\tilde \\chi^0_1$, ${\\tilde t_1}\\to W b \\tilde \\chi^0_1$ and ${\\tilde t_1}\\to c \\tilde \\chi^0_1$. We first examine the interplay of these decay modes with ${\\tilde c_1}\\to c \\tilde \\chi^0_1$ in a model-independent fashion, revealing the existence of large regions in parameter space which are excluded for any ${\\tilde t_1}\\to c \\tilde \\chi^0_1$ branching ratio. This effect is then illustrated for scenarios with stop-scharm mixing in the right-handed sector, where it has previously been observed that the stop mass limits can be significantly weakened for large mixing. Our analysis shows that once the LHC bounds from ${\\tilde c_1}\\to c \\tilde \\chi^0_1$ searches are taken into account, non-zero stop-scharm mixing leads only to a modest increase in the allowed regions of parameter...

  19. Searching for Orphan radiation sources

    International Nuclear Information System (INIS)

    Full text: The problem of orphan sources cannot be left unaddressed due high probability of accidental exposure and use of sources for terrorism. Search of objects of this kind is complex particularly when search territory is large. This requires devices capable of detecting sources, identifying their radionuclide composition, and correlating scan results to geographical coordinates and displaying results on a map. Spectral radiation scanner AT6101C can fulfill the objective of search for gamma and neutron radiation sources, radionuclide composition identification, correlation results to geographical coordinates and displaying results on a map. The scanner consists of gamma radiation scintillation detection unit based on NaI(Tl) crystal, neutron detection unit based on two He3 counters, GPS receiver and portable ruggedized computer. Built-in and application software automates entire scan process, saving all results to memory for further analysis with visual representation of results as spectral information diagrams, count rate profile and gamma radiation dose rates on a geographical map. The scanner informs operator with voice messages on detection of radiation sources, identification result and other events. Scanner detection units and accessories are packed in a backpack. Weighing 7 kg, the scanner is human portable and can be used for scan inside cars. The scanner can also be used for radiation mapping and inspections. (author)

  20. The CRESST dark matter search

    International Nuclear Information System (INIS)

    We discuss the short- and long-term perspectives of the CRESST (Cryogenic Rare Event Search using Superconducting Thermometers) project and present the current status of the experiment and new results concerning detector development. In the search for elementary particle dark matter, CRESST is presently the most advanced deep underground, low-background, cryogenic facility. The basic technique involved is to search for WIMPs (Weakly Interacting Massive Particles) by the measurement of nonthermal phonons, as created by WIMP-induced nuclear recoils. Combined with our newly developed method for the simultaneous measurement of scintillation light, strong background discrimination is possible, resulting in a substantial increase in WIMP detection sensitivity. This will allow a test of the reported positive evidence for a WIMP signal by the DAMA Collaboration in the near future. In the long term, the present CRESST setup permits the installation of a detector mass up to 100 kg. In contrast to other projects, CRESST technology allows the employment of a large variety of detection materials. This offers a powerful tool in establishing a WIMP signal and in investigating WIMP properties in the event of a positive signal

  1. Toward Expressive and Scalable Sponsored Search Auctions

    CERN Document Server

    Martin, David J; Halpern, Joseph Y

    2008-01-01

    Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the high volume of searches and the users' low tolerance for search result latency, it is imperative to resolve these auctions fast. Current approaches restrict the expressiveness of bids in order to achieve fast winner determination, which is the problem of allocating slots to advertisers so as to maximize the expected revenue given the advertisers' bids. The goal of our work is to permit more expressive bidding, thus allowing advertisers to achieve complex advertising goals, while still providing fast and scalable techniques for winner determination.

  2. Process-oriented semantic web search

    CERN Document Server

    Tran, DT

    2011-01-01

    The book is composed of two main parts. The first part is a general study of Semantic Web Search. The second part specifically focuses on the use of semantics throughout the search process, compiling a big picture of Process-oriented Semantic Web Search from different pieces of work that target specific aspects of the process.In particular, this book provides a rigorous account of the concepts and technologies proposed for searching resources and semantic data on the Semantic Web. To collate the various approaches and to better understand what the notion of Semantic Web Search entails, this bo

  3. Fast algorithms for sorting and searching strings

    Energy Technology Data Exchange (ETDEWEB)

    Bentley, J.L. [Bell Labs., Murray Hill, NJ (United States); Sedgewick, R. [Princeton Univ., NJ (United States)

    1997-06-01

    We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. The sorting algorithm blends Quicksort and radix sort; it is competitive with the best known C sort codes. The searching algorithm blends tries and binary search trees; it is faster than hashing and other commonly used search methods. The basic ideas behind the algorithms date back at least to the 1960s, but their practical utility has been overlooked. We also present extensions to more complex string problems, such as partial-match searching.

  4. A dynamic knowledge base based search engine

    Institute of Scientific and Technical Information of China (English)

    WANG Hui-jin; HU Hua; LI Qing

    2005-01-01

    Search engines have greatly helped us to find thedesired information from the Intemet. Most search engines use keywords matching technique. This paper discusses a Dynamic Knowledge Base based Search Engine (DKBSE), which can expand the user's query using the keywords' concept or meaning. To do this, the DKBSE needs to construct and maintain the knowledge base dynamically via the system's searching results and the user's feedback information. The DKBSE expands the user's initial query using the knowledge base, and returns the searched information after the expanded query.

  5. Relevance of Search Engines for Modern Generations

    OpenAIRE

    Trilok Gupta; Archana Sharma

    2014-01-01

    Web search engines have major impact in people‟s everyday life . It is of great i m p o r t a n c e to test the retrieval effectiveness of search e n g i n e s. However, it is labour-intensive to judge the relevance of search results for a large number of queries, and these relevance judgments may not be reusable since the Web data change all the time. Experiments on major search engines show that our approach mines many high- confidence rules that help understand search engines a...

  6. [Development of domain specific search engines].

    Science.gov (United States)

    Takai, T; Tokunaga, M; Maeda, K; Kaminuma, T

    2000-01-01

    As cyber space exploding in a pace that nobody has ever imagined, it becomes very important to search cyber space efficiently and effectively. One solution to this problem is search engines. Already a lot of commercial search engines have been put on the market. However these search engines respond with such cumbersome results that domain specific experts can not tolerate. Using a dedicate hardware and a commercial software called OpenText, we have tried to develop several domain specific search engines. These engines are for our institute's Web contents, drugs, chemical safety, endocrine disruptors, and emergent response for chemical hazard. These engines have been on our Web site for testing. PMID:11534132

  7. Search an unsorted database with quantum mechanics

    Institute of Scientific and Technical Information of China (English)

    LONG Guilu; LIU Yang

    2007-01-01

    In this article,we review quantum search algorithms for unsorted database search problem.Unsorted database search is a very important problem in science and technology.In a quantum computer,a marked state can be found with very high probability using the Grover's algorithm,or exactly with the Long algorithm.We review the Grover algorithm and related generalizations.In particular,we review the phase matching conditions in quantum search algorithm.Several issues that may cause confusion about the quantum search algorithm are also clarified.

  8. Pro SharePoint 2010 Search

    CERN Document Server

    Noble, J; Bakman-Mikalski, Dan

    2011-01-01

    Pro SharePoint 2010 Search gives you expert advice on planning, deploying and customizing searches in SharePoint 2010. Drawing on the authors' extensive experience of working with real-world SharePoint deployments, this book teaches everything you'll need to know to create well-designed SharePoint solutions that always keep the end-user's experience in mind. Increase your search efficiency with SharePoint 2010's search functionality: extend the search user interface using third-party tools, and utilize analytics to improve relevancy. This practical hands-on book is a must-have resource for any

  9. A simple model of search engine pricing

    OpenAIRE

    Eliaz, Kfir; Spiegler, Ran

    2009-01-01

    We present a simple model of how a monopolistic search engine optimally determines the average quality of firms in its search pool. In our model, there is a continuum of consumers, who use the search engine’s pool, and there is a continuum of firms, whose entry to the pool is restricted by a price set by the search engine. We show that a monopolistic search engine may have an incentive to set a relatively low price that encouarges low-relevance advertisers to enter the searc...

  10. Learning Search Algorithms: An Educational View

    Directory of Open Access Journals (Sweden)

    Ales Janota

    2014-12-01

    Full Text Available Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.

  11. A hybrid search algorithm for swarm robots searching in an unknown environment.

    Directory of Open Access Journals (Sweden)

    Shoutao Li

    Full Text Available This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

  12. A powerful search for EDMS 6

    CERN Multimedia

    2015-01-01

    Since the end of May, EDMS 6 has featured a brand new search solution. You might have already noticed the changes if you have run the search recently. We have integrated EDMS with the central CERN Search service, allowing EDMS to benefit from the central engine for queries and CERN search from EDMS public data, which can now be found directly via the CERN Search portal. The integration is a result of a very successful collaboration between the EDMS and the CERN Search teams.   What’s new in EDMS search The most important advantage of the new search is enabling searches in the files. While in the old search you could query only the document metadata, now the search also scans the content of the files attached to the documents. This allows for more relevant results, as the hit may be found both in the metadata or in the file. The result is displayed in the Documents & Files tab and the small icon indicates whether the object in which the queried terms were found is a file or a docume...

  13. A Search Model for Imperfectly Detected Targets

    Science.gov (United States)

    Ahumada, Albert

    2012-01-01

    Under the assumptions that 1) the search region can be divided up into N non-overlapping sub-regions that are searched sequentially, 2) the probability of detection is unity if a sub-region is selected, and 3) no information is available to guide the search, there are two extreme case models. The search can be done perfectly, leading to a uniform distribution over the number of searches required, or the search can be done with no memory, leading to a geometric distribution for the number of searches required with a success probability of 1/N. If the probability of detection P is less than unity, but the search is done otherwise perfectly, the searcher will have to search the N regions repeatedly until detection occurs. The number of searches is thus the sum two random variables. One is N times the number of full searches (a geometric distribution with success probability P) and the other is the uniform distribution over the integers 1 to N. The first three moments of this distribution were computed, giving the mean, standard deviation, and the kurtosis of the distribution as a function of the two parameters. The model was fit to the data presented last year (Ahumada, Billington, & Kaiwi, 2 required to find a single pixel target on a simulated horizon. The model gave a good fit to the three moments for all three observers.

  14. A Survey on Semantic Web Search Engine

    Directory of Open Access Journals (Sweden)

    G.Sudeepthi

    2012-03-01

    Full Text Available The tremendous growth in the volume of data and with the terrific growth of number of web pages, traditional search engines now a days are not appropriate and not suitable anymore. Search engine is the most important tool to discover any information in World Wide Web. Semantic Search Engine is born of traditional search engine to overcome the above problem. The Semantic Web is an extension of the current web in which information is given well-defined meaning. Semantic web technologies are playing a crucial role in enhancing traditional web search, as it is working to create machine readable data. but it will not replace traditional search engine. In this paper we made a brief survey on various promising features of some of the best semantic search engines developed so far and we have discussed the various approaches to semantic search. We have summarized the techniques, advantages of some important semantic web search engines that are developed so far.The most prominent part is that how the semantic search engines differ from the traditional searches and their results are shown by giving a sample query as input

  15. Practical fulltext search in medical records

    Directory of Open Access Journals (Sweden)

    Vít Volšička

    2015-09-01

    Full Text Available Performing a search through previously existing documents, including medical reports, is an integral part of acquiring new information and educational processes. Unfortunately, finding relevant information is not always easy, since many documents are saved in free text formats, thereby making it difficult to search through them. A full-text search is a viable solution for searching through documents. The full-text search makes it possible to efficiently search through large numbers of documents and to find those that contain specific search phrases in a short time. All leading database systems currently offer full-text search, but some do not support the complex morphology of the Czech language. Apache Solr provides full support options and some full-text libraries. This programme provides the good support of the Czech language in the basic installation, and a wide range of settings and options for its deployment over any platform. The library had been satisfactorily tested using real data from the hospitals. Solr provided useful, fast, and accurate searches. However, there is still a need to make adjustments in order to receive effective search results, particularly by correcting typographical errors made not only in the text, but also when entering words in the search box and creating a list of frequently used abbreviations and synonyms for more accurate results.

  16. Scuba Search : when selection meets innovation

    CERN Document Server

    Verel, Sébastien; Clergue, Manuel

    2007-01-01

    We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape. Despite the fact that natural evolution does not directly select for evolvability, the basic idea behind the scuba search heuristic is to explicitly push the evolvability to increase. The search process switches between two phases: Conquest-of-the-Waters and Invasion-of-the-Land. A comparative study of the new algorithm and standard local search heuristics on the NKq-landscapes has shown advantage and limit of the scuba search. To enlighten qualitative differences between neutral search processes, the space is changed into a connected graph to visualize the pathways that the search is likely to follow.

  17. NASA Indexing Benchmarks: Evaluating Text Search Engines

    Science.gov (United States)

    Esler, Sandra L.; Nelson, Michael L.

    1997-01-01

    The current proliferation of on-line information resources underscores the requirement for the ability to index collections of information and search and retrieve them in a convenient manner. This study develops criteria for analytically comparing the index and search engines and presents results for a number of freely available search engines. A product of this research is a toolkit capable of automatically indexing, searching, and extracting performance statistics from each of the focused search engines. This toolkit is highly configurable and has the ability to run these benchmark tests against other engines as well. Results demonstrate that the tested search engines can be grouped into two levels. Level one engines are efficient on small to medium sized data collections, but show weaknesses when used for collections 100MB or larger. Level two search engines are recommended for data collections up to and beyond 100MB.

  18. Global Heuristic Search on Encrypted Data (GHSED)

    CERN Document Server

    Halloush, Maisa

    2009-01-01

    Important document are being kept encrypted in remote servers. In order to retrieve these encrypted data, efficient search methods needed to enable the retrieval of the document without knowing the content of the documents In this paper a technique called a global heuristic search on encrypted data (GHSED) technique will be described for search in an encrypted files using public key encryption stored on an untrusted server and retrieve the files that satisfy a certain search pattern without revealing any information about the original files. GHSED technique would satisfy the following: (1) Provably secure, the untrusted server cannot learn anything about the plaintext given only the cipher text. (2) Provide controlled searching, so that the untrusted server cannot search for a word without the user's authorization. (3) Support hidden queries, so that the user may ask the untrusted server to search for a secret word without revealing the word to the server. (4) Support query isolation, so the untrusted server ...

  19. Shodhika Bhashini Multilingual Search and TTS System

    Directory of Open Access Journals (Sweden)

    Dr.K.V.N.Sunitha

    2010-11-01

    Full Text Available This paper presents a multilingual search engine and text to speech system (TTS developed to help hands-busy and visually impaired/aged people. Wide spread use of computers and Internet for the last two decades has made any information available in fraction of seconds. People of all ages prefer web searching than books. This resulted in development of very powerful search engines. But they are not that user friendly when it comes to searching using regional language andproducing the required information in a convenient way to disabled/aged/hands-busy people, particularly for Indian languages. The work presented here is an effort to overcome these limitations of search engine. Shodhika Bhashini not only searches the information in a user friendly way but also speaks out the information. This multilingual TTS and search engine is developed for communicating in Telugu, English & Hindi language. Same can be extended for other south Indian languages.

  20. P2P Concept Search: Some Preliminary Results

    OpenAIRE

    Giunchiglia, Fausto; Kharkevich, Uladzimir; Noori, S.R.H

    2009-01-01

    Concept Search extends syntactic search, i.e., search based on the computation of string similarity between words, with semantic search, i.e., search based on the computation of semantic relations between complex concepts. It allows us to deal with ambiguity of natural language. P2P Concept Search extends Concept Search by allowing distributed semantic search over structured P2P network. The key idea is to exploit distributed, rather than centralized, background knowledge and indices.