No Free Lunch versus Occam's Razor in Supervised Learning

The No Free Lunch theorems are often used to argue that domain specific knowledge is required to design successful algorithms. We use algorithmic information theory to argue the case for a universal bias allowing an algorithm to succeed in all interesting problem domains. Additionally, we give a new algorithm for off-line classification, inspired by Solomonoff induction, with good performance on all structured problems under reasonable assumptions. This includes a proof of the efficacy of the well-known heuristic of randomly selecting training data in the hope of reducing misclassification rates.Comment: 16 LaTeX pages, 1 figur

エントロピー圧縮した文字列に対する検索アルゴリズムに関する研究

Tohoku University篠原

Research and Field Application of Top Screen Cementing Technology with the Salvaging Type Plug-Drilling-Free Tool

Top screen pipe cementing technology of casing in horizontal well has been one of the main completion, especially for developing reservoirs with bottom and edge water and heavy oil reservoirs. Main drawbacks of screen top cementing completion technology in horizontal wells are casing wear in the process of drilling plug and burrs in the inner surface after drilling plug which are obstacles of well intervention. The salvaging type Non-plug-drilling tool eliminates the disadvantages of plug-drilling. By optimizing tool structure, improving technology, the reliability of salvaging type plug-drilling-free tool has been increased. More than 133 wells in 2012 had adopted the salvaging type plug-drilling-free tool with high reliability in Pai 601 Block of Xinjiang with 100% success rate.  Key words: Horizontal well; The salvaging type plug-drilling-free technology; Completion; Top screen cementing technology; Field applicatio

MEMS 411: Q.T. B-BAR, Gambian Pouched Rat Trap

To design and build an improved rat trap that will effectively capture a Gambian Pouched Rat of larger size ensuring the rodents\u27 safety, easy deployment in natural environments, simple mechanical release mechanisms, and cost-effectiveness

Data Structures for Efficient String Algorithms

This thesis deals with data structures that are mostly useful in the area of string matching and string mining. Our main result is an O(n)-time preprocessing scheme for an array of n numbers such that subsequent queries asking for the position of a minimum element in a specified interval can be answered in constant time (so-called RMQs for Range Minimum Queries). The space for this data structure is 2n+o(n) bits, which is shown to be asymptotically optimal in a general setting. This improves all previous results on this problem. The main techniques for deriving this result rely on combinatorial properties of arrays and so-called Cartesian Trees. For compressible input arrays we show that further space can be saved, while not affecting the time bounds. For the two-dimensional variant of the RMQ-problem we give a preprocessing scheme with quasi-optimal time bounds, but with an asymptotic increase in space consumption of a factor of log(n). It is well known that algorithms for answering RMQs in constant time are useful for many different algorithmic tasks (e.g., the computation of lowest common ancestors in trees); in the second part of this thesis we give several new applications of the RMQ-problem. We show that our preprocessing scheme for RMQ (and a variant thereof) leads to improvements in the space- and time-consumption of the Enhanced Suffix Array, a collection of arrays that can be used for many tasks in pattern matching. In particular, we will see that in conjunction with the suffix- and LCP-array 2n+o(n) bits of additional space (coming from our RMQ-scheme) are sufficient to find all occ occurrences of a (usually short) pattern of length m in a (usually long) text of length n in O(m*s+occ) time, where s denotes the size of the alphabet. This is certainly optimal if the size of the alphabet is constant; for non-constant alphabets we can improve this to O(m*log(s)+occ) locating time, replacing our original scheme with a data structure of size approximately 2.54n bits. Again by using RMQs, we then show how to solve frequency-related string mining tasks in optimal time. In a final chapter we propose a space- and time-optimal algorithm for computing suffix arrays on texts that are logically divided into words, if one is just interested in finding all word-aligned occurrences of a pattern. Apart from the theoretical improvements made in this thesis, most of our algorithms are also of practical value; we underline this fact by empirical tests and comparisons on real-word problem instances. In most cases our algorithms outperform previous approaches by all means

Pcm telemtry- a new approach using all- magnetic techniques

Digital all-magnetic circuit technique used in pulse code modulation telemetry system

Guiding nipple-areola complex reconstruction.Lliterature review and proposal of a new decision-making algorithm

Background: Nipple-areola complex reconstruction (NAR) most commonly represents the finishing touch to breast reconstruction (BR). Nipple presence is particularly relevant to the patient’s psyche, beyond any shadow of doubt. Many reconstructive options have been described in time. Surgery is easy, but final result is often disappointing on the long run. Methods: The goal of this manuscript is to analyze and classify knowledge concerning NAR techniques and the factors that influence success, and then to elaborate a practical evidence-based algorithm. Out of the 3136 available articles as of August 8th, 2020, we selected 172 manuscripts that met inclusion criteria, which we subdivided into 5 main topics of discussion, being the various NAR techniques; patient factors (including patient selection, timing and ideal position); dressings; potential complications and finally, outcomes/patient satisfaction. Results: We found 92 articles describing NAR techniques, 41 addressing patient factors (out of which 17 discussed patient selection, 14 described ideal NAC location, 10 described appropriate timing), 10 comparing dressings, 7 studying NAR complications, and 22 addressing outcomes and patient satisfaction. We elaborated a comprehensive decision-making algorithm to help narrow down the choice among NAR techniques, and choose the correct strategy according to the various scenarios, and particularly the BR technique and skin envelope. Conclusions: No single NAR technique provides definitive results, which is why we believe there is no “end-all be-all solution”. NAR must be approached as a case-by-case situation. Furthermore, despite NAR being such a widely discussed topic in scientific literature, we still found a lack of clinical trials to allow for more thorough recommendations to be elaborated. Level of Evidence III: This journal requires that authors assign a level of evidence to each submission to which Evidence-Based Medicine rankings are applicable. This excludes Review Articles, Book Reviews, and manuscripts that concern Basic Science, Animal Studies, Cadaver Studies, and Experimental Studies. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors www.springer.com/0026