WorldWideScience

Sample records for string matching algorithm

  1. Improved algorithms for approximate string matching (extended abstract

    Directory of Open Access Journals (Sweden)

    Papamichail Georgios

    2009-01-01

    Full Text Available Abstract Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. Results We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s - |n - m|·min(m, n, s + m + n and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm also excels in practice, especially in cases where the two strings compared differ significantly in length. Conclusion We have provided the design, analysis and implementation of a new algorithm for calculating the edit distance of two strings with both theoretical and practical implications. Source code of our algorithm is available online.

  2. Optimal Packed String Matching

    DEFF Research Database (Denmark)

    Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany

    2011-01-01

    In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speed...

  3. A string matching based algorithm for performance evaluation of ...

    Indian Academy of Sciences (India)

    In this paper, we have addressed the problem of automated performance evaluation of Mathematical Expression (ME) recognition. Automated evaluation requires that recognition output and ground truth in some editable format like LaTeX, MathML, etc. have to be matched. But standard forms can have extraneous symbols ...

  4. GPU Based N-Gram String Matching Algorithm with Score Table Approach for String Searching in Many Documents

    Science.gov (United States)

    Srinivasa, K. G.; Shree Devi, B. N.

    2017-10-01

    String searching in documents has become a tedious task with the evolution of Big Data. Generation of large data sets demand for a high performance search algorithm in areas such as text mining, information retrieval and many others. The popularity of GPU's for general purpose computing has been increasing for various applications. Therefore it is of great interest to exploit the thread feature of a GPU to provide a high performance search algorithm. This paper proposes an optimized new approach to N-gram model for string search in a number of lengthy documents and its GPU implementation. The algorithm exploits GPGPUs for searching strings in many documents employing character level N-gram matching with parallel Score Table approach and search using CUDA API. The new approach of Score table used for frequency storage of N-grams in a document, makes the search independent of the document's length and allows faster access to the frequency values, thus decreasing the search complexity. The extensive thread feature in a GPU has been exploited to enable parallel pre-processing of trigrams in a document for Score Table creation and parallel search in huge number of documents, thus speeding up the whole search process even for a large pattern size. Experiments were carried out for many documents of varied length and search strings from the standard Lorem Ipsum text on NVIDIA's GeForce GT 540M GPU with 96 cores. Results prove that the parallel approach for Score Table creation and searching gives a good speed up than the same approach executed serially.

  5. Keylogger Application to Monitoring Users Activity with Exact String Matching Algorithm

    Science.gov (United States)

    Rahim, Robbi; Nurdiyanto, Heri; Saleh A, Ansari; Abdullah, Dahlan; Hartama, Dedy; Napitupulu, Darmawan

    2018-01-01

    The development of technology is very fast, especially in the field of Internet technology that at any time experiencing significant changes, The development also supported by the ability of human resources, Keylogger is a tool that most developed because this application is very rarely recognized a malicious program by antivirus, keylogger will record all activities related to keystrokes, the recording process is accomplished by using string matching method. The application of string matching method in the process of recording the keyboard is to help the admin in knowing what the user accessed on the computer.

  6. Techniques Used in String Matching for Network Security

    OpenAIRE

    Jamuna Bhandari

    2014-01-01

    String matching also known as pattern matching is one of primary concept for network security. In this area the effectiveness and efficiency of string matching algorithms is important for applications in network security such as network intrusion detection, virus detection, signature matching and web content filtering system. This paper presents brief review on some of string matching techniques used for network security.

  7. Pattern recognition and string matching

    CERN Document Server

    Cheng, Xiuzhen

    2002-01-01

    The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and practical attention. String matching is also an important topic in combinatorial optimization. This book is devoted to recent advances in pattern recognition and string matching. It consists of twenty eight chapters written by different authors, addressing a broad range of topics such as those from classifica­ tion, matching, mining, feature selection, and applications. Each chapter is self-contained, and presents either novel methodological approaches or applications of existing theories and techniques. The aim, intent, and motivation for publishing this book is to pro­ vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way. This includes student...

  8. Towards optimal packed string matching

    DEFF Research Database (Denmark)

    Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany

    2014-01-01

    -size string-matching instruction wssm is available in contemporary commodity processors. The other word-size maximum-suffix instruction wslm is only required during the pattern pre-processing. Benchmarks show that our solution can be efficiently implemented, unlike some prior theoretical packed string...

  9. String matching with variable length gaps

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel

    2012-01-01

    primitive in computational biology applications. Let m and n be the lengths of P and T, respectively, and let k be the number of strings in P. We present a new algorithm achieving time O(nlogk+m+α) and space O(m+A), where A is the sum of the lower bounds of the lengths of the gaps in P and α is the total...... number of occurrences of the strings in P within T. Compared to the previous results this bound essentially achieves the best known time and space complexities simultaneously. Consequently, our algorithm obtains the best known bounds for almost all combinations of m, n, k, A, and α. Our algorithm...

  10. Experiences with string matching on the Fermi Architecture

    Energy Technology Data Exchange (ETDEWEB)

    Tumeo, Antonino; Secchi, Simone; Villa, Oreste

    2011-02-25

    String matching is at the core of many real-world applications, such as security, bioinformatic, data mining. All these applications requires the ability to match always growing data sets against large dictionaries effectively, fastly and possibly in real time. Unfortunately, string matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. Graphic Processing Units (GPU) have become an interesting target for such high-throughput applications, but the algorithms and the data structures need to be redesigned to be parallelized and adapted to the underlining hardware, coping with the limitations imposed by these architectures. In this paper we present an efficient implementation of the Aho-Corasick string matching algorithm on GPU, showing how we progressively redesigned the algorithm and the data structures to fit on the architecture. We then evaluate the implementation on single and multiple Tesla C2050 (T20 ``Fermi'' based) boards, comparing them to the previous Tesla C1060 (T10 based) solutions and equivalent multicore implementations on x86 CPUs. We discuss the various tradeoffs of the different architectures.

  11. Efficient Aho-Corasick String Matching on Emerging Multicore Architectures

    Energy Technology Data Exchange (ETDEWEB)

    Tumeo, Antonino; Villa, Oreste; Secchi, Simone; Chavarría-Miranda, Daniel

    2013-12-12

    String matching algorithms are critical to several scientific fields. Beside text processing and databases, emerging applications such as DNA protein sequence analysis, data mining, information security software, antivirus, ma- chine learning, all exploit string matching algorithms [3]. All these applica- tions usually process large quantity of textual data, require high performance and/or predictable execution times. Among all the string matching algorithms, one of the most studied, especially for text processing and security applica- tions, is the Aho-Corasick algorithm. 1 2 Book title goes here Aho-Corasick is an exact, multi-pattern string matching algorithm which performs the search in a time linearly proportional to the length of the input text independently from pattern set size. However, depending on the imple- mentation, when the number of patterns increase, the memory occupation may raise drastically. In turn, this can lead to significant variability in the performance, due to the memory access times and the caching effects. This is a significant concern for many mission critical applications and modern high performance architectures. For example, security applications such as Network Intrusion Detection Systems (NIDS), must be able to scan network traffic against very large dictionaries in real time. Modern Ethernet links reach up to 10 Gbps, and malicious threats are already well over 1 million, and expo- nentially growing [28]. When performing the search, a NIDS should not slow down the network, or let network packets pass unchecked. Nevertheless, on the current state-of-the-art cache based processors, there may be a large per- formance variability when dealing with big dictionaries and inputs that have different frequencies of matching patterns. In particular, when few patterns are matched and they are all in the cache, the procedure is fast. Instead, when they are not in the cache, often because many patterns are matched and the caches are

  12. Algorithms and data structures for grammar-compressed strings

    DEFF Research Database (Denmark)

    Cording, Patrick Hagge

    Textual databases for e.g. biological or web-data are growing rapidly, and it is often only feasible to store the data in compressed form. However, compressing the data comes at a price. Traditional algorithms for e.g. pattern matching requires all data to be decompressed - a computationally...... demanding task. In this thesis we design data structures for accessing and searching compressed data efficiently. Our results can be divided into two categories. In the first category we study problems related to pattern matching. In particular, we present new algorithms for counting and comparing...... substrings, and a new algorithm for finding all occurrences of a pattern in which we may insert gaps. In the other category we deal with accessing and decompressing parts of the compressed string. We show how to quickly access a single character of the compressed string, and present a data structure...

  13. Career Path Suggestion using String Matching and Decision Trees

    Science.gov (United States)

    Nagpal, Akshay; P. Panda, Supriya

    2015-05-01

    High school and college graduates seemingly are often battling for the courses they should major in order to achieve their target career. In this paper, we worked on suggesting a career path to a graduate to reach his/her dream career given the current educational status. Firstly, we collected the career data of professionals and academicians from various career fields and compiled the data set by using the necessary information from the data. Further, this was used as the basis to suggest the most appropriate career path for the person given his/her current educational status. Decision trees and string matching algorithms were employed to suggest the appropriate career path for a person. Finally, an analysis of the result has been done directing to further improvements in the model.

  14. Cache Locality-Centric Parallel String Matching on Many-Core Accelerator Chips

    OpenAIRE

    Tran, Nhat-Phuong; Lee, Myungho; Choi, Dong Hoon

    2015-01-01

    Aho-Corasick (AC) algorithm is a multiple patterns string matching algorithm commonly used in computer and network security and bioinformatics, among many others. In order to meet the highly demanding computational requirements imposed on these applications, achieving high performance for the AC algorithm is crucial. In this paper, we present a high performance parallelization of the AC on the many-core accelerator chips such as the Graphic Processing Unit (GPU) from Nvidia and...

  15. Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research

    Directory of Open Access Journals (Sweden)

    Burgess Shane C

    2008-04-01

    Full Text Available Abstract Background This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomics. The process of matching peptide sequences against a genome translated in six reading frames is part of a proteogenomic mapping pipeline that is used as a case-study. The Aho-Corasick algorithm is adapted for execution in field programmable gate array (FPGA devices in a manner that optimizes space and performance. In this approach, the traditional Aho-Corasick finite state machine (FSM is split into smaller FSMs, operating in parallel, each of which matches up to 20 peptides in the input translated genome. Each of the smaller FSMs is further divided into five simpler FSMs such that each simple FSM operates on a single bit position in the input (five bits are sufficient for representing all amino acids and special symbols in protein sequences. Results This bit-split organization of the Aho-Corasick implementation enables efficient utilization of the limited random access memory (RAM resources available in typical FPGAs. The use of on-chip RAM as opposed to FPGA logic resources for FSM implementation also enables rapid reconfiguration of the FPGA without the place and routing delays associated with complex digital designs. Conclusion Experimental results show storage efficiencies of over 80% for several data sets. Furthermore, the FPGA implementation executing at 100 MHz is nearly 20 times faster than an implementation of the traditional Aho-Corasick algorithm executing on a 2.67 GHz workstation.

  16. A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.

    Directory of Open Access Journals (Sweden)

    ThienLuan Ho

    Full Text Available Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs. In the proposed algorithm, all threads in the same GPUs warp share data using warp-shuffle operation instead of accessing the shared memory. Moreover, we implement the proposed algorithm by exploiting the memory structure of GPUs to optimize its performance. Experiment results for real DNA packages revealed that the performance of the proposed algorithm and its implementation archived up to 122.64 and 1.53 times compared to that of sequential algorithm on CPU and previous parallel approximate string matching algorithm on GPUs, respectively.

  17. Efficient parallel algorithms for string editing and related problems

    Science.gov (United States)

    Apostolico, Alberto; Atallah, Mikhail J.; Larmore, Lawrence; Mcfaddin, H. S.

    1988-01-01

    The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x),(absolute value of y)) and n = max((absolute value of x),(absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn).

  18. FPGA-accelerated algorithm for the regular expression matching system

    Science.gov (United States)

    Russek, P.; Wiatr, K.

    2015-01-01

    This article describes an algorithm to support a regular expressions matching system. The goal was to achieve an attractive performance system with low energy consumption. The basic idea of the algorithm comes from a concept of the Bloom filter. It starts from the extraction of static sub-strings for strings of regular expressions. The algorithm is devised to gain from its decomposition into parts which are intended to be executed by custom hardware and the central processing unit (CPU). The pipelined custom processor architecture is proposed and a software algorithm explained accordingly. The software part of the algorithm was coded in C and runs on a processor from the ARM family. The hardware architecture was described in VHDL and implemented in field programmable gate array (FPGA). The performance results and required resources of the above experiments are given. An example of target application for the presented solution is computer and network security systems. The idea was tested on nearly 100,000 body-based viruses from the ClamAV virus database. The solution is intended for the emerging technology of clusters of low-energy computing nodes.

  19. Fast Partial Evaluation of Pattern Matching in Strings

    DEFF Research Database (Denmark)

    Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

    2006-01-01

    We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by specializing a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how to obtain...... it in linear time has remained an open problem. Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate computations can...... be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time. Finally, we show that the method also...

  20. Fast Partial Evaluation of Pattern Matching in Strings

    DEFF Research Database (Denmark)

    Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

    2003-01-01

    We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by specializing a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how to obtain...... it in linear time has remained an open problem. Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate computations can...... be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time. Finally, we show that the method also...

  1. Fast Partial Evaluation of Pattern Matching in Strings

    DEFF Research Database (Denmark)

    Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

    2003-01-01

    We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by partial evaluation of a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how...... to obtain it in linear time has remained an open problem.Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate...... computations can be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time....

  2. Matching and Compression of Strings with Automata and Word Packing

    DEFF Research Database (Denmark)

    Skjoldjensen, Frederik Rye; Gørtz, Inge Li; Thomassen, Carsten

    pattern queries. In the deterministic variant the goal is to solve the string indexing problem without any randomization (at preprocessing time or query time). In the packed variant the strings are stored with several character in a single word, giving us the opportunity to read multiple characters...... in (deterministic) time O (m= + logm + log log ) ; where = w= log is the number of characters packed in a word of size w = (log n). Our query time is always at least as good as the previous best known bounds and whenever several characters are packed in a word, i.e., log w, the query times are faster. Dynamic...

  3. Stereo Matching Based On Election Campaign Algorithm

    Directory of Open Access Journals (Sweden)

    Xie Qing Hua

    2016-01-01

    Full Text Available Stereo matching is one of the significant problems in the study of the computer vision. By getting the distance information through pixels, it is possible to reproduce a three-dimensional stereo. In this paper, the edges are the primitives for matching, the grey values of the edges and the magnitude and direction of the edge gradient were figured out as the properties of the edge feature points, according to the constraints for stereo matching, the energy function was built for finding the route minimizing by election campaign optimization algorithm during the process of stereo matching was applied to this problem the energy function. Experiment results show that this algorithm is more stable and it can get the matching result with better accuracy.

  4. Algorithms and Data Structures for Strings, Points and Integers

    DEFF Research Database (Denmark)

    Vind, Søren Juhl

    a string under a compression scheme that can achieve better than entropy compression. We also give improved results for the substring concatenation problem, and an extension of our structure can be used as a black box to get an improved solution to the previously studied dynamic text static pattern problem....... Compressed Pattern Matching. In the streaming model, input data flows past a client one item at a time, but is far too large for the client to store. The annotated streaming model extends the model by introducing a powerful but untrusted annotator (representing “the cloud”) that can annotate input elements...... with additional information, sent as one-way communication to the client. We generalize the annotated streaming model to be able to solve problems on strings and present a data structure that allows us to trade off client space and annotation size. This lets us exploit the power of the annotator. In compressed...

  5. A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol.

    Directory of Open Access Journals (Sweden)

    Ping Zeng

    Full Text Available In this paper, based on our previous multi-pattern uniform resource locator (URL binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.

  6. Nearest Neighbour Corner Points Matching Detection Algorithm

    Directory of Open Access Journals (Sweden)

    Zhang Changlong

    2015-01-01

    Full Text Available Accurate detection towards the corners plays an important part in camera calibration. To deal with the instability and inaccuracies of present corner detection algorithm, the nearest neighbour corners match-ing detection algorithms was brought forward. First, it dilates the binary image of the photographed pictures, searches and reserves quadrilateral outline of the image. Second, the blocks which accord with chess-board-corners are classified into a class. If too many blocks in class, it will be deleted; if not, it will be added, and then let the midpoint of the two vertex coordinates be the rough position of corner. At last, it precisely locates the position of the corners. The Experimental results have shown that the algorithm has obvious advantages on accuracy and validity in corner detection, and it can give security for camera calibration in traffic accident measurement.

  7. Alternative confidence measure for local matching stereo algorithms

    CSIR Research Space (South Africa)

    Ndhlovu, T

    2009-11-01

    Full Text Available The authors present a confidence measure applied to individual disparity estimates in local matching stereo correspondence algorithms. It aims at identifying textureless areas, where most local matching algorithms fail. The confidence measure works...

  8. Fast image matching algorithm based on projection characteristics

    Science.gov (United States)

    Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

    2011-06-01

    Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.

  9. Fast Searching in Packed Strings

    DEFF Research Database (Denmark)

    Bille, Philip

    2009-01-01

    Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time....... However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let m...... word-RAM with logarithmic word size we present an algorithm using time O(n/log(sigma) n + m + occ) Here occ is the number of occurrences of P in Q. For m = o(n) this improves the O(n) bound...

  10. A string matching based algorithm for performance evaluation of ...

    Indian Academy of Sciences (India)

    Zanibbi et al (2011) have proposed performance metrics based on bipartite graphs at stroke level. ... bipartite graphs on which metrics based on hamming distances are defined. ...... Document Image Analysis for Libraries 320–331 ... Lee H J and Wang J S 1997 Design of a mathematical expression understanding system.

  11. Improved artificial bee colony algorithm based gravity matching navigation method.

    Science.gov (United States)

    Gao, Wei; Zhao, Bo; Zhou, Guang Tao; Wang, Qiu Ying; Yu, Chun Yang

    2014-07-18

    Gravity matching navigation algorithm is one of the key technologies for gravity aided inertial navigation systems. With the development of intelligent algorithms, the powerful search ability of the Artificial Bee Colony (ABC) algorithm makes it possible to be applied to the gravity matching navigation field. However, existing search mechanisms of basic ABC algorithms cannot meet the need for high accuracy in gravity aided navigation. Firstly, proper modifications are proposed to improve the performance of the basic ABC algorithm. Secondly, a new search mechanism is presented in this paper which is based on an improved ABC algorithm using external speed information. At last, modified Hausdorff distance is introduced to screen the possible matching results. Both simulations and ocean experiments verify the feasibility of the method, and results show that the matching rate of the method is high enough to obtain a precise matching position.

  12. Selection method of terrain matching area for TERCOM algorithm

    Science.gov (United States)

    Zhang, Qieqie; Zhao, Long

    2017-10-01

    The performance of terrain aided navigation is closely related to the selection of terrain matching area. The different matching algorithms have different adaptability to terrain. This paper mainly studies the adaptability to terrain of TERCOM algorithm, analyze the relation between terrain feature and terrain characteristic parameters by qualitative and quantitative methods, and then research the relation between matching probability and terrain characteristic parameters by the Monte Carlo method. After that, we propose a selection method of terrain matching area for TERCOM algorithm, and verify the method correctness with real terrain data by simulation experiment. Experimental results show that the matching area obtained by the method in this paper has the good navigation performance and the matching probability of TERCOM algorithm is great than 90%

  13. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2016-01-01

    that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power

  14. A new taxonomy of sublinear keyword pattern matching algorithms

    NARCIS (Netherlands)

    Cleophas, L.G.W.A.; Watson, B.W.; Zwaan, G.

    2004-01-01

    Abstract This paper presents a new taxonomy of sublinear (multiple) keyword pattern matching algorithms. Based on an earlier taxonomy by Watson and Zwaan [WZ96, WZ95], this new taxonomy includes not only suffix-based algorithms related to the Boyer-Moore, Commentz-Walter and Fan-Su algorithms, but

  15. Phase matching in quantum searching and the improved Grover algorithm

    International Nuclear Information System (INIS)

    Long Guilu; Li Yansong; Xiao Li; Tu Changcun; Sun Yang

    2004-01-01

    The authors briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. the Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero-failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned. (author)

  16. Fingerprint matching algorithm for poor quality images

    Directory of Open Access Journals (Sweden)

    Vedpal Singh

    2015-04-01

    Full Text Available The main aim of this study is to establish an efficient platform for fingerprint matching for low-quality images. Generally, fingerprint matching approaches use the minutiae points for authentication. However, it is not such a reliable authentication method for low-quality images. To overcome this problem, the current study proposes a fingerprint matching methodology based on normalised cross-correlation, which would improve the performance and reduce the miscalculations during authentication. It would decrease the computational complexities. The error rate of the proposed method is 5.4%, which is less than the two-dimensional (2D dynamic programming (DP error rate of 5.6%, while Lee's method produces 5.9% and the combined method has 6.1% error rate. Genuine accept rate at 1% false accept rate is 89.3% but at 0.1% value it is 96.7%, which is higher. The outcome of this study suggests that the proposed methodology has a low error rate with minimum computational effort as compared with existing methods such as Lee's method and 2D DP and the combined method.

  17. Geomagnetic matching navigation algorithm based on robust estimation

    Science.gov (United States)

    Xie, Weinan; Huang, Liping; Qu, Zhenshen; Wang, Zhenhuan

    2017-08-01

    The outliers in the geomagnetic survey data seriously affect the precision of the geomagnetic matching navigation and badly disrupt its reliability. A novel algorithm which can eliminate the outliers influence is investigated in this paper. First, the weight function is designed and its principle of the robust estimation is introduced. By combining the relation equation between the matching trajectory and the reference trajectory with the Taylor series expansion for geomagnetic information, a mathematical expression of the longitude, latitude and heading errors is acquired. The robust target function is obtained by the weight function and the mathematical expression. Then the geomagnetic matching problem is converted to the solutions of nonlinear equations. Finally, Newton iteration is applied to implement the novel algorithm. Simulation results show that the matching error of the novel algorithm is decreased to 7.75% compared to the conventional mean square difference (MSD) algorithm, and is decreased to 18.39% to the conventional iterative contour matching algorithm when the outlier is 40nT. Meanwhile, the position error of the novel algorithm is 0.017° while the other two algorithms fail to match when the outlier is 400nT.

  18. A Multi-Scale Settlement Matching Algorithm Based on ARG

    Science.gov (United States)

    Yue, Han; Zhu, Xinyan; Chen, Di; Liu, Lingjia

    2016-06-01

    Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG) is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

  19. A Multi-Scale Settlement Matching Algorithm Based on ARG

    Directory of Open Access Journals (Sweden)

    H. Yue

    2016-06-01

    Full Text Available Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

  20. Reliable Line Matching Algorithm for Stereo Images with Topological Relationship

    Directory of Open Access Journals (Sweden)

    WANG Jingxue

    2017-11-01

    Full Text Available Because of the lack of relationships between matching line and adjacent lines in the process of individual line matching, and the weak reliability of the individual line descriptor facing on discontinue texture, this paper presents a reliable line matching algorithm for stereo images with topological relationship. The algorithm firstly generates grouped line pairs from lines extracted from the reference image and searching image according to the basic topological relationships such as distance and angle between the lines. Then it takes the grouped line pairs as matching primitives, and matches these grouped line pairs by using epipolar constraint, homography constraint, quadrant constraint and gray correlation constraint of irregular triangle in order. And finally, it resolves the corresponding line pairs into two pairs of corresponding individual lines, and obtains one to one matching results after the post-processing of integrating, fitting, and checking. This paper adopts digital aerial images and close-range images with typical texture features to deal with the parameter analysis and line matching, and the experiment results demonstrate that the proposed algorithm in this paper can obtain reliable line matching results.

  1. Preprocessing Algorithm for Deciphering Historical Inscriptions Using String Metric

    Directory of Open Access Journals (Sweden)

    Lorand Lehel Toth

    2016-07-01

    Full Text Available The article presents the improvements in the preprocessing part of the deciphering method (shortly preprocessing algorithm for historical inscriptions of unknown origin. Glyphs used in historical inscriptions changed through time; therefore, various versions of the same script may contain different glyphs for each grapheme. The purpose of the preprocessing algorithm is reducing the running time of the deciphering process by filtering out the less probable interpretations of the examined inscription. However, the first version of the preprocessing algorithm leads incorrect outcome or no result in the output in certain cases. Therefore, its improved version was developed to find the most similar words in the dictionary by relaying the search conditions more accurately, but still computationally effectively. Moreover, a sophisticated similarity metric used to determine the possible meaning of the unknown inscription is introduced. The results of the evaluations are also detailed.

  2. The LabelHash algorithm for substructure matching

    Directory of Open Access Journals (Sweden)

    Bryant Drew H

    2010-11-01

    Full Text Available Abstract Background There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseases and designing new therapeutics. However, experimental protein function determination is expensive and very time-consuming. Computational methods can facilitate function determination by identifying proteins that have high structural and chemical similarity. Results We present LabelHash, a novel algorithm for matching substructural motifs to large collections of protein structures. The algorithm consists of two phases. In the first phase the proteins are preprocessed in a fashion that allows for instant lookup of partial matches to any motif. In the second phase, partial matches for a given motif are expanded to complete matches. The general applicability of the algorithm is demonstrated with three different case studies. First, we show that we can accurately identify members of the enolase superfamily with a single motif. Next, we demonstrate how LabelHash can complement SOIPPA, an algorithm for motif identification and pairwise substructure alignment. Finally, a large collection of Catalytic Site Atlas motifs is used to benchmark the performance of the algorithm. LabelHash runs very efficiently in parallel; matching a motif against all proteins in the 95% sequence identity filtered non-redundant Protein Data Bank typically takes no more than a few minutes. The LabelHash algorithm is available through a web server and as a suite of standalone programs at http://labelhash.kavrakilab.org. The output of the LabelHash algorithm can be further analyzed with Chimera through a plugin that we developed for this purpose. Conclusions LabelHash is an efficient, versatile algorithm for large-scale substructure matching. When LabelHash is running in parallel, motifs can typically be matched against the entire PDB on the order of minutes. The algorithm is able to identify

  3. An algorithm for reduction of extracted power from photovoltaic strings in grid-tied photovoltaic power plants during voltage sags

    DEFF Research Database (Denmark)

    Tafti, Hossein Dehghani; Maswood, Ali Iftekhar; Pou, Josep

    2016-01-01

    strings should be reduced during voltage sags. In this paper, an algorithm is proposed for determining the reference voltage of the PV string which results in a reduction of the output power to a certain amount. The proposed algorithm calculates the reference voltage for the dc/dc converter controller......, based on the characteristics of the power-voltage curve of the PV string and therefore, no modification is required in the the controller of the dc/dc converter. Simulation results on a 50-kW PV string verified the effectiveness of the proposed algorithm in reducing the power from PV strings under......Due to the high penetration of the installed distributed generation units in the power system, the injection of reactive power is required for the medium-scale and large-scale grid-connected photovoltaic power plants (PVPPs). Because of the current limitation of the grid-connected inverter...

  4. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    Hamza, Doha R.

    2016-08-15

    We consider a cognitive radio network where secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. PUs and SUs negotiate over allocations of the secondary power that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power allocations. We stipulate a limited information exchange in the network so that agents only calculate their own utilities but no information is available about the utilities of any other users in the network. We establish convergence to epsilon pairwise stable matchings in finite time. Finally we show that our algorithm exhibits a limited degradation in PU utility when compared with the Pareto optimal results attained using perfect information assumptions. © 2016 IEEE.

  5. Automated Photogrammetric Image Matching with Sift Algorithm and Delaunay Triangulation

    DEFF Research Database (Denmark)

    Karagiannis, Georgios; Antón Castro, Francesc/François; Mioc, Darka

    2016-01-01

    An algorithm for image matching of multi-sensor and multi-temporal satellite images is developed. The method is based on the SIFT feature detector proposed by Lowe in (Lowe, 1999). First, SIFT feature points are detected independently in two images (reference and sensed image). The features detec...... of each feature set for each image are computed. The isomorphism of the Delaunay triangulations is determined to guarantee the quality of the image matching. The algorithm is implemented in Matlab and tested on World-View 2, SPOT6 and TerraSAR-X image patches....

  6. An improved ASIFT algorithm for indoor panorama image matching

    Science.gov (United States)

    Fu, Han; Xie, Donghai; Zhong, Ruofei; Wu, Yu; Wu, Qiong

    2017-07-01

    The generation of 3D models for indoor objects and scenes is an attractive tool for digital city, virtual reality and SLAM purposes. Panoramic images are becoming increasingly more common in such applications due to their advantages to capture the complete environment in one single image with large field of view. The extraction and matching of image feature points are important and difficult steps in three-dimensional reconstruction, and ASIFT is a state-of-the-art algorithm to implement these functions. Compared with the SIFT algorithm, more feature points can be generated and the matching accuracy of ASIFT algorithm is higher, even for the panoramic images with obvious distortions. However, the algorithm is really time-consuming because of complex operations and performs not very well for some indoor scenes under poor light or without rich textures. To solve this problem, this paper proposes an improved ASIFT algorithm for indoor panoramic images: firstly, the panoramic images are projected into multiple normal perspective images. Secondly, the original ASIFT algorithm is simplified from the affine transformation of tilt and rotation with the images to the only tilt affine transformation. Finally, the results are re-projected to the panoramic image space. Experiments in different environments show that this method can not only ensure the precision of feature points extraction and matching, but also greatly reduce the computing time.

  7. Global stereo matching algorithm based on disparity range estimation

    Science.gov (United States)

    Li, Jing; Zhao, Hong; Gu, Feifei

    2017-09-01

    The global stereo matching algorithms are of high accuracy for the estimation of disparity map, but the time-consuming in the optimization process still faces a curse, especially for the image pairs with high resolution and large baseline setting. To improve the computational efficiency of the global algorithms, a disparity range estimation scheme for the global stereo matching is proposed to estimate the disparity map of rectified stereo images in this paper. The projective geometry in a parallel binocular stereo vision is investigated to reveal a relationship between two disparities at each pixel in the rectified stereo images with different baselines, which can be used to quickly obtain a predicted disparity map in a long baseline setting estimated by that in the small one. Then, the drastically reduced disparity ranges at each pixel under a long baseline setting can be determined by the predicted disparity map. Furthermore, the disparity range estimation scheme is introduced into the graph cuts with expansion moves to estimate the precise disparity map, which can greatly save the cost of computing without loss of accuracy in the stereo matching, especially for the dense global stereo matching, compared to the traditional algorithm. Experimental results with the Middlebury stereo datasets are presented to demonstrate the validity and efficiency of the proposed algorithm.

  8. Generic Energy Matching Model and Figure of Matching Algorithm for Combined Renewable Energy Systems

    Directory of Open Access Journals (Sweden)

    J.C. Brezet

    2009-08-01

    Full Text Available In this paper the Energy Matching Model and Figure of Matching Algorithm which originally was dedicated only to photovoltaic (PV systems [1] are extended towards a Model and Algorithm suitable for combined systems which are a result of integration of two or more renewable energy sources into one. The systems under investigation will range from mobile portable devices up to the large renewable energy system conceivably to be applied at the Afsluitdijk (Closure- dike in the north of the Netherlands. This Afsluitdijk is the major dam in the Netherlands, damming off the Zuiderzee, a salt water inlet of the North Sea and turning it into the fresh water lake of the IJsselmeer. The energy chain of power supplies based on a combination of renewable energy sources can be modeled by using one generic Energy Matching Model as starting point.

  9. A dual-adaptive support-based stereo matching algorithm

    Science.gov (United States)

    Zhang, Yin; Zhang, Yun

    2017-07-01

    Many stereo matching algorithms use fixed color thresholds and a rigid cross skeleton to segment supports (viz., Cross method), which, however, does not work well for different images. To address this issue, this paper proposes a novel dual adaptive support (viz., DAS)-based stereo matching method, which uses both appearance and shape information of a local region to segment supports automatically, and, then, integrates the DAS-based cost aggregation with the absolute difference plus census transform cost, scanline optimization and disparity refinement to develop a stereo matching system. The performance of the DAS method is also evaluated in the Middlebury benchmark and by comparing with the Cross method. The results show that the average error for the DAS method 25.06% lower than that for the Cross method, indicating that the proposed method is more accurate, with fewer parameters and suitable for parallel computing.

  10. An ensemble based nonlinear orthogonal matching pursuit algorithm for sparse history matching of reservoir models

    KAUST Repository

    Fsheikh, Ahmed H.

    2013-01-01

    A nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of reservoir models is presented. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated components of the basis functions with the residual. The discovered basis (aka support) is augmented across the nonlinear iterations. Once the basis functions are selected from the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives to efficiently approximate gradients. In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm.

  11. Fast searching in packed strings

    DEFF Research Database (Denmark)

    Bille, Philip

    2011-01-01

    Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P. The classical Knuth–Morris–Pratt algorithm [SIAM J. Comput. 6 (2) (1977) 323–350] solves the string matching problem in linear time which is optimal if we can only read one character...... at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation....... Let m⩽n be the lengths P and Q, respectively, and let σ denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using timeO(nlogσn+m+occ). Here occ is the number of occurrences of P in Q. For m=o(n) this improves the O(n) bound of the Knuth...

  12. Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm

    Directory of Open Access Journals (Sweden)

    Vladimir Kolmogorov

    2014-10-01

    Full Text Available Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar geometry, this is equivalent to a matching problem. This article describes a method proposed by Kolmogorov and Zabih in 2001, which puts forward an energy-based formulation. The aim is to minimize a four-term-energy. This energy is not convex and cannot be minimized except among a class of perturbations called expansion moves, in which case an exact minimization can be done with graph cuts techniques. One noteworthy feature of this method is that it handles occlusion: The algorithm detects points that cannot be matched with any point in the other image. In this method displacements are pixel accurate (no subpixel refinement.

  13. Unrelated Hematopoietic Stem Cell Donor Matching Probability and Search Algorithm

    Directory of Open Access Journals (Sweden)

    J.-M. Tiercy

    2012-01-01

    Full Text Available In transplantation of hematopoietic stem cells (HSCs from unrelated donors a high HLA compatibility level decreases the risk of acute graft-versus-host disease and mortality. The diversity of the HLA system at the allelic and haplotypic level and the heterogeneity of HLA typing data of the registered donors render the search process a complex task. This paper summarizes our experience with a search algorithm that includes at the start of the search a probability estimate (high/intermediate/low to identify a HLA-A, B, C, DRB1, DQB1-compatible donor (a 10/10 match. Based on 2002–2011 searches about 30% of patients have a high, 30% an intermediate, and 40% a low probability search. Search success rate and duration are presented and discussed in light of the experience of other centers. Overall a 9-10/10 matched HSC donor can now be identified for 60–80% of patients of European descent. For high probability searches donors can be selected on the basis of DPB1-matching with an estimated success rate of >40%. For low probability searches there is no consensus on which HLA incompatibilities are more permissive, although HLA-DQB1 mismatches are generally considered as acceptable. Models for the discrimination of more detrimental mismatches based on specific amino acid residues rather than specific HLA alleles are presented.

  14. Fast and compact regular expression matching

    DEFF Research Database (Denmark)

    Bille, Philip; Farach-Colton, Martin

    2008-01-01

    We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...... to improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way....

  15. An accurate algorithm to match imperfectly matched images for lung tumor detection without markers.

    Science.gov (United States)

    Rozario, Timothy; Bereg, Sergey; Yan, Yulong; Chiu, Tsuicheng; Liu, Honghuan; Kearney, Vasant; Jiang, Lan; Mao, Weihua

    2015-05-08

    In order to locate lung tumors on kV projection images without internal markers, digitally reconstructed radiographs (DRRs) are created and compared with projection images. However, lung tumors always move due to respiration and their locations change on projection images while they are static on DRRs. In addition, global image intensity discrepancies exist between DRRs and projections due to their different image orientations, scattering, and noises. This adversely affects comparison accuracy. A simple but efficient comparison algorithm is reported to match imperfectly matched projection images and DRRs. The kV projection images were matched with different DRRs in two steps. Preprocessing was performed in advance to generate two sets of DRRs. The tumors were removed from the planning 3D CT for a single phase of planning 4D CT images using planning contours of tumors. DRRs of background and DRRs of tumors were generated separately for every projection angle. The first step was to match projection images with DRRs of background signals. This method divided global images into a matrix of small tiles and similarities were evaluated by calculating normalized cross-correlation (NCC) between corresponding tiles on projections and DRRs. The tile configuration (tile locations) was automatically optimized to keep the tumor within a single projection tile that had a bad matching with the corresponding DRR tile. A pixel-based linear transformation was determined by linear interpolations of tile transformation results obtained during tile matching. The background DRRs were transformed to the projection image level and subtracted from it. The resulting subtracted image now contained only the tumor. The second step was to register DRRs of tumors to the subtracted image to locate the tumor. This method was successfully applied to kV fluoro images (about 1000 images) acquired on a Vero (BrainLAB) for dynamic tumor tracking on phantom studies. Radiation opaque markers were

  16. Improved SURF Algorithm and Its Application in Seabed Relief Image Matching

    Directory of Open Access Journals (Sweden)

    Zhang Hong-Mei

    2017-01-01

    Full Text Available The matching based on seabed relief image is widely used in underwater relief matching navigation and target recognition, etc. However, being influenced by various factors, some conventional matching algorithms are difficult to obtain an ideal result in the matching of seabed relief image. SURF(Speeded Up Robust Features algorithm is based on feature points pair to achieve matching, and can get good results in the seabed relief image matching. However, in practical applications, the traditional SURF algorithm is easy to get false matching, especially when the area’s features are similar or not obvious, the problem is more seriously. In order to improve the robustness of the algorithm, this paper proposes an improved matching algorithm, which combines the SURF, and RANSAC (Random Sample Consensus algorithms. The new algorithm integrates the two algorithms advantages, firstly, the SURF algorithm is applied to detect and extract the feature points then to pre-match. Secondly, RANSAC algorithm is utilized to eliminate mismatching points, and then the accurate matching is accomplished with the correct matching points. The experimental results show that the improved algorithm overcomes the mismatching problem effectively and have better precision and faster speed than the traditional SURF algorithm.

  17. Optimizing Fukushima Emissions Through Pattern Matching and Genetic Algorithms

    Science.gov (United States)

    Lucas, D. D.; Simpson, M. D.; Philip, C. S.; Baskett, R.

    2017-12-01

    Hazardous conditions during the Fukushima Daiichi nuclear power plant (NPP) accident hindered direct observations of the emissions of radioactive materials into the atmosphere. A wide range of emissions are estimated from bottom-up studies using reactor inventories and top-down approaches based on inverse modeling. We present a new inverse modeling estimate of cesium-137 emitted from the Fukushima NPP. Our estimate considers weather uncertainty through a large ensemble of Weather Research and Forecasting model simulations and uses the FLEXPART atmospheric dispersion model to transport and deposit cesium. The simulations are constrained by observations of the spatial distribution of cumulative cesium deposited on the surface of Japan through April 2, 2012. Multiple spatial metrics are used to quantify differences between observed and simulated deposition patterns. In order to match the observed pattern, we use a multi-objective genetic algorithm to optimize the time-varying emissions. We find that large differences with published bottom-up estimates are required to explain the observations. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.

  18. An adaptive clustering algorithm for image matching based on corner feature

    Science.gov (United States)

    Wang, Zhe; Dong, Min; Mu, Xiaomin; Wang, Song

    2018-04-01

    The traditional image matching algorithm always can not balance the real-time and accuracy better, to solve the problem, an adaptive clustering algorithm for image matching based on corner feature is proposed in this paper. The method is based on the similarity of the matching pairs of vector pairs, and the adaptive clustering is performed on the matching point pairs. Harris corner detection is carried out first, the feature points of the reference image and the perceived image are extracted, and the feature points of the two images are first matched by Normalized Cross Correlation (NCC) function. Then, using the improved algorithm proposed in this paper, the matching results are clustered to reduce the ineffective operation and improve the matching speed and robustness. Finally, the Random Sample Consensus (RANSAC) algorithm is used to match the matching points after clustering. The experimental results show that the proposed algorithm can effectively eliminate the most wrong matching points while the correct matching points are retained, and improve the accuracy of RANSAC matching, reduce the computation load of whole matching process at the same time.

  19. On algorithmic equivalence of instruction sequences for computing bit string functions

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2015-01-01

    Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We

  20. On algorithmic equivalence of instruction sequences for computing bit string functions

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2014-01-01

    Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We

  1. Computational Comparison of Several Greedy Algorithms for the Minimum Cost Perfect Matching Problem on Large Graphs

    DEFF Research Database (Denmark)

    Wøhlk, Sanne; Laporte, Gilbert

    2017-01-01

    The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected complete graph. Our work is motivated by the need to solve large instances of the Capacitated Arc Routing Problem (CARP) arising in the optimization of garbage...... collection in Denmark. Common heuristics for the CARP involve the optimal matching of the odd-degree nodes of a graph. The algorithms used in the comparison include the CPLEX solution of an exact formulation, the LEDA matching algorithm, a recent implementation of the Blossom algorithm, as well as six...

  2. Dense Matching Comparison Between Census and a Convolutional Neural Network Algorithm for Plant Reconstruction

    Science.gov (United States)

    Xia, Y.; Tian, J.; d'Angelo, P.; Reinartz, P.

    2018-05-01

    3D reconstruction of plants is hard to implement, as the complex leaf distribution highly increases the difficulty level in dense matching. Semi-Global Matching has been successfully applied to recover the depth information of a scene, but may perform variably when different matching cost algorithms are used. In this paper two matching cost computation algorithms, Census transform and an algorithm using a convolutional neural network, are tested for plant reconstruction based on Semi-Global Matching. High resolution close-range photogrammetric images from a handheld camera are used for the experiment. The disparity maps generated based on the two selected matching cost methods are comparable with acceptable quality, which shows the good performance of Census and the potential of neural networks to improve the dense matching.

  3. DENSE MATCHING COMPARISON BETWEEN CENSUS AND A CONVOLUTIONAL NEURAL NETWORK ALGORITHM FOR PLANT RECONSTRUCTION

    Directory of Open Access Journals (Sweden)

    Y. Xia

    2018-05-01

    Full Text Available 3D reconstruction of plants is hard to implement, as the complex leaf distribution highly increases the difficulty level in dense matching. Semi-Global Matching has been successfully applied to recover the depth information of a scene, but may perform variably when different matching cost algorithms are used. In this paper two matching cost computation algorithms, Census transform and an algorithm using a convolutional neural network, are tested for plant reconstruction based on Semi-Global Matching. High resolution close-range photogrammetric images from a handheld camera are used for the experiment. The disparity maps generated based on the two selected matching cost methods are comparable with acceptable quality, which shows the good performance of Census and the potential of neural networks to improve the dense matching.

  4. Catheter Calibration Using Template Matching Line Interpolation Algorithm

    National Research Council Canada - National Science Library

    Nagy, L

    2001-01-01

    ..., such as: image resolution, type of the calibration, algorithm used for contour detection, size of the FOV, other parameters of the image The studied calibration method is the one using catheter size...

  5. A technique to obtain a multiparameter radar rainfall algorithm using the probability matching procedure

    International Nuclear Information System (INIS)

    Gorgucci, E.; Scarchilli, G.

    1997-01-01

    The natural cumulative distributions of rainfall observed by a network of rain gauges and a multiparameter radar are matched to derive multiparameter radar algorithms for rainfall estimation. The use of multiparameter radar measurements in a statistical framework to estimate rainfall is resented in this paper, The techniques developed in this paper are applied to the radar and rain gauge measurement of rainfall observed in central Florida and central Italy. Conventional pointwise estimates of rainfall are also compared. The probability matching procedure, when applied to the radar and surface measurements, shows that multiparameter radar algorithms can match the probability distribution function better than the reflectivity-based algorithms. It is also shown that the multiparameter radar algorithm derived matching the cumulative distribution function of rainfall provides more accurate estimates of rainfall on the ground in comparison to any conventional reflectivity-based algorithm

  6. The choice of a 'Best' assisted history matching algorithm

    NARCIS (Netherlands)

    Hanea, R.G.; Przybysz-Jarnut, J.K.; Krymskaya, M.V.; Heemink, A.W.; Jansen, J.D.

    2010-01-01

    Computer-assisted history matching is the act of systematicalty adjusting a ‘prior’ reservoir model using measured data until its simulated production response closely reproduces the past behavior of the reservoir. Thereafler, the updated, ‘posterior’, model is expected to predict future reservoir

  7. Algorithm-Architecture Matching for Signal and Image Processing

    CERN Document Server

    Gogniat, Guy; Morawiec, Adam; Erdogan, Ahmet

    2011-01-01

    Advances in signal and image processing together with increasing computing power are bringing mobile technology closer to applications in a variety of domains like automotive, health, telecommunication, multimedia, entertainment and many others. The development of these leading applications, involving a large diversity of algorithms (e.g. signal, image, video, 3D, communication, cryptography) is classically divided into three consecutive steps: a theoretical study of the algorithms, a study of the target architecture, and finally the implementation. Such a linear design flow is reaching its li

  8. An ensemble based nonlinear orthogonal matching pursuit algorithm for sparse history matching of reservoir models

    KAUST Repository

    Fsheikh, Ahmed H.; Wheeler, Mary Fanett; Hoteit, Ibrahim

    2013-01-01

    the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives

  9. Treat a new and efficient match algorithm for AI production system

    CERN Document Server

    Miranker, Daniel P

    1988-01-01

    TREAT: A New and Efficient Match Algorithm for AI Production Systems describes the architecture and software systems embodying the DADO machine, a parallel tree-structured computer designed to provide significant performance improvements over serial computers of comparable hardware complexity in the execution of large expert systems implemented in production system form.This book focuses on TREAT as a match algorithm for executing production systems that is presented and comparatively analyzed with the RETE match algorithm. TREAT, originally designed specifically for the DADO machine architect

  10. A Spherical Model Based Keypoint Descriptor and Matching Algorithm for Omnidirectional Images

    Directory of Open Access Journals (Sweden)

    Guofeng Tong

    2014-04-01

    Full Text Available Omnidirectional images generally have nonlinear distortion in radial direction. Unfortunately, traditional algorithms such as scale-invariant feature transform (SIFT and Descriptor-Nets (D-Nets do not work well in matching omnidirectional images just because they are incapable of dealing with the distortion. In order to solve this problem, a new voting algorithm is proposed based on the spherical model and the D-Nets algorithm. Because the spherical-based keypoint descriptor contains the distortion information of omnidirectional images, the proposed matching algorithm is invariant to distortion. Keypoint matching experiments are performed on three pairs of omnidirectional images, and comparison is made among the proposed algorithm, the SIFT and the D-Nets. The result shows that the proposed algorithm is more robust and more precise than the SIFT, and the D-Nets in matching omnidirectional images. Comparing with the SIFT and the D-Nets, the proposed algorithm has two main advantages: (a there are more real matching keypoints; (b the coverage range of the matching keypoints is wider, including the seriously distorted areas.

  11. A Novel Artificial Bee Colony Algorithm Based on Internal-Feedback Strategy for Image Template Matching

    Directory of Open Access Journals (Sweden)

    Bai Li

    2014-01-01

    Full Text Available Image template matching refers to the technique of locating a given reference image over a source image such that they are the most similar. It is a fundamental mission in the field of visual target recognition. In general, there are two critical aspects of a template matching scheme. One is similarity measurement and the other is best-match location search. In this work, we choose the well-known normalized cross correlation model as a similarity criterion. The searching procedure for the best-match location is carried out through an internal-feedback artificial bee colony (IF-ABC algorithm. IF-ABC algorithm is highlighted by its effort to fight against premature convergence. This purpose is achieved through discarding the conventional roulette selection procedure in the ABC algorithm so as to provide each employed bee an equal chance to be followed by the onlooker bees in the local search phase. Besides that, we also suggest efficiently utilizing the internal convergence states as feedback guidance for searching intensity in the subsequent cycles of iteration. We have investigated four ideal template matching cases as well as four actual cases using different searching algorithms. Our simulation results show that the IF-ABC algorithm is more effective and robust for this template matching mission than the conventional ABC and two state-of-the-art modified ABC algorithms do.

  12. AN FDTD ALGORITHM WITH PERFECTLY MATCHED LAYERS FOR CONDUCTIVE MEDIA. (R825225)

    Science.gov (United States)

    We extend Berenger's perfectly matched layers (PML) to conductive media. A finite-difference-time-domain (FDTD) algorithm with PML as an absorbing boundary condition is developed for solutions of Maxwell's equations in inhomogeneous, conductive media. For a perfectly matched laye...

  13. A Boyer-Moore (or Watson-Watson) type algorithm for regular tree pattern matching

    NARCIS (Netherlands)

    Watson, B.W.; Aarts, E.H.L.; Eikelder, ten H.M.M.; Hemerik, C.; Rem, M.

    1995-01-01

    In this chapter, I outline a new algorithm for regular tree pattern matching. The existence of this algorithm was first mentioned in the statements accompanying my dissertation, [2]. In order to avoid repeating the material in my dissertation, it is assumed that the reader is familiar with Chapters

  14. Two related algorithms for root-to-frontier tree pattern matching

    NARCIS (Netherlands)

    Cleophas, L.G.W.A.; Hemerik, C.; Zwaan, G.

    2006-01-01

    Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applications such as compilers and term rewriting systems. Many TPM algorithms appearing in the literature are based on tree automata. For efficiency, these automata should be deterministic, yet deterministic

  15. Enhanced Map-Matching Algorithm with a Hidden Markov Model for Mobile Phone Positioning

    Directory of Open Access Journals (Sweden)

    An Luo

    2017-10-01

    Full Text Available Numerous map-matching techniques have been developed to improve positioning, using Global Positioning System (GPS data and other sensors. However, most existing map-matching algorithms process GPS data with high sampling rates, to achieve a higher correct rate and strong universality. This paper introduces a novel map-matching algorithm based on a hidden Markov model (HMM for GPS positioning and mobile phone positioning with a low sampling rate. The HMM is a statistical model well known for providing solutions to temporal recognition applications such as text and speech recognition. In this work, the hidden Markov chain model was built to establish a map-matching process, using the geometric data, the topologies matrix of road links in road network and refined quad-tree data structure. HMM-based map-matching exploits the Viterbi algorithm to find the optimized road link sequence. The sequence consists of hidden states in the HMM model. The HMM-based map-matching algorithm is validated on a vehicle trajectory using GPS and mobile phone data. The results show a significant improvement in mobile phone positioning and high and low sampling of GPS data.

  16. Sensor-based vibration signal feature extraction using an improved composite dictionary matching pursuit algorithm.

    Science.gov (United States)

    Cui, Lingli; Wu, Na; Wang, Wenjing; Kang, Chenhui

    2014-09-09

    This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-atom matching, the original composite dictionary multi-atom matching pursuit (CD-MaMP) algorithm can achieve noise reduction in the reconstruction stage, but it cannot dramatically reduce the computational cost and improve the efficiency in the decomposition stage. Therefore, the optimized composite dictionary single-atom matching algorithm (CD-SaMP) is proposed. Second, the termination condition of iteration based on the attenuation coefficient is put forward to improve the sparsity and efficiency of the algorithm, which adjusts the parameters of the termination condition constantly in the process of decomposition to avoid noise. Third, composite dictionaries are enriched with the modulation dictionary, which is one of the important structural characteristics of gear fault signals. Meanwhile, the termination condition of iteration settings, sub-feature dictionary selections and operation efficiency between CD-MaMP and CD-SaMP are discussed, aiming at gear simulation vibration signals with noise. The simulation sensor-based vibration signal results show that the termination condition of iteration based on the attenuation coefficient enhances decomposition sparsity greatly and achieves a good effect of noise reduction. Furthermore, the modulation dictionary achieves a better matching effect compared to the Fourier dictionary, and CD-SaMP has a great advantage of sparsity and efficiency compared with the CD-MaMP. The sensor-based vibration signals measured from practical engineering gearbox analyses have further shown that the CD-SaMP decomposition and reconstruction algorithm

  17. Sensor-Based Vibration Signal Feature Extraction Using an Improved Composite Dictionary Matching Pursuit Algorithm

    Directory of Open Access Journals (Sweden)

    Lingli Cui

    2014-09-01

    Full Text Available This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-atom matching, the original composite dictionary multi-atom matching pursuit (CD-MaMP algorithm can achieve noise reduction in the reconstruction stage, but it cannot dramatically reduce the computational cost and improve the efficiency in the decomposition stage. Therefore, the optimized composite dictionary single-atom matching algorithm (CD-SaMP is proposed. Second, the termination condition of iteration based on the attenuation coefficient is put forward to improve the sparsity and efficiency of the algorithm, which adjusts the parameters of the termination condition constantly in the process of decomposition to avoid noise. Third, composite dictionaries are enriched with the modulation dictionary, which is one of the important structural characteristics of gear fault signals. Meanwhile, the termination condition of iteration settings, sub-feature dictionary selections and operation efficiency between CD-MaMP and CD-SaMP are discussed, aiming at gear simulation vibration signals with noise. The simulation sensor-based vibration signal results show that the termination condition of iteration based on the attenuation coefficient enhances decomposition sparsity greatly and achieves a good effect of noise reduction. Furthermore, the modulation dictionary achieves a better matching effect compared to the Fourier dictionary, and CD-SaMP has a great advantage of sparsity and efficiency compared with the CD-MaMP. The sensor-based vibration signals measured from practical engineering gearbox analyses have further shown that the CD-SaMP decomposition and

  18. BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks

    KAUST Repository

    Hamza, Doha R.

    2017-01-26

    We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an

  19. BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2017-01-01

    We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an

  20. A roadmap of clustering algorithms: finding a match for a biomedical application.

    Science.gov (United States)

    Andreopoulos, Bill; An, Aijun; Wang, Xiaogang; Schroeder, Michael

    2009-05-01

    Clustering is ubiquitously applied in bioinformatics with hierarchical clustering and k-means partitioning being the most popular methods. Numerous improvements of these two clustering methods have been introduced, as well as completely different approaches such as grid-based, density-based and model-based clustering. For improved bioinformatics analysis of data, it is important to match clusterings to the requirements of a biomedical application. In this article, we present a set of desirable clustering features that are used as evaluation criteria for clustering algorithms. We review 40 different clustering algorithms of all approaches and datatypes. We compare algorithms on the basis of desirable clustering features, and outline algorithms' benefits and drawbacks as a basis for matching them to biomedical applications.

  1. A Line-Based Adaptive-Weight Matching Algorithm Using Loopy Belief Propagation

    Directory of Open Access Journals (Sweden)

    Hui Li

    2015-01-01

    Full Text Available In traditional adaptive-weight stereo matching, the rectangular shaped support region requires excess memory consumption and time. We propose a novel line-based stereo matching algorithm for obtaining a more accurate disparity map with low computation complexity. This algorithm can be divided into two steps: disparity map initialization and disparity map refinement. In the initialization step, a new adaptive-weight model based on the linear support region is put forward for cost aggregation. In this model, the neural network is used to evaluate the spatial proximity, and the mean-shift segmentation method is used to improve the accuracy of color similarity; the Birchfield pixel dissimilarity function and the census transform are adopted to establish the dissimilarity measurement function. Then the initial disparity map is obtained by loopy belief propagation. In the refinement step, the disparity map is optimized by iterative left-right consistency checking method and segmentation voting method. The parameter values involved in this algorithm are determined with many simulation experiments to further improve the matching effect. Simulation results indicate that this new matching method performs well on standard stereo benchmarks and running time of our algorithm is remarkably lower than that of algorithm with rectangle-shaped support region.

  2. Parallel algorithm for determining motion vectors in ice floe images by matching edge features

    Science.gov (United States)

    Manohar, M.; Ramapriyan, H. K.; Strong, J. P.

    1988-01-01

    A parallel algorithm is described to determine motion vectors of ice floes using time sequences of images of the Arctic ocean obtained from the Synthetic Aperture Radar (SAR) instrument flown on-board the SEASAT spacecraft. Researchers describe a parallel algorithm which is implemented on the MPP for locating corresponding objects based on their translationally and rotationally invariant features. The algorithm first approximates the edges in the images by polygons or sets of connected straight-line segments. Each such edge structure is then reduced to a seed point. Associated with each seed point are the descriptions (lengths, orientations and sequence numbers) of the lines constituting the corresponding edge structure. A parallel matching algorithm is used to match packed arrays of such descriptions to identify corresponding seed points in the two images. The matching algorithm is designed such that fragmentation and merging of ice floes are taken into account by accepting partial matches. The technique has been demonstrated to work on synthetic test patterns and real image pairs from SEASAT in times ranging from .5 to 0.7 seconds for 128 x 128 images.

  3. RANCANG BANGUN APLIKASI ANTIVIRUS KOMPUTER DENGAN MENGGUNAKAN METODE SECURE HASH ALGORITHM 1 (SHA1 DAN HEURISTIC STRING

    Directory of Open Access Journals (Sweden)

    I Gusti Made Panji Indrawinatha

    2016-12-01

    Full Text Available Virus komputer merupakan perangkat lunak berbahaya yang dapat merusak data dan menggandakan diri pada sistem komputer. Untuk mendeteksi dan membersihkan virus dari sistem komputer, maka dibuatlah aplikasi antivirus. Dalam mendeteksi berbagai jenis virus sebuah aplikasi antivirus biasanya menggunakan beberapa metode. Pada penelitian ini akan membahas perancangan sebuah aplikasi antivirus menggunakan metode Secure Hash Algorithm 1 (SHA1 dan heuristic string sebagai metode pendeteksian virus. Dari pengujian yang dilakukan diperoleh hasil dimana saat tidak menggunakan heuristic, antivirus hanya mendeteksi 12 file dari 34 file sample virus atau memiliki tingkat akurasi pendeteksian sebesar 35%. sedangkan saat menggunakan heuristic, antivirus berhasil mendeteksi 31 file dari 34 file sample virus atau memiliki tingkat akurasi pendeteksian sebesar 91%.

  4. A model for Intelligent Random Access Memory architecture (IRAM) cellular automata algorithms on the Associative String Processing machine (ASTRA)

    CERN Document Server

    Rohrbach, F; Vesztergombi, G

    1997-01-01

    In the near future, the computer performance will be completely determined by how long it takes to access memory. There are bottle-necks in memory latency and memory-to processor interface bandwidth. The IRAM initiative could be the answer by putting Processor-In-Memory (PIM). Starting from the massively parallel processing concept, one reached a similar conclusion. The MPPC (Massively Parallel Processing Collaboration) project and the 8K processor ASTRA machine (Associative String Test bench for Research \\& Applications) developed at CERN \\cite{kuala} can be regarded as a forerunner of the IRAM concept. The computing power of the ASTRA machine, regarded as an IRAM with 64 one-bit processors on a 64$\\times$64 bit-matrix memory chip machine, has been demonstrated by running statistical physics algorithms: one-dimensional stochastic cellular automata, as a simple model for dynamical phase transitions. As a relevant result for physics, the damage spreading of this model has been investigated.

  5. A comparison of semiglobal and local dense matching algorithms for surface reconstruction

    Directory of Open Access Journals (Sweden)

    E. Dall'Asta

    2014-06-01

    Full Text Available Encouraged by the growing interest in automatic 3D image-based reconstruction, the development and improvement of robust stereo matching techniques is one of the most investigated research topic of the last years in photogrammetry and computer vision. The paper is focused on the comparison of some stereo matching algorithms (local and global which are very popular both in photogrammetry and computer vision. In particular, the Semi-Global Matching (SGM, which realizes a pixel-wise matching and relies on the application of consistency constraints during the matching cost aggregation, will be discussed. The results of some tests performed on real and simulated stereo image datasets, evaluating in particular the accuracy of the obtained digital surface models, will be presented. Several algorithms and different implementation are considered in the comparison, using freeware software codes like MICMAC and OpenCV, commercial software (e.g. Agisoft PhotoScan and proprietary codes implementing Least Square e Semi-Global Matching algorithms. The comparisons will also consider the completeness and the level of detail within fine structures, and the reliability and repeatability of the obtainable data.

  6. A comparison of semiglobal and local dense matching algorithms for surface reconstruction

    Science.gov (United States)

    Dall'Asta, E.; Roncella, R.

    2014-06-01

    Encouraged by the growing interest in automatic 3D image-based reconstruction, the development and improvement of robust stereo matching techniques is one of the most investigated research topic of the last years in photogrammetry and computer vision. The paper is focused on the comparison of some stereo matching algorithms (local and global) which are very popular both in photogrammetry and computer vision. In particular, the Semi-Global Matching (SGM), which realizes a pixel-wise matching and relies on the application of consistency constraints during the matching cost aggregation, will be discussed. The results of some tests performed on real and simulated stereo image datasets, evaluating in particular the accuracy of the obtained digital surface models, will be presented. Several algorithms and different implementation are considered in the comparison, using freeware software codes like MICMAC and OpenCV, commercial software (e.g. Agisoft PhotoScan) and proprietary codes implementing Least Square e Semi-Global Matching algorithms. The comparisons will also consider the completeness and the level of detail within fine structures, and the reliability and repeatability of the obtainable data.

  7. Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH

    International Nuclear Information System (INIS)

    Volk, Jochen; Herrmann, Torsten; Wuethrich, Kurt

    2008-01-01

    MATCH (Memetic Algorithm and Combinatorial Optimization Heuristics) is a new memetic algorithm for automated sequence-specific polypeptide backbone NMR assignment of proteins. MATCH employs local optimization for tracing partial sequence-specific assignments within a global, population-based search environment, where the simultaneous application of local and global optimization heuristics guarantees high efficiency and robustness. MATCH thus makes combined use of the two predominant concepts in use for automated NMR assignment of proteins. Dynamic transition and inherent mutation are new techniques that enable automatic adaptation to variable quality of the experimental input data. The concept of dynamic transition is incorporated in all major building blocks of the algorithm, where it enables switching between local and global optimization heuristics at any time during the assignment process. Inherent mutation restricts the intrinsically required randomness of the evolutionary algorithm to those regions of the conformation space that are compatible with the experimental input data. Using intact and artificially deteriorated APSY-NMR input data of proteins, MATCH performed sequence-specific resonance assignment with high efficiency and robustness

  8. Length-Bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection

    Directory of Open Access Journals (Sweden)

    Yi-Shan Lin

    2017-01-01

    Full Text Available Since frequent communication between applications takes place in high speed networks, deep packet inspection (DPI plays an important role in the network application awareness. The signature-based network intrusion detection system (NIDS contains a DPI technique that examines the incoming packet payloads by employing a pattern matching algorithm that dominates the overall inspection performance. Existing studies focused on implementing efficient pattern matching algorithms by parallel programming on software platforms because of the advantages of lower cost and higher scalability. Either the central processing unit (CPU or the graphic processing unit (GPU were involved. Our studies focused on designing a pattern matching algorithm based on the cooperation between both CPU and GPU. In this paper, we present an enhanced design for our previous work, a length-bounded hybrid CPU/GPU pattern matching algorithm (LHPMA. In the preliminary experiment, the performance and comparison with the previous work are displayed, and the experimental results show that the LHPMA can achieve not only effective CPU/GPU cooperation but also higher throughput than the previous method.

  9. Definition of an Ontology Matching Algorithm for Context Integration in Smart Cities.

    Science.gov (United States)

    Otero-Cerdeira, Lorena; Rodríguez-Martínez, Francisco J; Gómez-Rodríguez, Alma

    2014-12-08

    In this paper we describe a novel proposal in the field of smart cities: using an ontology matching algorithm to guarantee the automatic information exchange between the agents and the smart city. A smart city is composed by different types of agents that behave as producers and/or consumers of the information in the smart city. In our proposal, the data from the context is obtained by sensor and device agents while users interact with the smart city by means of user or system agents. The knowledge of each agent, as well as the smart city's knowledge, is semantically represented using different ontologies. To have an open city, that is fully accessible to any agent and therefore to provide enhanced services to the users, there is the need to ensure a seamless communication between agents and the city, regardless of their inner knowledge representations, i.e., ontologies. To meet this goal we use ontology matching techniques, specifically we have defined a new ontology matching algorithm called OntoPhil to be deployed within a smart city, which has never been done before. OntoPhil was tested on the benchmarks provided by the well known evaluation initiative, Ontology Alignment Evaluation Initiative, and also compared to other matching algorithms, although these algorithms were not specifically designed for smart cities. Additionally, specific tests involving a smart city's ontology and different types of agents were conducted to validate the usefulness of OntoPhil in the smart city environment.

  10. Matching algorithm of missile tail flame based on back-propagation neural network

    Science.gov (United States)

    Huang, Da; Huang, Shucai; Tang, Yidong; Zhao, Wei; Cao, Wenhuan

    2018-02-01

    This work presents a spectral matching algorithm of missile plume detection that based on neural network. The radiation value of the characteristic spectrum of the missile tail flame is taken as the input of the network. The network's structure including the number of nodes and layers is determined according to the number of characteristic spectral bands and missile types. We can get the network weight matrixes and threshold vectors through training the network using training samples, and we can determine the performance of the network through testing the network using the test samples. A small amount of data cause the network has the advantages of simple structure and practicality. Network structure composed of weight matrix and threshold vector can complete task of spectrum matching without large database support. Network can achieve real-time requirements with a small quantity of data. Experiment results show that the algorithm has the ability to match the precise spectrum and strong robustness.

  11. Target Matching Recognition for Satellite Images Based on the Improved FREAK Algorithm

    Directory of Open Access Journals (Sweden)

    Yantong Chen

    2016-01-01

    Full Text Available Satellite remote sensing image target matching recognition exhibits poor robustness and accuracy because of the unfit feature extractor and large data quantity. To address this problem, we propose a new feature extraction algorithm for fast target matching recognition that comprises an improved feature from accelerated segment test (FAST feature detector and a binary fast retina key point (FREAK feature descriptor. To improve robustness, we extend the FAST feature detector by applying scale space theory and then transform the feature vector acquired by the FREAK descriptor from decimal into binary. We reduce the quantity of data in the computer and improve matching accuracy by using the binary space. Simulation test results show that our algorithm outperforms other relevant methods in terms of robustness and accuracy.

  12. AN EVOLUTIONARY ALGORITHM FOR FAST INTENSITY BASED IMAGE MATCHING BETWEEN OPTICAL AND SAR SATELLITE IMAGERY

    Directory of Open Access Journals (Sweden)

    P. Fischer

    2018-04-01

    Full Text Available This paper presents a hybrid evolutionary algorithm for fast intensity based matching between satellite imagery from SAR and very high-resolution (VHR optical sensor systems. The precise and accurate co-registration of image time series and images of different sensors is a key task in multi-sensor image processing scenarios. The necessary preprocessing step of image matching and tie-point detection is divided into a search problem and a similarity measurement. Within this paper we evaluate the use of an evolutionary search strategy for establishing the spatial correspondence between satellite imagery of optical and radar sensors. The aim of the proposed algorithm is to decrease the computational costs during the search process by formulating the search as an optimization problem. Based upon the canonical evolutionary algorithm, the proposed algorithm is adapted for SAR/optical imagery intensity based matching. Extensions are drawn using techniques like hybridization (e.g. local search and others to lower the number of objective function calls and refine the result. The algorithm significantely decreases the computational costs whilst finding the optimal solution in a reliable way.

  13. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

    OpenAIRE

    Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

    2013-01-01

    Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are inve...

  14. Micro-seismic waveform matching inversion based on gravitational search algorithm and parallel computation

    Science.gov (United States)

    Jiang, Y.; Xing, H. L.

    2016-12-01

    Micro-seismic events induced by water injection, mining activity or oil/gas extraction are quite informative, the interpretation of which can be applied for the reconstruction of underground stress and monitoring of hydraulic fracturing progress in oil/gas reservoirs. The source characterises and locations are crucial parameters that required for these purposes, which can be obtained through the waveform matching inversion (WMI) method. Therefore it is imperative to develop a WMI algorithm with high accuracy and convergence speed. Heuristic algorithm, as a category of nonlinear method, possesses a very high convergence speed and good capacity to overcome local minimal values, and has been well applied for many areas (e.g. image processing, artificial intelligence). However, its effectiveness for micro-seismic WMI is still poorly investigated; very few literatures exits that addressing this subject. In this research an advanced heuristic algorithm, gravitational search algorithm (GSA) , is proposed to estimate the focal mechanism (angle of strike, dip and rake) and source locations in three dimension. Unlike traditional inversion methods, the heuristic algorithm inversion does not require the approximation of green function. The method directly interacts with a CPU parallelized finite difference forward modelling engine, and updating the model parameters under GSA criterions. The effectiveness of this method is tested with synthetic data form a multi-layered elastic model; the results indicate GSA can be well applied on WMI and has its unique advantages. Keywords: Micro-seismicity, Waveform matching inversion, gravitational search algorithm, parallel computation

  15. Segmentation of Handwritten Chinese Character Strings Based on improved Algorithm Liu

    Directory of Open Access Journals (Sweden)

    Zhihua Cai

    2014-09-01

    Full Text Available Algorithm Liu attracts high attention because of its high accuracy in segmentation of Japanese postal address. But the disadvantages, such as complexity and difficult implementation of algorithm, etc. have an adverse effect on its popularization and application. In this paper, the author applies the principles of algorithm Liu to handwritten Chinese character segmentation according to the characteristics of the handwritten Chinese characters, based on deeply study on algorithm Liu.In the same time, the author put forward the judgment criterion of Segmentation block classification and adhering mode of the handwritten Chinese characters.In the process of segmentation, text images are seen as the sequence made up of Connected Components (CCs, while the connected components are made up of several horizontal itinerary set of black pixels in image. The author determines whether these parts will be merged into segmentation through analyzing connected components. And then the author does image segmentation through adhering mode based on the analysis of outline edges. Finally cut the text images into character segmentation. Experimental results show that the improved Algorithm Liu obtains high segmentation accuracy and produces a satisfactory segmentation result.

  16. An adaptive map-matching algorithm based on hierarchical fuzzy system from vehicular GPS data.

    Directory of Open Access Journals (Sweden)

    Jinjun Tang

    Full Text Available An improved hierarchical fuzzy inference method based on C-measure map-matching algorithm is proposed in this paper, in which the C-measure represents the certainty or probability of the vehicle traveling on the actual road. A strategy is firstly introduced to use historical positioning information to employ curve-curve matching between vehicle trajectories and shapes of candidate roads. It improves matching performance by overcoming the disadvantage of traditional map-matching algorithm only considering current information. An average historical distance is used to measure similarity between vehicle trajectories and road shape. The input of system includes three variables: distance between position point and candidate roads, angle between driving heading and road direction, and average distance. As the number of fuzzy rules will increase exponentially when adding average distance as a variable, a hierarchical fuzzy inference system is then applied to reduce fuzzy rules and improve the calculation efficiency. Additionally, a learning process is updated to support the algorithm. Finally, a case study contains four different routes in Beijing city is used to validate the effectiveness and superiority of the proposed method.

  17. Taxamatch, an Algorithm for Near (‘Fuzzy’) Matching of Scientific Names in Taxonomic Databases

    Science.gov (United States)

    Rees, Tony

    2014-01-01

    Misspellings of organism scientific names create barriers to optimal storage and organization of biological data, reconciliation of data stored under different spelling variants of the same name, and appropriate responses from user queries to taxonomic data systems. This study presents an analysis of the nature of the problem from first principles, reviews some available algorithmic approaches, and describes Taxamatch, an improved name matching solution for this information domain. Taxamatch employs a custom Modified Damerau-Levenshtein Distance algorithm in tandem with a phonetic algorithm, together with a rule-based approach incorporating a suite of heuristic filters, to produce improved levels of recall, precision and execution time over the existing dynamic programming algorithms n-grams (as bigrams and trigrams) and standard edit distance. Although entirely phonetic methods are faster than Taxamatch, they are inferior in the area of recall since many real-world errors are non-phonetic in nature. Excellent performance of Taxamatch (as recall, precision and execution time) is demonstrated against a reference database of over 465,000 genus names and 1.6 million species names, as well as against a range of error types as present at both genus and species levels in three sets of sample data for species and four for genera alone. An ancillary authority matching component is included which can be used both for misspelled names and for otherwise matching names where the associated cited authorities are not identical. PMID:25247892

  18. DEM GENERATION FROM HIGH RESOLUTION SATELLITE IMAGES THROUGH A NEW 3D LEAST SQUARES MATCHING ALGORITHM

    Directory of Open Access Journals (Sweden)

    T. Kim

    2012-09-01

    Full Text Available Automated generation of digital elevation models (DEMs from high resolution satellite images (HRSIs has been an active research topic for many years. However, stereo matching of HRSIs, in particular based on image-space search, is still difficult due to occlusions and building facades within them. Object-space matching schemes, proposed to overcome these problem, often are very time consuming and critical to the dimensions of voxels. In this paper, we tried a new least square matching (LSM algorithm that works in a 3D object space. The algorithm starts with an initial height value on one location of the object space. From this 3D point, the left and right image points are projected. The true height is calculated by iterative least squares estimation based on the grey level differences between the left and right patches centred on the projected left and right points. We tested the 3D LSM to the Worldview images over 'Terrassa Sud' provided by the ISPRS WG I/4. We also compared the performance of the 3D LSM with the correlation matching based on 2D image space and the correlation matching based on 3D object space. The accuracy of the DEM from each method was analysed against the ground truth. Test results showed that 3D LSM offers more accurate DEMs over the conventional matching algorithms. Results also showed that 3D LSM is sensitive to the accuracy of initial height value to start the estimation. We combined the 3D COM and 3D LSM for accurate and robust DEM generation from HRSIs. The major contribution of this paper is that we proposed and validated that LSM can be applied to object space and that the combination of 3D correlation and 3D LSM can be a good solution for automated DEM generation from HRSIs.

  19. A review of feature detection and match algorithms for localization and mapping

    Science.gov (United States)

    Li, Shimiao

    2017-09-01

    Localization and mapping is an essential ability of a robot to keep track of its own location in an unknown environment. Among existing methods for this purpose, vision-based methods are more effective solutions for being accurate, inexpensive and versatile. Vision-based methods can generally be categorized as feature-based approaches and appearance-based approaches. The feature-based approaches prove higher performance in textured scenarios. However, their performance depend highly on the applied feature-detection algorithms. In this paper, we surveyed algorithms for feature detection, which is an essential step in achieving vision-based localization and mapping. In this pater, we present mathematical models of the algorithms one after another. To compare the performances of the algorithms, we conducted a series of experiments on their accuracy, speed, scale invariance and rotation invariance. The results of the experiments showed that ORB is the fastest algorithm in detecting and matching features, the speed of which is more than 10 times that of SURF and approximately 40 times that of SIFT. And SIFT, although with no advantage in terms of speed, shows the most correct matching pairs and proves its accuracy.

  20. A feature matching and fusion-based positive obstacle detection algorithm for field autonomous land vehicles

    Directory of Open Access Journals (Sweden)

    Tao Wu

    2017-03-01

    Full Text Available Positive obstacles will cause damage to field robotics during traveling in field. Field autonomous land vehicle is a typical field robotic. This article presents a feature matching and fusion-based algorithm to detect obstacles using LiDARs for field autonomous land vehicles. There are three main contributions: (1 A novel setup method of compact LiDAR is introduced. This method improved the LiDAR data density and reduced the blind region of the LiDAR sensor. (2 A mathematical model is deduced under this new setup method. The ideal scan line is generated by using the deduced mathematical model. (3 Based on the proposed mathematical model, a feature matching and fusion (FMAF-based algorithm is presented in this article, which is employed to detect obstacles. Experimental results show that the performance of the proposed algorithm is robust and stable, and the computing time is reduced by an order of two magnitudes by comparing with other exited algorithms. This algorithm has been perfectly applied to our autonomous land vehicle, which has won the champion in the challenge of Chinese “Overcome Danger 2014” ground unmanned vehicle.

  1. A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection.

    Directory of Open Access Journals (Sweden)

    Chun-Liang Lee

    Full Text Available The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms.

  2. The index-based subgraph matching algorithm (ISMA: fast subgraph enumeration in large networks using optimized search trees.

    Directory of Open Access Journals (Sweden)

    Sofie Demeyer

    Full Text Available Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.

  3. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

    Science.gov (United States)

    Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

    2013-01-01

    Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/. PMID:23620730

  4. Video error concealment using block matching and frequency selective extrapolation algorithms

    Science.gov (United States)

    P. K., Rajani; Khaparde, Arti

    2017-06-01

    Error Concealment (EC) is a technique at the decoder side to hide the transmission errors. It is done by analyzing the spatial or temporal information from available video frames. It is very important to recover distorted video because they are used for various applications such as video-telephone, video-conference, TV, DVD, internet video streaming, video games etc .Retransmission-based and resilient-based methods, are also used for error removal. But these methods add delay and redundant data. So error concealment is the best option for error hiding. In this paper, the error concealment methods such as Block Matching error concealment algorithm is compared with Frequency Selective Extrapolation algorithm. Both the works are based on concealment of manually error video frames as input. The parameter used for objective quality measurement was PSNR (Peak Signal to Noise Ratio) and SSIM(Structural Similarity Index). The original video frames along with error video frames are compared with both the Error concealment algorithms. According to simulation results, Frequency Selective Extrapolation is showing better quality measures such as 48% improved PSNR and 94% increased SSIM than Block Matching Algorithm.

  5. A Matlab-Based Testbed for Integration, Evaluation and Comparison of Heterogeneous Stereo Vision Matching Algorithms

    Directory of Open Access Journals (Sweden)

    Raul Correal

    2016-11-01

    Full Text Available Stereo matching is a heavily researched area with a prolific published literature and a broad spectrum of heterogeneous algorithms available in diverse programming languages. This paper presents a Matlab-based testbed that aims to centralize and standardize this variety of both current and prospective stereo matching approaches. The proposed testbed aims to facilitate the application of stereo-based methods to real situations. It allows for configuring and executing algorithms, as well as comparing results, in a fast, easy and friendly setting. Algorithms can be combined so that a series of processes can be chained and executed consecutively, using the output of a process as input for the next; some additional filtering and image processing techniques have been included within the testbed for this purpose. A use case is included to illustrate how these processes are sequenced and its effect on the results for real applications. The testbed has been conceived as a collaborative and incremental open-source project, where its code is accessible and modifiable, with the objective of receiving contributions and releasing future versions to include new algorithms and features. It is currently available online for the research community.

  6. Hardware-Efficient Design of Real-Time Profile Shape Matching Stereo Vision Algorithm on FPGA

    Directory of Open Access Journals (Sweden)

    Beau Tippetts

    2014-01-01

    Full Text Available A variety of platforms, such as micro-unmanned vehicles, are limited in the amount of computational hardware they can support due to weight and power constraints. An efficient stereo vision algorithm implemented on an FPGA would be able to minimize payload and power consumption in microunmanned vehicles, while providing 3D information and still leaving computational resources available for other processing tasks. This work presents a hardware design of the efficient profile shape matching stereo vision algorithm. Hardware resource usage is presented for the targeted micro-UV platform, Helio-copter, that uses the Xilinx Virtex 4 FX60 FPGA. Less than a fifth of the resources on this FGPA were used to produce dense disparity maps for image sizes up to 450 × 375, with the ability to scale up easily by increasing BRAM usage. A comparison is given of accuracy, speed performance, and resource usage of a census transform-based stereo vision FPGA implementation by Jin et al. Results show that the profile shape matching algorithm is an efficient real-time stereo vision algorithm for hardware implementation for resource limited systems such as microunmanned vehicles.

  7. A new accurate curvature matching and optimal tool based five-axis machining algorithm

    International Nuclear Information System (INIS)

    Lin, Than; Lee, Jae Woo; Bohez, Erik L. J.

    2009-01-01

    Free-form surfaces are widely used in CAD systems to describe the part surface. Today, the most advanced machining of free from surfaces is done in five-axis machining using a flat end mill cutter. However, five-axis machining requires complex algorithms for gouging avoidance, collision detection and powerful computer-aided manufacturing (CAM) systems to support various operations. An accurate and efficient method is proposed for five-axis CNC machining of free-form surfaces. The proposed algorithm selects the best tool and plans the tool path autonomously using curvature matching and integrated inverse kinematics of the machine tool. The new algorithm uses the real cutter contact tool path generated by the inverse kinematics and not the linearized piecewise real cutter location tool path

  8. Object Detection and Tracking using Modified Diamond Search Block Matching Motion Estimation Algorithm

    Directory of Open Access Journals (Sweden)

    Apurva Samdurkar

    2018-06-01

    Full Text Available Object tracking is one of the main fields within computer vision. Amongst various methods/ approaches for object detection and tracking, the background subtraction approach makes the detection of object easier. To the detected object, apply the proposed block matching algorithm for generating the motion vectors. The existing diamond search (DS and cross diamond search algorithms (CDS are studied and experiments are carried out on various standard video data sets and user defined data sets. Based on the study and analysis of these two existing algorithms a modified diamond search pattern (MDS algorithm is proposed using small diamond shape search pattern in initial step and large diamond shape (LDS in further steps for motion estimation. The initial search pattern consists of five points in small diamond shape pattern and gradually grows into a large diamond shape pattern, based on the point with minimum cost function. The algorithm ends with the small shape pattern at last. The proposed MDS algorithm finds the smaller motion vectors and fewer searching points than the existing DS and CDS algorithms. Further, object detection is carried out by using background subtraction approach and finally, MDS motion estimation algorithm is used for tracking the object in color video sequences. The experiments are carried out by using different video data sets containing a single object. The results are evaluated and compared by using the evaluation parameters like average searching points per frame and average computational time per frame. The experimental results show that the MDS performs better than DS and CDS on average search point and average computation time.

  9. Rating Algorithm for Pronunciation of English Based on Audio Feature Pattern Matching

    Directory of Open Access Journals (Sweden)

    Li Kun

    2015-01-01

    Full Text Available With the increasing internationalization of China, language communication has become an important channel for us to adapt to the political and economic environment. How to improve English learners’ language learning efficiency in limited conditions has turned into a problem demanding prompt solution at present. This paper applies two pronunciation patterns according to the actual needs of English pronunciation rating: to-be-evaluated pronunciation pattern and standard pronunciation pattern. It will translate the patterns into English pronunciation rating results through European distance. Besides, this paper will introduce the design philosophy of the whole algorithm in combination with CHMM matching pattern. Each link of the CHMM pattern will be given selective analysis while a contrast experiment between the CHMM matching pattern and the other two patterns will be conducted. From the experiment results, it can be concluded that CHMM pattern is the best option.

  10. PRACTICAL APPLICATION OF MATCHING ALGORITHMS IN CASE OF A TASK ALLOCATION PROBLEM

    Directory of Open Access Journals (Sweden)

    Péter Szikora

    2015-04-01

    Full Text Available Conflicts between individuals or even groups of people are part of everyday social life. However, when handling conflict situations successfully, conflicts are actually solved. In order to achieve such resolution, parties should separate the conflict from the involved people and try to create a cooperative, nonzero-sum mind set concentrating on interests and not on positions - agreeing on principles like using a fair standard and a fair procedure. In present paper such impartial standards and procedures - namely matching theory algorithms - that concentrate on factual controversies are introduced.

  11. Parallel implementation of DNA sequences matching algorithms using PWM on GPU architecture.

    Science.gov (United States)

    Sharma, Rahul; Gupta, Nitin; Narang, Vipin; Mittal, Ankush

    2011-01-01

    Positional Weight Matrices (PWMs) are widely used in representation and detection of Transcription Factor Of Binding Sites (TFBSs) on DNA. We implement online PWM search algorithm over parallel architecture. A large PWM data can be processed on Graphic Processing Unit (GPU) systems in parallel which can help in matching sequences at a faster rate. Our method employs extensive usage of highly multithreaded architecture and shared memory of multi-cored GPU. An efficient use of shared memory is required to optimise parallel reduction in CUDA. Our optimised method has a speedup of 230-280x over linear implementation on GPU named GeForce GTX 280.

  12. A matched-filter algorithm to detect amperometric spikes resulting from quantal secretion.

    Science.gov (United States)

    Balaji Ramachandran, Supriya; Gillis, Kevin D

    2018-01-01

    Electrochemical microelectrodes located immediately adjacent to the cell surface can detect spikes of amperometric current during exocytosis as the transmitter released from a single vesicle is oxidized on the electrode surface. Automated techniques to detect spikes are needed in order to quantify the spike rate as a measure of the rate of exocytosis. We have developed a Matched Filter (MF) detection algorithm that scans the data set with a library of prototype spike templates while performing a least-squares fit to determine the amplitude and standard error. The ratio of the fit amplitude to the standard error constitutes a criterion score that is assigned for each time point and for each template. A spike is detected when the criterion score exceeds a threshold and the highest-scoring template and the time of peak score is identified. The search for the next spike commences only after the score falls below a second, lower threshold to reduce false positives. The approach was extended to detect spikes with double-exponential decays with the sum of two templates. Receiver Operating Characteristic plots (ROCs) demonstrate that the algorithm detects >95% of manually identified spikes with a false-positive rate of ∼2%. ROCs demonstrate that the MF algorithm performs better than algorithms that detect spikes based on a derivative-threshold approach. The MF approach performs well and leads into approaches to identify spike parameters. Copyright © 2017 Elsevier B.V. All rights reserved.

  13. Study on a digital pulse processing algorithm based on template-matching for high-throughput spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Wen, Xianfei; Yang, Haori

    2015-06-01

    A major challenge in utilizing spectroscopy techniques for nuclear safeguards is to perform high-resolution measurements at an ultra-high throughput rate. Traditionally, piled-up pulses are rejected to ensure good energy resolution. To improve throughput rate, high-pass filters are normally implemented to shorten pulses. However, this reduces signal-to-noise ratio and causes degradation in energy resolution. In this work, a pulse pile-up recovery algorithm based on template-matching was proved to be an effective approach to achieve high-throughput gamma ray spectroscopy. First, a discussion of the algorithm was given in detail. Second, the algorithm was then successfully utilized to process simulated piled-up pulses from a scintillator detector. Third, the algorithm was implemented to analyze high rate data from a NaI detector, a silicon drift detector and a HPGe detector. The promising results demonstrated the capability of this algorithm to achieve high-throughput rate without significant sacrifice in energy resolution. The performance of the template-matching algorithm was also compared with traditional shaping methods. - Highlights: • A detailed discussion on the template-matching algorithm was given. • The algorithm was tested on data from a NaI and a Si detector. • The algorithm was successfully implemented on high rate data from a HPGe detector. • The performance of the algorithm was compared with traditional shaping methods. • The advantage of the algorithm in active interrogation was discussed.

  14. A New Profile Shape Matching Stereovision Algorithm for Real-time Human Pose and Hand Gesture Recognition

    Directory of Open Access Journals (Sweden)

    Dong Zhang

    2014-02-01

    Full Text Available This paper presents a new profile shape matching stereovision algorithm that is designed to extract 3D information in real time. This algorithm obtains 3D information by matching profile intensity shapes of each corresponding row of the stereo image pair. It detects the corresponding matching patterns of the intensity profile rather than the intensity values of individual pixels or pixels in a small neighbourhood. This approach reduces the effect of the intensity and colour variations caused by lighting differences. As with all real-time vision algorithms, there is always a trade-off between accuracy and processing speed. This algorithm achieves a balance between the two to produce accurate results for real-time applications. To demonstrate its performance, the proposed algorithm is tested for human pose and hand gesture recognition to control a smart phone and an entertainment system.

  15. PocketMatch: A new algorithm to compare binding sites in protein structures

    Directory of Open Access Journals (Sweden)

    Chandra Nagasuma

    2008-12-01

    Full Text Available Abstract Background Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. Conclusion A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that

  16. Compressed Subsequence Matching and Packed Tree Coloring

    DEFF Research Database (Denmark)

    Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

    2017-01-01

    We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log N\\log...... w\\cdot occ)\\) or \\(O(n+\\frac{n\\sigma }{w}\\log w+m\\log N\\cdot occ)\\) time. Here w is the word size and occ is the number of minimal occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for \\(occ=o(\\frac{n}{\\log N})\\) occurrences. The algorithm uses...... a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings....

  17. Matching theory

    CERN Document Server

    Plummer, MD

    1986-01-01

    This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.

  18. An enhanced block matching algorithm for fast elastic registration in adaptive radiotherapy

    International Nuclear Information System (INIS)

    Malsch, U; Thieke, C; Huber, P E; Bendl, R

    2006-01-01

    Image registration has many medical applications in diagnosis, therapy planning and therapy. Especially for time-adaptive radiotherapy, an efficient and accurate elastic registration of images acquired for treatment planning, and at the time of the actual treatment, is highly desirable. Therefore, we developed a fully automatic and fast block matching algorithm which identifies a set of anatomical landmarks in a 3D CT dataset and relocates them in another CT dataset by maximization of local correlation coefficients in the frequency domain. To transform the complete dataset, a smooth interpolation between the landmarks is calculated by modified thin-plate splines with local impact. The concept of the algorithm allows separate processing of image discontinuities like temporally changing air cavities in the intestinal track or rectum. The result is a fully transformed 3D planning dataset (planning CT as well as delineations of tumour and organs at risk) to a verification CT, allowing evaluation and, if necessary, changes of the treatment plan based on the current patient anatomy without time-consuming manual re-contouring. Typically the total calculation time is less than 5 min, which allows the use of the registration tool between acquiring the verification images and delivering the dose fraction for online corrections. We present verifications of the algorithm for five different patient datasets with different tumour locations (prostate, paraspinal and head-and-neck) by comparing the results with manually selected landmarks, visual assessment and consistency testing. It turns out that the mean error of the registration is better than the voxel resolution (2 x 2 x 3 mm 3 ). In conclusion, we present an algorithm for fully automatic elastic image registration that is precise and fast enough for online corrections in an adaptive fractionated radiation treatment course

  19. String theory

    International Nuclear Information System (INIS)

    Chan Hongmo.

    1987-10-01

    The paper traces the development of the String Theory, and was presented at Professor Sir Rudolf Peierls' 80sup(th) Birthday Symposium. The String theory is discussed with respect to the interaction of strings, the inclusion of both gauge theory and gravitation, inconsistencies in the theory, and the role of space-time. The physical principles underlying string theory are also outlined. (U.K.)

  20. An Adaptive Impedance Matching Network with Closed Loop Control Algorithm for Inductive Wireless Power Transfer.

    Science.gov (United States)

    Miao, Zhidong; Liu, Dake; Gong, Chen

    2017-08-01

    For an inductive wireless power transfer (IWPT) system, maintaining a reasonable power transfer efficiency and a stable output power are two most challenging design issues, especially when coil distance varies. To solve these issues, this paper presents a novel adaptive impedance matching network (IMN) for IWPT system. In our adaptive IMN IWPT system, the IMN is automatically reconfigured to keep matching with the coils and to adjust the output power adapting to coil distance variation. A closed loop control algorithm is used to change the capacitors continually, which can compensate mismatches and adjust output power simultaneously. The proposed adaptive IMN IWPT system is working at 125 kHz for 2 W power delivered to load. Comparing with the series resonant IWPT system and fixed IMN IWPT system, the power transfer efficiency of our system increases up to 31.79% and 60% when the coupling coefficient varies in a large range from 0.05 to 0.8 for 2 W output power.

  1. An Adaptive Impedance Matching Network with Closed Loop Control Algorithm for Inductive Wireless Power Transfer

    Science.gov (United States)

    Miao, Zhidong; Liu, Dake

    2017-01-01

    For an inductive wireless power transfer (IWPT) system, maintaining a reasonable power transfer efficiency and a stable output power are two most challenging design issues, especially when coil distance varies. To solve these issues, this paper presents a novel adaptive impedance matching network (IMN) for IWPT system. In our adaptive IMN IWPT system, the IMN is automatically reconfigured to keep matching with the coils and to adjust the output power adapting to coil distance variation. A closed loop control algorithm is used to change the capacitors continually, which can compensate mismatches and adjust output power simultaneously. The proposed adaptive IMN IWPT system is working at 125 kHz for 2 W power delivered to load. Comparing with the series resonant IWPT system and fixed IMN IWPT system, the power transfer efficiency of our system increases up to 31.79% and 60% when the coupling coefficient varies in a large range from 0.05 to 0.8 for 2 W output power. PMID:28763011

  2. Hardware architecture for projective model calculation and false match refining using random sample consensus algorithm

    Science.gov (United States)

    Azimi, Ehsan; Behrad, Alireza; Ghaznavi-Ghoushchi, Mohammad Bagher; Shanbehzadeh, Jamshid

    2016-11-01

    The projective model is an important mapping function for the calculation of global transformation between two images. However, its hardware implementation is challenging because of a large number of coefficients with different required precisions for fixed point representation. A VLSI hardware architecture is proposed for the calculation of a global projective model between input and reference images and refining false matches using random sample consensus (RANSAC) algorithm. To make the hardware implementation feasible, it is proved that the calculation of the projective model can be divided into four submodels comprising two translations, an affine model and a simpler projective mapping. This approach makes the hardware implementation feasible and considerably reduces the required number of bits for fixed point representation of model coefficients and intermediate variables. The proposed hardware architecture for the calculation of a global projective model using the RANSAC algorithm was implemented using Verilog hardware description language and the functionality of the design was validated through several experiments. The proposed architecture was synthesized by using an application-specific integrated circuit digital design flow utilizing 180-nm CMOS technology as well as a Virtex-6 field programmable gate array. Experimental results confirm the efficiency of the proposed hardware architecture in comparison with software implementation.

  3. Detection of cardiovascular risk from a photoplethysmographic signal using a matching pursuit algorithm.

    Science.gov (United States)

    Sommermeyer, Dirk; Zou, Ding; Ficker, Joachim H; Randerath, Winfried; Fischer, Christoph; Penzel, Thomas; Sanner, Bernd; Hedner, Jan; Grote, Ludger

    2016-07-01

    Cardiovascular disease is the main cause of death in Europe, and early detection of increased cardiovascular risk (CR) is of clinical importance. Pulse wave analysis based on pulse oximetry has proven useful for the recognition of increased CR. The current study provides a detailed description of the pulse wave analysis technology and its clinical application. A novel matching pursuit-based feature extraction algorithm was applied for signal decomposition of the overnight photoplethysmographic pulse wave signals obtained by a single-pulse oximeter sensor. The algorithm computes nine parameters (pulse index, SpO2 index, pulse wave amplitude index, respiratory-related pulse oscillations, pulse propagation time, periodic and symmetric desaturations, time under 90 % SpO2, difference between pulse and SpO2 index, and arrhythmia). The technology was applied in 631 patients referred for a sleep study with suspected sleep apnea. The technical failure rate was 1.4 %. Anthropometric data like age and BMI correlated significantly with measures of vascular stiffness and pulse rate variability (PPT and age r = -0.54, p < 0.001, PR and age r = -0.36, p < 0.01). The composite biosignal risk score showed a dose-response relationship with the number of CR factors (p < 0.001) and was further elevated in patients with sleep apnea (AHI ≥ 15n/h; p < 0.001). The developed algorithm extracts meaningful parameters indicative of cardiorespiratory and autonomic nervous system function and dysfunction in patients suspected of SDB.

  4. A block matching-based registration algorithm for localization of locally advanced lung tumors

    Energy Technology Data Exchange (ETDEWEB)

    Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D., E-mail: gdhugo@vcu.edu [Department of Radiation Oncology, Virginia Commonwealth University, Richmond, Virginia, 23298 (United States)

    2014-04-15

    Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm{sup 3}), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0

  5. A block matching-based registration algorithm for localization of locally advanced lung tumors

    International Nuclear Information System (INIS)

    Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D.

    2014-01-01

    Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm 3 ), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0.001). Left

  6. Hyperbolic strings

    International Nuclear Information System (INIS)

    Popov, A.D.

    1991-01-01

    We introduce hyperbolic strings as closed bosonic strings with the target space R d-1,1 xT q+1,1 which has an additional time-like dimension in the internal space. The Fock spaces of the q-parametric family of standard bosonic, fermionic and heterotic strings with the target spaces of dimension n≤d+q are shown to be embedded into the Fock space of hyperbolic strings. The condition of the absence of anomaly fixes d and q for all three types of strings written in a bosonized form. (orig.)

  7. Fast Arc-Annotated Subsequence Matching in Linear Space

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2012-01-01

    for investigating the function of RNA molecules. Gramm et al. (ACM Trans. Algorithms 2(1): 44-65, 2006) gave an algorithm for this problem using O(nm) time and space, where m and n are the lengths of P and Q, respectively. In this paper we present a new algorithm using O(nm) time and O(n+m) space, thereby matching......-annotated strings. © 2010 Springer Science+Business Media, LLC....

  8. Genetic Algorithm-Based Optimization to Match Asteroid Energy Deposition Curves

    Science.gov (United States)

    Tarano, Ana; Mathias, Donovan; Wheeler, Lorien; Close, Sigrid

    2018-01-01

    An asteroid entering Earth's atmosphere deposits energy along its path due to thermal ablation and dissipative forces that can be measured by ground-based and spaceborne instruments. Inference of pre-entry asteroid properties and characterization of the atmospheric breakup is facilitated by using an analytic fragment-cloud model (FCM) in conjunction with a Genetic Algorithm (GA). This optimization technique is used to inversely solve for the asteroid's entry properties, such as diameter, density, strength, velocity, entry angle, and strength scaling, from simulations using FCM. The previous parameters' fitness evaluation involves minimizing error to ascertain the best match between the physics-based calculated energy deposition and the observed meteors. This steady-state GA provided sets of solutions agreeing with literature, such as the meteor from Chelyabinsk, Russia in 2013 and Tagish Lake, Canada in 2000, which were used as case studies in order to validate the optimization routine. The assisted exploration and exploitation of this multi-dimensional search space enables inference and uncertainty analysis that can inform studies of near-Earth asteroids and consequently improve risk assessment.

  9. Generation of synthetic image sequences for the verification of matching and tracking algorithms for deformation analysis

    Science.gov (United States)

    Bethmann, F.; Jepping, C.; Luhmann, T.

    2013-04-01

    This paper reports on a method for the generation of synthetic image data for almost arbitrary static or dynamic 3D scenarios. Image data generation is based on pre-defined 3D objects, object textures, camera orientation data and their imaging properties. The procedure does not focus on the creation of photo-realistic images under consideration of complex imaging and reflection models as they are used by common computer graphics programs. In contrast, the method is designed with main emphasis on geometrically correct synthetic images without radiometric impact. The calculation process includes photogrammetric distortion models, hence cameras with arbitrary geometric imaging characteristics can be applied. Consequently, image sets can be created that are consistent to mathematical photogrammetric models to be used as sup-pixel accurate data for the assessment of high-precision photogrammetric processing methods. In the first instance the paper describes the process of image simulation under consideration of colour value interpolation, MTF/PSF and so on. Subsequently the geometric quality of the synthetic images is evaluated with ellipse operators. Finally, simulated image sets are used to investigate matching and tracking algorithms as they have been developed at IAPG for deformation measurement in car safety testing.

  10. Fast index based algorithms and software for matching position specific scoring matrices

    Directory of Open Access Journals (Sweden)

    Homann Robert

    2006-08-01

    Full Text Available Abstract Background In biological sequence analysis, position specific scoring matrices (PSSMs are widely used to represent sequence motifs in nucleotide as well as amino acid sequences. Searching with PSSMs in complete genomes or large sequence databases is a common, but computationally expensive task. Results We present a new non-heuristic algorithm, called ESAsearch, to efficiently find matches of PSSMs in large databases. Our approach preprocesses the search space, e.g., a complete genome or a set of protein sequences, and builds an enhanced suffix array that is stored on file. This allows the searching of a database with a PSSM in sublinear expected time. Since ESAsearch benefits from small alphabets, we present a variant operating on sequences recoded according to a reduced alphabet. We also address the problem of non-comparable PSSM-scores by developing a method which allows the efficient computation of a matrix similarity threshold for a PSSM, given an E-value or a p-value. Our method is based on dynamic programming and, in contrast to other methods, it employs lazy evaluation of the dynamic programming matrix. We evaluated algorithm ESAsearch with nucleotide PSSMs and with amino acid PSSMs. Compared to the best previous methods, ESAsearch shows speedups of a factor between 17 and 275 for nucleotide PSSMs, and speedups up to factor 1.8 for amino acid PSSMs. Comparisons with the most widely used programs even show speedups by a factor of at least 3.8. Alphabet reduction yields an additional speedup factor of 2 on amino acid sequences compared to results achieved with the 20 symbol standard alphabet. The lazy evaluation method is also much faster than previous methods, with speedups of a factor between 3 and 330. Conclusion Our analysis of ESAsearch reveals sublinear runtime in the expected case, and linear runtime in the worst case for sequences not shorter than |A MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92Aae

  11. Global rotational motion and displacement estimation of digital image stabilization based on the oblique vectors matching algorithm

    Science.gov (United States)

    Yu, Fei; Hui, Mei; Zhao, Yue-jin

    2009-08-01

    The image block matching algorithm based on motion vectors of correlative pixels in oblique direction is presented for digital image stabilization. The digital image stabilization is a new generation of image stabilization technique which can obtains the information of relative motion among frames of dynamic image sequences by the method of digital image processing. In this method the matching parameters are calculated from the vectors projected in the oblique direction. The matching parameters based on the vectors contain the information of vectors in transverse and vertical direction in the image blocks at the same time. So the better matching information can be obtained after making correlative operation in the oblique direction. And an iterative weighted least square method is used to eliminate the error of block matching. The weights are related with the pixels' rotational angle. The center of rotation and the global emotion estimation of the shaking image can be obtained by the weighted least square from the estimation of each block chosen evenly from the image. Then, the shaking image can be stabilized with the center of rotation and the global emotion estimation. Also, the algorithm can run at real time by the method of simulated annealing in searching method of block matching. An image processing system based on DSP was used to exam this algorithm. The core processor in the DSP system is TMS320C6416 of TI, and the CCD camera with definition of 720×576 pixels was chosen as the input video signal. Experimental results show that the algorithm can be performed at the real time processing system and have an accurate matching precision.

  12. Bowed Strings

    Science.gov (United States)

    Rossing, Thomas D.; Hanson, Roger J.

    In the next eight chapters, we consider some aspects of the science of bowed string instruments, old and new. In this chapter, we present a brief discussion of bowed strings, a subject that will be developed much more thoroughly in Chap. 16. Chapters 13-15 discuss the violin, the cello, and the double bass. Chapter 17 discusses viols and other historic string instruments, and Chap. 18 discusses the Hutchins-Schelleng violin octet.

  13. TPS-HAMMER: improving HAMMER registration algorithm by soft correspondence matching and thin-plate splines based deformation interpolation.

    Science.gov (United States)

    Wu, Guorong; Yap, Pew-Thian; Kim, Minjeong; Shen, Dinggang

    2010-02-01

    We present an improved MR brain image registration algorithm, called TPS-HAMMER, which is based on the concepts of attribute vectors and hierarchical landmark selection scheme proposed in the highly successful HAMMER registration algorithm. We demonstrate that TPS-HAMMER algorithm yields better registration accuracy, robustness, and speed over HAMMER owing to (1) the employment of soft correspondence matching and (2) the utilization of thin-plate splines (TPS) for sparse-to-dense deformation field generation. These two aspects can be integrated into a unified framework to refine the registration iteratively by alternating between soft correspondence matching and dense deformation field estimation. Compared with HAMMER, TPS-HAMMER affords several advantages: (1) unlike the Gaussian propagation mechanism employed in HAMMER, which can be slow and often leaves unreached blotches in the deformation field, the deformation interpolation in the non-landmark points can be obtained immediately with TPS in our algorithm; (2) the smoothness of deformation field is preserved due to the nice properties of TPS; (3) possible misalignments can be alleviated by allowing the matching of the landmarks with a number of possible candidate points and enforcing more exact matches in the final stages of the registration. Extensive experiments have been conducted, using the original HAMMER as a comparison baseline, to validate the merits of TPS-HAMMER. The results show that TPS-HAMMER yields significant improvement in both accuracy and speed, indicating high applicability for the clinical scenario. Copyright (c) 2009 Elsevier Inc. All rights reserved.

  14. INS/GPS/LiDAR Integrated Navigation System for Urban and Indoor Environments Using Hybrid Scan Matching Algorithm.

    Science.gov (United States)

    Gao, Yanbin; Liu, Shifei; Atia, Mohamed M; Noureldin, Aboelmagd

    2015-09-15

    This paper takes advantage of the complementary characteristics of Global Positioning System (GPS) and Light Detection and Ranging (LiDAR) to provide periodic corrections to Inertial Navigation System (INS) alternatively in different environmental conditions. In open sky, where GPS signals are available and LiDAR measurements are sparse, GPS is integrated with INS. Meanwhile, in confined outdoor environments and indoors, where GPS is unreliable or unavailable and LiDAR measurements are rich, LiDAR replaces GPS to integrate with INS. This paper also proposes an innovative hybrid scan matching algorithm that combines the feature-based scan matching method and Iterative Closest Point (ICP) based scan matching method. The algorithm can work and transit between two modes depending on the number of matched line features over two scans, thus achieving efficiency and robustness concurrently. Two integration schemes of INS and LiDAR with hybrid scan matching algorithm are implemented and compared. Real experiments are performed on an Unmanned Ground Vehicle (UGV) for both outdoor and indoor environments. Experimental results show that the multi-sensor integrated system can remain sub-meter navigation accuracy during the whole trajectory.

  15. Bosonic strings

    CERN Document Server

    Jost, Jürgen

    2007-01-01

    This book presents a mathematical treatment of Bosonic string theory from the point of view of global geometry. As motivation, Jost presents the theory of point particles and Feynman path integrals. He provides detailed background material, including the geometry of Teichmüller space, the conformal and complex geometry of Riemann surfaces, and the subtleties of boundary regularity questions. The high point is the description of the partition function for Bosonic strings as a finite-dimensional integral over a moduli space of Riemann surfaces. Jost concludes with some topics related to open and closed strings and D-branes. Bosonic Strings is suitable for graduate students and researchers interested in the mathematics underlying string theory.

  16. Multiquark strings

    International Nuclear Information System (INIS)

    Wang, F.; Chun, W.

    1985-01-01

    The use of basis states described as hadronic (or hadron-hadron) or hidden-colour (or colour-colour) for a system of quarks does not necessarily imply that connected exotic multiquark hadrons do exist. Antisymmetrization of quark wave functions tends to make these descriptions ill defined. It appears necessary to have stable collective structures called strings or bags to provide the physical connections required by quark confinement. The masses of multiquark hadrons can then be estimated by using semplified string, bag and NR potential models. The results turn out to be qualitatively similar in all these models. The stability problem for multiquark strings is briefly discussed

  17. An Image Matching Algorithm Integrating Global SRTM and Image Segmentation for Multi-Source Satellite Imagery

    Directory of Open Access Journals (Sweden)

    Xiao Ling

    2016-08-01

    Full Text Available This paper presents a novel image matching method for multi-source satellite images, which integrates global Shuttle Radar Topography Mission (SRTM data and image segmentation to achieve robust and numerous correspondences. This method first generates the epipolar lines as a geometric constraint assisted by global SRTM data, after which the seed points are selected and matched. To produce more reliable matching results, a region segmentation-based matching propagation is proposed in this paper, whereby the region segmentations are extracted by image segmentation and are considered to be a spatial constraint. Moreover, a similarity measure integrating Distance, Angle and Normalized Cross-Correlation (DANCC, which considers geometric similarity and radiometric similarity, is introduced to find the optimal correspondences. Experiments using typical satellite images acquired from Resources Satellite-3 (ZY-3, Mapping Satellite-1, SPOT-5 and Google Earth demonstrated that the proposed method is able to produce reliable and accurate matching results.

  18. Effective potentials from complex simulations: a potential-matching algorithm and remarks on coarse-grained potentials

    International Nuclear Information System (INIS)

    Toth, Gergely

    2007-01-01

    The projection of complex interactions onto simple distance-dependent or angle-dependent classical mechanical functions is a long-standing theoretical challenge in the field of computational sciences concerning biomolecules, colloids, aggregates and simple systems as well. The construction of an effective potential may be based on theoretical assumptions, on the application of fitting procedures on experimental data and on the simplification of complex molecular simulations. Recently, a force-matching method was elaborated to project the data of Car-Parrinello ab initio molecular dynamics simulations onto two-particle classical interactions (Izvekov et al 2004 J. Chem. Phys. 120 10896). We have developed a potential-matching algorithm as a practical analogue of this force-matching method. The algorithm requires a large number of configurations (particle positions) and a single value of the potential energy for each configuration. We show the details of the algorithm and the test calculations on simple systems. The test calculation on water showed an example in which a similar structure was obtained for qualitatively different pair interactions. The application of the algorithm on reverse Monte Carlo configurations was tried as well. We detected inconsistencies in a part of our calculations. We found that the coarse graining of potentials cannot be performed perfectly both for the structural and the thermodynamic data. For example, if one applies an inverse method with an input of the pair-correlation function, it provides energetics data for the configurations uniquely. These energetics data can be different from the desired ones obtained by all atom simulations, as occurred in the testing of our potential-matching method

  19. Cosmic strings

    International Nuclear Information System (INIS)

    Bennett, D.P.

    1988-07-01

    Cosmic strings are linear topological defects that are predicted by some grand unified theories to form during a spontaneous symmetry breaking phase transition in the early universe. They are the basis for the only theories of galaxy formation aside from quantum fluctuations from inflation that are based on fundamental physics. In contrast to inflation, they can also be observed directly through gravitational lensing and their characteristic microwave background anistropy. It has recently been discovered by F. Bouchet and myself that details of cosmic string evolution are very different from the so-called ''standard model'' that has been assumed in most of the string induced galaxy formation calculations. Therefore, the details of galaxy formation in the cosmic string models are currently very uncertain. 29 refs., 9 figs

  20. Magnetic strings

    International Nuclear Information System (INIS)

    Chaves, Max

    2006-01-01

    The conception of the magnetic string is presented as an infinitely thin bundle of magnetic flux lines. The magnetic strings are surrounded by a film of current that rotates around them, and are a solution of Maxwell's equations. The magnetic potential contains a line singularity, and its stability can be established topologically. A few comments are added on the possibility that they may exist at a cosmological scale as relics of the Big Bang. (author) [es

  1. Lattice strings

    International Nuclear Information System (INIS)

    Thorn, C.B.

    1988-01-01

    The possibility of studying non-perturbative effects in string theory using a world sheet lattice is discussed. The light-cone lattice string model of Giles and Thorn is studied numerically to assess the accuracy of ''coarse lattice'' approximations. For free strings a 5 by 15 lattice seems sufficient to obtain better than 10% accuracy for the bosonic string tachyon mass squared. In addition a crude lattice model simulating string like interactions is studied to find out how easily a coarse lattice calculation can pick out effects such as bound states which would qualitatively alter the spectrum of the free theory. The role of the critical dimension in obtaining a finite continuum limit is discussed. Instead of the ''gaussian'' lattice model one could use one of the vertex models, whose continuum limit is the same as a gaussian model on a torus of any radius. Indeed, any critical 2 dimensional statistical system will have a stringy continuum limit in the absence of string interactions. 8 refs., 1 fig. , 9 tabs

  2. Are Stopped Strings Preferred in Sad Music?

    Directory of Open Access Journals (Sweden)

    David Huron

    2017-01-01

    Full Text Available String instruments may be played either with open strings (where the string vibrates between the bridge and a hard wooden nut or with stopped strings (where the string vibrates between the bridge and a performer's finger pressed against the fingerboard. Compared with open strings, stopped strings permit the use of vibrato and exhibit a darker timbre. Inspired by research on the timbre of sad speech, we test whether there is a tendency to use stopped strings in nominally sad music. Specifically, we compare the proportion of potentially open-to-stopped strings in a sample of slow, minor-mode movements with matched major-mode movements. By way of illustration, a preliminary analysis of Samuel Barber's famous Adagio from his Opus 11 string quartet shows that the selected key (B-flat minor provides the optimum key for minimizing open string tones. However, examination of a broader controlled sample of quartet movements by Haydn, Mozart and Beethoven failed to exhibit the conjectured relationship. Instead, major-mode movements were found to avoid possible open strings more than slow minor-mode movements.

  3. Quality-aware features-based noise level estimator for block matching and three-dimensional filtering algorithm

    Science.gov (United States)

    Xu, Shaoping; Hu, Lingyan; Yang, Xiaohui

    2016-01-01

    The performance of conventional denoising algorithms is usually controlled by one or several parameters whose optimal settings depend on the contents of the processed images and the characteristics of the noises. Among these parameters, noise level is a fundamental parameter that is always assumed to be known by most of the existing denoising algorithms (so-called nonblind denoising algorithms), which largely limits the applicability of these nonblind denoising algorithms in many applications. Moreover, these nonblind algorithms do not always achieve the best denoised images in visual quality even when fed with the actual noise level parameter. To address these shortcomings, in this paper we propose a new quality-aware features-based noise level estimator (NLE), which consists of quality-aware features extraction and optimal noise level parameter prediction. First, considering that image local contrast features convey important structural information that is closely related to image perceptual quality, we utilize the marginal statistics of two local contrast operators, i.e., the gradient magnitude and the Laplacian of Gaussian (LOG), to extract quality-aware features. The proposed quality-aware features have very low computational complexity, making them well suited for time-constrained applications. Then we propose a learning-based framework where the noise level parameter is estimated based on the quality-aware features. Based on the proposed NLE, we develop a blind block matching and three-dimensional filtering (BBM3D) denoising algorithm which is capable of effectively removing additive white Gaussian noise, even coupled with impulse noise. The noise level parameter of the BBM3D algorithm is automatically tuned according to the quality-aware features, guaranteeing the best performance. As such, the classical block matching and three-dimensional algorithm can be transformed into a blind one in an unsupervised manner. Experimental results demonstrate that the

  4. A New FPGA Architecture of FAST and BRIEF Algorithm for On-Board Corner Detection and Matching

    Directory of Open Access Journals (Sweden)

    Jingjin Huang

    2018-03-01

    Full Text Available Although some researchers have proposed the Field Programmable Gate Array (FPGA architectures of Feature From Accelerated Segment Test (FAST and Binary Robust Independent Elementary Features (BRIEF algorithm, there is no consideration of image data storage in these traditional architectures that will result in no image data that can be reused by the follow-up algorithms. This paper proposes a new FPGA architecture that considers the reuse of sub-image data. In the proposed architecture, a remainder-based method is firstly designed for reading the sub-image, a FAST detector and a BRIEF descriptor are combined for corner detection and matching. Six pairs of satellite images with different textures, which are located in the Mentougou district, Beijing, China, are used to evaluate the performance of the proposed architecture. The Modelsim simulation results found that: (i the proposed architecture is effective for sub-image reading from DDR3 at a minimum cost; (ii the FPGA implementation is corrected and efficient for corner detection and matching, such as the average value of matching rate of natural areas and artificial areas are approximately 67% and 83%, respectively, which are close to PC’s and the processing speed by FPGA is approximately 31 and 2.5 times faster than those by PC processing and by GPU processing, respectively.

  5. A New FPGA Architecture of FAST and BRIEF Algorithm for On-Board Corner Detection and Matching.

    Science.gov (United States)

    Huang, Jingjin; Zhou, Guoqing; Zhou, Xiang; Zhang, Rongting

    2018-03-28

    Although some researchers have proposed the Field Programmable Gate Array (FPGA) architectures of Feature From Accelerated Segment Test (FAST) and Binary Robust Independent Elementary Features (BRIEF) algorithm, there is no consideration of image data storage in these traditional architectures that will result in no image data that can be reused by the follow-up algorithms. This paper proposes a new FPGA architecture that considers the reuse of sub-image data. In the proposed architecture, a remainder-based method is firstly designed for reading the sub-image, a FAST detector and a BRIEF descriptor are combined for corner detection and matching. Six pairs of satellite images with different textures, which are located in the Mentougou district, Beijing, China, are used to evaluate the performance of the proposed architecture. The Modelsim simulation results found that: (i) the proposed architecture is effective for sub-image reading from DDR3 at a minimum cost; (ii) the FPGA implementation is corrected and efficient for corner detection and matching, such as the average value of matching rate of natural areas and artificial areas are approximately 67% and 83%, respectively, which are close to PC's and the processing speed by FPGA is approximately 31 and 2.5 times faster than those by PC processing and by GPU processing, respectively.

  6. Clustering Words to Match Conditions: An Algorithm for Stimuli Selection in Factorial Designs

    Science.gov (United States)

    Guasch, Marc; Haro, Juan; Boada, Roger

    2017-01-01

    With the increasing refinement of language processing models and the new discoveries about which variables can modulate these processes, stimuli selection for experiments with a factorial design is becoming a tough task. Selecting sets of words that differ in one variable, while matching these same words into dozens of other confounding variables…

  7. A novel iris patterns matching algorithm of weighted polar frequency correlation

    Science.gov (United States)

    Zhao, Weijie; Jiang, Linhua

    2014-11-01

    Iris recognition is recognized as one of the most accurate techniques for biometric authentication. In this paper, we present a novel correlation method - Weighted Polar Frequency Correlation(WPFC) - to match and evaluate two iris images, actually it can also be used for evaluating the similarity of any two images. The WPFC method is a novel matching and evaluating method for iris image matching, which is complete different from the conventional methods. For instance, the classical John Daugman's method of iris recognition uses 2D Gabor wavelets to extract features of iris image into a compact bit stream, and then matching two bit streams with hamming distance. Our new method is based on the correlation in the polar coordinate system in frequency domain with regulated weights. The new method is motivated by the observation that the pattern of iris that contains far more information for recognition is fine structure at high frequency other than the gross shapes of iris images. Therefore, we transform iris images into frequency domain and set different weights to frequencies. Then calculate the correlation of two iris images in frequency domain. We evaluate the iris images by summing the discrete correlation values with regulated weights, comparing the value with preset threshold to tell whether these two iris images are captured from the same person or not. Experiments are carried out on both CASIA database and self-obtained images. The results show that our method is functional and reliable. Our method provides a new prospect for iris recognition system.

  8. Motion Vector Estimation Using Line-Square Search Block Matching Algorithm for Video Sequences

    Directory of Open Access Journals (Sweden)

    Guo Bao-long

    2004-09-01

    Full Text Available Motion estimation and compensation techniques are widely used for video coding applications but the real-time motion estimation is not easily achieved due to its enormous computations. In this paper, a new fast motion estimation algorithm based on line search is presented, in which computation complexity is greatly reduced by using the line search strategy and a parallel search pattern. Moreover, the accurate search is achieved because the small square search pattern is used. It has a best-case scenario of only 9 search points, which is 4 search points less than the diamond search algorithm. Simulation results show that, compared with the previous techniques, the LSPS algorithm significantly reduces the computational requirements for finding motion vectors, and also produces close performance in terms of motion compensation errors.

  9. A novel directional asymmetric sampling search algorithm for fast block-matching motion estimation

    Science.gov (United States)

    Li, Yue-e.; Wang, Qiang

    2011-11-01

    This paper proposes a novel directional asymmetric sampling search (DASS) algorithm for video compression. Making full use of the error information (block distortions) of the search patterns, eight different direction search patterns are designed for various situations. The strategy of local sampling search is employed for the search of big-motion vector. In order to further speed up the search, early termination strategy is adopted in procedure of DASS. Compared to conventional fast algorithms, the proposed method has the most satisfactory PSNR values for all test sequences.

  10. Singleton strings

    International Nuclear Information System (INIS)

    Engquist, J.; Sundell, P.; Tamassia, L.

    2007-01-01

    The group theoretical structure underlying physics in anti de Sitter (AdS) spacetime is intrinsically different with respect to the flat case, due to the presence of special ultra-short representations, named singletons, that do not admit a flat space limit. The purpose of this collaboration is to exploit this feature in the study of string and brane dynamics in AdS spacetime, in particular while trying to establish a connection between String Theory in AdS backgrounds (in the tensionless limit) and Higher-Spin Gauge Theory. (orig.)

  11. A Bayesian matching pursuit based scheduling algorithm for feedback reduction in MIMO broadcast channels

    KAUST Repository

    Shibli, Hussain J.

    2013-06-01

    Opportunistic schedulers rely on the feedback of all users in order to schedule a set of users with favorable channel conditions. While the downlink channels can be easily estimated at all user terminals via a single broadcast, several key challenges are faced during uplink transmission. First of all, the statistics of the noisy and fading feedback channels are unknown at the base station (BS) and channel training is usually required from all users. Secondly, the amount of network resources (air-time) required for feedback transmission grows linearly with the number of users. In this paper, we tackle the above challenges and propose a Bayesian based scheduling algorithm that 1) reduces the air-time required to identify the strong users, and 2) is agnostic to the statistics of the feedback channels and utilizes the a priori statistics of the additive noise to identify the strong users. Numerical results show that the proposed algorithm reduces the feedback air-time while improving detection in the presence of fading and noisy channels when compared to recent compressed sensing based algorithms. Furthermore, the proposed algorithm achieves a sum-rate throughput close to that obtained by noiseless dedicated feedback systems. © 2013 IEEE.

  12. Doppler distortion correction based on microphone array and matching pursuit algorithm for a wayside train bearing monitoring system

    International Nuclear Information System (INIS)

    Liu, Xingchen; Hu, Zhiyong; He, Qingbo; Zhang, Shangbin; Zhu, Jun

    2017-01-01

    Doppler distortion and background noise can reduce the effectiveness of wayside acoustic train bearing monitoring and fault diagnosis. This paper proposes a method of combining a microphone array and matching pursuit algorithm to overcome these difficulties. First, a dictionary is constructed based on the characteristics and mechanism of a far-field assumption. Then, the angle of arrival of the train bearing is acquired when applying matching pursuit to analyze the acoustic array signals. Finally, after obtaining the resampling time series, the Doppler distortion can be corrected, which is convenient for further diagnostic work. Compared with traditional single-microphone Doppler correction methods, the advantages of the presented array method are its robustness to background noise and its barely requiring pre-measuring parameters. Simulation and experimental study show that the proposed method is effective in performing wayside acoustic bearing fault diagnosis. (paper)

  13. Doppler distortion correction based on microphone array and matching pursuit algorithm for a wayside train bearing monitoring system

    Science.gov (United States)

    Liu, Xingchen; Hu, Zhiyong; He, Qingbo; Zhang, Shangbin; Zhu, Jun

    2017-10-01

    Doppler distortion and background noise can reduce the effectiveness of wayside acoustic train bearing monitoring and fault diagnosis. This paper proposes a method of combining a microphone array and matching pursuit algorithm to overcome these difficulties. First, a dictionary is constructed based on the characteristics and mechanism of a far-field assumption. Then, the angle of arrival of the train bearing is acquired when applying matching pursuit to analyze the acoustic array signals. Finally, after obtaining the resampling time series, the Doppler distortion can be corrected, which is convenient for further diagnostic work. Compared with traditional single-microphone Doppler correction methods, the advantages of the presented array method are its robustness to background noise and its barely requiring pre-measuring parameters. Simulation and experimental study show that the proposed method is effective in performing wayside acoustic bearing fault diagnosis.

  14. On the elliptic genus of three E-strings and heterotic strings

    International Nuclear Information System (INIS)

    Cai, Wenhe; Huang, Min-xin; Sun, Kaiwen

    2015-01-01

    A precise formula for the elliptic genus of three E-strings is presented. The related refined free energy coincides with the result calculated from topological string on local half K3 Calabi-Yau threefold up to genus twelve. The elliptic genus of three heterotic strings computed from M9 domain walls matches with the result from orbifold formula to high orders. This confirms the n=3 case of the recent conjecture that n pairs of E-strings can recombine into n heterotic strings.

  15. Automated Radiology-Pathology Module Correlation Using a Novel Report Matching Algorithm by Organ System.

    Science.gov (United States)

    Dane, Bari; Doshi, Ankur; Gfytopoulos, Soterios; Bhattacharji, Priya; Recht, Michael; Moore, William

    2018-05-01

    Radiology-pathology correlation is time-consuming and is not feasible in most clinical settings, with the notable exception of breast imaging. The purpose of this study was to determine if an automated radiology-pathology report pairing system could accurately match radiology and pathology reports, thus creating a feedback loop allowing for more frequent and timely radiology-pathology correlation. An experienced radiologist created a matching matrix of radiology and pathology reports. These matching rules were then exported to a novel comprehensive radiology-pathology module. All distinct radiology-pathology pairings at our institution from January 1, 2016 to July 1, 2016 were included (n = 8999). The appropriateness of each radiology-pathology report pairing was scored as either "correlative" or "non-correlative." Pathology reports relating to anatomy imaged in the specific imaging study were deemed correlative, whereas pathology reports describing anatomy not imaged with the particular study were denoted non-correlative. Overall, there was 88.3% correlation (accuracy) of the radiology and pathology reports (n = 8999). Subset analysis demonstrated that computed tomography (CT) abdomen/pelvis, CT head/neck/face, CT chest, musculoskeletal CT (excluding spine), mammography, magnetic resonance imaging (MRI) abdomen/pelvis, MRI brain, musculoskeletal MRI (excluding spine), breast MRI, positron emission tomography (PET), breast ultrasound, and head/neck ultrasound all demonstrated greater than 91% correlation. When further stratified by imaging modality, CT, MRI, mammography, and PET demonstrated excellent correlation (greater than 96.3%). Ultrasound and non-PET nuclear medicine studies demonstrated poorer correlation (80%). There is excellent correlation of radiology imaging reports and appropriate pathology reports when matched by organ system. Rapid, appropriate radiology-pathology report pairings provide an excellent opportunity to close feedback loop to the

  16. SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Shepard, A; Bednarz, B [University of Wisconsin, Madison, WI (United States)

    2016-06-15

    Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localized block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA

  17. SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

    International Nuclear Information System (INIS)

    Shepard, A; Bednarz, B

    2016-01-01

    Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localized block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA

  18. Algorithm research for user trajectory matching across social media networks based on paragraph2vec

    Science.gov (United States)

    Xu, Qian; Chen, Hongchang; Zhi, Hongxin; Wang, Yanchuan

    2018-04-01

    Identifying users across different social media networks (SMN) is to link accounts of the same user that belong to the same individual across SMNs. The problem is fundamental and important, and its results can benefit many applications such as cross SMN user modeling and recommendation. With the development of GPS technology and mobile communication, more and more social networks provide location services. This provides a new opportunity for cross SMN user identification. In this paper, we solve cross SMN user identification problem in an unsupervised manner by utilizing user trajectory data in SMNs. A paragraph2vec based algorithm is proposed in which location sequence feature of user trajectory is captured in temporal and spatial dimensions. Our experimental results validate the effectiveness and efficiency of our algorithm.

  19. String phenomenology

    CERN Document Server

    Ibáñez, Luis E

    2015-01-01

    This chapter reviews a number of topics in the field of string phenomenology, focusing on orientifold/F-theory models yielding semirealistic low-energy physics. The emphasis is on the extraction of the low-energy effective action and possible tests of specific models at the LHC.

  20. String GUTs

    International Nuclear Information System (INIS)

    Aldazabal, G.; Ibanez, L.E.; Uranga, A.M.

    1995-01-01

    Standard SUSY-GUTs such as those based on SU(5) or SO(10) lead to predictions for the values of α s and sin 2 θ W in amazing agreement with experiment. In this article we investigate how these models may be obtained from string theory, thus bringing them into the only known consistent framework for quantum gravity. String models with matter in standard GUT representations require the realization of affine Lie algebras at higher levels. We start by describing some methods to build level k=2 symmetric orbifold string models with gauge groups SU(5) or SO(10). We present several examples and identify generic features of the type of models constructed. Chiral fields appropriate to break the symmetry down to the standard model generically appear in the massless spectrum. However, unlike in standard SUSY-GUTs, they often behave as string moduli, i.e., they do not have self-couplings. We also discuss briefly the doublet-triplet Higgs splitting. We find that, in some models, built-in sliding-singlet type of couplings exist. (orig.)

  1. Automated Peak Detection and Matching Algorithm for Gas Chromatography–Differential Mobility Spectrometry

    Science.gov (United States)

    Fong, Sim S.; Rearden, Preshious; Kanchagar, Chitra; Sassetti, Christopher; Trevejo, Jose; Brereton, Richard G.

    2013-01-01

    A gas chromatography–differential mobility spectrometer (GC-DMS) involves a portable and selective mass analyzer that may be applied to chemical detection in the field. Existing approaches examine whole profiles and do not attempt to resolve peaks. A new approach for peak detection in the 2D GC-DMS chromatograms is reported. This method is demonstrated on three case studies: a simulated case study; a case study of headspace gas analysis of Mycobacterium tuberculosis (MTb) cultures consisting of three matching GC-DMS and GC-MS chromatograms; a case study consisting of 41 GC-DMS chromatograms of headspace gas analysis of MTb culture and media. PMID:21204557

  2. Control of force during rapid visuomotor force-matching tasks can be described by discrete time PID control algorithms.

    Science.gov (United States)

    Dideriksen, Jakob Lund; Feeney, Daniel F; Almuklass, Awad M; Enoka, Roger M

    2017-08-01

    Force trajectories during isometric force-matching tasks involving isometric contractions vary substantially across individuals. In this study, we investigated if this variability can be explained by discrete time proportional, integral, derivative (PID) control algorithms with varying model parameters. To this end, we analyzed the pinch force trajectories of 24 subjects performing two rapid force-matching tasks with visual feedback. Both tasks involved isometric contractions to a target force of 10% maximal voluntary contraction. One task involved a single action (pinch) and the other required a double action (concurrent pinch and wrist extension). 50,000 force trajectories were simulated with a computational neuromuscular model whose input was determined by a PID controller with different PID gains and frequencies at which the controller adjusted muscle commands. The goal was to find the best match between each experimental force trajectory and all simulated trajectories. It was possible to identify one realization of the PID controller that matched the experimental force produced during each task for most subjects (average index of similarity: 0.87 ± 0.12; 1 = perfect similarity). The similarities for both tasks were significantly greater than that would be expected by chance (single action: p = 0.01; double action: p = 0.04). Furthermore, the identified control frequencies in the simulated PID controller with the greatest similarities decreased as task difficulty increased (single action: 4.0 ± 1.8 Hz; double action: 3.1 ± 1.3 Hz). Overall, the results indicate that discrete time PID controllers are realistic models for the neural control of force in rapid force-matching tasks involving isometric contractions.

  3. Semantic Data Matching: Principles and Performance

    Science.gov (United States)

    Deaton, Russell; Doan, Thao; Schweiger, Tom

    Automated and real-time management of customer relationships requires robust and intelligent data matching across widespread and diverse data sources. Simple string matching algorithms, such as dynamic programming, can handle typographical errors in the data, but are less able to match records that require contextual and experiential knowledge. Latent Semantic Indexing (LSI) (Berry et al. ; Deerwester et al. is a machine intelligence technique that can match data based upon higher order structure, and is able to handle difficult problems, such as words that have different meanings but the same spelling, are synonymous, or have multiple meanings. Essentially, the technique matches records based upon context, or mathematically quantifying when terms occur in the same record.

  4. Powertrain Matching and Optimization of Dual-Motor Hybrid Driving System for Electric Vehicle Based on Quantum Genetic Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2014-01-01

    Full Text Available In order to increase the driving range and improve the overall performance of all-electric vehicles, a new dual-motor hybrid driving system with two power sources was proposed. This system achieved torque-speed coupling between the two power sources and greatly improved the high performance working range of the motors; at the same time, continuously variable transmission (CVT was achieved to efficiently increase the driving range. The power system parameters were determined using the “global optimization method”; thus, the vehicle’s dynamics and economy were used as the optimization indexes. Based on preliminary matches, quantum genetic algorithm was introduced to optimize the matching in the dual-motor hybrid power system. Backward simulation was performed on the combined simulation platform of Matlab/Simulink and AVL-Cruise to optimize, simulate, and verify the system parameters of the transmission system. Results showed that quantum genetic algorithms exhibited good global optimization capability and convergence in dealing with multiobjective and multiparameter optimization. The dual-motor hybrid-driving system for electric cars satisfied the dynamic performance and economy requirements of design, efficiently increasing the driving range of the car, having high performance, and reducing energy consumption of 15.6% compared with the conventional electric vehicle with single-speed reducers.

  5. Indonesian name matching using machine learning supervised approach

    Science.gov (United States)

    Alifikri, Mohamad; Arif Bijaksana, Moch.

    2018-03-01

    Most existing name matching methods are developed for English language and so they cover the characteristics of this language. Up to this moment, there is no specific one has been designed and implemented for Indonesian names. The purpose of this thesis is to develop Indonesian name matching dataset as a contribution to academic research and to propose suitable feature set by utilizing combination of context of name strings and its permute-winkler score. Machine learning classification algorithms is taken as the method for performing name matching. Based on the experiments, by using tuned Random Forest algorithm and proposed features, there is an improvement of matching performance by approximately 1.7% and it is able to reduce until 70% misclassification result of the state of the arts methods. This improving performance makes the matching system more effective and reduces the risk of misclassified matches.

  6. Compute-unified device architecture implementation of a block-matching algorithm for multiple graphical processing unit cards.

    Science.gov (United States)

    Massanes, Francesc; Cadennes, Marie; Brankov, Jovan G

    2011-07-01

    In this paper we describe and evaluate a fast implementation of a classical block matching motion estimation algorithm for multiple Graphical Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) computing engine. The implemented block matching algorithm (BMA) uses summed absolute difference (SAD) error criterion and full grid search (FS) for finding optimal block displacement. In this evaluation we compared the execution time of a GPU and CPU implementation for images of various sizes, using integer and non-integer search grids.The results show that use of a GPU card can shorten computation time by a factor of 200 times for integer and 1000 times for a non-integer search grid. The additional speedup for non-integer search grid comes from the fact that GPU has built-in hardware for image interpolation. Further, when using multiple GPU cards, the presented evaluation shows the importance of the data splitting method across multiple cards, but an almost linear speedup with a number of cards is achievable.In addition we compared execution time of the proposed FS GPU implementation with two existing, highly optimized non-full grid search CPU based motion estimations methods, namely implementation of the Pyramidal Lucas Kanade Optical flow algorithm in OpenCV and Simplified Unsymmetrical multi-Hexagon search in H.264/AVC standard. In these comparisons, FS GPU implementation still showed modest improvement even though the computational complexity of FS GPU implementation is substantially higher than non-FS CPU implementation.We also demonstrated that for an image sequence of 720×480 pixels in resolution, commonly used in video surveillance, the proposed GPU implementation is sufficiently fast for real-time motion estimation at 30 frames-per-second using two NVIDIA C1060 Tesla GPU cards.

  7. The automated reference toolset: A soil-geomorphic ecological potential matching algorithm

    Science.gov (United States)

    Nauman, Travis; Duniway, Michael C.

    2016-01-01

    Ecological inventory and monitoring data need referential context for interpretation. Identification of appropriate reference areas of similar ecological potential for site comparison is demonstrated using a newly developed automated reference toolset (ART). Foundational to identification of reference areas was a soil map of particle size in the control section (PSCS), a theme in US Soil Taxonomy. A 30-m resolution PSCS map of the Colorado Plateau (366,000 km2) was created by interpolating ∼5000 field soil observations using a random forest model and a suite of raster environmental spatial layers representing topography, climate, general ecological community, and satellite imagery ratios. The PSCS map had overall out of bag accuracy of 61.8% (Kappa of 0.54, p < 0.0001), and an independent validation accuracy of 93.2% at a set of 356 field plots along the southern edge of Canyonlands National Park, Utah. The ART process was also tested at these plots, and matched plots with the same ecological sites (ESs) 67% of the time where sites fell within 2-km buffers of each other. These results show that the PSCS and ART have strong application for ecological monitoring and sampling design, as well as assessing impacts of disturbance and land management action using an ecological potential framework. Results also demonstrate that PSCS could be a key mapping layer for the USDA-NRCS provisional ES development initiative.

  8. Radial motion of the carotid artery wall: A block matching algorithm approach

    Directory of Open Access Journals (Sweden)

    Effat Soleimani

    2012-06-01

    Full Text Available Introduction: During recent years, evaluating the relation between mechanical properties of the arterialwall and cardiovascular diseases has been of great importance. On the other hand, motion estimation of thearterial wall using a sequence of noninvasive ultrasonic images and convenient processing methods mightprovide useful information related to biomechanical indexes and elastic properties of the arteries and assistdoctors to discriminate between healthy and diseased arteries. In the present study, a block matching basedalgorithm was introduced to extract radial motion of the carotid artery wall during cardiac cycles.Materials and Methods: The program was implemented to the consecutive ultrasonic images of thecommon carotid artery of 10 healthy men and maximum and mean radial movement of the posterior wall ofthe artery was extracted. Manual measurements were carried out to validate the automatic method andresults of two methods were compared.Results: Paired t-test analysis showed no significant differences between the automatic and manualmethods (P>0.05. There was significant correlation between the changes in the instantaneous radialmovement of the common carotid artery measured with the manual and automatic methods (withcorrelation coefficient 0.935 and P<0.05.Conclusion: Results of the present study showed that by using a semi automated computer analysismethod, with minimizing the user interfere and no attention to the user experience or skill, arterial wallmotion in the radial direction can be extracted from consecutive ultrasonic frames

  9. Balance control of grid currents for UPQC under unbalanced loads based on matching-ratio compensation algorithm

    DEFF Research Database (Denmark)

    Zhao, Xiaojun; Zhang, Chunjiang; Chai, Xiuhui

    2018-01-01

    In three-phase four-wire systems, unbalanced loads can cause grid currents to be unbalanced, and this may cause the neutral point potential on the grid side to shift. The neutral point potential shift will worsen the control precision as well as the performance of the threephase four-wire unified...... fluctuations, and elaborates the interaction between unbalanced grid currents and DC bus voltage fluctuations; two control strategies of UPQC under three-phase stationary coordinate based on the MCA are given, and finally, the feasibility and effectiveness of the proposed control strategy are verified...... power quality conditioner (UPQC), and it also leads to unbalanced three-phase output voltage, even causing damage to electric equipment. To deal with unbalanced loads, this paper proposes a matching-ratio compensation algorithm (MCA) for the fundamental active component of load currents...

  10. LZ-Compressed String Dictionaries

    OpenAIRE

    Arz, Julian; Fischer, Johannes

    2013-01-01

    We show how to compress string dictionaries using the Lempel-Ziv (LZ78) data compression algorithm. Our approach is validated experimentally on dictionaries of up to 1.5 GB of uncompressed text. We achieve compression ratios often outperforming the existing alternatives, especially on dictionaries containing many repeated substrings. Our query times remain competitive.

  11. Fingerprints in Compressed Strings

    DEFF Research Database (Denmark)

    Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

    2013-01-01

    The Karp-Rabin fingerprint of a string is a type of hash value that due to its strong properties has been used in many string algorithms. In this paper we show how to construct a data structure for a string S of size N compressed by a context-free grammar of size n that answers fingerprint queries...... derivative that captures LZ78 compression and its variations) we get O(loglogN) query time. Hence, our data structures has the same time and space complexity as for random access in SLPs. We utilize the fingerprint data structures to solve the longest common extension problem in query time O(logNlogℓ) and O....... That is, given indices i and j, the answer to a query is the fingerprint of the substring S[i,j]. We present the first O(n) space data structures that answer fingerprint queries without decompressing any characters. For Straight Line Programs (SLP) we get O(logN) query time, and for Linear SLPs (an SLP...

  12. A dynamic model of the marriage market-part 1: matching algorithm based on age preference and availability.

    Science.gov (United States)

    Matthews, A P; Garenne, M L

    2013-09-01

    The matching algorithm in a dynamic marriage market model is described in this first of two companion papers. Iterative Proportional Fitting is used to find a marriage function (an age distribution of new marriages for both sexes), in a stable reference population, that is consistent with the one-sex age distributions of new marriages, and includes age preference. The one-sex age distributions (which are the marginals of the two-sex distribution) are based on the Picrate model, and age preference on a normal distribution, both of which may be adjusted by choice of parameter values. For a population that is perturbed from the reference state, the total number of new marriages is found as the harmonic mean of target totals for men and women obtained by applying reference population marriage rates to the perturbed population. The marriage function uses the age preference function, assumed to be the same for the reference and the perturbed populations, to distribute the total number of new marriages. The marriage function also has an availability factor that varies as the population changes with time, where availability depends on the supply of unmarried men and women. To simplify exposition, only first marriage is treated, and the algorithm is illustrated by application to Zambia. In the second paper, remarriage and dissolution are included. Copyright © 2013 Elsevier Inc. All rights reserved.

  13. Finding Maximal Quasiperiodicities in Strings

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Pedersen, Christian N. S.

    2000-01-01

    of length n in time O(n log n) and space O(n). Our algorithm uses the suffix tree as the fundamental data structure combined with efficient methods for merging and performing multiple searches in search trees. Besides finding all maximal quasiperiodic substrings, our algorithm also marks the nodes......Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log2 n). In this paper we give an algorithm that finds all maximal quasiperiodic substrings in a string...... in the suffix tree that have a superprimitive path-label....

  14. String Gas Cosmology

    OpenAIRE

    Brandenberger, Robert H.

    2008-01-01

    String gas cosmology is a string theory-based approach to early universe cosmology which is based on making use of robust features of string theory such as the existence of new states and new symmetries. A first goal of string gas cosmology is to understand how string theory can effect the earliest moments of cosmology before the effective field theory approach which underlies standard and inflationary cosmology becomes valid. String gas cosmology may also provide an alternative to the curren...

  15. Closed string field theory

    International Nuclear Information System (INIS)

    Strominger, A.

    1987-01-01

    A gauge invariant cubic action describing bosonic closed string field theory is constructed. The gauge symmetries include local spacetime diffeomorphisms. The conventional closed string spectrum and trilinear couplings are reproduced after spontaneous symmetry breaking. The action S is constructed from the usual ''open string'' field of ghost number minus one half. It is given by the associator of the string field product which is non-vanishing because of associativity anomalies. S does not describe open string propagation because open string states associate and can thereby be shifted away. A field theory of closed and open strings can be obtained by adding to S the cubic open string action. (orig.)

  16. Image matching as a data source for forest inventory - Comparison of Semi-Global Matching and Next-Generation Automatic Terrain Extraction algorithms in a typical managed boreal forest environment

    Science.gov (United States)

    Kukkonen, M.; Maltamo, M.; Packalen, P.

    2017-08-01

    Image matching is emerging as a compelling alternative to airborne laser scanning (ALS) as a data source for forest inventory and management. There is currently an open discussion in the forest inventory community about whether, and to what extent, the new method can be applied to practical inventory campaigns. This paper aims to contribute to this discussion by comparing two different image matching algorithms (Semi-Global Matching [SGM] and Next-Generation Automatic Terrain Extraction [NGATE]) and ALS in a typical managed boreal forest environment in southern Finland. Spectral features from unrectified aerial images were included in the modeling and the potential of image matching in areas without a high resolution digital terrain model (DTM) was also explored. Plot level predictions for total volume, stem number, basal area, height of basal area median tree and diameter of basal area median tree were modeled using an area-based approach. Plot level dominant tree species were predicted using a random forest algorithm, also using an area-based approach. The statistical difference between the error rates from different datasets was evaluated using a bootstrap method. Results showed that ALS outperformed image matching with every forest attribute, even when a high resolution DTM was used for height normalization and spectral information from images was included. Dominant tree species classification with image matching achieved accuracy levels similar to ALS regardless of the resolution of the DTM when spectral metrics were used. Neither of the image matching algorithms consistently outperformed the other, but there were noticeably different error rates depending on the parameter configuration, spectral band, resolution of DTM, or response variable. This study showed that image matching provides reasonable point cloud data for forest inventory purposes, especially when a high resolution DTM is available and information from the understory is redundant.

  17. A Novel Parallel Algorithm for Edit Distance Computation

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2018-01-01

    Full Text Available The edit distance between two sequences is the minimum number of weighted transformation-operations that are required to transform one string into the other. The weighted transformation-operations are insert, remove, and substitute. Dynamic programming solution to find edit distance exists but it becomes computationally intensive when the lengths of strings become very large. This work presents a novel parallel algorithm to solve edit distance problem of string matching. The algorithm is based on resolving dependencies in the dynamic programming solution of the problem and it is able to compute each row of edit distance table in parallel. In this way, it becomes possible to compute the complete table in min(m,n iterations for strings of size m and n whereas state-of-the-art parallel algorithm solves the problem in max(m,n iterations. The proposed algorithm also increases the amount of parallelism in each of its iteration. The algorithm is also capable of exploiting spatial locality while its implementation. Additionally, the algorithm works in a load balanced way that further improves its performance. The algorithm is implemented for multicore systems having shared memory. Implementation of the algorithm in OpenMP shows linear speedup and better execution time as compared to state-of-the-art parallel approach. Efficiency of the algorithm is also proven better in comparison to its competitor.

  18. GeneYenta: a phenotype-based rare disease case matching tool based on online dating algorithms for the acceleration of exome interpretation.

    Science.gov (United States)

    Gottlieb, Michael M; Arenillas, David J; Maithripala, Savanie; Maurer, Zachary D; Tarailo Graovac, Maja; Armstrong, Linlea; Patel, Millan; van Karnebeek, Clara; Wasserman, Wyeth W

    2015-04-01

    Advances in next-generation sequencing (NGS) technologies have helped reveal causal variants for genetic diseases. In order to establish causality, it is often necessary to compare genomes of unrelated individuals with similar disease phenotypes to identify common disrupted genes. When working with cases of rare genetic disorders, finding similar individuals can be extremely difficult. We introduce a web tool, GeneYenta, which facilitates the matchmaking process, allowing clinicians to coordinate detailed comparisons for phenotypically similar cases. Importantly, the system is focused on phenotype annotation, with explicit limitations on highly confidential data that create barriers to participation. The procedure for matching of patient phenotypes, inspired by online dating services, uses an ontology-based semantic case matching algorithm with attribute weighting. We evaluate the capacity of the system using a curated reference data set and 19 clinician entered cases comparing four matching algorithms. We find that the inclusion of clinician weights can augment phenotype matching. © 2015 WILEY PERIODICALS, INC.

  19. Tracing the string: BMN correspondence at finite J2/N

    International Nuclear Information System (INIS)

    Pearson, John; Vaman, Diana; Verlinde, Herman; Volovich, Anastasia; Spradlin, Marcus

    2003-01-01

    Employing the string bit formalism of hep-th/0209215, we identify the basis transformation that relates BMN operators in N=4 gauge theory to string states in the dual string field theory at finite g 2 =J 2 /N. In this basis, the supercharge truncates at linear order in g 2 , and the mixing amplitude between 1 and 2-string states precisely matches with the (corrected) answer of hep-th/0206073 for the 3-string amplitude in light-cone string field theory. Supersymmetry then predicts the order g 2 2 contact term in the string bit Hamiltonian. The resulting leading order mass renormalization of string states agrees with the recently computed shift in conformal dimension of BMN operators in the gauge theory. (author)

  20. STRING v9.1

    DEFF Research Database (Denmark)

    Franceschini, A.; Simonovic, M.; Roth, A.

    2013-01-01

    for certain model organisms and functional systems. Currently, protein interactions and associations are annotated at various levels of detail in online resources, ranging from raw data repositories to highly formalized pathway databases. For many applications, a global view of all the available interaction...... data is desirable, including lower-quality data and/or computational predictions. The STRING database (http://string-db.org/) aims to provide such a global perspective for as many organisms as feasible. Known and predicted associations are scored and integrated, resulting in comprehensive protein...... networks covering >1100 organisms. Here, we describe the update to version 9.1 of STRING, introducing several improvements: (i) we extend the automated mining of scientific texts for interaction information, to now also include full-text articles; (ii) we entirely re-designed the algorithm for transferring...

  1. Very Fast Algorithms and Detection Performance of Multi-Channel and 2-D Parametric Adaptive Matched Filters for Airborne Radar

    National Research Council Canada - National Science Library

    Marple, Jr., S. L; Corbell, Phillip M; Rangaswamy, Muralidhar

    2007-01-01

    ...) detection statistics under exactly known covariance (the clairvoyant case). Improved versions of the two original multichannel PAMF algorithms, one new multichannel PAMF algorithm, and a new two-dimensional (2D) PAMF algorithm...

  2. Cosmic global strings

    International Nuclear Information System (INIS)

    Sikivie, P.

    1991-01-01

    The topics are: global strings; the gravitational field of a straight global string; how do global strings behave?; the axion cosmological energy density; computer simulations of the motion and decay of global strings; electromagnetic radiation from the conversion of Nambu-Goldstone bosons in astrophysical magnetic fields. (orig.)

  3. Evidence for string substructure

    International Nuclear Information System (INIS)

    Bergman, O.

    1996-06-01

    The author argues that the behavior of string theory at high temperature and high longitudinal boosts, combined with the emergence of p-branes as necessary ingredients in various string dualities, point to a possible reformulation of strings, as well as p-branes, as composites of bits. He reviews the string-bit models, and suggests generalizations to incorporate p-branes

  4. String driven inflation

    International Nuclear Information System (INIS)

    Turok, N.

    1987-11-01

    It is argued that, in fundamental string theories, as one traces the universe back in time a point is reached when the expansion rate is so fast that the rate of string creation due to quantum effects balances the dilution of the string density due to the expansion. One is therefore led into a phase of constant string density and an exponentially expanding universe. Fundamental strings therefore seem to lead naturally to inflation. 17 refs., 1 fig

  5. Hot String Soup

    OpenAIRE

    Lowe, D. A.; Thorlacius, L.

    1994-01-01

    Above the Hagedorn energy density closed fundamental strings form a long string phase. The dynamics of weakly interacting long strings is described by a simple Boltzmann equation which can be solved explicitly for equilibrium distributions. The average total number of long strings grows logarithmically with total energy in the microcanonical ensemble. This is consistent with calculations of the free single string density of states provided the thermodynamic limit is carefully defined. If the ...

  6. String-driven inflation

    International Nuclear Information System (INIS)

    Turok, N.

    1988-01-01

    It is argued that, in fundamental string theories, as one traces the universe back in time a point is reached when the expansion rate is so fast that the rate of string creation due to quantum effects balances the dilution of the string density due to the expansion. One is therefore led into a phase of constant string density and an exponentially expanding universe. Fundamental strings therefore seem to lead naturally to inflation

  7. Algorithmic and user study of an autocompletion algorithm on a large medical vocabulary.

    Science.gov (United States)

    Sevenster, Merlijn; van Ommering, Rob; Qian, Yuechen

    2012-02-01

    Autocompletion supports human-computer interaction in software applications that let users enter textual data. We will be inspired by the use case in which medical professionals enter ontology concepts, catering the ongoing demand for structured and standardized data in medicine. Goal is to give an algorithmic analysis of one particular autocompletion algorithm, called multi-prefix matching algorithm, which suggests terms whose words' prefixes contain all words in the string typed by the user, e.g., in this sense, opt ner me matches optic nerve meningioma. Second we aim to investigate how well it supports users entering concepts from a large and comprehensive medical vocabulary (snomed ct). We give a concise description of the multi-prefix algorithm, and sketch how it can be optimized to meet required response time. Performance will be compared to a baseline algorithm, which gives suggestions that extend the string typed by the user to the right, e.g. optic nerve m gives optic nerve meningioma, but opt ner me does not. We conduct a user experiment in which 12 participants are invited to complete 40 snomed ct terms with the baseline algorithm and another set of 40 snomed ct terms with the multi-prefix algorithm. Our results show that users need significantly fewer keystrokes when supported by the multi-prefix algorithm than when supported by the baseline algorithm. The proposed algorithm is a competitive candidate for searching and retrieving terms from a large medical ontology. Copyright © 2011 Elsevier Inc. All rights reserved.

  8. The heterotic string

    International Nuclear Information System (INIS)

    Gross, D.J.

    1986-01-01

    Traditional string theories, either bosonic or supersymmetric, came in two varieties, closed string theories and open string theories. Closed string are neutral objects which describe at low energies gravity or supergravity. Open strings have geometrically invariant ends to which charge can be attached, thereby obtaining, in addition to gravity, Yang-Mills gauge interactions. Recently a new kind of string theory was discovered--the heterotic string, which is a chiral hybrid of the closed superstring and the closed bosonic string, and which produces by an internal dynamical mechanism gauge interactions of a totally specified kind. Although this theory is found in an attempt to produce a superstring theory which would yield a low energy E/sub 8/xE/sub 8/ supersymmetric, anomaly free, gauge theory, as suggested by the anomaly cancellation mechanism of Green and Schwarz, it fits naturally into the general framework of consistent string theories

  9. Fuzzy automata and pattern matching

    Science.gov (United States)

    Setzer, C. B.; Warsi, N. A.

    1986-01-01

    A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.

  10. Algorithms

    Indian Academy of Sciences (India)

    polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.

  11. Relativistic classical strings. II

    International Nuclear Information System (INIS)

    Galvao, C.A.P.

    1985-01-01

    The interactions of strings with electromagnetic and gravitational fields are extensively discussed. Some concepts of differential geometry are reviewed. Strings in Kaluza-Klein manifolds are studied. (L.C.) [pt

  12. Inflationary string theory?

    Indian Academy of Sciences (India)

    strongly motivate a detailed search for inflation within string theory, although it has ... between string theory and observations provides a strong incentive for ..... sonably be expected to arise for any system having very many degrees of freedom.

  13. Strings in the Sun?

    International Nuclear Information System (INIS)

    Chudnovsky, E.; Vilenkin, A.

    1988-01-01

    If light superconducting strings were formed in the early Universe, then it is very likely that now they exist in abundance in the interstellar plasma and in stars. The dynamics of such strings can be dominated by friction, so that they are ''frozen'' into the plasma. Turbulence of the plasma twists and stretches the strings, forming a stochastic string network. Such networks must generate particles and magnetic fields, and may play an important role in the physics of stars and of the Galaxy

  14. Why string theory?

    CERN Document Server

    Conlon, Joseph

    2016-01-01

    Is string theory a fraud or one of the great scientific advances? Why do so many physicists work on string theory if it cannot be tested? This book provides insight into why such a theory, with little direct experimental support, plays such a prominent role in theoretical physics. The book gives a modern and accurate account of string theory and science, explaining what string theory is, why it is regarded as so promising, and why it is hard to test.

  15. Introduction to string theory and string compactifications

    International Nuclear Information System (INIS)

    GarcIa-Compean, Hugo

    2005-01-01

    Basics of some topics on perturbative and non-perturbative string theory are reviewed. After a mathematical survey of the Standard Model of particle physics and GUTs, the bosonic string kinematics for the free case and with interaction is described. The effective action of the bosonic string and the spectrum is also discussed. T-duality in closed and open strings and the definition of D-brane are surveyed. Five perturbative superstring theories and their spectra is briefly outlined. Calabi-Yau three-fold compactifications of heterotic strings and their relation to some four-dimensional physics are given. Finally, non-perturbative issues like S-duality, M-theory and F-theory are also reviewed

  16. Random surfaces and strings

    International Nuclear Information System (INIS)

    Ambjoern, J.

    1987-08-01

    The theory of strings is the theory of random surfaces. I review the present attempts to regularize the world sheet of the string by triangulation. The corresponding statistical theory of triangulated random surfaces has a surprising rich structure, but the connection to conventional string theory seems non-trivial. (orig.)

  17. Dynamics of Carroll strings

    Energy Technology Data Exchange (ETDEWEB)

    Cardona, Biel [Departament d’Estructura i Constituents de la Matèriaand Institut de Ciències del Cosmos (ICCUB) Facultat de Física, Universitat de Barcelona,Diagonal 647, E-08028 Barcelona, Catalonia (Spain); Gomis, Joaquim [Departament d’Estructura i Constituents de la Matèriaand Institut de Ciències del Cosmos (ICCUB) Facultat de Física, Universitat de Barcelona,Diagonal 647, E-08028 Barcelona, Catalonia (Spain); Department of Physics, Faculty of Science, Chulalongkorn University,Bangkok 10330 (Thailand); Pons, Josep M. [Departament d’Estructura i Constituents de la Matèriaand Institut de Ciències del Cosmos (ICCUB) Facultat de Física, Universitat de Barcelona,Diagonal 647, E-08028 Barcelona, Catalonia (Spain)

    2016-07-11

    We construct the canonical action of a Carroll string doing the Carroll limit of a canonical relativistic string. We also study the Killing symmetries of the Carroll string, which close under an infinite dimensional algebra. The tensionless limit and the Carroll p-brane action are also discussed.

  18. String Math 2017

    CERN Document Server

    The series of String-Math conferences has developed into a central event on the interface between mathematics and physics related to string theory, quantum field theory and neighboring subjects. The conference will take place from July 24-28 in the main building of Hamburg university. The String-Math conference is organised by the University of Hamburg jointly with DESY Hamburg.

  19. Landmine detection using two-tapped joint orthogonal matching pursuits

    Science.gov (United States)

    Goldberg, Sean; Glenn, Taylor; Wilson, Joseph N.; Gader, Paul D.

    2012-06-01

    Joint Orthogonal Matching Pursuits (JOMP) is used here in the context of landmine detection using data obtained from an electromagnetic induction (EMI) sensor. The response from an object containing metal can be decomposed into a discrete spectrum of relaxation frequencies (DSRF) from which we construct a dictionary. A greedy iterative algorithm is proposed for computing successive residuals of a signal by subtracting away the highest matching dictionary element at each step. The nal condence of a particular signal is a combination of the reciprocal of this residual and the mean of the complex component. A two-tap approach comparing signals on opposite sides of the geometric location of the sensor is examined and found to produce better classication. It is found that using only a single pursuit does a comparable job, reducing complexity and allowing for real-time implementation in automated target recognition systems. JOMP is particularly highlighted in comparison with a previous EMI detection algorithm known as String Match.

  20. Non-static vacuum strings: exterior and interior solutions

    International Nuclear Information System (INIS)

    Stein-Schabes, J.A.

    1986-01-01

    New non-static cylindrically symmetric solutions of Einsteins's equations are presented. Some of these solutions represent string-like objects. An exterior vacuum solution is matched to a non-vacuum interior solution for different forms of the energy-momentum tensor. They generalize the standard static string. 12 refs

  1. Cosmic strings and inflation

    International Nuclear Information System (INIS)

    Vishniac, E.T.

    1987-01-01

    We examine the compatibility of inflation with the cosmic string theory for galaxy formation. There is a general conflict between having sufficient string tension to effect galaxy formation, and reheating after inflation to a high enough temperature that strings may form in a thermal phase transition. To escape this conflict, we propose a class of models where the inflation is coupled to the string-producing field. The strings are formed late in inflation as the inflaton rolls towards its zero-temperature value. A large subset of these models have a novel large-scale distribution of galaxies that is fractal, displays biasing without dynamics or feedback mechanisms, and contains voids. (orig.)

  2. Minimal open strings

    International Nuclear Information System (INIS)

    Hosomichi, Kazuo

    2008-01-01

    We study FZZT-branes and open string amplitudes in (p, q) minimal string theory. We focus on the simplest boundary changing operators in two-matrix models, and identify the corresponding operators in worldsheet theory through the comparison of amplitudes. Along the way, we find a novel linear relation among FZZT boundary states in minimal string theory. We also show that the boundary ground ring is realized on physical open string operators in a very simple manner, and discuss its use for perturbative computation of higher open string amplitudes.

  3. Closed Strings From Nothing

    Energy Technology Data Exchange (ETDEWEB)

    Lawrence, Albion

    2001-07-25

    We study the physics of open strings in bosonic and type II string theories in the presence of unstable D-branes. When the potential energy of the open string tachyon is at its minimum, Sen has argued that only closed strings remain in the perturbative spectrum. We explore the scenario of Yi and of Bergman, Hori and Yi, who argue that the open string degrees of freedom are strongly coupled and disappear through confinement. We discuss arguments using open string field theory and worldsheet boundary RG flows, which seem to indicate otherwise. We then describe a solitonic excitation of the open string tachyon and gauge field with the charge and tension of a fundamental closed string. This requires a double scaling limit where the tachyon is taken to its minimal value and the electric field is taken to its maximum value. The resulting flux tube has an unconstrained spatial profile; and for large fundamental string charge, it appears to have light, weakly coupled open strings living in the core. We argue that the flux tube acquires a size or order {alpha}' through sigma model and string coupling effects; and we argue that confinement effects make the light degrees of freedom heavy and strongly interacting.

  4. Closed Strings From Nothing

    International Nuclear Information System (INIS)

    Lawrence, Albion

    2001-01-01

    We study the physics of open strings in bosonic and type II string theories in the presence of unstable D-branes. When the potential energy of the open string tachyon is at its minimum, Sen has argued that only closed strings remain in the perturbative spectrum. We explore the scenario of Yi and of Bergman, Hori and Yi, who argue that the open string degrees of freedom are strongly coupled and disappear through confinement. We discuss arguments using open string field theory and worldsheet boundary RG flows, which seem to indicate otherwise. We then describe a solitonic excitation of the open string tachyon and gauge field with the charge and tension of a fundamental closed string. This requires a double scaling limit where the tachyon is taken to its minimal value and the electric field is taken to its maximum value. The resulting flux tube has an unconstrained spatial profile; and for large fundamental string charge, it appears to have light, weakly coupled open strings living in the core. We argue that the flux tube acquires a size or order α' through sigma model and string coupling effects; and we argue that confinement effects make the light degrees of freedom heavy and strongly interacting

  5. The arithmetic of strings

    International Nuclear Information System (INIS)

    Freund, P.G.O.

    1988-01-01

    According to the author nobody has succeeded as yet in extracting any new numbers from string theory. This paper discusses how if one cannot get new numbers from string theory, maybe one can get new strings out of number theory. Number theory is generally regarded as the purest form of mathematics. So how can it conceivably make contact with physics which aims at describing nature? The author discusses how the connecting link of these two disciplines is provided by the compact Riemann surfaces. These appear as world sheets of interacting strings. For instance, string-string scattering at the three-loop level involves the four external strings attaching themselves to a genus three compact surface

  6. Citation Matching in Sanskrit Corpora Using Local Alignment

    Science.gov (United States)

    Prasad, Abhinandan S.; Rao, Shrisha

    Citation matching is the problem of finding which citation occurs in a given textual corpus. Most existing citation matching work is done on scientific literature. The goal of this paper is to present methods for performing citation matching on Sanskrit texts. Exact matching and approximate matching are the two methods for performing citation matching. The exact matching method checks for exact occurrence of the citation with respect to the textual corpus. Approximate matching is a fuzzy string-matching method which computes a similarity score between an individual line of the textual corpus and the citation. The Smith-Waterman-Gotoh algorithm for local alignment, which is generally used in bioinformatics, is used here for calculating the similarity score. This similarity score is a measure of the closeness between the text and the citation. The exact- and approximate-matching methods are evaluated and compared. The methods presented can be easily applied to corpora in other Indic languages like Kannada, Tamil, etc. The approximate-matching method can in particular be used in the compilation of critical editions and plagiarism detection in a literary work.

  7. Algorithms

    Indian Academy of Sciences (India)

    to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

  8. Electric drill-string telemetry

    CERN Document Server

    Carcione, J M

    2003-01-01

    We design a numerical algorithm for simulation of low-frequency electric-signal transmission through a drill string. This is represented by a transmission line with varying geometrical and electromagnetic properties versus depth, depending on the characteristics of the drill-string/formation system. These properties are implicitly modeled by the series impedance and the shunt admittance of the transmission line. The differential equations are parabolic, since at low frequencies the wave field is diffusive. We use an explicit scheme for the solution of parabolic problems, based on a Chebyshev expansion of the evolution operator and the Fourier pseudospectral method to compute the spatial derivatives. The results are verified by comparison to analytical solutions obtained for the initial-value problem with a voltage source.

  9. BRST invariant mixed string vertex for the bosonic string

    International Nuclear Information System (INIS)

    Clarizia, A.; Pezzella, F.

    1987-09-01

    We construct a BRST invariant (N+M)-string vertex including both open and closed string states. When we saturate it with N open string and M closed string physical states it reproduces their corresponding scattering amplitude. As a particular case we obtain BRST invariant vertex for the open-closed string transition. (orig.)

  10. Open-closed string correspondence in open string field theory

    International Nuclear Information System (INIS)

    Baumgartl, M.; Sachs, I.

    2008-01-01

    We address the problem of describing different closed string backgrounds in background independent open string field theory: A shift in the closed string background corresponds to a collective excitation of open strings. As an illustration we apply the formalism to the case where the closed string background is a group manifold. (Abstract Copyright [2008], Wiley Periodicals, Inc.)

  11. Strings, texture, and inflation

    International Nuclear Information System (INIS)

    Hodges, H.M.; Primack, J.R.

    1991-01-01

    We examine mechanisms, several of which are proposed here, to generate structure formation, or to just add large-scale features, through either gauged or global cosmic strings or global texture, within the framework of inflation. We first explore the possibility that strings or texture form if there is no coupling between the topological theory and the inflaton or spacetime curvature, via (1) quantum creation, and (2) a sufficiently high reheat temperature. In addition, we examine the prospects for the inflaton field itself to generate strings or texture. Then, models with the string/texture field coupled to the curvature, and an equivalent model with coupling to the inflaton field, are considered in detail. The requirement that inflationary density fluctuations are not so large as to conflict with observations leads to a number of constraints on model parameters. We find that strings of relevance for structure formation can form in the absence of coupling to the inflaton or curvature through the process of quantum creation, but only if the strings are strongly type I, or if they are global strings. If formed after reheating, naturalness suggests that gauged cosmic strings correspond to a type-I superconductor. Similarly, gauged strings formed during inflation via conformal coupling ξ=1/6 to the spacetime curvature (in a model suggested by Yokoyama in order to evade the millisecond pulsar constraint on cosmic strings) are expected to be strongly type I

  12. Speeding Up the String Comparison of the IDS Snort using Parallel Programming: A Systematic Literature Review on the Parallelized Aho-Corasick Algorithm

    Directory of Open Access Journals (Sweden)

    SILVA JUNIOR,J. B.

    2016-12-01

    Full Text Available The Intrusion Detection System (IDS needs to compare the contents of all packets arriving at the network interface with a set of signatures for indicating possible attacks, a task that consumes much CPU processing time. In order to alleviate this problem, some researchers have tried to parallelize the IDS's comparison engine, transferring execution from the CPU to GPU. This paper identifies and maps the parallelization features of the Aho-Corasick algorithm, which is used in Snort to compare patterns, in order to show this algorithm's implementation and execution issues, as well as optimization techniques for the Aho-Corasick machine. We have found 147 papers from important computer science publications databases, and have mapped them. We selected 22 and analyzed them in order to find our results. Our analysis of the papers showed, among other results, that parallelization of the AC algorithm is a new task and the authors have focused on the State Transition Table as the most common way to implement the algorithm on the GPU. Furthermore, we found that some techniques speed up the algorithm and reduce the required machine storage space are highly used, such as the algorithm running on the fastest memories and mechanisms for reducing the number of nodes and bit maping.

  13. Combining Fragment-Ion and Neutral-Loss Matching during Mass Spectral Library Searching: A New General Purpose Algorithm Applicable to Illicit Drug Identification.

    Science.gov (United States)

    Moorthy, Arun S; Wallace, William E; Kearsley, Anthony J; Tchekhovskoi, Dmitrii V; Stein, Stephen E

    2017-12-19

    A mass spectral library search algorithm that identifies compounds that differ from library compounds by a single "inert" structural component is described. This algorithm, the Hybrid Similarity Search, generates a similarity score based on matching both fragment ions and neutral losses. It employs the parameter DeltaMass, defined as the mass difference between query and library compounds, to shift neutral loss peaks in the library spectrum to match corresponding neutral loss peaks in the query spectrum. When the spectra being compared differ by a single structural feature, these matching neutral loss peaks should contain that structural feature. This method extends the scope of the library to include spectra of "nearest-neighbor" compounds that differ from library compounds by a single chemical moiety. Additionally, determination of the structural origin of the shifted peaks can aid in the determination of the chemical structure and fragmentation mechanism of the query compound. A variety of examples are presented, including the identification of designer drugs and chemical derivatives not present in the library.

  14. The best of a BAD situation: Optimising an algorithm to match course resolution SAR vessel detections to sparse AIS data

    CSIR Research Space (South Africa)

    Meyer, Rory GV

    2017-07-01

    Full Text Available The detection and classification of SAR imaged vessels at sea is a valuable ability for organisations interested in the marine environment or marine vessels. Matching the SAR detected vessels to their AIS messages allows vessels to be identified...

  15. FindFoci: a focus detection algorithm with automated parameter training that closely matches human assignments, reduces human inconsistencies and increases speed of analysis.

    Directory of Open Access Journals (Sweden)

    Alex D Herbert

    Full Text Available Accurate and reproducible quantification of the accumulation of proteins into foci in cells is essential for data interpretation and for biological inferences. To improve reproducibility, much emphasis has been placed on the preparation of samples, but less attention has been given to reporting and standardizing the quantification of foci. The current standard to quantitate foci in open-source software is to manually determine a range of parameters based on the outcome of one or a few representative images and then apply the parameter combination to the analysis of a larger dataset. Here, we demonstrate the power and utility of using machine learning to train a new algorithm (FindFoci to determine optimal parameters. FindFoci closely matches human assignments and allows rapid automated exploration of parameter space. Thus, individuals can train the algorithm to mirror their own assignments and then automate focus counting using the same parameters across a large number of images. Using the training algorithm to match human assignments of foci, we demonstrate that applying an optimal parameter combination from a single image is not broadly applicable to analysis of other images scored by the same experimenter or by other experimenters. Our analysis thus reveals wide variation in human assignment of foci and their quantification. To overcome this, we developed training on multiple images, which reduces the inconsistency of using a single or a few images to set parameters for focus detection. FindFoci is provided as an open-source plugin for ImageJ.

  16. Topics in string theory

    International Nuclear Information System (INIS)

    Neveu, A.

    1986-01-01

    There exist several string models. In the first lecture, the simplest one, the open bosonic string, which turns out to live most naturally in 26 dimensions will be described in some detail. In the second lecture, the closed bosonic strings, and the open and closed 10-dimensional strings (superstrings) are reviewed. In the third lecture, various compactification schemes which have been proposed to deal with the extra space dimensions, from 4 to 10 or 26 are dealt with; in particular, the Frenkel-Kac construction which builds non-Abelian internal symmetry groups out of the compactified dimensions, and the resulting heterotic string are described. Finally, in the fourth lecture, the important problem of the second quantization of string theories, and of the underlying gauge invariance which is responsible for the possibility of dealing, in a consistent fashion, with interacting high-spin states without negative metric is addressed. 41 references, 8 figures

  17. Strings and quantum gravity

    International Nuclear Information System (INIS)

    Vega, H.J. de

    1990-01-01

    One of the main challenges in theoretical physics today is the unification of all interactions including gravity. At present, string theories appear as the most promising candidates to achieve such a unification. However, gravity has not completely been incorporated in string theory, many technical and conceptual problems remain and a full quantum theory of gravity is still non-existent. Our aim is to properly understand strings in the context of quantum gravity. Attempts towards this are reviewed. (author)

  18. 6d string chains

    Science.gov (United States)

    Gadde, Abhijit; Haghighat, Babak; Kim, Joonho; Kim, Seok; Lockhart, Guglielmo; Vafa, Cumrun

    2018-02-01

    We consider bound states of strings which arise in 6d (1,0) SCFTs that are realized in F-theory in terms of linear chains of spheres with negative self-intersections 1,2, and 4. These include the strings associated to N small E 8 instantons, as well as the ones associated to M5 branes probing A and D type singularities in M-theory or D5 branes probing ADE singularities in Type IIB string theory. We find that these bound states of strings admit (0,4) supersymmetric quiver descriptions and show how one can compute their elliptic genera.

  19. QCD and string theories

    International Nuclear Information System (INIS)

    Cohen-Tannoudji, G.

    1990-01-01

    This paper is devoted to a review of the connections between quantumchromodynamics (QCD) and string theories. One reviews the phenomenological models leading to string pictures in non perturbative QCD and the string effects, related to soft gluon coherence, which arise in perturbative QCD. One tries to build a string theory which goes to QCD at the zero slope limit. A specific model, based on superstring theories is shown to agree with QCD four point amplitudes at the Born approximation and with one loop corrections. One shows how this approach can provide a theoretical framework to account for the phenomenological property of parton-hadron duality

  20. Thermodynamics of quantum strings

    CERN Document Server

    Morgan, M J

    1994-01-01

    A statistical mechanical analysis of an ideal gas of non-relativistic quantum strings is presented, in which the thermodynamic properties of the string gas are calculated from a canonical partition function. This toy model enables students to gain insight into the thermodynamics of a simple 'quantum field' theory, and provides a useful pedagogical introduction to the more complicated relativistic string theories. A review is also given of the thermodynamics of the open bosonic string gas and the type I (open) superstring gas. (author)

  1. Interpolating string field theories

    International Nuclear Information System (INIS)

    Zwiebach, B.

    1992-01-01

    This paper reports that a minimal area problem imposing different length conditions on open and closed curves is shown to define a one-parameter family of covariant open-closed quantum string field theories. These interpolate from a recently proposed factorizable open-closed theory up to an extended version of Witten's open string field theory capable of incorporating on shell closed strings. The string diagrams of the latter define a new decomposition of the moduli spaces of Riemann surfaces with punctures and boundaries based on quadratic differentials with both first order and second order poles

  2. Heterotic cosmic strings

    International Nuclear Information System (INIS)

    Becker, Katrin; Becker, Melanie; Krause, Axel

    2006-01-01

    We show that all three conditions for the cosmological relevance of heterotic cosmic strings, the right tension, stability and a production mechanism at the end of inflation, can be met in the strongly coupled M-theory regime. Whereas cosmic strings generated from weakly coupled heterotic strings have the well-known problems posed by Witten in 1985, we show that strings arising from M5-branes wrapped around 4-cycles (divisors) of a Calabi-Yau in heterotic M-theory compactifications solve these problems in an elegant fashion

  3. Stretching cosmic strings

    International Nuclear Information System (INIS)

    Turok, N.; Bhattacharjee, P.

    1984-01-01

    The evolution of a network of strings produced at a grand-unification phase transition in an expanding universe is discussed, with particular reference to the processes of energy exchange between the strings and the rest of the universe. This is supported by numerical calculations simulating the behavior of strings in an expanding universe. It is found that in order that the energy density of the strings does not come to dominate the total energy density there must be an efficient mechanism for energy loss: the only plausible one being the production of closed loops and their subsequent decay via gravitational radiation

  4. QCD and hadronic strings

    International Nuclear Information System (INIS)

    Cohen-Tannoudji, G.

    1989-01-01

    This series of lectures is devoted to review ot he connections between QCD and string theories. One reviews the phenomenological models leading to string pictures in non perturbative QCD and the string effects, related to soft gluon coherence, which arise in perturbative QCD. One tries to build a string theory which goes to QCD at the zero slope limit. A specific model, based on superstring theories is shown to agree with QCD four point amplitudes at the Born approximation and with one loop corrections. One shows how this approach can provide a theoretical framework to account for the phenomenological property of parton-hadron duality.(author)

  5. Design of Robust Supertwisting Algorithm Based Second-Order Sliding Mode Controller for Nonlinear Systems with Both Matched and Unmatched Uncertainty

    Directory of Open Access Journals (Sweden)

    Marwa Jouini

    2017-01-01

    Full Text Available This paper proposes a robust supertwisting algorithm (STA design for nonlinear systems where both matched and unmatched uncertainties are considered. The main contributions reside primarily to conceive a novel structure of STA, in order to ensure the desired performance of the uncertain nonlinear system. The modified algorithm is formed of double closed-loop feedback, in which two linear terms are added to the classical STA. In addition, an integral sliding mode switching surface is proposed to construct the attractiveness and reachability of sliding mode. Sufficient conditions are derived to guarantee the exact differentiation stability in finite time based on Lyapunov function theory. Finally, a comparative study for a variable-length pendulum system illustrates the robustness and the effectiveness of the proposed approach compared to other STA schemes.

  6. Open String Diagrams I: Topological Type

    OpenAIRE

    Nag, Subhashis; Sankaran, Parameswaran

    1992-01-01

    An arbitrary Feynman graph for string field theory interactions is analysed and the homeomorphism type of the corresponding world sheet surface is completely determined even in the non-orientable cases. Algorithms are found to mechanically compute the topological characteristics of the resulting surface from the structure of the signed oriented graph. Whitney's permutation-theoretic coding of graphs is utilized.

  7. Gravity from strings

    International Nuclear Information System (INIS)

    Deser, S.

    1987-01-01

    We obtain the Einstein action plus quadratic curvature corrections generated by closed bosonic, heterotic and supersymmetric strings by matching the four-graviton amplitude (to first order in the slope parameter and fourth power of momenta) with an effective local gravitational action. The resulting corrections are first shown to be of the Gauss-Bonnet form. It is then noted that, by the very nature of the slope expansion, the field-redefinition theorem applies. Consequently, only the curvature-squared term is determined, while squares of its contractions are explicitly seen not to contribute. This latter property has a generalization to all orders which implies that the effective gravitational action is unavoidably ghost-free. The properties of solutions to these corrected theories are then examined. First neglecting dilatons, we find the explicit 'Schwarzschild' metrics. Both asymptotically flat and de Sitter solutions are present. The latter are however shown to be unstable. The former have horizons and singularities which are respectively smaller and less violent than in Einstein gravity; the correct sign of the slope parameter also ensures absence of naked singularities. When dilatons are included, the cosmological vacua are gratifyingly excluded. (orig.)

  8. Clinical application and validation of an iterative forward projection matching algorithm for permanent brachytherapy seed localization from conebeam-CT x-ray projections

    Energy Technology Data Exchange (ETDEWEB)

    Pokhrel, Damodar; Murphy, Martin J.; Todor, Dorin A.; Weiss, Elisabeth; Williamson, Jeffrey F. [Department of Radiation Oncology, School of Medicine, Virginia Commonwealth University, Richmond, Virginia 23298 (United States)

    2010-09-15

    Purpose: To experimentally validate a new algorithm for reconstructing the 3D positions of implanted brachytherapy seeds from postoperatively acquired 2D conebeam-CT (CBCT) projection images. Methods: The iterative forward projection matching (IFPM) algorithm finds the 3D seed geometry that minimizes the sum of the squared intensity differences between computed projections of an initial estimate of the seed configuration and radiographic projections of the implant. In-house machined phantoms, containing arrays of 12 and 72 seeds, respectively, are used to validate this method. Also, four {sup 103}Pd postimplant patients are scanned using an ACUITY digital simulator. Three to ten x-ray images are selected from the CBCT projection set and processed to create binary seed-only images. To quantify IFPM accuracy, the reconstructed seed positions are forward projected and overlaid on the measured seed images to find the nearest-neighbor distance between measured and computed seed positions for each image pair. Also, the estimated 3D seed coordinates are compared to known seed positions in the phantom and clinically obtained VariSeed planning coordinates for the patient data. Results: For the phantom study, seed localization error is (0.58{+-}0.33) mm. For all four patient cases, the mean registration error is better than 1 mm while compared against the measured seed projections. IFPM converges in 20-28 iterations, with a computation time of about 1.9-2.8 min/iteration on a 1 GHz processor. Conclusions: The IFPM algorithm avoids the need to match corresponding seeds in each projection as required by standard back-projection methods. The authors' results demonstrate {approx}1 mm accuracy in reconstructing the 3D positions of brachytherapy seeds from the measured 2D projections. This algorithm also successfully localizes overlapping clustered and highly migrated seeds in the implant.

  9. Clinical application and validation of an iterative forward projection matching algorithm for permanent brachytherapy seed localization from conebeam-CT x-ray projections.

    Science.gov (United States)

    Pokhrel, Damodar; Murphy, Martin J; Todor, Dorin A; Weiss, Elisabeth; Williamson, Jeffrey F

    2010-09-01

    To experimentally validate a new algorithm for reconstructing the 3D positions of implanted brachytherapy seeds from postoperatively acquired 2D conebeam-CT (CBCT) projection images. The iterative forward projection matching (IFPM) algorithm finds the 3D seed geometry that minimizes the sum of the squared intensity differences between computed projections of an initial estimate of the seed configuration and radiographic projections of the implant. In-house machined phantoms, containing arrays of 12 and 72 seeds, respectively, are used to validate this method. Also, four 103Pd postimplant patients are scanned using an ACUITY digital simulator. Three to ten x-ray images are selected from the CBCT projection set and processed to create binary seed-only images. To quantify IFPM accuracy, the reconstructed seed positions are forward projected and overlaid on the measured seed images to find the nearest-neighbor distance between measured and computed seed positions for each image pair. Also, the estimated 3D seed coordinates are compared to known seed positions in the phantom and clinically obtained VariSeed planning coordinates for the patient data. For the phantom study, seed localization error is (0.58 +/- 0.33) mm. For all four patient cases, the mean registration error is better than 1 mm while compared against the measured seed projections. IFPM converges in 20-28 iterations, with a computation time of about 1.9-2.8 min/ iteration on a 1 GHz processor. The IFPM algorithm avoids the need to match corresponding seeds in each projection as required by standard back-projection methods. The authors' results demonstrate approximately 1 mm accuracy in reconstructing the 3D positions of brachytherapy seeds from the measured 2D projections. This algorithm also successfully localizes overlapping clustered and highly migrated seeds in the implant.

  10. Butterfly tachyons in vacuum string field theory

    International Nuclear Information System (INIS)

    Matlock, Peter

    2003-01-01

    We use geometrical conformal field theory methods to investigate tachyon fluctuations about the butterfly projector state in vacuum string field theory. We find that the on-shell condition for the tachyon field is equivalent to the requirement that the quadratic term in the string-field action vanish on shell. This further motivates the interpretation of the butterfly state as a D-brane. We begin a calculation of the tension of the butterfly, and conjecture that this will match the case of the sliver and further strengthen this interpretation

  11. Efficient Disk-Based Techniques for Manipulating Very Large String Databases

    KAUST Repository

    Allam, Amin

    2017-05-18

    Indexing and processing strings are very important topics in database management. Strings can be database records, DNA sequences, protein sequences, or plain text. Various string operations are required for several application categories, such as bioinformatics and entity resolution. When the string count or sizes become very large, several state-of-the-art techniques for indexing and processing such strings may fail or behave very inefficiently. Modifying an existing technique to overcome these issues is not usually straightforward or even possible. A category of string operations can be facilitated by the suffix tree data structure, which basically indexes a long string to enable efficient finding of any substring of the indexed string, and can be used in other operations as well, such as approximate string matching. In this document, we introduce a novel efficient method to construct the suffix tree index for very long strings using parallel architectures, which is a major challenge in this category. Another category of string operations require clustering similar strings in order to perform application-specific processing on the resulting possibly-overlapping clusters. In this document, based on clustering similar strings, we introduce a novel efficient technique for record linkage and entity resolution, and a novel method for correcting errors in a large number of small strings (read sequences) generated by the DNA sequencing machines.

  12. Algorithms

    Indian Academy of Sciences (India)

    ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...

  13. 1-Colored Archetypal Permutations and Strings of Degree n

    Directory of Open Access Journals (Sweden)

    Gheorghe Eduard Tara

    2012-10-01

    Full Text Available New notions related to permutations are introduced here. We present the string of a 1-colored permutation as a closed planar curve, the fundamental 1-colored permutation as an equivalence class related to the equivalence in strings of the 1-colored permutations. We give formulas for the number of the 1-colored archetypal permutations of degree n. We establish an algorithm to identify the 1- colored archetypal permutations of degree n and we present the atlas of the 1-colored archetypal strings of degree n, n ≤ 7, based on this algorithm.

  14. Semilocal and electroweak strings

    NARCIS (Netherlands)

    Achucarro, A; Vachaspati, T

    We review a class of non-topological defects in the standard electroweak model, and their implications. Starting with the semilocal string, which provides a counterexample to many well-known properties of topological vortices, we discuss electroweak strings and their stability with and without

  15. Disordered chaotic strings

    DEFF Research Database (Denmark)

    Schäfer, Mirko; Greiner, Martin

    2011-01-01

    to chaotic strings. Inhomogeneous coupling weights as well as small-world perturbations of the ring-network structure are discussed. It is found that certain combinations of coupling and network disorder preserve the empirical relationship between chaotic strings and the weak and strong sector...

  16. A rotating string

    International Nuclear Information System (INIS)

    Jensen, B.

    1993-06-01

    The author presents a global solution of Einstein's equations which represents a rotating cosmic string with a finite coreradius. The importance of pressure for the generation of closed timelike curves outside the coreregion of such strings is clearly displayed in this model due to the simplicity of the source. 10 refs

  17. Derandomizing from random strings

    NARCIS (Netherlands)

    Buhrman, H.; Fortnow, L.; Koucký, M.; Loff, B.

    2010-01-01

    In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings R(K). It was previously known that PSPACE, and hence BPP is Turing-reducible to R(K). The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial

  18. Unification of string dualities

    International Nuclear Information System (INIS)

    Sen, A.

    1997-01-01

    We argue that all conjectured dualities involving various string, M- and F-theory compactifications can be 'derived' from the conjectured duality between type I and SO(32) heterotic string theory, T-dualities and the definition of M-and F-theories. (orig.)

  19. Introduction to string theory

    CERN Multimedia

    CERN. Geneva. Audiovisual Unit

    2002-01-01

    I will present a simple and non-technical overview of string theory, aimed for non-experts who like to get some idea what string theory is about. Besides introductory material, I intend to cover also some of the more recent developments.

  20. StringForce

    DEFF Research Database (Denmark)

    Barendregt, Wolmet; Börjesson, Peter; Eriksson, Eva

    2017-01-01

    In this paper, we present the forced collaborative interaction game StringForce. StringForce is developed for a special education context to support training of collaboration skills, using readily available technologies and avoiding the creation of a "mobile bubble". In order to play String......Force two or four physically collocated tablets are required. These tablets are connected to form one large shared game area. The game can only be played by collaborating. StringForce extends previous work, both technologically and regarding social-emotional training. We believe String......Force to be an interesting demo for the IDC community, as it intertwines several relevant research fields, such as mobile interaction and collaborative gaming in the special education context....

  1. String-Math 2015

    CERN Document Server

    2015-01-01

    Welcome to String-Math 2015 at Sanya. The conference will be opened in December 31, 2015- January 4, 2016. String theory plays a central role in theoretical physics as a candidate for the quantum theory unifying gravity with other interactions. It has profound connections with broad branches of modern mathematics ever since the birth. In the last decades, the prosperous interaction, built upon the joint efforts from both mathematicians and physicists, has given rise to marvelous deep results in supersymmetric gauge theory, topological string, M-theory and duality on the physics side as well as in algebraic geometry, differential geometry, algebraic topology, representation theory and number theory on the mathematics side. The interplay is two-fold. The mathematics has provided powerful tools to fulfill the physical interconnection of ideas and clarify physical structures to understand the nature of string theory. On the other hand, ideas from string theory and quantum field theory have been a source of sign...

  2. Open string model building

    International Nuclear Information System (INIS)

    Ishibashi, Nobuyuki; Onogi, Tetsuya

    1989-01-01

    Consistency conditions of open string theories, which can be a powerful tool in open string model building, are proposed. By making use of these conditions and assuming a simple prescription for the Chan-Paton factors, open string theories in several backgrounds are studied. We show that 1. there exist a large number of consistent bosonic open string theories on Z 2 orbifolds, 2. SO(32) type I superstring is the unique consistent model among fermionic string theories on the ten-dimensional flat Minkowski space, and 3. with our prescription for the Chan-Paton factors, there exist no consistent open superstring theories on (six-dimensional Minkowski space-time) x (Z 2 orbifold). (orig.)

  3. Can a semi-automated surface matching and principal axis-based algorithm accurately quantify femoral shaft fracture alignment in six degrees of freedom?

    Science.gov (United States)

    Crookshank, Meghan C; Beek, Maarten; Singh, Devin; Schemitsch, Emil H; Whyne, Cari M

    2013-07-01

    Accurate alignment of femoral shaft fractures treated with intramedullary nailing remains a challenge for orthopaedic surgeons. The aim of this study is to develop and validate a cone-beam CT-based, semi-automated algorithm to quantify the malalignment in six degrees of freedom (6DOF) using a surface matching and principal axes-based approach. Complex comminuted diaphyseal fractures were created in nine cadaveric femora and cone-beam CT images were acquired (27 cases total). Scans were cropped and segmented using intensity-based thresholding, producing superior, inferior and comminution volumes. Cylinders were fit to estimate the long axes of the superior and inferior fragments. The angle and distance between the two cylindrical axes were calculated to determine flexion/extension and varus/valgus angulation and medial/lateral and anterior/posterior translations, respectively. Both surfaces were unwrapped about the cylindrical axes. Three methods of matching the unwrapped surface for determination of periaxial rotation were compared based on minimizing the distance between features. The calculated corrections were compared to the input malalignment conditions. All 6DOF were calculated to within current clinical tolerances for all but two cases. This algorithm yielded accurate quantification of malalignment of femoral shaft fractures for fracture gaps up to 60 mm, based on a single CBCT image of the fractured limb. Copyright © 2012 IPEM. Published by Elsevier Ltd. All rights reserved.

  4. A multi-stage heuristic algorithm for matching problem in the modified miniload automated storage and retrieval system of e-commerce

    Science.gov (United States)

    Wang, Wenrui; Wu, Yaohua; Wu, Yingying

    2016-05-01

    E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can't fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

  5. A reduced covariant string model for the extrinsic string

    International Nuclear Information System (INIS)

    Botelho, L.C.L.

    1989-01-01

    It is studied a reduced covariant string model for the extrinsic string by using Polyakov's path integral formalism. On the basis of this reduced model it is suggested that the extrinsic string has its critical dimension given by 13. Additionally, it is calculated in a simple way Poliakov's renormalization group law for the string rigidity coupling constants. (A.C.A.S.) [pt

  6. String field theory

    International Nuclear Information System (INIS)

    Kaku, M.

    1987-01-01

    In this article, the authors summarize the rapid progress in constructing string field theory actions, such as the development of the covariant BRST theory. They also present the newer geometric formulation of string field theory, from which the BRST theory and the older light cone theory can be derived from first principles. This geometric formulation allows us to derive the complete field theory of strings from two geometric principles, in the same way that general relativity and Yang-Mills theory can be derived from two principles based on global and local symmetry. The geometric formalism therefore reduces string field theory to a problem of finding an invariant under a new local gauge group they call the universal string group (USG). Thus, string field theory is the gauge theory of the universal string group in much the same way that Yang-Mills theory is the gauge theory of SU(N). The geometric formulation places superstring theory on the same rigorous group theoretical level as general relativity and gauge theory

  7. Algorithms

    Indian Academy of Sciences (India)

    algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).

  8. Algorithms

    Indian Academy of Sciences (India)

    algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...

  9. Supergravity duals of matrix string theory

    International Nuclear Information System (INIS)

    Morales, Jose F.; Samtleben, Henning

    2002-01-01

    We study holographic duals of type II and heterotic matrix string theories described by warped AdS 3 supergravities. By explicitly solving the linearized equations of motion around near horizon D-string geometries, we determine the spectrum of Kaluza-Klein primaries for type I, II supergravities on warped AdS 3 xS 7 . The results match those coming from the dual two-dimensional gauge theories living on the D-string worldvolumes. We briefly discuss the connections with the N=(8,8), N=(8,0) orbifold superconformal field theories to which type IIB/heterotic matrix strings flow in the infrared. In particular, we associate the dimension (h,h-bar) (32,32) twisted operator which brings the matrix string theories out from the conformal point (R; 8 ) N /S N with the dilaton profile in the supergravity background. The familiar dictionary between masses and 'scaling' dimensions of field and operators are modified by the presence of non-trivial warp factors and running dilatons. These modifications are worked out for the general case of domain wall/QFT correspondences between supergravities on warped AdS d+1 xS q geometries and super Yang-Mills theories with 16 supercharges. (author)

  10. Duality relation between charged elastic strings and superconducting cosmic strings

    International Nuclear Information System (INIS)

    Carter, B.

    1989-01-01

    The mechanical properties of macroscopic electromagnetically coupled string models in a flat or curved background are treated using a covariant formalism allowing the construction of a duality transformation that relates the category of uniform ''electric'' string models, constructed as the (nonconducting) charged generalisation of ordinary uncoupled (violin type) elastic strings, to a category of ''magnetic'' string models comprising recently discussed varieties of ''superconducting cosmic strings''. (orig.)

  11. Lattice gravity and strings

    International Nuclear Information System (INIS)

    Jevicki, A.; Ninomiya, M.

    1985-01-01

    We are concerned with applications of the simplicial discretization method (Regge calculus) to two-dimensional quantum gravity with emphasis on the physically relevant string model. Beginning with the discretization of gravity and matter we exhibit a discrete version of the conformal trace anomaly. Proceeding to the string problem we show how the direct approach of (finite difference) discretization based on Nambu action corresponds to unsatisfactory treatment of gravitational degrees. Based on the Regge approach we then propose a discretization corresponding to the Polyakov string. In this context we are led to a natural geometric version of the associated Liouville model and two-dimensional gravity. (orig.)

  12. Superconducting cosmic strings

    International Nuclear Information System (INIS)

    Chudnovsky, E.M.; Field, G.B.; Spergel, D.N.; Vilenkin, A.

    1986-01-01

    Superconducting loops of string formed in the early Universe, if they are relatively light, can be an important source of relativistic particles in the Galaxy. They can be observed as sources of synchrotron radiation at centimeter wavelengths. We propose a string model for two recently discovered radio sources, the ''thread'' in the galactic center and the source G357.7-0.1, and predict that the filaments in these sources should move at relativistic speeds. We also consider superheavy superconducting strings, and the possibility that they be observed as extragalactic radio sources

  13. Final Report: "Strings 2014"

    Energy Technology Data Exchange (ETDEWEB)

    Witten, Edward

    2015-10-21

    The Strings 2014 meeting was held at Princeton University June 23-27, 2014, co-sponsored by Princeton University and the Institute for Advanced Study. The goal of the meeting was to provide a stimulating and up-to-date overview of research in string theory and its relations to other areas of physics and mathematics, ranging from geometry to quantum field theory, condensed matter physics, and more. This brief report lists committee members and speakers but contains no scientific information. Note that the talks at Strings 2014 were videotaped and are available on the conference website: http://physics.princeton.edustrings2014/Talk_titles.shtml.

  14. A disintegrating cosmic string

    International Nuclear Information System (INIS)

    Griffiths, J B; Docherty, P

    2002-01-01

    We present a simple sandwich gravitational wave of the Robinson-Trautman family. This is interpreted as representing a shock wave with a spherical wavefront which propagates into a Minkowski background minus a wedge (i.e. the background contains a cosmic string). The deficit angle (the tension) of the string decreases through the gravitational wave, which then ceases. This leaves an expanding spherical region of Minkowski space behind it. The decay of the cosmic string over a finite interval of retarded time may be considered to generate the gravitational wave. (letter to the editor)

  15. Baryon string model

    International Nuclear Information System (INIS)

    Klimenko, S.V.; Kochin, V.N.; Plyushchaj, M.S.; Pron'ko, G.P.; Razumov, A.V.; Samarin, A.V.

    1985-01-01

    Partial solutions to classical equations of three-string motion are considered. Simplest solutions, when three-string center moving with high velocity, are co nsidered. Single-mode solutions are studied. Explicit form of their parametrization is obtained and three-string dynamics visualization is made. Means of graphic packet ''Atom'' were used for visualization. A set of processes for graphic representation of multiparametric functions is developed. Peculiarity of these processes is a wide class of functions, which are represented by parametric, coordinate and functional isolines

  16. Exceptional groups from open strings

    International Nuclear Information System (INIS)

    Gaberdiel, M.R.; Zwiebach, B.

    1998-01-01

    We consider type IIB theory compactified on a two-sphere in the presence of mutually non-local 7-branes. The BPS states associated with the gauge vectors of exceptional groups are seen to arise from open strings connecting the 7-branes, and multi-pronged open strings capable of ending on more than two 7-branes. These multi-pronged strings are built from open string junctions that arise naturally when strings cross 7-branes. The different string configurations can be multiplied as traditional open strings, and are shown to generate the structure of exceptional groups. (orig.)

  17. A fast complex domain-matching pursuit algorithm and its application to deep-water gas reservoir detection

    Science.gov (United States)

    Zeng, Jing; Huang, Handong; Li, Huijie; Miao, Yuxin; Wen, Junxiang; Zhou, Fei

    2017-12-01

    The main emphasis of exploration and development is shifting from simple structural reservoirs to complex reservoirs, which all have the characteristics of complex structure, thin reservoir thickness and large buried depth. Faced with these complex geological features, hydrocarbon detection technology is a direct indication of changes in hydrocarbon reservoirs and a good approach for delimiting the distribution of underground reservoirs. It is common to utilize the time-frequency (TF) features of seismic data in detecting hydrocarbon reservoirs. Therefore, we research the complex domain-matching pursuit (CDMP) method and propose some improvements. First is the introduction of a scale parameter, which corrects the defect that atomic waveforms only change with the frequency parameter. Its introduction not only decomposes seismic signal with high accuracy and high efficiency but also reduces iterations. We also integrate jumping search with ergodic search to improve computational efficiency while maintaining the reasonable accuracy. Then we combine the improved CDMP with the Wigner-Ville distribution to obtain a high-resolution TF spectrum. A one-dimensional modeling experiment has proved the validity of our method. Basing on the low-frequency domain reflection coefficient in fluid-saturated porous media, we finally get an approximation formula for the mobility attributes of reservoir fluid. This approximation formula is used as a hydrocarbon identification factor to predict deep-water gas-bearing sand of the M oil field in the South China Sea. The results are consistent with the actual well test results and our method can help inform the future exploration of deep-water gas reservoirs.

  18. Algorithms

    Indian Academy of Sciences (India)

    will become clear in the next article when we discuss a simple logo like programming language. ... Rod B may be used as an auxiliary store. The problem is to find an algorithm which performs this task. ... No disks are moved from A to Busing C as auxiliary rod. • move _disk (A, C);. (No + l)th disk is moved from A to C directly ...

  19. Cosmic strings and cosmic structure

    International Nuclear Information System (INIS)

    Albrecht, A.; Brandenberger, R.; Turok, N.

    1987-01-01

    The paper concerns the application of the theory of cosmic strings to explain the structure of the Universe. The formation of cosmic strings in the early Universe is outlined, along with the Big Bang theory, Grand Unified theories, and the first three minutes after the Big Bang. A description is given of the shaping of the Universe by cosmic strings, including the evolution of the string. The possibility for direct observation of cosmic strings is discussed. (U.K.)

  20. International conference on string theory

    CERN Document Server

    2017-01-01

    The Strings 2017 conference is part of the "Strings" series of annual conferences, that bring the entire string theory community together. It will include reviews of major developments in the field, and specialized talks on specific topics. There will also be several public lectures given by conference participants, a pre-Strings school at the Technion, and a post-Strings workshop at the Weizmann Institute.

  1. String-math 2012

    CERN Document Server

    Katz, Sheldon; Klemm, Albrecht; Morrison, David R

    2015-01-01

    This volume contains the proceedings of the conference String-Math 2012, which was held July 16-21, 2012, at the Hausdorff Center for Mathematics, Universitat Bonn. This was the second in a series of annual large meetings devoted to the interface of mathematics and string theory. These meetings have rapidly become the flagship conferences in the field. Topics include super Riemann surfaces and their super moduli, generalized moonshine and K3 surfaces, the latest developments in supersymmetric and topological field theory, localization techniques, applications to knot theory, and many more. The contributors include many leaders in the field, such as Sergio Cecotti, Matthias Gaberdiel, Rahul Pandharipande, Albert Schwarz, Anne Taormina, Johannes Walcher, Katrin Wendland, and Edward Witten. This book will be essential reading for researchers and students in this area and for all mathematicians and string theorists who want to update themselves on developments in the math-string interface.

  2. Hydroball string sensing system

    International Nuclear Information System (INIS)

    Hurwitz, M.J.; Ekeroth, D.E.; Squarer, D.

    1991-01-01

    This patent describes a hydroball string sensing system for a nuclear reactor having a core containing a fluid at a fluid pressure. It comprises a tube connectable to the nuclear reactor so that the fluid can flow within the tube at a fluid pressure that is substantially the same as the fluid pressure of the nuclear reactor core; a hydroball string including - a string member having objects positioned therealong with a specified spacing, the object including a plurality of hydroballs, and bullet members positioned at opposing ends of the string member; first sensor means, positioned outside a first segment of the tube, for sensing one of the objects being positioned within the first segment, and for providing a sensing signal responsive to the sensing of the first sensing means

  3. The QCD Effective String

    International Nuclear Information System (INIS)

    Espriu, D.

    2003-01-01

    QCD can be described in a certain kinematical regime by an effective string theory. This string must couple to background chiral fields in a chirally invariant manner, thus taking into account the true chirally non-invariant QCD vacuum. By requiring conformal symmetry of the string and the unitarity constraint on chiral fields we reconstruct the equations of motion for the latter ones. These provide a consistent background for the propagation of the string. By further requiring locality of the effective action we recover the Lagrangian of non-linear sigma model of pion interactions. The prediction is unambiguous and parameter-free. The estimated chiral structural constants of Gasser and Leutwyler fit very well the phenomenological values. (author)

  4. Field theory of strings

    International Nuclear Information System (INIS)

    Ramond, P.

    1987-01-01

    We review the construction of the free equations of motion for open and closed strings in 26 dimensions, using the methods of the Florida Group. Differing from previous treatments, we argue that the constraint L 0 -anti L 0 =0 should not be imposed on all the fields of the closed string in the gauge invariant formalism; we show that it can be incorporated in the gauge invariant formalism at the price of being unable to extract the equations of motion from a Langrangian. We then describe our purely algebraic method to introduce interactions, which works equally well for open and closed strings. Quartic interactions are absent except in the Physical Gauge. Finally, we speculate on the role of the measure of the open string path functional. (orig.)

  5. String Theory Rocks!

    CERN Multimedia

    2008-01-01

    String Theory supporters argue that the universe we live in has eleven dimensions, out of which three spacial dimensions and a temporal one, which define the void and the space-time environment we experience daily.

  6. Nonrelativistic closed string theory

    International Nuclear Information System (INIS)

    Gomis, Jaume; Ooguri, Hirosi

    2001-01-01

    We construct a Galilean invariant nongravitational closed string theory whose excitations satisfy a nonrelativistic dispersion relation. This theory can be obtained by taking a consistent low energy limit of any of the conventional string theories, including the heterotic string. We give a finite first order worldsheet Hamiltonian for this theory and show that this string theory has a sensible perturbative expansion, interesting high energy behavior of scattering amplitudes and a Hagedorn transition of the thermal ensemble. The strong coupling duals of the Galilean superstring theories are considered and are shown to be described by an eleven-dimensional Galilean invariant theory of light membrane fluctuations. A new class of Galilean invariant nongravitational theories of light-brane excitations are obtained. We exhibit dual formulations of the strong coupling limits of these Galilean invariant theories and show that they exhibit many of the conventional dualities of M theory in a nonrelativistic setting

  7. String theory compactifications

    CERN Document Server

    Graña, Mariana

    2017-01-01

    The lectures in this book provide graduate students and non-specialist researchers with a concise introduction to the concepts and formalism required to reduce the ten-dimensional string theories to the observable four-dimensional space-time - a procedure called string compactification. The text starts with a very brief introduction to string theory, first working out its massless spectrum and showing how the condition on the number of dimensions arises. It then dwells on the different possible internal manifolds, from the simplest to the most relevant phenomenologically, thereby showing that the most elegant description is through an extension of ordinary Riemannian geometry termed generalized geometry, which was first introduced by Hitchin. Last but not least, the authors review open problems in string phenomenology, such as the embedding of the Standard Model and obtaining de Sitter solutions.

  8. Application of point-to-point matching algorithms for background correction in on-line liquid chromatography-Fourier transform infrared spectrometry (LC-FTIR).

    Science.gov (United States)

    Kuligowski, J; Quintás, G; Garrigues, S; de la Guardia, M

    2010-03-15

    A new background correction method for the on-line coupling of gradient liquid chromatography and Fourier transform infrared spectrometry has been developed. It is based on the use of a point-to-point matching algorithm that compares the absorption spectra of the sample data set with those of a previously recorded reference data set in order to select an appropriate reference spectrum. The spectral range used for the point-to-point comparison is selected with minimal user-interaction, thus facilitating considerably the application of the whole method. The background correction method has been successfully tested on a chromatographic separation of four nitrophenols running acetonitrile (0.08%, v/v TFA):water (0.08%, v/v TFA) gradients with compositions ranging from 35 to 85% (v/v) acetonitrile, giving accurate results for both, baseline resolved and overlapped peaks. Copyright (c) 2009 Elsevier B.V. All rights reserved.

  9. History Matching and Parameter Estimation of Surface Deformation Data for a CO2 Sequestration Field Project Using Ensemble-Based Algorithms

    Science.gov (United States)

    Tavakoli, Reza; Srinivasan, Sanjay; Wheeler, Mary

    2015-04-01

    The application of ensemble-based algorithms for history matching reservoir models has been steadily increasing over the past decade. However, the majority of implementations in the reservoir engineering have dealt only with production history matching. During geologic sequestration, the injection of large quantities of CO2 into the subsurface may alter the stress/strain field which in turn can lead to surface uplift or subsidence. Therefore, it is essential to couple multiphase flow and geomechanical response in order to predict and quantify the uncertainty of CO2 plume movement for long-term, large-scale CO2 sequestration projects. In this work, we simulate and estimate the properties of a reservoir that is being used to store CO2 as part of the In Salah Capture and Storage project in Algeria. The CO2 is separated from produced natural gas and is re-injected into downdip aquifer portion of the field from three long horizontal wells. The field observation data includes ground surface deformations (uplift) measured using satellite-based radar (InSAR), injection well locations and CO2 injection rate histories provided by the operators. We implement variations of ensemble Kalman filter and ensemble smoother algorithms for assimilating both injection rate data as well as geomechanical observations (surface uplift) into reservoir model. The preliminary estimation results of horizontal permeability and material properties such as Young Modulus and Poisson Ratio are consistent with available measurements and previous studies in this field. Moreover, the existence of high-permeability channels (fractures) within the reservoir; especially in the regions around the injection wells are confirmed. This estimation results can be used to accurately and efficiently predict and quantify the uncertainty in the movement of CO2 plume.

  10. History matching and parameter estimation of surface deformation data for a CO2 sequestration field project using ensemble-based algorithm

    Science.gov (United States)

    Ping, J.; Tavakoli, R.; Min, B.; Srinivasan, S.; Wheeler, M. F.

    2015-12-01

    Optimal management of subsurface processes requires the characterization of the uncertainty in reservoir description and reservoir performance prediction. The application of ensemble-based algorithms for history matching reservoir models has been steadily increasing over the past decade. However, the majority of implementations in the reservoir engineering have dealt only with production history matching. During geologic sequestration, the injection of large quantities of CO2 into the subsurface may alter the stress/strain field which in turn can lead to surface uplift or subsidence. Therefore, it is essential to couple multiphase flow and geomechanical response in order to predict and quantify the uncertainty of CO2 plume movement for long-term, large-scale CO2 sequestration projects. In this work, we simulate and estimate the properties of a reservoir that is being used to store CO2 as part of the In Salah Capture and Storage project in Algeria. The CO2 is separated from produced natural gas and is re-injected into downdip aquifer portion of the field from three long horizontal wells. The field observation data includes ground surface deformations (uplift) measured using satellite-based radar (InSAR), injection well locations and CO2 injection rate histories provided by the operators. We implement ensemble-based algorithms for assimilating both injection rate data as well as geomechanical observations (surface uplift) into reservoir model. The preliminary estimation results of horizontal permeability and material properties such as Young Modulus and Poisson Ratio are consistent with available measurements and previous studies in this field. Moreover, the existence of high-permeability channels/fractures within the reservoir; especially in the regions around the injection wells are confirmed. This estimation results can be used to accurately and efficiently predict and monitor the movement of CO2 plume.

  11. Heterotic string construction

    International Nuclear Information System (INIS)

    Schellekens, A.N.

    1989-01-01

    In this paper an elementary introduction to the principles of four-dimensional string construction will be given. Although the emphasis is on lattice constructions, almost all results have further, and often quite straightforward generalizations to other constructions. Since heterotic strings look phenomenologically more promising than type-II theories the authors only consider the former, although everything can easily be generalized to type-II theories. Some additional aspects of lattice constructions are discussed, and an extensive review can be found

  12. Confusing the heterotic string

    International Nuclear Information System (INIS)

    Benett, D.L.; Mizrachi, L.

    1986-01-01

    A confusion mechanism is proposed as a global modification of the heterotic string model. It envolves a confusion hypersurface across which the two E 8 's of the heterotic string are permuted. A remarkable numerical coincidence is found which prevents an inconsistency in the model. The low energy limit of this theory (after compactification) is typically invariant under one E 8 only, thereby removing the shadow world from the original model. (orig.)

  13. Confusing the heterotic string

    Science.gov (United States)

    Benett, D.; Brene, N.; Mizrachi, Leah; Nielsen, H. B.

    1986-10-01

    A confusion mechanism is proposed as a global modification of the heterotic string model. It envolves a confusion hypersurface across which the two E 8's of the heterotic string are permuted. A remarkable numerical coincidence is found which prevents an inconsistency in the model. The low energy limit of this theory (after compactification) is typically invariant under one E 8 only, thereby removing the shadow world from the original model.

  14. Confusing the heterotic string

    Energy Technology Data Exchange (ETDEWEB)

    Benett, D.L.; Brene, N.; Nielsen, H.B.; Mizrachi, L.

    1986-10-02

    A confusion mechanism is proposed as a global modification of the heterotic string model. It envolves a confusion hypersurface across which the two E/sub 8/'s of the heterotic string are permuted. A remarkable numerical coincidence is found which prevents an inconsistency in the model. The low energy limit of this theory (after compactification) is typically invariant under one E/sub 8/ only, thereby removing the shadow world from the original model.

  15. Lectures on string theory

    International Nuclear Information System (INIS)

    Thorn, C.B.

    1988-01-01

    Several topics are discussed in string theory presented as three lectures to the Spring School on Superstrings at the ICTP at Trieste, Italy, in April, 1988. The first lecture is devoted to some general aspects of conformal invariance and duality. The second sketches methods for carrying out perturbative calculations in string field theory. The final lecture presents an alternative lattice approach to a nonperturbative formulation of the sum over world surfaces. 35 refs., 12 figs

  16. String dynamics in QCD

    International Nuclear Information System (INIS)

    Gervais, J.L.; Neveu, A.

    1980-01-01

    Recent works of the authors on string interpretation of the Wilson loop operators in QCD are reviewed in a self-contained fashion. Although most of the results habe already appeared in print, some new material is presented in renormalization of the Wilson loop operator and on the use of light-cone expansion to derive a linear string-like equation in light-cone formalism. (orig.)

  17. Matrix String Theory

    CERN Document Server

    Dijkgraaf, R; Verlinde, Herman L

    1997-01-01

    Via compactification on a circle, the matrix model of M-theory proposed by Banks et al suggests a concrete identification between the large N limit of two-dimensional N=8 supersymmetric Yang-Mills theory and type IIA string theory. In this paper we collect evidence that supports this identification. We explicitly identify the perturbative string states and their interactions, and describe the appearance of D-particle and D-membrane states.

  18. Manipulating Strings in Python

    Directory of Open Access Journals (Sweden)

    William J. Turkel

    2012-07-01

    Full Text Available This lesson is a brief introduction to string manipulation techniques in Python. Knowing how to manipulate strings plays a crucial role in most text processing tasks. If you’d like to experiment with the following lessons, you can write and execute short programs as we’ve been doing, or you can open up a Python shell / Terminal to try them out on the command line.

  19. Determination of acoustic impedances of multi matching layers for narrowband ultrasonic airborne transducers at frequencies <2.5 MHz - Application of a genetic algorithm.

    Science.gov (United States)

    Saffar, Saber; Abdullah, Amir

    2012-01-01

    The effective ultrasonic energy radiation into the air of piezoelectric transducers requires using multilayer matching systems with accurately selected acoustic impedances and the thickness of particular layers. One major problem of ultrasonic transducers, radiating acoustic energy into air, is to find the proper acoustic impedances of one or more matching layers. This work aims at developing an original solution to the acoustic impedance mismatch between transducer and air. If the acoustic impedance defences between transducer and air be more, then finding best matching layer(s) is harder. Therefore we consider PZT (lead zirconate titanate piezo electric) transducer and air that has huge acoustic impedance deference. The vibration source energy (PZT), which is used to generate the incident wave, consumes a part of the mechanical energy and converts it to an electrical one in theoretical calculation. After calculating matching layers, we consider the energy source as layer to design a transducer. However, this part of the mechanical energy will be neglected during the mathematical work. This approximation is correct only if the transducer is open-circuit. Since the possibilities of choosing material with required acoustic impedance are limited (the counted values cannot always be realized and applied in practice) it is necessary to correct the differences between theoretical values and the possibilities of practical application of given acoustic impedances. Such a correction can be done by manipulating other parameters of matching layers (e.g. by changing their thickness). The efficiency of the energy transmission from the piezoceramic transducer through different layers with different thickness and different attenuation enabling a compensation of non-ideal real values by changing their thickness was computer analyzed (base on genetic algorithm). Firstly, three theoretical solutions were investigated. Namely, Chebyshev, Desilets and Souquet theories. However, the

  20. Spectral matching techniques (SMTs) and automated cropland classification algorithms (ACCAs) for mapping croplands of Australia using MODIS 250-m time-series (2000–2015) data

    Science.gov (United States)

    Teluguntla, Pardhasaradhi G.; Thenkabail, Prasad S.; Xiong, Jun N.; Gumma, Murali Krishna; Congalton, Russell G.; Oliphant, Adam; Poehnelt, Justin; Yadav, Kamini; Rao, Mahesh N.; Massey, Richard

    2017-01-01

    Mapping croplands, including fallow areas, are an important measure to determine the quantity of food that is produced, where they are produced, and when they are produced (e.g. seasonality). Furthermore, croplands are known as water guzzlers by consuming anywhere between 70% and 90% of all human water use globally. Given these facts and the increase in global population to nearly 10 billion by the year 2050, the need for routine, rapid, and automated cropland mapping year-after-year and/or season-after-season is of great importance. The overarching goal of this study was to generate standard and routine cropland products, year-after-year, over very large areas through the use of two novel methods: (a) quantitative spectral matching techniques (QSMTs) applied at continental level and (b) rule-based Automated Cropland Classification Algorithm (ACCA) with the ability to hind-cast, now-cast, and future-cast. Australia was chosen for the study given its extensive croplands, rich history of agriculture, and yet nonexistent routine yearly generated cropland products using multi-temporal remote sensing. This research produced three distinct cropland products using Moderate Resolution Imaging Spectroradiometer (MODIS) 250-m normalized difference vegetation index 16-day composite time-series data for 16 years: 2000 through 2015. The products consisted of: (1) cropland extent/areas versus cropland fallow areas, (2) irrigated versus rainfed croplands, and (3) cropping intensities: single, double, and continuous cropping. An accurate reference cropland product (RCP) for the year 2014 (RCP2014) produced using QSMT was used as a knowledge base to train and develop the ACCA algorithm that was then applied to the MODIS time-series data for the years 2000–2015. A comparison between the ACCA-derived cropland products (ACPs) for the year 2014 (ACP2014) versus RCP2014 provided an overall agreement of 89.4% (kappa = 0.814) with six classes: (a) producer’s accuracies varying

  1. An automatic algorithm for blink-artifact suppression based on iterative template matching: application to single channel recording of cortical auditory evoked potentials

    Science.gov (United States)

    Valderrama, Joaquin T.; de la Torre, Angel; Van Dun, Bram

    2018-02-01

    Objective. Artifact reduction in electroencephalogram (EEG) signals is usually necessary to carry out data analysis appropriately. Despite the large amount of denoising techniques available with a multichannel setup, there is a lack of efficient algorithms that remove (not only detect) blink-artifacts from a single channel EEG, which is of interest in many clinical and research applications. This paper describes and evaluates the iterative template matching and suppression (ITMS), a new method proposed for detecting and suppressing the artifact associated with the blink activity from a single channel EEG. Approach. The approach of ITMS consists of (a) an iterative process in which blink-events are detected and the blink-artifact waveform of the analyzed subject is estimated, (b) generation of a signal modeling the blink-artifact, and (c) suppression of this signal from the raw EEG. The performance of ITMS is compared with the multi-window summation of derivatives within a window (MSDW) technique using both synthesized and real EEG data. Main results. Results suggest that ITMS presents an adequate performance in detecting and suppressing blink-artifacts from a single channel EEG. When applied to the analysis of cortical auditory evoked potentials (CAEPs), ITMS provides a significant quality improvement in the resulting responses, i.e. in a cohort of 30 adults, the mean correlation coefficient improved from 0.37 to 0.65 when the blink-artifacts were detected and suppressed by ITMS. Significance. ITMS is an efficient solution to the problem of denoising blink-artifacts in single-channel EEG applications, both in clinical and research fields. The proposed ITMS algorithm is stable; automatic, since it does not require human intervention; low-invasive, because the EEG segments not contaminated by blink-artifacts remain unaltered; and easy to implement, as can be observed in the Matlab script implemeting the algorithm provided as supporting material.

  2. Tsunami early warning in the Mediterranean: role, structure and tricks of pre-computed tsunami simulation databases and matching/forecasting algorithms

    Science.gov (United States)

    Armigliato, Alberto; Pagnoni, Gianluca; Tinti, Stefano

    2014-05-01

    The general idea that pre-computed simulated scenario databases can play a key role in conceiving tsunami early warning systems is commonly accepted by now. But it was only in the last decade that it started to be applied to the Mediterranean region, taking special impulse from initiatives like the GDACS and from recently concluded EU-funded projects such as TRIDEC and NearToWarn. With reference to these two projects and with the possibility of further developing this research line in the frame of the FP7 ASTARTE project, we discuss some results we obtained regarding two major topics, namely the strategies applicable to the tsunami scenario database building and the design and performance assessment of a timely and "reliable" elementary-scenario combination algorithm to be run in real-time. As for the first theme, we take advantage of the experience gained in the test areas of Western Iberia, Rhodes (Greece) and Cyprus to illustrate the criteria with which a "Matching Scenario Database" (MSDB) can be built. These involve 1) the choice of the main tectonic tsunamigenic sources (or areas), 2) their tessellation with matrices of elementary faults whose dimension heavily depend on the particular studied area and must be a compromise between the needs to represent the tsunamigenic area in sufficient detail and of limiting the number of scenarios to be simulated, 3) the computation of the scenarios themselves, 4) the choice of the relevant simulation outputs and the standardisation of their formats. Regarding the matching/forecast algorithm, we want it to select and combine the MSDB elements based on the initial earthquake magnitude and location estimate, and to produce a forecast of (at least) the tsunami arrival time, amplitude and period at the closest tide-level sensors and in all needed forecast points. We discuss the performance of the algorithm in terms of the time needed to produce the forecast after the earthquake is detected. In particular, we analyse the

  3. Deterministic indexing for packed strings

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye

    2017-01-01

    Given a string S of length n, the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries. In the deterministic variant the goal is to solve the string indexing problem without any randomization (at preprocessing time...... or query time). In the packed variant the strings are stored with several character in a single word, giving us the opportunity to read multiple characters simultaneously. Our main result is a new string index in the deterministic and packed setting. Given a packed string S of length n over an alphabet σ...

  4. A new method for finding vacua in string phenomenology

    Energy Technology Data Exchange (ETDEWEB)

    Gray, James [Institut d' Astrophysique de Paris and APC, Universite de Paris 7, 98 bis, Bd. Arago 75014, Paris (France); He, Yang-Hui [Rudolf Peierls Centre for Theoretical Physics, University of Oxford, 1 Keble Road, Oxford OX1 3NP (United Kingdom)]|[Merton College, Oxford, OX1 4JD and Mathematical Institute, Oxford University, Oxford (United Kingdom); Ilderton, Anton [School of Mathematics and Statistics, University of Plymouth, Drake Circus, Plymouth PL4 8AA (United Kingdom); Lukas, Andre [Rudolf Peierls Centre for Theoretical Physics, University of Oxford, 1 Keble Road, Oxford OX1 3NP (United Kingdom)

    2007-05-15

    One of the central problems of string-phenomenology is to find stable vacua in the four dimensional effective theories which result from compactification. We present an algorithmic method to find all of the vacua of any given string-phenomenological system in a huge class. In particular, this paper reviews and then extends hep-th/0606122 to include various nonperturbative effects. These include gaugino condensation and instantonic contributions to the superpotential. (authors)

  5. Framework for benchmarking FA-based string recognizers

    CSIR Research Space (South Africa)

    Ngassam, EK

    2010-10-01

    Full Text Available of suggested algorithms by domain-specific FA-implementers requires prior knowledge of the behaviour (performance-wise) of each algorithm in order to make an informed choice. The authors propose a based string recognizers such that FA-implementers could capture...

  6. Windings of twisted strings

    Science.gov (United States)

    Casali, Eduardo; Tourkine, Piotr

    2018-03-01

    Twistor string models have been known for more than a decade now but have come back under the spotlight recently with the advent of the scattering equation formalism which has greatly generalized the scope of these models. A striking ubiquitous feature of these models has always been that, contrary to usual string theory, they do not admit vibrational modes and thus describe only conventional field theory. In this paper we report on the surprising discovery of a whole new sector of one of these theories which we call "twisted strings," when spacetime has compact directions. We find that the spectrum is enhanced from a finite number of states to an infinite number of interacting higher spin massive states. We describe both bosonic and world sheet supersymmetric models, their spectra and scattering amplitudes. These models have distinctive features of both string and field theory, for example they are invariant under stringy T-duality but have the high energy behavior typical of field theory. Therefore they describe a new kind of field theories in target space, sitting on their own halfway between string and field theory.

  7. Strings and fundamental physics

    International Nuclear Information System (INIS)

    Baumgartl, Marco; Brunner, Ilka; Haack, Michael

    2012-01-01

    The basic idea, simple and revolutionary at the same time, to replace the concept of a point particle with a one-dimensional string, has opened up a whole new field of research. Even today, four decades later, its multifaceted consequences are still not fully conceivable. Up to now string theory has offered a new way to view particles as different excitations of the same fundamental object. It has celebrated success in discovering the graviton in its spectrum, and it has naturally led scientists to posit space-times with more than four dimensions - which in turn has triggered numerous interesting developments in fields as varied as condensed matter physics and pure mathematics. This book collects pedagogical lectures by leading experts in string theory, introducing the non-specialist reader to some of the newest developments in the field. The carefully selected topics are at the cutting edge of research in string theory and include new developments in topological strings, AdS/CFT dualities, as well as newly emerging subfields such as doubled field theory and holography in the hydrodynamic regime. The contributions to this book have been selected and arranged in such a way as to form a self-contained, graduate level textbook. (orig.)

  8. Strings and fundamental physics

    Energy Technology Data Exchange (ETDEWEB)

    Baumgartl, Marco [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Brunner, Ilka; Haack, Michael (eds.) [Muenchen Univ. (Germany). Fakultaet fuer Physik

    2012-07-01

    The basic idea, simple and revolutionary at the same time, to replace the concept of a point particle with a one-dimensional string, has opened up a whole new field of research. Even today, four decades later, its multifaceted consequences are still not fully conceivable. Up to now string theory has offered a new way to view particles as different excitations of the same fundamental object. It has celebrated success in discovering the graviton in its spectrum, and it has naturally led scientists to posit space-times with more than four dimensions - which in turn has triggered numerous interesting developments in fields as varied as condensed matter physics and pure mathematics. This book collects pedagogical lectures by leading experts in string theory, introducing the non-specialist reader to some of the newest developments in the field. The carefully selected topics are at the cutting edge of research in string theory and include new developments in topological strings, AdS/CFT dualities, as well as newly emerging subfields such as doubled field theory and holography in the hydrodynamic regime. The contributions to this book have been selected and arranged in such a way as to form a self-contained, graduate level textbook. (orig.)

  9. Perspectives on string phenomenology

    CERN Document Server

    Kane, Gordon; Kumar, Piyush

    2015-01-01

    The remarkable recent discovery of the Higgs boson at the CERN Large Hadron Collider completed the Standard Model of particle physics and has paved the way for understanding the physics which may lie beyond it. String/M theory has emerged as a broad framework for describing a plethora of diverse physical systems, which includes condensed matter systems, gravitational systems as well as elementary particle physics interactions. If string/M theory is to be considered as a candidate theory of Nature, it must contain an effectively four-dimensional universe among its solutions that is indistinguishable from our own. In these solutions, the extra dimensions of string/M Theory are “compactified” on tiny scales which are often comparable to the Planck length. String phenomenology is the branch of string/M theory that studies such solutions, relates their properties to data, and aims to answer many of the outstanding questions of particle physics beyond the Standard Model. This book contains perspectives on stri...

  10. Matching Students to Schools

    Directory of Open Access Journals (Sweden)

    Dejan Trifunovic

    2017-08-01

    Full Text Available In this paper, we present the problem of matching students to schools by using different matching mechanisms. This market is specific since public schools are free and the price mechanism cannot be used to determine the optimal allocation of children in schools. Therefore, it is necessary to use different matching algorithms that mimic the market mechanism and enable us to determine the core of the cooperative game. In this paper, we will determine that it is possible to apply cooperative game theory in matching problems. This review paper is based on illustrative examples aiming to compare matching algorithms in terms of the incentive compatibility, stability and efficiency of the matching. In this paper we will present some specific problems that may occur in matching, such as improving the quality of schools, favoring minority students, the limited length of the list of preferences and generating strict priorities from weak priorities.

  11. Coulomb string tension, asymptotic string tension, and the gluon chain

    OpenAIRE

    Greensite, Jeff; Szczepaniak, Adam P.

    2014-01-01

    We compute, via numerical simulations, the non-perturbative Coulomb potential of pure SU(3) gauge theory in Coulomb gauge. We find that that the Coulomb potential scales nicely in accordance with asymptotic freedom, that the Coulomb potential is linear in the infrared, and that the Coulomb string tension is about four times larger than the asymptotic string tension. We explain how it is possible that the asymptotic string tension can be lower than the Coulomb string tension by a factor of four.

  12. Fast Arc-Annotated Subsequence Matching in Linear Space

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2010-01-01

    is deleted any arc with an endpoint in that base is also deleted. Arc-annotated strings where the arcs are "nested" are a natural model of RNA molecules that captures both the primary and secondary structure of these. The arc-preserving subsequence problem for nested arc-annotated strings is basic primitive...... for investigating the function of RNA molecules. Gramm et al. [ACM Trans. Algorithms 2006] gave an algorithm for this problem using O(nm) time and space, where m and n are the lengths of P and Q, respectively. In this paper we present; a new algorithm using O(nm) time and O(n+m,) space, thereby matching...... the previous time bound while significantly reducing the space from a quadratic term to linear. This is essential to process large RNA molecules where the space is a likely to be a bottleneck. To obtain our result we introduce several novel ideas which may be of independent interest for related problems on arc...

  13. Interacting-string picture of the fermionic string

    International Nuclear Information System (INIS)

    Mandelstam, S.

    1986-01-01

    This report gives a review of the interacting-string picture of the Bose string. In the present lecture, the author outlines a similar treatment of the Fermionic string. The quantization of the free Fermionic string is carried out to the degrees of freedom x, representing the displacement of the string. Also presented are Grassman degrees of freedom S distributed along the string. The report pictures the fermionic string as a string of dipoles. The general picture of the interaction of such strings by joining and splitting is the same as for the Bose string. The author does not at present have the simplest formula for fermion string scattering amplitudes. A less detailed treatment is given than for the Bose string. The report sets up the functional-integration formalism, derives the analog mode, and indicates in general, terms how the conformal transformation to the z-plane may be performed. The paper concludes by stating without proof the formula for the N-article tree amplitude in the manifestly supersymmetric formalism

  14. String field theory solution for any open string background

    Czech Academy of Sciences Publication Activity Database

    Erler, T.; Maccaferri, Carlo

    2014-01-01

    Roč. 10, Oct (2014), 1-37 ISSN 1029-8479 R&D Projects: GA ČR GBP201/12/G028 Institutional support: RVO:68378271 Keywords : tachyon condensation * string field theory * conformal field models in string theory * bosonic strings Subject RIV: BE - Theoretical Physics Impact factor: 6.111, year: 2014

  15. Are Stopped Strings Preferred in Sad Music?

    OpenAIRE

    David Huron; Caitlyn Trevor

    2017-01-01

    String instruments may be played either with open strings (where the string vibrates between the bridge and a hard wooden nut) or with stopped strings (where the string vibrates between the bridge and a performer's finger pressed against the fingerboard). Compared with open strings, stopped strings permit the use of vibrato and exhibit a darker timbre. Inspired by research on the timbre of sad speech, we test whether there is a tendency to use stopped strings in nominally sad music. Specifica...

  16. Strings for quantumchromodynamics

    International Nuclear Information System (INIS)

    Schomerus, V.

    2007-04-01

    During the last decade, intriguing dualities between gauge and string theory have been found and explored. they provide a novel window on strongly couplde gauge physics, including QCD-like models. Based on a short historical review of modern string theory, we explain how so-called AdS/CFT dualities emerged at the end of the 1990s. Some of their concrete implications and remarkable recent progress are then illustrated for the simplest example, namely the multicolor limit of N=4 SYM theory in four dimensions. We end with a few comments on existing extensions to more realistic models and applications, in particular to the sQGP. This text is meant as a non-technical introduction to gauge/string dualities for (particle) physicists. (orig.)

  17. The confining trailing string

    CERN Document Server

    Kiritsis, E; Nitti, F

    2014-01-01

    We extend the holographic trailing string picture of a heavy quark to the case of a bulk geometry dual to a confining gauge theory. We compute the classical trailing confining string solution for a static as well as a uniformly moving quark. The trailing string is infinitely extended and approaches a confining horizon, situated at a critical value of the radial coordinate, along one of the space-time directions, breaking boundary rotational invariance. We compute the equations for the fluctuations around the classical solutions, which are used to obtain boundary force correlators controlling the Langevin dynamics of the quark. The imaginary part of the correlators has a non-trivial low-frequency limit, which gives rise to a viscous friction coefficient induced by the confining vacuum. The vacuum correlators are used to define finite-temperature dressed Langevin correlators with an appropriate high-frequency behavior.

  18. Strings for quantumchromodynamics

    Energy Technology Data Exchange (ETDEWEB)

    Schomerus, V.

    2007-04-15

    During the last decade, intriguing dualities between gauge and string theory have been found and explored. they provide a novel window on strongly couplde gauge physics, including QCD-like models. Based on a short historical review of modern string theory, we explain how so-called AdS/CFT dualities emerged at the end of the 1990s. Some of their concrete implications and remarkable recent progress are then illustrated for the simplest example, namely the multicolor limit of N=4 SYM theory in four dimensions. We end with a few comments on existing extensions to more realistic models and applications, in particular to the sQGP. This text is meant as a non-technical introduction to gauge/string dualities for (particle) physicists. (orig.)

  19. Cylindrically symmetric, static strings with a cosmological constant in Brans-Dicke theory

    International Nuclear Information System (INIS)

    Delice, Oezguer

    2006-01-01

    The static cylindrically symmetric vacuum solutions with a cosmological constant in the framework of the Brans-Dicke theory are investigated. Some of these solutions admitting Lorentz boost invariance along the symmetry axis correspond to local, straight cosmic strings with a cosmological constant. Some physical properties of such solutions are studied. These strings apply attractive or repulsive forces on the test particles. A smooth matching is also performed with a recently introduced interior thick string solution with a cosmological constant

  20. Quark potential of spontaneous strings

    International Nuclear Information System (INIS)

    German, G.; Kleinert, H.

    1989-01-01

    The authors present some recent developments in string models with an extrinsic curvature term in action. Particular emphasis is placed upon the static quark potential and on the thermal deconfinement properties of spontaneous strings

  1. Cosmic strings and galaxy formation

    International Nuclear Information System (INIS)

    Bertschinger, E.

    1989-01-01

    Cosmic strings have become increasingly popular candidates as seeds for the formation of structure in the universe. This scenario, remains a serious cosmogonical model despite close scrutiny. In constrast, magnetic monopoles and domain walls - relic topological defects as are cosmic strings - are disastrous for cosmology if they are left over from the early universe. The production of heavy cosmic strings is speculative, as it depends on the details of ultrahigh energy physics. Fortunately, speculation about cosmic strings is not entirely idle because, if they exist and are heavy enough to seed galaxy formation, cosmic strings can be detected astronomically. Failure to detect cosmic strings would impose some constraints on grand unified theories (GUTs); their discovery would have exciting consequences for high energy physics and cosmology. This article reviews the basic physics of nonsuperconducting cosmic strings, highlighting the field theory aspects, and provides a progress report on calculations of structure formation with cosmic strings

  2. Mining a database of single amplified genomes from Red Sea brine pool extremophiles—improving reliability of gene function prediction using a profile and pattern matching algorithm (PPMA)

    Science.gov (United States)

    Grötzinger, Stefan W.; Alam, Intikhab; Ba Alawi, Wail; Bajic, Vladimir B.; Stingl, Ulrich; Eppinger, Jörg

    2014-01-01

    Reliable functional annotation of genomic data is the key-step in the discovery of novel enzymes. Intrinsic sequencing data quality problems of single amplified genomes (SAGs) and poor homology of novel extremophile's genomes pose significant challenges for the attribution of functions to the coding sequences identified. The anoxic deep-sea brine pools of the Red Sea are a promising source of novel enzymes with unique evolutionary adaptation. Sequencing data from Red Sea brine pool cultures and SAGs are annotated and stored in the Integrated Data Warehouse of Microbial Genomes (INDIGO) data warehouse. Low sequence homology of annotated genes (no similarity for 35% of these genes) may translate into false positives when searching for specific functions. The Profile and Pattern Matching (PPM) strategy described here was developed to eliminate false positive annotations of enzyme function before progressing to labor-intensive hyper-saline gene expression and characterization. It utilizes InterPro-derived Gene Ontology (GO)-terms (which represent enzyme function profiles) and annotated relevant PROSITE IDs (which are linked to an amino acid consensus pattern). The PPM algorithm was tested on 15 protein families, which were selected based on scientific and commercial potential. An initial list of 2577 enzyme commission (E.C.) numbers was translated into 171 GO-terms and 49 consensus patterns. A subset of INDIGO-sequences consisting of 58 SAGs from six different taxons of bacteria and archaea were selected from six different brine pool environments. Those SAGs code for 74,516 genes, which were independently scanned for the GO-terms (profile filter) and PROSITE IDs (pattern filter). Following stringent reliability filtering, the non-redundant hits (106 profile hits and 147 pattern hits) are classified as reliable, if at least two relevant descriptors (GO-terms and/or consensus patterns) are present. Scripts for annotation, as well as for the PPM algorithm, are available

  3. Mining a database of single amplified genomes from Red Sea brine pool extremophiles – Improving reliability of gene function prediction using a profile and pattern matching algorithm (PPMA

    Directory of Open Access Journals (Sweden)

    Stefan Wolfgang Grötzinger

    2014-04-01

    Full Text Available Reliable functional annotation of genomic data is the key-step in the discovery of novel enzymes. Intrinsic sequencing data quality problems of single amplified genomes (SAGs and poor homology of novel extremophile’s genomes pose significant challenges for the attribution of functions to the coding sequences identified. The anoxic deep-sea brine pools of the Red Sea are a promising source of novel enzymes with unique evolutionary adaptation. Sequencing data from Red Sea brine pool cultures and SAGs are annotated and stored in the INDIGO data warehouse. Low sequence homology of annotated genes (no similarity for 35% of these genes may translate into false positives when searching for specific functions. The Profile & Pattern Matching (PPM strategy described here was developed to eliminate false positive annotations of enzyme function before progressing to labor-intensive hyper-saline gene expression and characterization. It utilizes InterPro-derived Gene Ontology (GO-terms (which represent enzyme function profiles and annotated relevant PROSITE IDs (which are linked to an amino acid consensus pattern. The PPM algorithm was tested on 15 protein families, which were selected based on scientific and commercial potential. An initial list of 2,577 E.C. numbers was translated into 171 GO-terms and 49 consensus patterns. A subset of INDIGO-sequences consisting of 58 SAGs from six different taxons of bacteria and archaea were selected from 6 different brine pool environments. Those SAGs code for 74,516 genes, which were independently scanned for the GO-terms (profile filter and PROSITE IDs (pattern filter. Following stringent reliability filtering, the non-redundant hits (106 profile hits and 147 pattern hits are classified as reliable, if at least two relevant descriptors (GO-terms and/or consensus patterns are present. Scripts for annotation, as well as for the PPM algorithm, are available through the INDIGO website.

  4. Mining a database of single amplified genomes from Red Sea brine pool extremophiles-improving reliability of gene function prediction using a profile and pattern matching algorithm (PPMA).

    KAUST Repository

    Grötzinger, Stefan W.

    2014-04-07

    Reliable functional annotation of genomic data is the key-step in the discovery of novel enzymes. Intrinsic sequencing data quality problems of single amplified genomes (SAGs) and poor homology of novel extremophile\\'s genomes pose significant challenges for the attribution of functions to the coding sequences identified. The anoxic deep-sea brine pools of the Red Sea are a promising source of novel enzymes with unique evolutionary adaptation. Sequencing data from Red Sea brine pool cultures and SAGs are annotated and stored in the Integrated Data Warehouse of Microbial Genomes (INDIGO) data warehouse. Low sequence homology of annotated genes (no similarity for 35% of these genes) may translate into false positives when searching for specific functions. The Profile and Pattern Matching (PPM) strategy described here was developed to eliminate false positive annotations of enzyme function before progressing to labor-intensive hyper-saline gene expression and characterization. It utilizes InterPro-derived Gene Ontology (GO)-terms (which represent enzyme function profiles) and annotated relevant PROSITE IDs (which are linked to an amino acid consensus pattern). The PPM algorithm was tested on 15 protein families, which were selected based on scientific and commercial potential. An initial list of 2577 enzyme commission (E.C.) numbers was translated into 171 GO-terms and 49 consensus patterns. A subset of INDIGO-sequences consisting of 58 SAGs from six different taxons of bacteria and archaea were selected from six different brine pool environments. Those SAGs code for 74,516 genes, which were independently scanned for the GO-terms (profile filter) and PROSITE IDs (pattern filter). Following stringent reliability filtering, the non-redundant hits (106 profile hits and 147 pattern hits) are classified as reliable, if at least two relevant descriptors (GO-terms and/or consensus patterns) are present. Scripts for annotation, as well as for the PPM algorithm, are available

  5. STRING v10

    DEFF Research Database (Denmark)

    Szklarczyk, Damian; Franceschini, Andrea; Wyder, Stefan

    2015-01-01

    , and the available data exhibit notable differences in terms of quality and completeness. The STRING database (http://string-db.org) aims to provide a critical assessment and integration of protein-protein interactions, including direct (physical) as well as indirect (functional) associations. The new version 10...... into families at various levels of phylogenetic resolution. Further improvements in version 10.0 include a completely redesigned prediction pipeline for inferring protein-protein associations from co-expression data, an API interface for the R computing environment and improved statistical analysis...

  6. Proceedings of strings, 89

    International Nuclear Information System (INIS)

    Arnowitt, R.; Bryan, R.; Duff, M.J.; Nanopoulos, D.; Pope, C.N.

    1990-01-01

    Does string theory provide us with a consistent quantum theory of gravity? Is it that Holy Grail of elementary particle physics, a Theory of Everything with embraces all the forces and particles of Nature? Even if it is, can we extract concrete predictions about our low-energy world that can be tested experimentally at the SSC and other particle accelerators? What does it have to say about the origin of the Universe and the thorny problem of the cosmological constant? Are superstring theories unique, or might the eleven-dimensional supermembrane prove equally consistent? These are just some of the question posed and debated at Strings '89

  7. Strings draw theorists together

    International Nuclear Information System (INIS)

    Green, Michael

    2000-01-01

    Theorists are confident that they are closer than ever to finding a quantum theory that unites gravity with the three other fundamental forces in nature. Many of the leading figures in the world of string theory met at the California Institute of Technology in January to discuss recent progress in the field and to reflect on the state of the theory. The enthusiastic mood of the gathering was based on the fact that string theory provides an elegant framework for a unified theory of all the forces and particles in nature, and also gives a consistent quantum-mechanical description of general relativity. String theory, and more precisely superstring theory, describes the assortment of elementary particles such as quarks and leptons, and the gauge bosons responsible for mediating forces in a unified manner as different modes of vibration of a single extended string. This version of the theory also embodies supersymmetry a conjectured symmetry that unifies fermions and bosons. Furthermore, the fact that the string has a fundamental length scale - the ''string length'' - apparently cures the short-distance problems of uniting general relativity with quantum theory. The main problem with the early formulations of superstring theory was that they emphasized the ''perturbative'' point of view, an approximation that describes string-like quantum-mechanical particles moving through classical (that is non quantum-mechanical) space-time. However, very general arguments require that any quantum theory of gravity should also describe space-time geometry in a quantum-mechanical manner. The classical geometry of space-time should then emerge as an approximate description at distance scales much larger than the so-called Planck scale of 10 -33 m. This requires an understanding of the theory beyond the perturbative approximation. It is the quest for this more fundamental description of string theory that has provided the main challenge for string theorists over the past decade. Much

  8. Introduction to string theory

    International Nuclear Information System (INIS)

    Randjbar-Daemi, S.; Strathdee, J.

    1987-10-01

    These notes are based on a set of six introductory lectures given jointly by the authors. After developing the canonical methods we discuss the covariant quantization of the bosonic as well as the fermionic string. Conformal field theory methods are also introduced and used to calculate the anomaly coefficient, c, as well as the critical dimensions for bosonic and superstrings. We briefly sketch the BRS quantization and then offer an elementary derivation of the anomaly in the ghost number current. Finally, we address the one-loop partition function of the bosonic string and the question of SL(2,Z) invariance. (author). 15 refs

  9. Matrix string partition function

    CERN Document Server

    Kostov, Ivan K; Kostov, Ivan K.; Vanhove, Pierre

    1998-01-01

    We evaluate quasiclassically the Ramond partition function of Euclidean D=10 U(N) super Yang-Mills theory reduced to a two-dimensional torus. The result can be interpreted in terms of free strings wrapping the space-time torus, as expected from the point of view of Matrix string theory. We demonstrate that, when extrapolated to the ultraviolet limit (small area of the torus), the quasiclassical expressions reproduce exactly the recently obtained expression for the partition of the completely reduced SYM theory, including the overall numerical factor. This is an evidence that our quasiclassical calculation might be exact.

  10. Characterization of binary string statistics for syntactic landmine detection

    Science.gov (United States)

    Nasif, Ahmed O.; Mark, Brian L.; Hintz, Kenneth J.

    2011-06-01

    Syntactic landmine detection has been proposed to detect and classify non-metallic landmines using ground penetrating radar (GPR). In this approach, the GPR return is processed to extract characteristic binary strings for landmine and clutter discrimination. In our previous work, we discussed the preprocessing methodology by which the amplitude information of the GPR A-scan signal can be effectively converted into binary strings, which identify the impedance discontinuities in the signal. In this work, we study the statistical properties of the binary string space. In particular, we develop a Markov chain model to characterize the observed bit sequence of the binary strings. The state is defined as the number of consecutive zeros between two ones in the binarized A-scans. Since the strings are highly sparse (the number of zeros is much greater than the number of ones), defining the state this way leads to fewer number of states compared to the case where each bit is defined as a state. The number of total states is further reduced by quantizing the number of consecutive zeros. In order to identify the correct order of the Markov model, the mean square difference (MSD) between the transition matrices of mine strings and non-mine strings is calculated up to order four using training data. The results show that order one or two maximizes this MSD. The specification of the transition probabilities of the chain can be used to compute the likelihood of any given string. Such a model can be used to identify characteristic landmine strings during the training phase. These developments on modeling and characterizing the string statistics can potentially be part of a real-time landmine detection algorithm that identifies landmine and clutter in an adaptive fashion.

  11. Deriving the four-string and open-closed string interactions from geometric string field theory

    International Nuclear Information System (INIS)

    Kaku, M.

    1990-01-01

    One of the questions concerning the covariant open string field theory is why there are two distinct BRST theories and why the four-string interaction appears in one version but not the other. The authors solve this mystery by showing that both theories are gauge-fixed versions of a higher gauge theory, called the geometric string field theory, with a new field, a string verbein e μσ νρ , which allows us to gauge the string length and σ parametrization. By fixing the gauge, the authors can derive the endpoint gauge (the covariantized light cone gauge), the midpoint gauge of Witten, or the interpolating gauge with arbitrary string length. The authors show explicitly that the four-string interaction is a gauge artifact of the geometric theory (the counterpart of the four-fermion instantaneous Coulomb term of QED). By choosing the interpolating gauge, they produce a new class of four-string interactions which smoothly interpolate between the endpoint gauge and the midpoint gauge (where it vanishes). Similarly, they can extract the closed string as a bound state of the open string, which appears in the endpoint gauge but vanishes in the midpoint gauge. Thus, the four-string and open-closed string interactions do not have to be added to the action as long as the string vierbein is included

  12. Racetrack inflation and cosmic strings

    Energy Technology Data Exchange (ETDEWEB)

    Brax, P. [CEA-Saclay, Gif sur Yvette (France). CEA/DSM/SPhT, Unite de Recherche Associee au CNRS, Service de Physique Theorique; Bruck, C. van de [Sheffield Univ. (United Kingdom). Dept. of Applied Mathematics; Davis, A.C.; Davis, S.C. [Cambridge Univ. (United Kingdom). DAMTP, Centre for Mathematical Sciences; Jeannerot, R. [Instituut-Lorentz for Theoretical Physics, Leiden (Netherlands); Postma, M. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)]|[Nationaal Inst. voor Kernfysica en Hoge-Energiefysica (NIKHEF), Amsterdam (Netherlands)

    2008-05-15

    We consider the coupling of racetrack inflation to matter fields as realised in the D3/D7 brane system. In particular, we investigate the possibility of cosmic string formation in this system. We find that string formation before or at the onset of racetrack inflation is possible, but they are then inflated away. Furthermore, string formation at the end of inflation is prevented by the presence of the moduli sector. As a consequence, no strings survive racetrack inflation. (orig.)

  13. String theory in four dimensions

    International Nuclear Information System (INIS)

    Dine, M.

    1988-01-01

    A representative sample of current ideas about how one might develop a string phenomenology is presented. Some of the obstacles which lie in between string theory and contact with experiment are described. It is hoped that this volume will provide the reader with ways of thinking about string theory in four dimensions and provide tools for asking questions about string theory and ordinary physics. 102 refs

  14. The STRING database in 2011

    DEFF Research Database (Denmark)

    Szklarczyk, Damian; Franceschini, Andrea; Kuhn, Michael

    2011-01-01

    present an update on the online database resource Search Tool for the Retrieval of Interacting Genes (STRING); it provides uniquely comprehensive coverage and ease of access to both experimental as well as predicted interaction information. Interactions in STRING are provided with a confidence score...... models, extensive data updates and strongly improved connectivity and integration with third-party resources. Version 9.0 of STRING covers more than 1100 completely sequenced organisms; the resource can be reached at http://string-db.org....

  15. Instability of colliding metastable strings

    Energy Technology Data Exchange (ETDEWEB)

    Hiramatsu, Takashi [Kyoto Univ. (Japan). Yukawa Inst. for Theoretical Physics; Eto, Minoru [Yamagata Univ. (Japan). Dept. of Physics; Kamada, Kohei [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Kobayashi, Tatsuo [Kyoto Univ. (Japan). Dept. of Physics; Ookouchi, Yutaka [Kyoto Univ. (Japan). Dept. of Physics; Kyoto Univ. (Japan). The Hakubi Center for Advanced Research

    2013-04-15

    We investigate the collision dynamics of two metastable strings which can be viewed as tube-like domain walls with winding numbers interpolating a false vacuum and a true vacuum. We find that depending on the relative angle and speed of two strings, instability of strings increases and the false vacuum is filled out by rapid expansion of the strings or of a remnant of the collision.

  16. Cosmic strings and galaxy formation

    Science.gov (United States)

    Bertschinger, Edmund

    1989-01-01

    The cosmogonical model proposed by Zel'dovich and Vilenkin (1981), in which superconducting cosmic strings act as seeds for the origin of structure in the universe, is discussed, summarizing the results of recent theoretical investigations. Consideration is given to the formation of cosmic strings, the microscopic structure of strings, gravitational effects, cosmic string evolution, and the formation of galaxies and large-scale structure. Simulation results are presented in graphs, and several outstanding issues are listed and briefly characterized.

  17. Instability of colliding metastable strings

    International Nuclear Information System (INIS)

    Hiramatsu, Takashi; Kobayashi, Tatsuo; Ookouchi, Yutaka; Kyoto Univ.

    2013-04-01

    We investigate the collision dynamics of two metastable strings which can be viewed as tube-like domain walls with winding numbers interpolating a false vacuum and a true vacuum. We find that depending on the relative angle and speed of two strings, instability of strings increases and the false vacuum is filled out by rapid expansion of the strings or of a remnant of the collision.

  18. Racetrack inflation and cosmic strings

    International Nuclear Information System (INIS)

    Brax, P.; Postma, M.

    2008-05-01

    We consider the coupling of racetrack inflation to matter fields as realised in the D3/D7 brane system. In particular, we investigate the possibility of cosmic string formation in this system. We find that string formation before or at the onset of racetrack inflation is possible, but they are then inflated away. Furthermore, string formation at the end of inflation is prevented by the presence of the moduli sector. As a consequence, no strings survive racetrack inflation. (orig.)

  19. String theory and quark confinement

    International Nuclear Information System (INIS)

    Polyakov, A.M.

    1998-01-01

    This article is based on a talk given at the ''Strings '97'' conference. It discusses the search for the universality class of confining strings. The key ingredients include the loop equations, the zigzag symmetry, the non-linear renormalization group. Some new tests for the equivalence between gauge fields and strings are proposed. (orig.)

  20. String theory in four dimensions

    CERN Document Server

    1988-01-01

    ``String Theory in Four Dimensions'' contains a representative collection of papers dealing with various aspects of string phenomenology, including compactifications on smooth manifolds and more general conformal field theories. Together with the lucid introduction by M. Dine, this material gives the reader a good working knowledge of our present ideas for connecting string theory to nature.

  1. String necklaces and primordial black holes from type IIB strings

    International Nuclear Information System (INIS)

    Lake, Matthew; Thomas, Steve; Ward, John

    2009-01-01

    We consider a model of static cosmic string loops in type IIB string theory, where the strings wrap cycles within the internal space. The strings are not topologically stabilised, however the presence of a lifting potential traps the windings giving rise to kinky cycloops. We find that PBH formation occurs at early times in a small window, whilst at late times we observe the formation of dark matter relics in the scaling regime. This is in stark contrast to previous predictions based on field theoretic models. We also consider the PBH contribution to the mass density of the universe, and use the experimental data to impose bounds on the string theory parameters.

  2. SUPERCOLLIDER: String test success

    International Nuclear Information System (INIS)

    Anon.

    1992-01-01

    On 14 August at the Superconducting Supercollider (SSC) Laboratory in Ellis County, Texas, the Accelerator Systems String Test (ASST) successfully met its objective by operating a half-cell of five collider dipole magnets, one quadrupole magnet, and two spool pieces at the design current of 6500 amperes

  3. Help from the strings

    CERN Multimedia

    2007-01-01

    "How can the nature of basic particles be defined beyond the mechanisms presiding over their creation? Besides the standard model of particle physics - resulting from the postulations of quantum mechanics - contemporary science has pinned its hopes on the totally new unifying notion provided by the highly mathematical string theory."(2 pages)

  4. New Z3 strings

    Directory of Open Access Journals (Sweden)

    Marco A.C. Kneipp

    2016-12-01

    Full Text Available We consider a Yang–Mills–Higgs theory with the gauge group SU(3 broken to its center Z3 by two scalar fields in the adjoint representation and obtain new Z3 strings asymptotic configurations with the gauge field and magnetic field in the direction of the step operators.

  5. On exceptional instanton strings

    NARCIS (Netherlands)

    Del Zotto, M.; Lockhart, G.

    According to a recent classification of 6d (1, 0) theories within F-theory there are only six “pure” 6d gauge theories which have a UV superconformal fixed point. The corresponding gauge groups are SU(3), SO(8), F4, E6, E7, and E8. These exceptional models have BPS strings which are also instantons

  6. String perturbation theory diverges

    International Nuclear Information System (INIS)

    Gross, D.J.; Periwal, V.

    1988-01-01

    We prove that perturbation theory for the bosonic string diverges for arbitrary values of the coupling constant and is not Borel summable. This divergence is independent of the existence of the infinities that occur in the theory due to the presence of tachyons and dilaton tadpoles. We discuss the physical implications of such a divergence

  7. Transversally extended string

    International Nuclear Information System (INIS)

    Akama, Keiichi

    1988-01-01

    Starting with the space-time action of the transversally extended string, we derive its world-sheet action, which is that of a gravitational and gauge theory with matter fields on the world-sheet, with additional effects of the second fundamental quantity. (author)

  8. Lectures on strings and dualities

    International Nuclear Information System (INIS)

    Vafa, C.

    1997-01-01

    In this set of lectures I review recent developments in string theory emphasizing their non-perturbative aspects and their recently discovered duality symmetries. The goal of the lectures is to make the recent exciting developments in string theory accessible to those with no previous background in string theory who wish to join the research effort in this area. Topics covered include a brief review of string theory, its compactifications, solitons and D-branes, black hole entropy and wed of string dualities. (author)

  9. Macroscopic fundamental strings in cosmology

    Energy Technology Data Exchange (ETDEWEB)

    Aharonov, Y; Englert, F; Orloff, J

    1987-12-24

    We show that, when D greater than or equal to 4, theories of closed strings of closed strings in D, non-compact space-time dimensions exhibit a phase transition. The high-temperature phase is characterized by a condensate of arbitrarily long strings with Hausdorff dimension two (area filling curves). We suggest that this stringy phase is the ancestor of the adiabatic era. Fundamental strings could then both drive the inflation and seed, in a way reminiscent of the cosmic string mechanism, the large structures in the universe.

  10. Strings draw theorists together

    Energy Technology Data Exchange (ETDEWEB)

    Green, Michael [Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge (United Kingdom)

    2000-03-01

    Theorists are confident that they are closer than ever to finding a quantum theory that unites gravity with the three other fundamental forces in nature. Many of the leading figures in the world of string theory met at the California Institute of Technology in January to discuss recent progress in the field and to reflect on the state of the theory. The enthusiastic mood of the gathering was based on the fact that string theory provides an elegant framework for a unified theory of all the forces and particles in nature, and also gives a consistent quantum-mechanical description of general relativity. String theory, and more precisely superstring theory, describes the assortment of elementary particles such as quarks and leptons, and the gauge bosons responsible for mediating forces in a unified manner as different modes of vibration of a single extended string. This version of the theory also embodies supersymmetry a conjectured symmetry that unifies fermions and bosons. Furthermore, the fact that the string has a fundamental length scale - the ''string length'' - apparently cures the short-distance problems of uniting general relativity with quantum theory. The main problem with the early formulations of superstring theory was that they emphasized the ''perturbative'' point of view, an approximation that describes string-like quantum-mechanical particles moving through classical (that is non quantum-mechanical) space-time. However, very general arguments require that any quantum theory of gravity should also describe space-time geometry in a quantum-mechanical manner. The classical geometry of space-time should then emerge as an approximate description at distance scales much larger than the so-called Planck scale of 10{sup -33} m. This requires an understanding of the theory beyond the perturbative approximation. It is the quest for this more fundamental description of string theory that has provided the main challenge for

  11. Cosmic strings and galaxy formation: Current status

    International Nuclear Information System (INIS)

    Stebbins, A.

    1987-04-01

    Successes and remaining problems with cosmic string theories of galaxy formation are outlined. Successes of the theory include predictions for the correct amplitude of initial inhomogeneities leading to galaxy formation, the distribution of observed inhomogeneities, the observed correlation function of clusters, and the density profiles of dark matter halos. Potentially serious problems which have been raised are the biased galaxy production (why do galaxies occur in clusters?), the core radius problem (density profiles of galactic halos do not match predictions), the maximal rotation velocity problem (why is there a sharp cutoff in observed rotational velocity of galaxies?), the small galaxy problem (why are all the galaxies relatively small structures?), the angular momentum problem (where do baryons acquire their angular momentum in order to form spirals), and the large-scale structure problem (why do most galaxies appear to lie on surfaces surrounding voids?). Possible approaches to each of these problems are suggested and the future of cosmic string theory is discussed. 25 refs

  12. Gravitational effects of global strings

    International Nuclear Information System (INIS)

    Aryal, M.; Everett, A.E.

    1986-01-01

    We have obtained the gravitational field, in the weak-field approximation, of cosmic strings formed in a phase transition in which a global symmetry is broken (global strings). The effect of this field on light rays passing a global string is found, and the resulting formation of double images and production of discontinuities in the microwave background temperature compared with the corresponding results for gauge strings. There are some differences in the case of global strings, reflecting the fact that the space surrounding such strings is not purely conical. However, the differences between gauge and global strings with masses suitable to explain galaxy formation are small, and the task of distinguishing them observationally appears difficult at best

  13. Device for balancing parallel strings

    Science.gov (United States)

    Mashikian, Matthew S.

    1985-01-01

    A battery plant is described which features magnetic circuit means in association with each of the battery strings in the battery plant for balancing the electrical current flow through the battery strings by equalizing the voltage across each of the battery strings. Each of the magnetic circuit means generally comprises means for sensing the electrical current flow through one of the battery strings, and a saturable reactor having a main winding connected electrically in series with the battery string, a bias winding connected to a source of alternating current and a control winding connected to a variable source of direct current controlled by the sensing means. Each of the battery strings is formed by a plurality of batteries connected electrically in series, and these battery strings are connected electrically in parallel across common bus conductors.

  14. Cosmic String Detection with Tree-Based Machine Learning

    Science.gov (United States)

    Vafaei Sadr, A.; Farhang, M.; Movahed, S. M. S.; Bassett, B.; Kunz, M.

    2018-05-01

    We explore the use of random forest and gradient boosting, two powerful tree-based machine learning algorithms, for the detection of cosmic strings in maps of the cosmic microwave background (CMB), through their unique Gott-Kaiser-Stebbins effect on the temperature anisotropies. The information in the maps is compressed into feature vectors before being passed to the learning units. The feature vectors contain various statistical measures of the processed CMB maps that boost cosmic string detectability. Our proposed classifiers, after training, give results similar to or better than claimed detectability levels from other methods for string tension, Gμ. They can make 3σ detection of strings with Gμ ≳ 2.1 × 10-10 for noise-free, 0.9΄-resolution CMB observations. The minimum detectable tension increases to Gμ ≳ 3.0 × 10-8 for a more realistic, CMB S4-like (II) strategy, improving over previous results.

  15. A Simple Introduction to Grobner Basis Methods in String Phenomenology

    International Nuclear Information System (INIS)

    Gray, J.

    2011-01-01

    I give an elementary introduction to the key algorithm used in recent applications of computational algebraic geometry to the subject of string phenomenology. I begin with a simple description of the algorithm itself and then give 3 examples of its use in physics. I describe how it can be used to obtain constraints on flux parameters, how it can simplify the equations describing vacua in 4D string models, and lastly how it can be used to compute the vacuum space of the electroweak sector of the MSSM.

  16. The freetext matching algorithm: a computer program to extract diagnoses and causes of death from unstructured text in electronic health records

    Directory of Open Access Journals (Sweden)

    Shah Anoop D

    2012-08-01

    Full Text Available Abstract Background Electronic health records are invaluable for medical research, but much information is stored as free text rather than in a coded form. For example, in the UK General Practice Research Database (GPRD, causes of death and test results are sometimes recorded only in free text. Free text can be difficult to use for research if it requires time-consuming manual review. Our aim was to develop an automated method for extracting coded information from free text in electronic patient records. Methods We reviewed the electronic patient records in GPRD of a random sample of 3310 patients who died in 2001, to identify the cause of death. We developed a computer program called the Freetext Matching Algorithm (FMA to map diagnoses in text to the Read Clinical Terminology. The program uses lookup tables of synonyms and phrase patterns to identify diagnoses, dates and selected test results. We tested it on two random samples of free text from GPRD (1000 texts associated with death in 2001, and 1000 general texts from cases and controls in a coronary artery disease study, comparing the output to the U.S. National Library of Medicine’s MetaMap program and the gold standard of manual review. Results Among 3310 patients registered in the GPRD who died in 2001, the cause of death was recorded in coded form in 38.1% of patients, and in the free text alone in 19.4%. On the 1000 texts associated with death, FMA coded 683 of the 735 positive diagnoses, with precision (positive predictive value 98.4% (95% confidence interval (CI 97.2, 99.2 and recall (sensitivity 92.9% (95% CI 90.8, 94.7. On the general sample, FMA detected 346 of the 447 positive diagnoses, with precision 91.5% (95% CI 88.3, 94.1 and recall 77.4% (95% CI 73.2, 81.2, which was similar to MetaMap. Conclusions We have developed an algorithm to extract coded information from free text in GP records with good precision. It may facilitate research using free text in electronic patient

  17. Stringing physics along

    Energy Technology Data Exchange (ETDEWEB)

    Riordan, M. [Stanford University and the University of California, Santa Cruz (United States)]. E-mail: mriordan@ucsc.edu

    2007-02-15

    In the last few decades, however, physical theory has drifted away from the professional norms advocated by Newton and other enlightenment philosophers. A vast outpouring of hypotheses has occurred under the umbrella of what is widely called string theory. But string theory is not really a 'theory' at all - at least not in the strict sense that scientists generally use the term. It is instead a dense, weedy thicket of hypotheses and conjectures badly in need of pruning. That pruning, however, can come only from observation and experiment, to which string theory (a phrase I will grudgingly continue using) is largely inaccessible. String theory was invented in the 1970s in the wake of the Standard Model of particle physics. Encouraged by the success of gauge theories of the strong, weak and electromagnetic forces, theorists tried to extend similar ideas to energy and distance scales that are orders of magnitude beyond what can be readily observed or measured. The normal, healthy intercourse between theory and experiment - which had led to the Standard Model - has broken down, and fundamental physics now finds itself in a state of crisis. So it is refreshing to hear from a theorist - one who was deeply involved with string theory and championed it in his previous book, Three Roads to Quantum Gravity - that all is not well in this closeted realm. Smolin argues from the outset that viable hypotheses must lead to observable consequences by which they can be tested and judged. String theory by its very nature does not allow for such probing, according to Smolin, and therefore it must be considered as an unprovable conjecture. Towards the end of his book, Smolin suggests other directions fundamental physics can take, particularly in the realm of quantum gravity, to resolve its crisis and reconnect with the observable world. From my perspective, he leans a bit too heavily towards highly speculative ideas such as doubly special relativity, modified Newtonian

  18. Finding counterparts for all-sky X-ray surveys with NWAY: a Bayesian algorithm for cross-matching multiple catalogues

    Science.gov (United States)

    Salvato, M.; Buchner, J.; Budavári, T.; Dwelly, T.; Merloni, A.; Brusa, M.; Rau, A.; Fotopoulou, S.; Nandra, K.

    2018-02-01

    We release the AllWISE counterparts and Gaia matches to 106 573 and 17 665 X-ray sources detected in the ROSAT 2RXS and XMMSL2 surveys with |b| > 15°. These are the brightest X-ray sources in the sky, but their position uncertainties and the sparse multi-wavelength coverage until now rendered the identification of their counterparts a demanding task with uncertain results. New all-sky multi-wavelength surveys of sufficient depth, like AllWISE and Gaia, and a new Bayesian statistics based algorithm, NWAY, allow us, for the first time, to provide reliable counterpart associations. NWAY extends previous distance and sky density based association methods and, using one or more priors (e.g. colours, magnitudes), weights the probability that sources from two or more catalogues are simultaneously associated on the basis of their observable characteristics. Here, counterparts have been determined using a Wide-field Infrared Survey Explorer (WISE) colour-magnitude prior. A reference sample of 4524 XMM/Chandra and Swift X-ray sources demonstrates a reliability of ∼94.7 per cent (2RXS) and 97.4 per cent (XMMSL2). Combining our results with Chandra-COSMOS data, we propose a new separation between stars and AGN in the X-ray/WISE flux-magnitude plane, valid over six orders of magnitude. We also release the NWAY code and its user manual. NWAY was extensively tested with XMM-COSMOS data. Using two different sets of priors, we find an agreement of 96 per cent and 99 per cent with published Likelihood Ratio methods. Our results were achieved faster and without any follow-up visual inspection. With the advent of deep and wide area surveys in X-rays (e.g. SRG/eROSITA, Athena/WFI) and radio (ASKAP/EMU, LOFAR, APERTIF, etc.) NWAY will provide a powerful and reliable counterpart identification tool.

  19. Best matching theory & applications

    CERN Document Server

    Moghaddam, Mohsen

    2017-01-01

    Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Design...

  20. Real topological string amplitudes

    Energy Technology Data Exchange (ETDEWEB)

    Narain, K.S. [The Abdus Salam International Centre for Theoretical Physics (ICTP),Strada Costiera 11, Trieste, 34151 (Italy); Piazzalunga, N. [Simons Center for Geometry and Physics, State University of New York,Stony Brook, NY, 11794-3636 (United States); International School for Advanced Studies (SISSA) and INFN, Sez. di Trieste,via Bonomea 265, Trieste, 34136 (Italy); Tanzini, A. [International School for Advanced Studies (SISSA) and INFN, Sez. di Trieste,via Bonomea 265, Trieste, 34136 (Italy)

    2017-03-15

    We discuss the physical superstring correlation functions in type I theory (or equivalently type II with orientifold) that compute real topological string amplitudes. We consider the correlator corresponding to holomorphic derivative of the real topological amplitude G{sub χ}, at fixed worldsheet Euler characteristic χ. This corresponds in the low-energy effective action to N=2 Weyl multiplet, appropriately reduced to the orientifold invariant part, and raised to the power g{sup ′}=−χ+1. We show that the physical string correlator gives precisely the holomorphic derivative of topological amplitude. Finally, we apply this method to the standard closed oriented case as well, and prove a similar statement for the topological amplitude F{sub g}.

  1. Open spinning strings

    International Nuclear Information System (INIS)

    Stefanski, B. Jr.

    2004-01-01

    We find classical open string solutions in the AdS 5 x S 5 /Z 2 orientifold with angular momenta along the five-sphere. The energy of these solutions has an expansion in integral powers of λ with sigma-model corrections suppressed by inverse powers of J - the total angular momentum. This gives a prediction for the exact anomalous dimensions of operators in the large N limit of an N = 2 Sp, Super-Yang-Mills theory with matter. We also find a simple map between open and closed string solutions. This gives a prediction for an all-loop planar relationship between the anomalous dimensions of single-trace and two-quark operators in the dual gauge theory. (author)

  2. New Supersymmetric String Compactifications

    Energy Technology Data Exchange (ETDEWEB)

    Kachru, Shamit

    2002-11-25

    We describe a new class of supersymmetric string compactifications to 4d Minkowski space. These solutions involve type II strings propagating on (orientifolds of) non Calabi-Yau spaces in the presence of background NS and RR fluxes. The simplest examples have descriptions as cosets, generalizing the three-dimensional nilmanifold. They can also be thought of as twisted tori. We derive a formula for the (super)potential governing the light fields, which is generated by the fluxes and certain ''twists'' in the geometry. Detailed consideration of an example also gives strong evidence that in some cases, these exotic geometries are related by smooth transitions to standard Calabi-Yau or G2 compactifications of M-theory.

  3. Unified string theories

    International Nuclear Information System (INIS)

    Gross, D.J.

    1985-01-01

    String theories offer a way of realizing the potential of supersymmetry, Kaluza-Klein and much more. They represent a radical departure from ordinary quantum field theory, but in the direction of increased symmetry and structure. They are based on an enormous increase in the number of degrees of freedom, since in addition to fermionic coordinates and extra dimensions, the basic entities are extended one dimensional objects instead of points. Correspondingly the symmetry group is greatly enlarged, in a way that we are only beginning to comprehend. At the very least this extended symmetry contains the largest group of symmetries that can be contemplated within the framework of point field theories-those of ten-dimensional supergravity and super Yang-Mills theory. Types of string theories and the phenomenology to be expected from them are reviewed

  4. Fractional bosonic strings

    Science.gov (United States)

    Diaz, Victor Alfonzo; Giusti, Andrea

    2018-03-01

    The aim of this paper is to present a simple generalization of bosonic string theory in the framework of the theory of fractional variational problems. Specifically, we present a fractional extension of the Polyakov action, for which we compute the general form of the equations of motion and discuss the connection between the new fractional action and a generalization the Nambu-Goto action. Consequently, we analyze the symmetries of the modified Polyakov action and try to fix the gauge, following the classical procedures. Then we solve the equations of motion in a simplified setting. Finally, we present a Hamiltonian description of the classical fractional bosonic string and introduce the fractional light-cone gauge. It is important to remark that, throughout the whole paper, we thoroughly discuss how to recover the known results as an "integer" limit of the presented model.

  5. Comparative Performance Analysis of Different Fingerprint Biometric Scanners for Patient Matching.

    Science.gov (United States)

    Kasiiti, Noah; Wawira, Judy; Purkayastha, Saptarshi; Were, Martin C

    2017-01-01

    Unique patient identification within health services is an operational challenge in healthcare settings. Use of key identifiers, such as patient names, hospital identification numbers, national ID, and birth date are often inadequate for ensuring unique patient identification. In addition approximate string comparator algorithms, such as distance-based algorithms, have proven suboptimal for improving patient matching, especially in low-resource settings. Biometric approaches may improve unique patient identification. However, before implementing the technology in a given setting, such as health care, the right scanners should be rigorously tested to identify an optimal package for the implementation. This study aimed to investigate the effects of factors such as resolution, template size, and scan capture area on the matching performance of different fingerprint scanners for use within health care settings. Performance analysis of eight different scanners was tested using the demo application distributed as part of the Neurotech Verifinger SDK 6.0.

  6. p-adic string

    International Nuclear Information System (INIS)

    Volovich, I.V.

    1987-01-01

    The hypothesis of the possible p-adic structure of spacetime is considered. The p-adic Veneziano amplitude is proposed and the main properties of the p-adic string theory are discussed. The analogous questions on the Galois field are also discussed. In this case the Jacobi sum plays the role of the Veneziano amplitude which can be expressed by means of the I-adic cohomology of the Fermat curves. The corresponding vertex operator is given. (author)

  7. Exactly soluble dynamics of (p,q) string near macroscopic fundamental strings

    International Nuclear Information System (INIS)

    Bak, Dongsu; Rey, Soojong; Yee, Houng

    2004-01-01

    We study dynamics of type-IIB bound-state of a Dirichlet string and n fundamental strings in the background of N fundamental strings. Because of supergravity potential, the bound-state string is pulled to the background fundamental strings, whose motion is described by open string rolling radion field. The string coupling can be made controllably weak and, in the limit 1 2 st n 2 st N, the bound-state energy involved is small compared to the string scale. We thus propose rolling dynamics of open string radion in this system as an exactly solvable analog for rolling dynamics of open string tachyon in decaying D-brane. The dynamics bears a novel feature that the worldsheet electric field increases monotonically to the critical value as the bound-state string falls into the background string. Close to the background string, D string constituent inside the bound-state string decouples from fundamental string constituents. (author)

  8. The theta-structure in string theories - 1: bosonic strings

    International Nuclear Information System (INIS)

    Li Miao.

    1985-09-01

    We explored the theta-structures in bosonic string theories which are similar to those in gauge field theories. The theta-structure of string is due to the multiply connected spatial compact subspace of space-time. The work of this paper shows that there is an energy band E(theta) in the string theory and one may move the tachyon out in theory by choosing some proper theta parameters. (author)

  9. An invariant string propagator

    International Nuclear Information System (INIS)

    Cohen, A.; Moore, G.; Nelson, P.; Polchinski, J.

    1986-01-01

    The authors show that the Polyakov path integral is used to define off-shell quantities in string theory. The path integral of Polyakov gives an elegant description of strings and their interactions. However, its use has been limited to obtaining the Koba-Nielsen expressions for S-matrix elements. It is not yet clear what quantities make sense in string theory. This study shows that the path integral can be used to define off-shell quantities as well. In particular it defines a natural n-point function in loop space as the sum of all world surfaces bounded by n specific spacetime curves. The reader is referred for more detail. The report first outlines general evaluation then discusses the additional features added by boundaries. Locally, the three gauge freedoms ξ/sup a/ and δphi can be used to take g/sub ab/ (σ) to the unit matrix. Globally, this is not quite possible. In general the researchers choose a family of fiducial metrics g/sub ab/ (σ,tau), depending on a finite number of Teichmuller parameters tau, and every metric is gauge equivalent to one of these

  10. Thermodynamical string fragmentation

    Energy Technology Data Exchange (ETDEWEB)

    Fischer, Nadine [Theoretical Particle Physics, Department of Astronomy and Theoretical Physics, Lund University,Sölvegatan 14A, Lund, SE-223 62 (Sweden); School of Physics and Astronomy, Monash University,Wellington Road, Clayton, VIC-3800 (Australia); Sjöstrand, Torbjörn [Theoretical Particle Physics, Department of Astronomy and Theoretical Physics, Lund University,Sölvegatan 14A, Lund, SE-223 62 (Sweden)

    2017-01-31

    The observation of heavy-ion-like behaviour in pp collisions at the LHC suggests that more physics mechanisms are at play than traditionally assumed. The introduction e.g. of quark-gluon plasma or colour rope formation can describe several of the observations, but as of yet there is no established paradigm. In this article we study a few possible modifications to the Pythia event generator, which describes a wealth of data but fails for a number of recent observations. Firstly, we present a new model for generating the transverse momentum of hadrons during the string fragmentation process, inspired by thermodynamics, where heavier hadrons naturally are suppressed in rate but obtain a higher average transverse momentum. Secondly, close-packing of strings is taken into account by making the temperature or string tension environment-dependent. Thirdly, a simple model for hadron rescattering is added. The effect of these modifications is studied, individually and taken together, and compared with data mainly from the LHC. While some improvements can be noted, it turns out to be nontrivial to obtain effects as big as required, and further work is called for.

  11. Building GUTs from strings

    International Nuclear Information System (INIS)

    Aldazabal, G.; Ibanez, L.E.; Uranga, A.M.

    1996-01-01

    We study in detail the structure of Grand Unified Theories derived as the low-energy limit of orbifold four-dimensional strings. To this aim, new techniques for building level-two symmetric orbifold theories are presented. New classes of GUTs in the context of symmetric orbifolds are then constructed. The method of permutation modding is further explored and SO(10) GUTs with both 45- or 54-plets are obtained. SU(5) models are also found through this method. It is shown that, in the context of symmetric orbifold SO(10) GUTs, only a single GUT Higgs, either a 54 or a 45, can be present and it always resides in an order-two untwisted sector. Very restrictive results also hold in the case of SU(5). General properties and selection rules for string GUTs are described. Some of these selection rules forbid the presence of some particular GUT-Higgs couplings which are sometimes used in SUSY-GUT model building. Some semi-realistic string GUT examples are presented and their properties briefly discussed. (orig.)

  12. How to simulate global cosmic strings with large string tension

    Energy Technology Data Exchange (ETDEWEB)

    Klaer, Vincent B.; Moore, Guy D., E-mail: vklaer@theorie.ikp.physik.tu-darmstadt.de, E-mail: guy.moore@physik.tu-darmstadt.de [Institut für Kernphysik, Technische Universität Darmstadt, Schlossgartenstraße 2, Darmstadt, D-64289 Germany (Germany)

    2017-10-01

    Global string networks may be relevant in axion production in the early Universe, as well as other cosmological scenarios. Such networks contain a large hierarchy of scales between the string core scale and the Hubble scale, ln( f {sub a} / H ) ∼ 70, which influences the network dynamics by giving the strings large tensions T ≅ π f {sub a} {sup 2} ln( f {sub a} / H ). We present a new numerical approach to simulate such global string networks, capturing the tension without an exponentially large lattice.

  13. Maximal unbordered factors of random strings

    DEFF Research Database (Denmark)

    Cording, Patrick Hagge; Knudsen, Mathias Bæk Tejs

    2016-01-01

    A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border. Loptev, Kucherov, and Starikovskaya [CPM 2015] conjectured the following: If we pick a string of length n from a fixed alphabet uniformly at random...

  14. Dynamics of chaotic strings

    International Nuclear Information System (INIS)

    Schaefer, Mirko

    2011-01-01

    The main topic of this thesis is the investigation of dynamical properties of coupled Tchebycheff map networks. The results give insights into the chaotic string model and its network generalization from a dynamical point of view. As a first approach, discrete symmetry transformations of the model are studied. These transformations are formulated in a general way in order to be also applicable to similar dynamics on bipartite network structures. The dynamics is studied numerically via Lyapunov measures, spatial correlations, and ergodic properties. It is shown that the zeros of the interaction energy are distinguished only with respect to this specific observable, but not by a more general dynamical principle. The original chaotic string model is defined on a one-dimensional lattice (ring-network) as the underlying network topology. This thesis studies a modification of the model based on the introduction of tunable disorder. The effects of inhomogeneous coupling weights as well as small-world perturbations of the ring-network structure on the interaction energy are discussed. Synchronization properties of the chaotic string model and its network generalization are studied in later chapters of this thesis. The analysis is based on the master stability formalism, which relates the stability of the synchronized state to the spectral properties of the network. Apart from complete synchronization, where the dynamics at all nodes of the network coincide, also two-cluster synchronization on bipartite networks is studied. For both types of synchronization it is shown that depending on the type of coupling the synchronized dynamics can display chaotic as well as periodic or quasi-periodic behaviour. The semi-analytical calculations reveal that the respective synchronized states are often stable for a wide range of coupling values even for the ring-network, although the respective basins of attraction may inhabit only a small fraction of the phase space. To provide

  15. Quantum backreaction in string theory

    International Nuclear Information System (INIS)

    Evnin, O.

    2012-01-01

    There are situations in string theory when a finite number of string quanta induce a significant backreaction upon the background and render the perturbation theory infrared-divergent. The simplest example is D0-brane recoil under an impact by closed strings. A more physically interesting case is backreaction on the evolution of a totally compact universe due to closed string gas. Such situations necessitate qualitative amendments to the traditional formulation of string theory in a fixed classical background. In this contribution to the proceedings of the XVII European Workshop on String Theory in Padua, I review solved problems and current investigations in relation to this kind of quantum backreaction effects. (Copyright copyright 2012 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  16. Comparing double string theory actions

    International Nuclear Information System (INIS)

    De Angelis, L.; Gionti, S.J.G.; Marotta, R.; Pezzella, F.

    2014-01-01

    Aimed to a deeper comprehension of a manifestly T-dual invariant formulation of string theory, in this paper a detailed comparison between the non-covariant action proposed by Tseytlin and the covariant one proposed by Hull is done. These are obtained by making both the string coordinates and their duals explicitly appear, on the same footing, in the world-sheet action, so “doubling” the string coordinates along the compact dimensions. After a discussion on the nature of the constraints in both the models and the relative quantization, it results that the string coordinates and their duals behave like “non-commuting” phase space coordinates but their expressions in terms of Fourier modes generate the oscillator algebra of the standard bosonic string. A proof of the equivalence of the two formulations is given. Furthermore, open-string solutions are also discussed

  17. Comparing double string theory actions

    Energy Technology Data Exchange (ETDEWEB)

    De Angelis, L. [Dipartimento di Fisica, Università degli Studi “Federico II” di Napoli,Complesso Universitario Monte S. Angelo ed. 6, via Cintia, 80126 Napoli (Italy); Gionti, S.J.G. [Specola Vaticana, Vatican City, V-00120, Vatican City State and Vatican Observatory Research Group, Steward Observatory, The University Of Arizona, 933 North Cherry Avenue, Tucson, Arizona 85721 (United States); Marotta, R.; Pezzella, F. [Istituto Nazionale di Fisica Nucleare, Sezione di Napoli,Complesso Universitario di Monte S. Angelo ed. 6, via Cintia, 80126 Napoli (Italy)

    2014-04-28

    Aimed to a deeper comprehension of a manifestly T-dual invariant formulation of string theory, in this paper a detailed comparison between the non-covariant action proposed by Tseytlin and the covariant one proposed by Hull is done. These are obtained by making both the string coordinates and their duals explicitly appear, on the same footing, in the world-sheet action, so “doubling” the string coordinates along the compact dimensions. After a discussion on the nature of the constraints in both the models and the relative quantization, it results that the string coordinates and their duals behave like “non-commuting” phase space coordinates but their expressions in terms of Fourier modes generate the oscillator algebra of the standard bosonic string. A proof of the equivalence of the two formulations is given. Furthermore, open-string solutions are also discussed.

  18. Regularized strings with extrinsic curvature

    International Nuclear Information System (INIS)

    Ambjoern, J.; Durhuus, B.

    1987-07-01

    We analyze models of discretized string theories, where the path integral over world sheet variables is regularized by summing over triangulated surfaces. The inclusion of curvature in the action is a necessity for the scaling of the string tension. We discuss the physical properties of models with extrinsic curvature terms in the action and show that the string tension vanishes at the critical point where the bare extrinsic curvature coupling tends to infinity. Similar results are derived for models with intrinsic curvature. (orig.)

  19. Classical theory of radiating strings

    Science.gov (United States)

    Copeland, Edmund J.; Haws, D.; Hindmarsh, M.

    1990-01-01

    The divergent part of the self force of a radiating string coupled to gravity, an antisymmetric tensor and a dilaton in four dimensions are calculated to first order in classical perturbation theory. While this divergence can be absorbed into a renormalization of the string tension, demanding that both it and the divergence in the energy momentum tensor vanish forces the string to have the couplings of compactified N = 1 D = 10 supergravity. In effect, supersymmetry cures the classical infinities.

  20. Cosmic string induced CMB maps

    International Nuclear Information System (INIS)

    Landriau, M.; Shellard, E. P. S.

    2011-01-01

    We compute maps of CMB temperature fluctuations seeded by cosmic strings using high resolution simulations of cosmic strings in a Friedmann-Robertson-Walker universe. We create full-sky, 18 deg. and 3 deg. CMB maps, including the relevant string contribution at each resolution from before recombination to today. We extract the angular power spectrum from these maps, demonstrating the importance of recombination effects. We briefly discuss the probability density function of the pixel temperatures, their skewness, and kurtosis.

  1. Introduction to strings and superstrings

    International Nuclear Information System (INIS)

    Traubenberg, M.R. de.

    1988-01-01

    We discuss the main features on the formulation of string theory that, in a primitive level, describe the hadronic phenomenon of duality. We also study an extension of the models of closed and strings with spin. Then, by using supersymmetry, it is formulated the theory of superstrings and heterotic strings with the aim of unify the fundamental interactions and matter. (M.W.O.) [pt

  2. Experimenting with string musical instruments

    Science.gov (United States)

    LoPresto, Michael C.

    2012-03-01

    What follows are several investigations involving string musical instruments developed for and used in a Science of Sound & Light course. The experiments make use of a guitar, orchestral string instruments and data collection and graphing software. They are designed to provide students with concrete examples of how mathematical formulae, when used in physics, represent reality that can actually be observed, in this case, the operation of string musical instruments.

  3. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.

    Science.gov (United States)

    Dinh, Hieu; Rajasekaran, Sanguthevar

    2011-07-15

    Exact-match overlap graphs have been broadly used in the context of DNA assembly and the shortest super string problem where the number of strings n ranges from thousands to billions. The length ℓ of the strings is from 25 to 1000, depending on the DNA sequencing technologies. However, many DNA assemblers using overlap graphs suffer from the need for too much time and space in constructing the graphs. It is nearly impossible for these DNA assemblers to handle the huge amount of data produced by the next-generation sequencing technologies where the number n of strings could be several billions. If the overlap graph is explicitly stored, it would require Ω(n(2)) memory, which could be prohibitive in practice when n is greater than a hundred million. In this article, we propose a novel data structure using which the overlap graph can be compactly stored. This data structure requires only linear time to construct and and linear memory to store. For a given set of input strings (also called reads), we can informally define an exact-match overlap graph as follows. Each read is represented as a node in the graph and there is an edge between two nodes if the corresponding reads overlap sufficiently. A formal description follows. The maximal exact-match overlap of two strings x and y, denoted by ov(max)(x, y), is the longest string which is a suffix of x and a prefix of y. The exact-match overlap graph of n given strings of length ℓ is an edge-weighted graph in which each vertex is associated with a string and there is an edge (x, y) of weight ω=ℓ-|ov(max)(x, y)| if and only if ω ≤ λ, where |ov(max)(x, y)| is the length of ov(max)(x, y) and λ is a given threshold. In this article, we show that the exact-match overlap graphs can be represented by a compact data structure that can be stored using at most (2λ-1)(2⌈logn⌉+⌈logλ⌉)n bits with a guarantee that the basic operation of accessing an edge takes O(log λ) time. We also propose two algorithms for

  4. String breaking with Wilson loops?

    CERN Document Server

    Kratochvila, S; Kratochvila, Slavo; Forcrand, Philippe de

    2003-01-01

    A convincing, uncontroversial observation of string breaking, when the static potential is extracted from Wilson loops only, is still missing. This failure can be understood if the overlap of the Wilson loop with the broken string is exponentially small. In that case, the broken string ground state will only be seen if the Wilson loop is long enough. Our preliminary results show string breaking in the context of the 3d SU(2) adjoint static potential, using the L\\"uscher-Weisz exponential variance reduction approach. As a by-product, we measure the fundamental SU(2) static potential with improved accuracy and see clear deviations from Casimir scaling.

  5. A primer on string theory

    CERN Document Server

    Schomerus, Volker

    2017-01-01

    Since its conception in the 1960s, string theory has been hailed as one of the most promising routes we have to unify quantum mechanics and general relativity. This book provides a concise introduction to string theory explaining central concepts, mathematical tools and covering recent developments in physics including compactifications and gauge/string dualities. With string theory being a multidisciplinary field interfacing with high energy physics, mathematics and quantum field theory, this book is ideal for both students with no previous knowledge of the field and scholars from other disciplines who are looking for an introduction to basic concepts.

  6. Open problems in string cosmology

    International Nuclear Information System (INIS)

    Toumbas, N.

    2010-01-01

    Some of the open problems in string cosmology are highlighted within the context of the recently constructed thermal and quantum superstring cosmological solutions. Emphasis is given on the high temperature cosmological regime, where it is argued that thermal string vacua in the presence of gravito-magnetic fluxes can be used to bypass the Hagedorn instabilities of string gas cosmology. This article is based on a talk given at the workshop on ''Cosmology and Strings'', Corfu, September 6-13, 2009. (Abstract Copyright [2010], Wiley Periodicals, Inc.)

  7. Multiflavor string-net models

    Science.gov (United States)

    Lin, Chien-Hung

    2017-05-01

    We generalize the string-net construction to multiple flavors of strings, each of which is labeled by the elements of an Abelian group Gi. The same flavor of strings can branch, while different flavors of strings can cross one another and thus they form intersecting string nets. We systematically construct the exactly soluble lattice Hamiltonians and the ground-state wave functions for the intersecting string-net condensed phases. We analyze the braiding statistics of the low-energy quasiparticle excitations and find that our model can realize all the topological phases as the string-net model with group G =∏iGi . In this respect, our construction provides various ways of building lattice models which realize topological order G , corresponding to different partitions of G and thus different flavors of string nets. In fact, our construction concretely demonstrates the Künneth formula by constructing various lattice models with the same topological order. As an example, we construct the G =Z2×Z2×Z2 string-net model which realizes a non-Abelian topological phase by properly intersecting three copies of toric codes.

  8. The ABCDEFG of Little Strings

    OpenAIRE

    Haouzi, Nathan; Kozçaz, Can

    2017-01-01

    Starting from type IIB string theory on an $ADE$ singularity, the (2,0) little string arises when one takes the string coupling $g_s$ to 0. In this setup, we give a unified description of the codimension-two defects of the little string, for any simple Lie algebra ${\\mathfrak{g}}$. Geometrically, these are D5 branes wrapping 2-cycles of the singularity. Equivalently, the defects are specified by a certain set of weights of $^L {\\mathfrak{g}}$, the Langlands dual of ${\\mathfrak{g}}$. As a firs...

  9. String Theory in a Nutshell

    CERN Document Server

    Kiritsis, Elias

    2007-01-01

    This book is the essential new introduction to modern string theory, by one of the world's authorities on the subject. Concise, clearly presented, and up-to-date, String Theory in a Nutshell brings together the best understood and most important aspects of a theory that has been evolving since the early 1980s. A core model of physics that substitutes one-dimensional extended ""strings"" for zero-dimensional point-like particles (as in quantum field theory), string theory has been the leading candidate for a theory that would successfully unify all fundamental forces of nature, includin

  10. Splitting strings on integrable backgrounds

    Energy Technology Data Exchange (ETDEWEB)

    Vicedo, Benoit

    2011-05-15

    We use integrability to construct the general classical splitting string solution on R x S{sup 3}. Namely, given any incoming string solution satisfying a necessary self-intersection property at some given instant in time, we use the integrability of the worldsheet {sigma}-model to construct the pair of outgoing strings resulting from a split. The solution for each outgoing string is expressed recursively through a sequence of dressing transformations, the parameters of which are determined by the solutions to Birkhoff factorization problems in an appropriate real form of the loop group of SL{sub 2}(C). (orig.)

  11. Localizing intracavitary brachytherapy applicators from cone-beam CT x-ray projections via a novel iterative forward projection matching algorithm

    International Nuclear Information System (INIS)

    Pokhrel, Damodar; Murphy, Martin J.; Todor, Dorin A.; Weiss, Elisabeth; Williamson, Jeffrey F.

    2011-01-01

    Purpose: To present a novel method for reconstructing the 3D pose (position and orientation) of radio-opaque applicators of known but arbitrary shape from a small set of 2D x-ray projections in support of intraoperative brachytherapy planning. Methods: The generalized iterative forward projection matching (gIFPM) algorithm finds the six degree-of-freedom pose of an arbitrary rigid object by minimizing the sum-of-squared-intensity differences (SSQD) between the computed and experimentally acquired autosegmented projection of the objects. Starting with an initial estimate of the object's pose, gIFPM iteratively refines the pose parameters (3D position and three Euler angles) until the SSQD converges. The object, here specialized to a Fletcher-Weeks intracavitary brachytherapy (ICB) applicator, is represented by a fine mesh of discrete points derived from complex combinatorial geometric models of the actual applicators. Three pairs of computed and measured projection images with known imaging geometry are used. Projection images of an intrauterine tandem and colpostats were acquired from an ACUITY cone-beam CT digital simulator. An image postprocessing step was performed to create blurred binary applicators only images. To quantify gIFPM accuracy, the reconstructed 3D pose of the applicator model was forward projected and overlaid with the measured images and empirically calculated the nearest-neighbor applicator positional difference for each image pair. Results: In the numerical simulations, the tandem and colpostats positions (x,y,z) and orientations (α,β,γ) were estimated with accuracies of 0.6 mm and 2 deg., respectively. For experimentally acquired images of actual applicators, the residual 2D registration error was less than 1.8 mm for each image pair, corresponding to about 1 mm positioning accuracy at isocenter, with a total computation time of less than 1.5 min on a 1 GHz processor. Conclusions: This work describes a novel, accurate, fast, and completely

  12. Localizing intracavitary brachytherapy applicators from cone-beam CT x-ray projections via a novel iterative forward projection matching algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Pokhrel, Damodar; Murphy, Martin J.; Todor, Dorin A.; Weiss, Elisabeth; Williamson, Jeffrey F. [Department of Radiation Oncology, School of Medicine, Virginia Commonwealth University, Richmond, Virginia 23298 (United States)

    2011-02-15

    Purpose: To present a novel method for reconstructing the 3D pose (position and orientation) of radio-opaque applicators of known but arbitrary shape from a small set of 2D x-ray projections in support of intraoperative brachytherapy planning. Methods: The generalized iterative forward projection matching (gIFPM) algorithm finds the six degree-of-freedom pose of an arbitrary rigid object by minimizing the sum-of-squared-intensity differences (SSQD) between the computed and experimentally acquired autosegmented projection of the objects. Starting with an initial estimate of the object's pose, gIFPM iteratively refines the pose parameters (3D position and three Euler angles) until the SSQD converges. The object, here specialized to a Fletcher-Weeks intracavitary brachytherapy (ICB) applicator, is represented by a fine mesh of discrete points derived from complex combinatorial geometric models of the actual applicators. Three pairs of computed and measured projection images with known imaging geometry are used. Projection images of an intrauterine tandem and colpostats were acquired from an ACUITY cone-beam CT digital simulator. An image postprocessing step was performed to create blurred binary applicators only images. To quantify gIFPM accuracy, the reconstructed 3D pose of the applicator model was forward projected and overlaid with the measured images and empirically calculated the nearest-neighbor applicator positional difference for each image pair. Results: In the numerical simulations, the tandem and colpostats positions (x,y,z) and orientations ({alpha},{beta},{gamma}) were estimated with accuracies of 0.6 mm and 2 deg., respectively. For experimentally acquired images of actual applicators, the residual 2D registration error was less than 1.8 mm for each image pair, corresponding to about 1 mm positioning accuracy at isocenter, with a total computation time of less than 1.5 min on a 1 GHz processor. Conclusions: This work describes a novel, accurate

  13. Localizing intracavitary brachytherapy applicators from cone-beam CT x-ray projections via a novel iterative forward projection matching algorithm.

    Science.gov (United States)

    Pokhrel, Damodar; Murphy, Martin J; Todor, Dorin A; Weiss, Elisabeth; Williamson, Jeffrey F

    2011-02-01

    To present a novel method for reconstructing the 3D pose (position and orientation) of radio-opaque applicators of known but arbitrary shape from a small set of 2D x-ray projections in support of intraoperative brachytherapy planning. The generalized iterative forward projection matching (gIFPM) algorithm finds the six degree-of-freedom pose of an arbitrary rigid object by minimizing the sum-of-squared-intensity differences (SSQD) between the computed and experimentally acquired autosegmented projection of the objects. Starting with an initial estimate of the object's pose, gIFPM iteratively refines the pose parameters (3D position and three Euler angles) until the SSQD converges. The object, here specialized to a Fletcher-Weeks intracavitary brachytherapy (ICB) applicator, is represented by a fine mesh of discrete points derived from complex combinatorial geometric models of the actual applicators. Three pairs of computed and measured projection images with known imaging geometry are used. Projection images of an intrauterine tandem and colpostats were acquired from an ACUITY cone-beam CT digital simulator. An image postprocessing step was performed to create blurred binary applicators only images. To quantify gIFPM accuracy, the reconstructed 3D pose of the applicator model was forward projected and overlaid with the measured images and empirically calculated the nearest-neighbor applicator positional difference for each image pair. In the numerical simulations, the tandem and colpostats positions (x,y,z) and orientations (alpha, beta, gamma) were estimated with accuracies of 0.6 mm and 2 degrees, respectively. For experimentally acquired images of actual applicators, the residual 2D registration error was less than 1.8 mm for each image pair, corresponding to about 1 mm positioning accuracy at isocenter, with a total computation time of less than 1.5 min on a 1 GHz processor. This work describes a novel, accurate, fast, and completely automatic method to

  14. String derived exophobic SU(6)×SU(2) GUTs

    International Nuclear Information System (INIS)

    Bernard, Laura; Faraggi, Alon E.; Glasser, Ivan; Rizos, John; Sonmez, Hasan

    2013-01-01

    With the apparent discovery of the Higgs boson, the Standard Model has been confirmed as the theory accounting for all sub-atomic phenomena. This observation lends further credence to the perturbative unification in Grand Unified Theories (GUTs) and string theories. The free fermionic formalism yielded fertile ground for the construction of quasi-realistic heterotic-string models, which correspond to toroidal Z 2 ×Z 2 orbifold compactifications. In this paper we study a new class of heterotic-string models in which the GUT group is SU(6)×SU(2) at the string level. We use our recently developed fishing algorithm to extract an example of a three generation SU(6)×SU(2) GUT model. We explore the phenomenology of the model and show that it contains the required symmetry breaking Higgs representations. We show that the model admits flat directions that produce a Yukawa coupling for a single family. The novel feature of the SU(6)×SU(2) string GUT models is that they produce an additional family universal anomaly free U(1) symmetry, and may remain unbroken below the string scale. The massless spectrum of the model is free of exotic states.

  15. Strings and superstrings. Electron linear colliders

    International Nuclear Information System (INIS)

    Alessandrini, V.; Bambade, P.; Binetruy, P.; Kounnas, C.; Le Duff, J.; Schwimmer, A.

    1989-01-01

    Basic string theory; strings in interaction; construction of strings and superstrings in arbitrary space-time dimensions; compactification and phenomenology; linear e+e- colliders; and the Stanford linear collider were discussed [fr

  16. Vibration of a string against multiple spring-mass-damper stoppers

    Science.gov (United States)

    Shin, Ji-Hwan; Talib, Ezdiani; Kwak, Moon K.

    2018-02-01

    When a building sways due to strong wind or an earthquake, the elevator rope can undergo resonance, resulting in collision with the hoist-way wall. In this study, a hard stopper and a soft stopper comprised of a spring-mass-damper system installed along the hoist-way wall were considered to prevent the string from undergoing excessive vibrations. The collision of the string with multiple hard stoppers and multiple spring-mass-damper stoppers was investigated using an analytical method. The result revealed new formulas and computational algorithms that are suitable for simulating the vibration of the string against multiple stoppers. The numerical results show that the spring-mass-damper stopper is more effective in suppressing the vibrations of the string and reducing structural failure. The proposed algorithms were shown to be efficient to simulate the motion of the string against a vibration stopper.

  17. Strings, Branes and Symmetries

    International Nuclear Information System (INIS)

    Westerberg, A.

    1997-01-01

    Recent dramatic progress in the understanding of the non-perturbative structure of superstring theory shows that extended objects of various kinds, collectively referred to as p-branes, are an integral part of the theory. In this thesis, comprising an introductory text and seven appended research papers, we study various aspects of p-branes with relevance for superstring theory. The first part of the introductory text is a brief review of string theory focussing on the role of p-branes. In particular, we consider the so-called D-branes which currently are attracting a considerable amount of attention. The purpose of this part is mainly to put into context the results of paper 4, 5 and 6 concerning action functionals describing the low-energy dynamics of D-branes. The discussion of perturbative string theory given in this part of the introduction is also intended to provide some background to paper 2 which contains an application of the Reggeon-sewing approach to the construction of string vertices. The second part covers a rather different subject, namely higher-dimensional loop algebras and their cohomology, with the aim of facilitating the reading of papers 1, 3 and 7. The relation to p-branes is to be found in paper 1 where we introduce a certain higher-dimensional generalization of the loop algebra and discuss its potential applicability as a symmetry algebra for p-branes. Papers 3 and 7 are mathematically oriented out-growths of this paper addressing the issue of realizing algebras of this kind, known in physics as current algebras, in terms of pseudo differential operators (PSDOs). The main result of paper 3 is a proof of the equivalence between certain Lie-algebra cocycles on the space of second-quantizable PSDOs

  18. Topics in string theory

    Science.gov (United States)

    Gorbatov, Elie

    In the first part of the dissertation we study noncommutative field theories at finite temperature. We find evidence for winding states and observe the existence of a transition to a new phase where there is a reduction of the degrees of freedom in the non-planar sector of the theory. We emphasize that such a transition is generic and insensitive to the particulars of the UV definition of the theory. In the second part we investigate some aspects of M-theory compactifications on orbifolds. The heterotic E8 x E 8 string compactified on T4/ ZN has gauge group G x G˜ with massless states in the twisted sector charged under both factors. In the dual M-theory description on T4/ ZN x S1/Z 2 the two groups do not communicate with each other since they reside on the boundary of the eleven dimensional spacetime. This leads to a conundrum for the twisted states of the perturbative heterotic string for there does not seem to be local degrees of freedom which carry charges under both G and G˜. We propose a resolution of this apparent paradox by nonperturbative states in M-theory. In support of our argument we review the consideration of six-dimensional gauge couplings and verify the local anomaly cancellation. In order to understand the dynamical properties of these states we deform the orbifold geometry, find an equivalent string theory background, and brane engineer the low energy six-dimensional field theories. In the process we encounter many exotic and surprising phenomena which are intrinsically M-theoretic and completely invisible to the perturbative observer.

  19. Drill string gas data

    Energy Technology Data Exchange (ETDEWEB)

    Siciliano, E.R.

    1998-05-12

    Data and supporting documentation were compiled and analyzed for 26 cases of gas grab samples taken during waste-tank core sampling activities between September 1, 1995 and December 31, 1997. These cases were tested against specific criteria to reduce uncertainties associated with in-tank sampling location and conditions. Of the 26 possible cases, 16 qualified as drill-string grab samples most likely to represent recently released waste gases. The data from these 16 ``confirmed`` cases were adjusted to remove non-waste gas contributions from core-sampling activities (argon or nitrogen purge), the atmospheric background, and laboratory sampler preparation (helium). The procedure for subtracting atmospheric, laboratory, and argon purge gases was unambiguous. No reliable method for determining the exact amount of nitrogen purge gas was established. Thus, the final set of ``Adjusted`` drill string gas data for the 6 nitrogen-purged cases had a greater degree of uncertainty than the final results for the 10 argon-purged cases. Including the appropriate amounts of uncertainty, this final set of data was added to the set of high-quality results from the Retained Gas Sampler (RGS), and good agreement was found for the N{sub 2}, H{sub 2}, and N{sub 2}O mole fractions sampled from common tanks. These results indicate that under favorable sampling conditions, Drill-String (DS) grab samples can provide reasonably accurate information about the dominant species of released gas. One conclusion from this set of total gas data is that the distribution of the H{sub 2} mole fractions is bimodal in shape, with an upper bound of 78%.

  20. Optical Measurement of Cable and String Vibration

    Directory of Open Access Journals (Sweden)

    Y. Achkire

    1998-01-01

    Full Text Available This paper describes a non contacting measurement technique for the transverse vibration of small cables and strings using an analog position sensing detector. On the one hand, the sensor is used to monitor the cable vibrations of a small scale mock-up of a cable structure in order to validate the nonlinear cable dynamics model. On the other hand, the optical sensor is used to evaluate the performance of an active tendon control algorithm with guaranteed stability properties. It is demonstrated experimentally, that a force feedback control law based on a collocated force sensor measuring the tension in the cable is feasible and provides active damping in the cable.

  1. Transmutations for Strings

    Directory of Open Access Journals (Sweden)

    Amin Boumenir

    2008-07-01

    Full Text Available We investigate the existence and representation of transmutations, also known as transformation operators, for strings. Using measure theory and functional analytic methods we prove their existence and study their representation. We show that in general they are not close to unity since their representation does not involve a Volterra operator but rather the eigenvalue parameter. We also obtain conditions under which the transmutation is either a bounded or a compact operator. Explicit examples show that they cannot be reduced to Volterra type operators.  

  2. Sequestering in string theory

    International Nuclear Information System (INIS)

    Kachru, Shamit; McAllister, Liam; Sundrum, Raman

    2007-01-01

    We study sequestering, a prerequisite for flavor-blind supersymmetry breaking in several high-scale mediation mechanisms, in compactifications of type IIB string theory. We find that although sequestering is typically absent in unwarped backgrounds, strongly warped compactifications do readily sequester. The AdS/CFT dual description in terms of conformal sequestering plays an important role in our analysis, and we establish how sequestering works both on the gravity side and on the gauge theory side. We pay special attention to subtle compactification effects that can disrupt sequestering. Our result is a step toward realizing an appealing pattern of soft terms in a KKLT compactification

  3. Drilling string lifter

    Energy Technology Data Exchange (ETDEWEB)

    Shakhobalov, A B; Galiopa, A A; Ponomarev, G V; Ushakov, A M

    1981-04-28

    A drilling string lifter is suggested which includes a rotating tower installed on a fixed base, hydraulic cylinder and pipe-clamping assembly connected through a chain gear to the drive motor. In order to simplify the design of the hydraulic lifter, the drive motor is installed on a fixed base so that the axis of the outlet shaft of the drive motor coincides with the axis of rotation of the tower. In addition, the axis of rotation of the tower is made in the form of a tubular element, and the outlet shaft of the drive motor is ranged between the tubular element.

  4. Nuclear fuel string assembly

    International Nuclear Information System (INIS)

    Ip, A.K.; Koyanagi, K.; Tarasuk, W.R.

    1976-01-01

    A method of fabricating rodded fuels suitable for use in pressure tube type reactors and in pressure vessel type reactors is described. Fuel rods are secured as an inner and an outer sub-assembly, each rod attached between mounting rings secured to the rod ends. The two sub-assemblies are telescoped together and positioned by spaced thimbles located between them to provide precise positioning while permittng differential axial movement between the sub-assemblies. Such sub-assemblies are particularly suited for mounting as bundle strings. The method provides particular advantages in the assembly of annular-section fuel pins, which includes booster fuel containing enriched fuel material. (LL)

  5. Y-system and quasi-classical strings

    Energy Technology Data Exchange (ETDEWEB)

    Gromov, Nikolay [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; St. Petersburg INP, Gatchina, St. Petersburg (Russian Federation)

    2009-11-15

    Recently Kazakov, Vieira and the author conjectured the Y-system set of equations describing the planar spectrum of AdS/CFT. In this paper we solve the Y-system equations in the strong coupling scaling limit. We show that the quasi-classical spectrum of string moving inside AdS{sub 3} x S{sup 1} matches precisely with the prediction of the Y-system. Thus the Y-system, unlike the asymptotic Bethe ansatz, describes correctly the spectrum of one-loop string energies including all exponential finite size corrections. This gives a very non-trivial further support in favor of the conjecture. (orig.)

  6. 'Hard' effects in Monte Carlo proton-(anti) proton events of soft two-string dual parton model, e+e- annihilation and cascade scaling break of string and the theory of the open string

    International Nuclear Information System (INIS)

    Lugovoj, V.V.

    1998-01-01

    At proton-(anti) proton scattering in the frame of two-string Dual Parton Model the semihard parton-parton interactions can lead to the valence (anti) (di) quark excitations which lead to the production of up to four fast hadron leaders, and the process of soft colour interaction between constituents leads to formation of two primary strings, which decay into secondary hadrons according to a new cascade model of string breaking, which corresponds to the fundamental interaction of the theory of the open string. Therefore the recent results of the theory of QCD open string (about the small deviations of the string stretch direction near the longitudinal direction) are used in the algorithm of string breaking. For the fitted values of the free parameters in the process of decay of mother string into two daughter strings the energy (momentum) distributions for the first and second daughter strings are similar to momentum distributions for valence quark and antiquark in meson. This Monte Carlo model with 9 free parameters agrees well with the multiplicity, pseudorapidity, transverse momentum (up to p T =4GeV) distributions and correlations between the average transverse momentum and multiplicity of secondary particles produced by ISR, SS, Tevatron experiments (√s=27 to 1800 GeV). There is quantitative (and qualitative) explanation for correlations between the average transverse momentum and multiplicity for different types of secondary particles (antiprotons, kaons, pions) at √s =1800 GeV. A cascade model of string breaking is a new Monte Carlo model for hadronization which agrees well with the experimental multiplicity, rapidity, transverse momentum distributions of secondary particles produced by e + e - annihilation at E c.m. =3GeV. (author)

  7. Vacuum strings in FRW models

    Energy Technology Data Exchange (ETDEWEB)

    Dyer, C C; Oattes, L M; Starkman, G D

    1988-01-01

    The authors find that vacuum string solutions cannot be embedded in an FRW model in the spirit of the swiss cheese model for inhomogeneities. Since all standard lensing calculations rely implicitly on the Swiss Cheese model, this result indicates that the previous lensing results for the vacuum string may be in error.

  8. Tadpole resummations in string theory

    International Nuclear Information System (INIS)

    Kitazawa, Noriaki

    2008-01-01

    While R-R tadpoles should be canceled for consistency, string models with broken supersymmetry generally have uncanceled NS-NS tadpoles. Their presence signals that the background does not solve the field equations, so that these models are in 'wrong' vacua. In this Letter we investigate, with reference to some prototype examples, whether the true values of physical quantities can be recovered resumming the NS-NS tadpoles, hence by an approach that is related to the analysis based on String Field Theory by open-closed duality. We show that, indeed, the positive classical vacuum energy of a Dp-brane of the bosonic string is exactly canceled by the negative contribution arising from tree-level tadpole resummation, in complete agreement with Sen's conjecture on open-string tachyon condensation and with the consequent analysis based on String Field Theory. We also show that the vanishing classical vacuum energy of the SO(8192) unoriented bosonic open-string theory does not receive any tree-level corrections from the tadpole resummation. This result is consistent with the fact that this (unstable) configuration is free from tadpoles of massless closed-string modes, although there is a tadpole of the closed string tachyon. The application of this method to superstring models with broken supersymmetry is also discussed

  9. String theory and water waves

    International Nuclear Information System (INIS)

    Iyer, Ramakrishnan; Johnson, Clifford V; Pennington, Jeffrey S

    2011-01-01

    We uncover a remarkable role that an infinite hierarchy of nonlinear differential equations plays in organizing and connecting certain c-hat <1 string theories non-perturbatively. We are able to embed the type 0A and 0B (A, A) minimal string theories into this single framework. The string theories arise as special limits of a rich system of equations underpinned by an integrable system known as the dispersive water wave hierarchy. We observe that there are several other string-like limits of the system, and conjecture that some of them are type IIA and IIB (A, D) minimal string backgrounds. We explain how these and several string-like special points arise and are connected. In some cases, the framework endows the theories with a non-perturbative definition for the first time. Notably, we discover that the Painleve IV equation plays a key role in organizing the string theory physics, joining its siblings, Painleve I and II, whose roles have previously been identified in this minimal string context.

  10. Cool Runnings For String 2

    CERN Multimedia

    2001-01-01

    String 2 is a series of superconducting magnets that are prototypes of those which will be installed in the LHC. It was cooled down to 1.9 Kelvin on September 14th. On Thursday last week, the dipoles of String 2 were successfully taken to nominal current, 11850 A.

  11. N-loop string amplitude

    International Nuclear Information System (INIS)

    Mandelstam, S.

    1986-06-01

    Work on the derivation of an explicit perturbation series for string and superstring amplitudes is reviewed. The light-cone approach is emphasized, but some work on the Polyakov approach is also mentioned, and the two methods are compared. The calculation of the measure factor is outlined in the interacting-string picture

  12. String-localized quantum fields

    International Nuclear Information System (INIS)

    Mund, Jens; Santos, Jose Amancio dos; Silva, Cristhiano Duarte; Oliveira, Erichardson de

    2009-01-01

    Full text. The principles of physics admit (unobservable) quantum fields which are localized not on points, but on strings in the sense of Mandelstam: a string emanates from a point in Minkowski space and extends to infinity in some space-like direction. This type of localization might permit the construction of new models, for various reasons: (a) in general, weaker localization implies better UV behaviour. Therefore, the class of renormalizable interactions in the string-localized has a chance to be larger than in the point-localized case; (b) for certain particle types, there are no point-localized (free) quantum fields - for example Anyons in d = 2 + 1, and Wigner's massless 'infinite spin' particles. For the latter, free string-localized quantum fields have been constructed; (c) in contrast to the point-localized case, string-localization admits covariant vector/tensor potentials for fotons and gravitons in a Hilbert space representation with positive energy. We shall present free string-localized quantum fields for various particle types, and some ideas about the perturbative construction of interacting string-localized fields. A central point will be an analogue of gauge theories, completely within a Hilbert space and without ghosts, trading gauge dependence with dependence on the direction of the localization string. In order to discuss renormalizability (item (a)), methods from microlocal analysis (wave front set and scaling degree) are needed. (author)

  13. A Platonic Sextet for Strings

    Science.gov (United States)

    Schaffer, Karl

    2012-01-01

    The use of traditional string figures by the Dr. Schaffer and Mr. Stern Dance Ensemble led to experimentation with polyhedral string constructions. This article presents a series of polyhedra made with six loops of three colors which sequence through all the Platonic Solids.

  14. Symmetry breaking in string theory

    International Nuclear Information System (INIS)

    Potting, R.

    1998-01-01

    A mechanism for a spontaneous breakdown of CPT symmetry appears in string theory, with possible implications for particle models. A realistic string theory might exhibit CPT violation at levels detectable in current or future experiments. A possible new mechanism for baryogenesis in the early Universe is also discussed

  15. Energy in a String Wave

    Science.gov (United States)

    Ng, Chiu-king

    2010-01-01

    When one end of a taut horizontal elastic string is shaken repeatedly up and down, a transverse wave (assume sine waveform) will be produced and travel along it. College students know this type of wave motion well. They know when the wave passes by, each element of the string will perform an oscillating up-down motion, which in mechanics is termed…

  16. String theory : physics or metaphysics?

    CERN Document Server

    Veneziano, Gabriele

    2010-01-01

    I will give arguments for why the enormous progress made during the last century on understanding elementary particles and their fundamental interactions suggests strings as the truly elementary constituents of Nature. I will then address the issue of whether the string paradigm can in principle be falsified or whether it should be considered as mere metaphysics.

  17. Differential formulation in string theories

    International Nuclear Information System (INIS)

    Guzzo, M.M.

    1987-01-01

    The equations of gauge invariance motion for theories of boson open strings and Neveu-Schwarz and Ramond superstring are derived. A construction for string theories using differential formalism, is introduced. The importance of BRST charge for constructing such theories and the necessity of introduction of auxiliary fields are verified. (M.C.K.) [pt

  18. Deformations of topological open strings

    NARCIS (Netherlands)

    Hofman, C.; Ma, Whee Ky

    Deformations of topological open string theories are described, with an emphasis on their algebraic structure. They are encoded in the mixed bulk-boundary correlators. They constitute the Hochschild complex of the open string algebra - the complex of multilinear maps on the boundary Hilbert space.

  19. Experimenting with String Musical Instruments

    Science.gov (United States)

    LoPresto, Michael C.

    2012-01-01

    What follows are several investigations involving string musical instruments developed for and used in a "Science of Sound & Light" course. The experiments make use of a guitar, orchestral string instruments and data collection and graphing software. They are designed to provide students with concrete examples of how mathematical formulae, when…

  20. Progress in string theory research

    CERN Document Server

    2016-01-01

    At the first look, the String Theory seems just an interesting and non-trivial application of the quantum mechanics and the special relativity to vibrating strings. By itself, the quantization of relativistic strings does not call the attention of the particle physicist as a significant paradigm shift. However, when the string quantization is performed by applying the standard rules of the perturbative Quantum Field Theory, one discovers that the strings in certain states have the same physical properties as the gravity in the flat space-time. Chapter one of this book reviews the construction of the thermal bosonic string and D-brane in the framework of the Thermo Field Dynamics (TFD). It briefly recalls the wellknown light-cone quantization of the bosonic string in the conformal gauge in flat space-time, and gives a bird’s eye view of the fundamental concepts of the TFD. Chapter two examines a visual model inspired by string theory, on the system of interacting anyons. Chapter three investigate the late-ti...

  1. Gauge invariance of string fields

    International Nuclear Information System (INIS)

    Banks, T.; Peskin, M.E.

    1985-10-01

    Some work done to understand the appearance of gauge bosons and gravitons in string theories is reported. An action has been constructed for free (bosonic) string field theory which is invariant under an infinite set of gauge transformations which include Yang-Mills transformations and general coordinate transformations as special cases. 15 refs., 1 tab

  2. String dualities and superpotential

    International Nuclear Information System (INIS)

    Ha, Tae-Won

    2010-09-01

    The main objective of this thesis is the computation of the superpotential induced by D5- branes in the type IIB string theory and by five-branes in the heterotic string theory. Both superpotentials have the same functional form which is the chain integral of the holomorphic three-form. Using relative (co)homology we can unify the flux and brane superpotential. The chain integral can be seen as an example of the Abel-Jacobi map. We discuss many structures such as mixed Hodge structure which allows for the computation of Picard-Fuchs differential equations crucial for explicit computations. We blow up the Calabi-Yau threefold along the submanifold wrapped by the brane to obtain geometrically more appropriate configuration. The resulting geometry is non-Calabi-Yau and we have a canonically given divisor. This blown-up geometry makes it possible to restrict our attention to complex structure deformations. However, the direct computation is yet very difficult, thus the main tool for computation will be the lift of the brane configuration to a F-theory compactification. In F-theory, since complex structure, brane and, if present, bundlemoduli are all contained in the complex structure moduli space of the elliptic Calabi-Yau fourfold, the computation can be dramatically simplified. The heterotic/F-theory duality is extended to include the blow-up geometry and thereby used to give the blow-up geometry amore physical meaning. (orig.)

  3. String dualities and superpotential

    Energy Technology Data Exchange (ETDEWEB)

    Ha, Tae-Won

    2010-09-15

    The main objective of this thesis is the computation of the superpotential induced by D5- branes in the type IIB string theory and by five-branes in the heterotic string theory. Both superpotentials have the same functional form which is the chain integral of the holomorphic three-form. Using relative (co)homology we can unify the flux and brane superpotential. The chain integral can be seen as an example of the Abel-Jacobi map. We discuss many structures such as mixed Hodge structure which allows for the computation of Picard-Fuchs differential equations crucial for explicit computations. We blow up the Calabi-Yau threefold along the submanifold wrapped by the brane to obtain geometrically more appropriate configuration. The resulting geometry is non-Calabi-Yau and we have a canonically given divisor. This blown-up geometry makes it possible to restrict our attention to complex structure deformations. However, the direct computation is yet very difficult, thus the main tool for computation will be the lift of the brane configuration to a F-theory compactification. In F-theory, since complex structure, brane and, if present, bundlemoduli are all contained in the complex structure moduli space of the elliptic Calabi-Yau fourfold, the computation can be dramatically simplified. The heterotic/F-theory duality is extended to include the blow-up geometry and thereby used to give the blow-up geometry amore physical meaning. (orig.)

  4. Cosmology from string theory

    International Nuclear Information System (INIS)

    Anchordoqui, Luis; Nawata, Satoshi; Goldberg, Haim; Nunez, Carlos

    2007-01-01

    We explore the cosmological content of Salam-Sezgin six-dimensional supergravity, and find a solution to the field equations in qualitative agreement with observation of distant supernovae, primordial nucleosynthesis abundances, and recent measurements of the cosmic microwave background. The carrier of the acceleration in the present de Sitter epoch is a quintessence field slowly rolling down its exponential potential. Intrinsic to this model is a second modulus which is automatically stabilized and acts as a source of cold dark matter, with a mass proportional to an exponential function of the quintessence field (hence realizing varying mass particle models within a string context). However, any attempt to saturate the present cold dark matter component in this manner leads to unacceptable deviations from cosmological data--a numerical study reveals that this source can account for up to about 7% of the total cold dark matter budget. We also show that (1) the model will support a de Sitter energy in agreement with observation at the expense of a miniscule breaking of supersymmetry in the compact space; (2) variations in the fine structure constant are controlled by the stabilized modulus and are negligible; (3) ''fifth'' forces are carried by the stabilized modulus and are short range; (4) the long time behavior of the model in four dimensions is that of a Robertson-Walker universe with a constant expansion rate (w=-1/3). Finally, we present a string theory background by lifting our six-dimensional cosmological solution to ten dimensions

  5. Poisson hierarchy of discrete strings

    International Nuclear Information System (INIS)

    Ioannidou, Theodora; Niemi, Antti J.

    2016-01-01

    The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

  6. Basic Concepts of String Theory

    CERN Document Server

    Blumenhagen, Ralph; Theisen, Stefan

    2013-01-01

    The purpose of this book is to thoroughly prepare the reader for research in string theory. It is intended as a textbook in the sense that, starting from the basics, the material is presented in a pedagogical and self-contained fashion. The emphasis is on the world-sheet perspective of closed strings and of open strings ending on D-branes, where two-dimensional conformal field theory is the main tool. Compactifications of string theory, with and without fluxes, and string dualities are also discussed from the space-time point of view, i.e. in geometric language. End-of-chapter references have been added to guide the reader intending to pursue further studies or to start research in the topics covered by this book.

  7. Strings, conformal fields and topology

    International Nuclear Information System (INIS)

    Kaku, Michio

    1991-01-01

    String Theory has advanced at an astonishing pace in the last few years, and this book aims to acquaint the reader with the most active topics of research in the field. Building on the foundations laid in his Introduction to Superstrings, Professor Kaku discusses such topics as the classification of conformal string theories, knot theory, the Yang-Baxter relation, quantum groups, the non-polynominal closed string field theory, matrix models, and topological field theory. Several chapters review the fundamentals of string theory, making the presentation of the material self-contained while keeping overlap with the earlier book to a minimum. The book conveys the vitality of current research in string theory and places readers at its forefront. (orig.) With 40 figs. in 50 parts

  8. Poisson hierarchy of discrete strings

    Energy Technology Data Exchange (ETDEWEB)

    Ioannidou, Theodora, E-mail: ti3@auth.gr [Faculty of Civil Engineering, School of Engineering, Aristotle University of Thessaloniki, 54249, Thessaloniki (Greece); Niemi, Antti J., E-mail: Antti.Niemi@physics.uu.se [Department of Physics and Astronomy, Uppsala University, P.O. Box 803, S-75108, Uppsala (Sweden); Laboratoire de Mathematiques et Physique Theorique CNRS UMR 6083, Fédération Denis Poisson, Université de Tours, Parc de Grandmont, F37200, Tours (France); Department of Physics, Beijing Institute of Technology, Haidian District, Beijing 100081 (China)

    2016-01-28

    The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

  9. Basic concepts of string theory

    International Nuclear Information System (INIS)

    Blumenhagen, Ralph

    2013-01-01

    The purpose of this book is to thoroughly prepare the reader for research in string theory. It is intended as a textbook in the sense that, starting from the basics, the material is presented in a pedagogical and self-contained fashion. The emphasis is on the world-sheet perspective of closed strings and of open strings ending on D-branes, where two-dimensional conformal field theory is the main tool. Compactifications of string theory, with and without fluxes, and string dualities are also discussed from the space-time point of view, i.e. in geometric language. End-of-chapter references have been added to guide the reader intending to pursue further studies or to start research in the topics covered by this book.

  10. Testing string theory at LHC?

    CERN Multimedia

    CERN. Geneva

    2002-01-01

    A theory with such mathematical beauty cannot be wrong: this is one of the main arguments in favour of string theory, which unifies all known physical theories of fundamental interactions in a single coherent description of the universe. But no one has ever observed strings, not even indirectly, nor the space of extra dimensions where they live. However there are good reasons to believe that the 'hidden' dimensions of string theory may be much larger than what we thought in the past and that they may be within experimental reach in the near future - together with the strings themselves. In my talk, I will give an elementary introduction of string theory and describe the main experimental predictions.Organiser(s): Jasper Kirkby / EP DivisionNote: Tea & coffee will be served at 16.00 hrs.

  11. Physically Inspired Models for the Synthesis of Stiff Strings with Dispersive Waveguides

    Directory of Open Access Journals (Sweden)

    Testa I

    2004-01-01

    Full Text Available We review the derivation and design of digital waveguides from physical models of stiff systems, useful for the synthesis of sounds from strings, rods, and similar objects. A transform method approach is proposed to solve the classic fourth-order equations of stiff systems in order to reduce it to two second-order equations. By introducing scattering boundary matrices, the eigenfrequencies are determined and their dependency is discussed for the clamped, hinged, and intermediate cases. On the basis of the frequency-domain physical model, the numerical discretization is carried out, showing how the insertion of an all-pass delay line generalizes the Karplus-Strong algorithm for the synthesis of ideally flexible vibrating strings. Knowing the physical parameters, the synthesis can proceed using the generalized structure. Another point of view is offered by Laguerre expansions and frequency warping, which are introduced in order to show that a stiff system can be treated as a nonstiff one, provided that the solutions are warped. A method to compute the all-pass chain coefficients and the optimum warping curves from sound samples is discussed. Once the optimum warping characteristic is found, the length of the dispersive delay line to be employed in the simulation is simply determined from the requirement of matching the desired fundamental frequency. The regularization of the dispersion curves by means of optimum unwarping is experimentally evaluated.

  12. Oriented open-closed string theory revisited

    International Nuclear Information System (INIS)

    Zwiebach, B.

    1998-01-01

    String theory on D-brane backgrounds is open-closed string theory. Given the relevance of this fact, we give details and elaborate upon our earlier construction of oriented open-closed string field theory. In order to incorporate explicitly closed strings, the classical sector of this theory is open strings with a homotopy associative A ∞ algebraic structure. We build a suitable Batalin-Vilkovisky algebra on moduli spaces of bordered Ricmann surfaces, the construction of which involves a few subtleties arising from the open string punctures and cyclicity conditions. All vertices coupling open and closed strings through disks are described explicitly. Subalgebras of the algebra of surfaces with boundaries are used to discuss symmetries of classical open string theory induced by the closed string sector, and to write classical open string field theory on general closed string backgrounds. We give a preliminary analysis of the ghost-dilaton theorem. copyright 1998 Academic Press, Inc

  13. A string theory which isn't about strings

    Science.gov (United States)

    Lee, Kanghoon; Rey, Soo-Jong; Rosabal, J. A.

    2017-11-01

    Quantization of closed string proceeds with a suitable choice of worldsheet vacuum. A priori, the vacuum may be chosen independently for left-moving and right-moving sectors. We construct ab initio quantized bosonic string theory with left-right asymmetric worldsheet vacuum and explore its consequences and implications. We critically examine the validity of new vacuum and carry out first-quantization using standard operator formalism. Remarkably, the string spectrum consists only of a finite number of degrees of freedom: string gravity (massless spin-two, Kalb-Ramond and dilaton fields) and two massive spin-two Fierz-Pauli fields. The massive spin-two fields have negative norm, opposite mass-squared, and provides a Lee-Wick type extension of string gravity. We compute two physical observables: tree-level scattering amplitudes and one-loop cosmological constant. Scattering amplitude of four dilatons is shown to be a rational function of kinematic invariants, and in D = 26 factorizes into contributions of massless spin-two and a pair of massive spin-two fields. The string one loop partition function is shown to perfectly agree with one loop Feynman diagram of string gravity and two massive spin-two fields. In particular, it does not exhibit modular invariance. We critically compare our construction with recent studies and contrast differences.

  14. Conformal techniques in string theory and string field theory

    International Nuclear Information System (INIS)

    Giddings, S.B.

    1987-01-01

    The application of some conformal and Riemann surface techniques to string theory and string field theory is described. First a brief review of Riemann surface techniques and of the Polyakov approach to string theory is presented. This is followed by a discussion of some features of string field theory and of its Feynman rules. Specifically, it is shown that the Feynman diagrams for Witten's string field theory respect modular invariance, and in particular give a triangulation of moduli space. The Polyakov formalism is then used to derive the Feynman rules that should follow from this theory upon gauge-fixing. It should also be possible to apply this derivation to deduce the Feynman rules for other gauge-fixed string field theories. Following this, Riemann surface techniques are turned to the problem of proving the equivalence of the Polyakov and light-cone formalisms. It is first shown that the light-cone diagrams triangulate moduli space. Then the Polyakov measure is worked out for these diagrams, and shown to equal that deduced from the light-cone gauge fixed formalism. Also presented is a short description of the comparison of physical states in the two formalisms. The equivalence of the two formalisms in particular constitutes a proof of the unitarity of the Polyakov framework for the closed bosonic string

  15. D-strings in unconventional type I vacuum configurations

    International Nuclear Information System (INIS)

    Bianchi, M.; Gava, E.; Morales, F.; Narain, K.S.

    1998-11-01

    We determine the spectrum of D-string bound states in various classes of generalized type I vacuum configurations with sixteen and eight supercharges. The precise matching of the BPS spectra confirms the duality between unconventional type IIB orientfolds with quantized NS-NS antisymmetric tensor and heterotic CHL models in D=8. A similar analysis puts the duality between type II (4,0) models and type I strings without open strings on a firmer ground. The analysis can be extended to type II (2,0) asymmetric orbifolds and their type I duals that correspond to unconventional K3 compactifications. Finally we discuss BPS-saturated threshold corrections to the corresponding low-energy effective lagrangians. In particular we show how the exact moduli dependence of some F 4 terms in the eight-dimensional type II (4,0) orbifold is reproduced by the infinite sum of D-instanton contributions in the dual type I theory. (author)

  16. Access, Rank, and Select in Grammar-compressed Strings

    DEFF Research Database (Denmark)

    Belazzougui, Djamal; Cording, Patrick Hagge; Puglisi, Simon J.

    2015-01-01

    Given a string S of length N on a fixed alphabet of σ symbols, a grammar compressor produces a context-free grammar G of size n that generates S and only S. In this paper we describe data structures to support the following operations on a grammar-compressed string: access(S,i,j) (return substring...... consecutive symbols from S. Alternatively, we can achieve \\O(logτN+m/logσN) query time using \\O(nτlogτ(N/n)logN) bits of space, matching a lower bound stated by Verbin and Yu for strings where N is polynomially related to n when τ = log ε N. For rank and select we describe data structures of size \\O...

  17. A procalcitonin-based algorithm to guide antibiotic therapy in secondary peritonitis following emergency surgery: a prospective study with propensity score matching analysis.

    Science.gov (United States)

    Huang, Ting-Shuo; Huang, Shie-Shian; Shyu, Yu-Chiau; Lee, Chun-Hui; Jwo, Shyh-Chuan; Chen, Pei-Jer; Chen, Huang-Yang

    2014-01-01

    Procalcitonin (PCT)-based algorithms have been used to guide antibiotic therapy in several clinical settings. However, evidence supporting PCT-based algorithms for secondary peritonitis after emergency surgery is scanty. In this study, we aimed to investigate whether a PCT-based algorithm could safely reduce antibiotic exposure in this population. From April 2012 to March 2013, patients that had secondary peritonitis diagnosed at the emergency department and underwent emergency surgery were screened for eligibility. PCT levels were obtained pre-operatively, on post-operative days 1, 3, 5, and 7, and on subsequent days if needed. Antibiotics were discontinued if PCT was Advanced age, coexisting pulmonary diseases, and higher severity of illness were significantly associated with longer durations of antibiotic use. The PCT-based algorithm safely reduces antibiotic exposure in this study. Further randomized trials are needed to confirm our findings and incorporate cost-effectiveness analysis. Australian New Zealand Clinical Trials Registry ACTRN12612000601831.

  18. String model of elementary particles

    International Nuclear Information System (INIS)

    Kikkawa, Keiji

    1975-01-01

    Recent development of the models of elementary particles is described. The principal features of elementary particle physics can be expressed by quark model, mass spectrum, the Regge behavior of scattering amplitude, and duality. Venezians showed in 1968 that the B function can express these features. From the analysis of mass spectrum, the string model was introduced. The quantization of the string is performed with the same procedure as the ordinary quantum mechanics. The motion of the string is determined by the Nambu-Goto action integral, and the Schroedinger equation is obtained. Mass spectrum from the string model was same as that from the duality model such as Veneziano model. The interaction between strings can be introduced, and the Lagrangian can be formulated. The relation between the string model and the duality model has been studied. The string model is the first theory of non-local field, and the further development is attractive. The relation between this model and the quark model is still not clear. (Kato, T.)

  19. String bit models for superstring

    International Nuclear Information System (INIS)

    Bergman, O.; Thorn, C.B.

    1995-01-01

    The authors extend the model of string as a polymer of string bits to the case of superstring. They mainly concentrate on type II-B superstring, with some discussion of the obstacles presented by not II-B superstring, together with possible strategies for surmounting them. As with previous work on bosonic string work within the light-cone gauge. The bit model possesses a good deal less symmetry than the continuous string theory. For one thing, the bit model is formulated as a Galilei invariant theory in (D - 2) + 1 dimensional space-time. This means that Poincare invariance is reduced to the Galilei subgroup in D - 2 space dimensions. Naturally the supersymmetry present in the bit model is likewise dramatically reduced. Continuous string can arise in the bit models with the formation of infinitely long polymers of string bits. Under the right circumstances (at the critical dimension) these polymers can behave as string moving in D dimensional space-time enjoying the full N = 2 Poincare supersymmetric dynamics of type II-B superstring

  20. String bit models for superstring

    Energy Technology Data Exchange (ETDEWEB)

    Bergman, O.; Thorn, C.B.

    1995-12-31

    The authors extend the model of string as a polymer of string bits to the case of superstring. They mainly concentrate on type II-B superstring, with some discussion of the obstacles presented by not II-B superstring, together with possible strategies for surmounting them. As with previous work on bosonic string work within the light-cone gauge. The bit model possesses a good deal less symmetry than the continuous string theory. For one thing, the bit model is formulated as a Galilei invariant theory in (D {minus} 2) + 1 dimensional space-time. This means that Poincare invariance is reduced to the Galilei subgroup in D {minus} 2 space dimensions. Naturally the supersymmetry present in the bit model is likewise dramatically reduced. Continuous string can arise in the bit models with the formation of infinitely long polymers of string bits. Under the right circumstances (at the critical dimension) these polymers can behave as string moving in D dimensional space-time enjoying the full N = 2 Poincare supersymmetric dynamics of type II-B superstring.

  1. Fermions on the electroweak string

    CERN Document Server

    Moreno, J M; Quirós, Mariano; Moreno, J M; Oaknin, D H; Quiros, M

    1995-01-01

    We construct a simple class of exact solutions of the electroweak theory including the naked Z--string and fermion fields. It consists in the Z--string configuration (\\phi,Z_\\theta), the {\\it time} and z components of the neutral gauge bosons (Z_{0,3},A_{0,3}) and a fermion condensate (lepton or quark) zero mode. The Z--string is not altered (no feed back from the rest of fields on the Z--string) while fermion condensates are zero modes of the Dirac equation in the presence of the Z--string background (no feed back from the {\\it time} and z components of the neutral gauge bosons on the fermion fields). For the case of the n--vortex Z--string the number of zero modes found for charged leptons and quarks is (according to previous results by Jackiw and Rossi) equal to |n|, while for (massless) neutrinos is |n|-1. The presence of fermion fields in its core make the obtained configuration a superconducting string, but their presence (as well as that of Z_{0,3},A_{0,3}) does not enhance the stability of the Z--stri...

  2. Gravity and strings

    CERN Document Server

    Ortín, Tomás

    2015-01-01

    Self-contained and comprehensive, this definitive new edition of Gravity and Strings is a unique resource for graduate students and researchers in theoretical physics. From basic differential geometry through to the construction and study of black-hole and black-brane solutions in quantum gravity - via all the intermediate stages - this book provides a complete overview of the intersection of gravity, supergravity, and superstrings. Now fully revised, this second edition covers an extensive array of topics, including new material on non-linear electric-magnetic duality, the electric-tensor formalism, matter-coupled supergravity, supersymmetric solutions, the geometries of scalar manifolds appearing in 4- and 5-dimensional supergravities, and much more. Covering reviews of important solutions and numerous solution-generating techniques, and accompanied by an exhaustive index and bibliography, this is an exceptional reference work.

  3. Fingerprints in compressed strings

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Cording, Patrick Hagge

    2017-01-01

    In this paper we show how to construct a data structure for a string S of size N compressed into a context-free grammar of size n that supports efficient Karp–Rabin fingerprint queries to any substring of S. That is, given indices i and j, the answer to a query is the fingerprint of the substring S......[i,j]. We present the first O(n) space data structures that answer fingerprint queries without decompressing any characters. For Straight Line Programs (SLP) we get O(log⁡N) query time, and for Linear SLPs (an SLP derivative that captures LZ78 compression and its variations) we get O(log⁡log⁡N) query time...

  4. Field theory and strings

    International Nuclear Information System (INIS)

    Bonara, L.; Cotta-Ramusino, P.; Rinaldi, M.

    1987-01-01

    It is well-known that type I and heterotic superstring theories have a zero mass spectrum which correspond to the field content of N=1 supergravity theory coupled to supersymmetric Yang-Mills theory in 10-D. The authors study the field theory ''per se'', in the hope that simple consistency requirements will determine the theory completely once one knows the field content inherited from string theory. The simplest consistency requirements are: N=1 supersymmetry; and absence of chiral anomalies. This is what the authors discuss in this paper here leaving undetermined the question of the range of validity of the resulting field theory. As is known, a model of N=1 supergravity (SUGRA) coupled to supersymmetric Yang-Mills (SYM) theory was known in the form given by Chapline and Manton. The coupling of SUGRA to SYM was determined by the definition of the ''field strength'' 3-form H in this paper

  5. Large scale CMB anomalies from thawing cosmic strings

    Energy Technology Data Exchange (ETDEWEB)

    Ringeval, Christophe [Centre for Cosmology, Particle Physics and Phenomenology, Institute of Mathematics and Physics, Louvain University, 2 Chemin du Cyclotron, 1348 Louvain-la-Neuve (Belgium); Yamauchi, Daisuke; Yokoyama, Jun' ichi [Research Center for the Early Universe (RESCEU), Graduate School of Science, The University of Tokyo, Tokyo 113-0033 (Japan); Bouchet, François R., E-mail: christophe.ringeval@uclouvain.be, E-mail: yamauchi@resceu.s.u-tokyo.ac.jp, E-mail: yokoyama@resceu.s.u-tokyo.ac.jp, E-mail: bouchet@iap.fr [Institut d' Astrophysique de Paris, UMR 7095-CNRS, Université Pierre et Marie Curie, 98bis boulevard Arago, 75014 Paris (France)

    2016-02-01

    Cosmic strings formed during inflation are expected to be either diluted over super-Hubble distances, i.e., invisible today, or to have crossed our past light cone very recently. We discuss the latter situation in which a few strings imprint their signature in the Cosmic Microwave Background (CMB) Anisotropies after recombination. Being almost frozen in the Hubble flow, these strings are quasi static and evade almost all of the previously derived constraints on their tension while being able to source large scale anisotropies in the CMB sky. Using a local variance estimator on thousand of numerically simulated Nambu-Goto all sky maps, we compute the expected signal and show that it can mimic a dipole modulation at large angular scales while being negligible at small angles. Interestingly, such a scenario generically produces one cold spot from the thawing of a cosmic string loop. Mixed with anisotropies of inflationary origin, we find that a few strings of tension GU = O(1) × 10{sup −6} match the amplitude of the dipole modulation reported in the Planck satellite measurements and could be at the origin of other large scale anomalies.

  6. Parikh Matching in the Streaming Model

    DEFF Research Database (Denmark)

    Lee, Lap-Kei; Lewenstein, Moshe; Zhang, Qin

    2012-01-01

    Let S be a string over an alphabet Σ = {σ1, σ2, …}. A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σi in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-leng...

  7. String effects in the 3d gauge Ising model

    International Nuclear Information System (INIS)

    Caselle, Michele; Panero, Marco; Hasenbusch, Martin

    2003-01-01

    We compare the predictions of the effective string description of confinement with a set of Monte Carlo data for the 3d gauge Ising model at finite temperature. Thanks to a new algorithm which makes use of the dual symmetry of the model we can reach very high precisions even for large quark-antiquark distances. We are thus able to explore the large R regime of the effective string. We find that for large enough distances and low enough temperature the data are well described by a pure bosonic string. As the temperature increases higher order corrections become important and cannot be neglected even at large distances. These higher order corrections seem to be well described by the Nambu-Goto action truncated at the first perturbative order. (author)

  8. Solving the open bosonic string in perturbation theory

    International Nuclear Information System (INIS)

    Samuel, S.

    1990-01-01

    The integrand and integration region for the N-point amplitude in the open oriented bosonic string are obtained to all orders in perturbation theory. The result is derived from the Witten covariant string field theory by using on-shell and off-shell conformal methods and Riemann surface mathematics. Although only the off-shell g-loop tachyon amplitudes are computed explicitly, the methods generalize to other external states. We derive the g-loop ghost-Jacobi identity in which the ghost correlation function cancels the jacobian factor in changing from second-quantized to first-quantized variables. Moduli space is discussed from several viewpoints and it is shown that string field theory provides an algorithm for its determination. (orig.)

  9. Dynamical evolution of cosmic strings

    International Nuclear Information System (INIS)

    Bouchet, F.R.

    1988-01-01

    The author have studied by means of numerical simulations the dynamical evolution of a network of cosmic strings, both in the radiation and matter era. Our basic conclusion is that a scaling solution exists, i.e., the string energy density evolves as t -2 . This means that the process by which long strings dump their energy into closed loops (which can gravitationally radiate away) is efficient enough to prevent the string domination over other forms of energy. This conclusion does not depend on the initial string energy density, nor on the various numerical parameters. On the other hand, the generated spectrum of loop sizes does depend on the value of our numerical lower cutoff (i.e., the minimum length of loop we allow to be chopped off the network). Furthermore, the network evolution is very different from what was assumed before), namely the creation of a few horizon sized loops per horizon volume and per hubble time, which subsequently fragment into about 10 smaller daughter loops. Rather, many tiny loops are directly cut from the network of infinite strings, and it appears that the only fundamental scale (the horizon) has been lost. This is probably because a fundamental ingredient had been overlooked, namely the kinks. These kinks are created in pairs at each intercommutation, and very rapidly, the long strings appear to be very kinky. Thus the number of long strings per horizon is still of the order of a few, but their total length is fairly large. Furthermore, a large number of kinks favors the formation of small loops, and their sizes might well be governed by the kink density along the long strings. Finally, we computed the two-point correlation function of the loops and found significant differences from the work of Turok

  10. Casimir energy of a nonuniform string

    Science.gov (United States)

    Hadasz, L.; Lambiase, G.; Nesterenko, V. V.

    2000-07-01

    The Casimir energy of a nonuniform string built up from two pieces with different speeds of sound is calculated. A standard procedure of subtracting the energy of an infinite uniform string is applied, the subtraction being interpreted as the renormalization of the string tension. It is shown that in the case of a homogeneous string this method is completely equivalent to zeta renormalization.

  11. Test particle trajectories near cosmic strings

    Indian Academy of Sciences (India)

    We present a detailed analysis of the motion of test particle in the gravitational field of cosmic strings in different situations using the Hamilton–Jacobi (H–J) formalism. We have discussed the trajectories near static cosmic string, cosmic string in Brans–Dicke theory and cosmic string in dilaton gravity.

  12. String Formatting Considered Harmful for Novice Programmers

    Science.gov (United States)

    Hughes, Michael C.; Jadud, Matthew C.; Rodrigo, Ma. Mercedes T.

    2010-01-01

    In Java, "System.out.printf" and "String.format" consume a specialised kind of string commonly known as a format string. In our study of first-year students at the Ateneo de Manila University, we discovered that format strings present a substantial challenge for novice programmers. Focusing on their first laboratory we found…

  13. M-strings, Elliptic Genera and N=4 String Amplitudes

    CERN Document Server

    Hohenegger, Stefan

    2014-01-01

    We study mass-deformed N=2 gauge theories from various points of view. Their partition functions can be computed via three dual approaches: firstly, (p,q)-brane webs in type II string theory using Nekrasov's instanton calculus, secondly, the (refined) topological string using the topological vertex formalism and thirdly, M theory via the elliptic genus of certain M-strings configurations. We argue for a large class of theories that these approaches yield the same gauge theory partition function which we study in detail. To make their modular properties more tangible, we consider a fourth approach by connecting the partition function to the equivariant elliptic genus of R^4 through a (singular) theta-transform. This form appears naturally as a specific class of one-loop scattering amplitudes in type II string theory on T^2, which we calculate explicitly.

  14. Covariant N-string amplitude

    International Nuclear Information System (INIS)

    Di Vecchia, P.; Sciuto, S.; Nakayama, R.; Petersen, J.L.; Sidenius, J.R.

    1986-11-01

    The BRST-invariant N-Reggeon vertex (for the bosonic string) previously given by us in the operator formulation is considered in more detail. In particular we present a direct derivation from the string path integral. Several crucial symmetry properties found a posteriori before, become a priori clearer in this formulation. A number of delicate points related to zero modes, cut off procedures and normal ordering prescriptions are treated in some detail. The old technique of letting the string field acquire a small dimension ε/2 → 0 + is found especially elegant. (orig.)

  15. Plucked Strings and the Harpsichord

    Science.gov (United States)

    GIORDANO, N.; WINANS, J. P.

    1999-07-01

    The excitation of a harpsichord string when it is set into motion, i.e., plucked, by a plectrum is studied. We find that the amplitude of the resulting string vibration is approximately independent of the velocity with which the key is depressed. This result is in accord with conventional wisdom, but at odds with a recent theoretical model. A more realistic theoretical treatment of the plucking process is then described, and shown to be consistent with our measurements. The experiments reveal several other interesting aspects of the plectrum-string interaction.

  16. Worldsheet geometries of ambitwistor string

    Energy Technology Data Exchange (ETDEWEB)

    Ohmori, Kantaro [Department of Physics, the University of Tokyo,Hongo, Bunkyo-ku, Tokyo 133-0022 (Japan)

    2015-06-12

    Mason and Skinner proposed the ambitwistor string theory which directly reproduces the formulas for the amplitudes of massless particles proposed by Cachazo, He and Yuan. In this paper we discuss geometries of the moduli space of worldsheets associated to the bosonic or the RNS ambitwistor string. Further, we investigate the factorization properties of the amplitudes when an internal momentum is near on-shell in the abstract CFT language. Along the way, we propose the existence of the ambitwistor strings with three or four fermionic worldsheet currents.

  17. Spin chain for quantum strings

    International Nuclear Information System (INIS)

    Beisert, N.

    2005-01-01

    We review and compare the integrable structures in N=4 gauge theory and string theory on AdS 5 x S 5 . Recently, Bethe ansaetze for gauge theory/weak coupling and string theory/strong coupling were proposed to describe scaling dimensions in the su(2) subsector. Here we investigate the Bethe equations for quantum string theory, naively extrapolated to weak coupling. Excitingly, we find a spin chain Hamiltonian similar, but not equal, to the gauge theory dilatation operator. (Abstract Copyright [2005], Wiley Periodicals, Inc.)

  18. Geometry, topology, and string theory

    Energy Technology Data Exchange (ETDEWEB)

    Varadarajan, Uday [Univ. of California, Berkeley, CA (United States)

    2003-01-01

    A variety of scenarios are considered which shed light upon the uses and limitations of classical geometric and topological notions in string theory. The primary focus is on situations in which D-brane or string probes of a given classical space-time see the geometry quite differently than one might naively expect. In particular, situations in which extra dimensions, non-commutative geometries as well as other non-local structures emerge are explored in detail. Further, a preliminary exploration of such issues in Lorentzian space-times with non-trivial causal structures within string theory is initiated.

  19. Geometry, topology, and string theory

    International Nuclear Information System (INIS)

    Varadarajan, Uday

    2003-01-01

    A variety of scenarios are considered which shed light upon the uses and limitations of classical geometric and topological notions in string theory. The primary focus is on situations in which D-brane or string probes of a given classical space-time see the geometry quite differently than one might naively expect. In particular, situations in which extra dimensions, non-commutative geometries as well as other non-local structures emerge are explored in detail. Further, a preliminary exploration of such issues in Lorentzian space-times with non-trivial causal structures within string theory is initiated

  20. String cosmology modern string theory concepts from the cosmic structure

    CERN Document Server

    2009-01-01

    The field of string cosmology has matured considerably over the past few years, attracting many new adherents to this multidisciplinary Field. This book fills a critical gap by bringing together strains of current research into one single volume. The resulting collection of selected articles presents the latest, ongoing results from renowned experts currently working in the field. This offers the possibility for practitioners to become conversant with many different aspects of string cosmology

  1. String cosmology. Large-field inflation in string theory

    International Nuclear Information System (INIS)

    Westphal, Alexander

    2014-09-01

    This is a short review of string cosmology. We wish to connect string-scale physics as closely as possible to observables accessible to current or near-future experiments. Our possible best hope to do so is a description of inflation in string theory. The energy scale of inflation can be as high as that of Grand Unification (GUT). If this is the case, this is the closest we can possibly get in energy scales to string-scale physics. Hence, GUT-scale inflation may be our best candidate phenomenon to preserve traces of string-scale dynamics. Our chance to look for such traces is the primordial gravitational wave, or tensor mode signal produced during inflation. For GUT-scale inflation this is strong enough to be potentially visible as a B-mode polarization of the cosmic microwave background (CMB). Moreover, a GUT-scale inflation model has a trans-Planckian excursion of the inflaton scalar field during the observable amount of inflation. Such large-field models of inflation have a clear need for symmetry protection against quantum corrections. This makes them ideal candidates for a description in a candidate fundamental theory like string theory. At the same time the need of large-field inflation models for UV completion makes them particularly susceptible to preserve imprints of their string-scale dynamics in the inflationary observables, the spectral index n s and the fractional tensor mode power r. Hence, we focus this review on axion monodromy inflation as a mechanism of large-field inflation in string theory.

  2. Vacua and inflation in string theory and supergravity

    International Nuclear Information System (INIS)

    Rummel, Markus

    2013-07-01

    We study the connection between the early and late accelerated expansion of the universe and string theory. In Part I of this thesis, the observational degeneracy between single field models of inflation with canonical kinetic terms and noncanonical kinetic terms, in particular string theory inspired models, is discussed. The 2-point function observables of a given non-canonical theory and its canonical transform that is obtained by matching the inflationary trajectories in phase space are found to match in the case of Dirac-Born-Infeld (DBI) inflation. At the level of the 3-point function observables (non-Gaussianities), we find degeneracy between non-canonical inflation and canonical inflation with a potential that includes a sum of modulated terms. In Part II, we present explicit examples for de Sitter vacua in type IIB string theory. After deriving a sufficient condition for de Sitter vacua in the Kahler uplifting scenario, we show that a globally consistent de Sitter model can be realized on a certain Calabi-Yau manifold. All geometric moduli are stabilized and all known consistency constraints are fulfilled. The complex structure moduli stabilization by fluxes is studied explicitly for a small number of cycles. Extrapolating to a larger number of flux carrying cycles, we verify statistical studies in the literature which show that, in principle, the string landscape can account for a universe with an extremely small cosmological constant.

  3. Vacua and inflation in string theory and supergravity

    Energy Technology Data Exchange (ETDEWEB)

    Rummel, Markus

    2013-07-15

    We study the connection between the early and late accelerated expansion of the universe and string theory. In Part I of this thesis, the observational degeneracy between single field models of inflation with canonical kinetic terms and noncanonical kinetic terms, in particular string theory inspired models, is discussed. The 2-point function observables of a given non-canonical theory and its canonical transform that is obtained by matching the inflationary trajectories in phase space are found to match in the case of Dirac-Born-Infeld (DBI) inflation. At the level of the 3-point function observables (non-Gaussianities), we find degeneracy between non-canonical inflation and canonical inflation with a potential that includes a sum of modulated terms. In Part II, we present explicit examples for de Sitter vacua in type IIB string theory. After deriving a sufficient condition for de Sitter vacua in the Kahler uplifting scenario, we show that a globally consistent de Sitter model can be realized on a certain Calabi-Yau manifold. All geometric moduli are stabilized and all known consistency constraints are fulfilled. The complex structure moduli stabilization by fluxes is studied explicitly for a small number of cycles. Extrapolating to a larger number of flux carrying cycles, we verify statistical studies in the literature which show that, in principle, the string landscape can account for a universe with an extremely small cosmological constant.

  4. Charting the Landscape of Supercritical String Theory

    International Nuclear Information System (INIS)

    Hellerman, Simeon; Swanson, Ian

    2007-01-01

    Special solutions of string theory in supercritical dimensions can interpolate in time between theories with different numbers of spacetime dimensions and different amounts of world sheet supersymmetry. These solutions connect supercritical string theories to the more familiar string duality web in ten dimensions and provide a precise link between supersymmetric and purely bosonic string theories. Dimension quenching and c duality appear to be natural concepts in string theory, giving rise to large networks of interconnected theories

  5. String and Sticky Tape Experiments.

    Science.gov (United States)

    Edge, R. D., Ed.

    1979-01-01

    Explains how to demonstrate the fundamentals of one dimensional kinematics such as Newton's third law of motion, and collision between bodies, using simple materials of marbles, strings, sticky tape, drinking straws, and rubber bands. (GA)

  6. String theory or field theory?

    International Nuclear Information System (INIS)

    Marshakov, A.V.

    2002-01-01

    The status of string theory is reviewed, and major recent developments - especially those in going beyond perturbation theory in the string theory and quantum field theory frameworks - are analyzed. This analysis helps better understand the role and place of experimental phenomena, it is emphasized that there are some insurmountable problems inherent in it - notably the impossibility to formulate the quantum theory of gravity on its basis - which prevent it from being a fundamental physical theory of the world of microscopic distances. It is this task, the creation of such a theory, which string theory, currently far from completion, is expected to solve. In spite of its somewhat vague current form, string theory has already led to a number of serious results and greatly contributed to progress in the understanding of quantum field theory. It is these developments, which are our concern in this review [ru

  7. String moduli inflation. An overview

    Energy Technology Data Exchange (ETDEWEB)

    Cicoli, Michele [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Quevedo, Fernando [Cambridge Univ. (United Kingdom). DAMTP/CMS; Abdus Salam International Centre for Theoretical Physics, Trieste (Italy)

    2011-06-15

    We present an overview of inflationary models derived from string theory focusing mostly on closed string moduli as inflatons. After a detailed discussion of the {eta}-problem and different approaches to address it, we describe possible ways to obtain a de Sitter vacuum with all closed string moduli stabilised. We then look for inflationary directions and present some of the most promising scenarios where the inflatons are either the real or the imaginary part of Kaehler moduli. We pay particular attention on extracting potential observable implications, showing how most of the scenarios predict negligible gravitational waves and could therefore be ruled out by the Planck satellite. We conclude by briefly mentioning some open challenges in string cosmology beyond deriving just inflation. (orig.)

  8. Spin chains and string theory.

    Science.gov (United States)

    Kruczenski, Martin

    2004-10-15

    Recently, an important test of the anti de Sitter/conformal field theory correspondence has been done using rotating strings with two angular momenta. We show that such a test can be described more generally as the agreement between two actions: one a low energy description of a spin chain appearing in the field theory side, and the other a limit of the string action in AdS5xS5. This gives a map between the mean value of the spin in the boundary theory and the position of the string in the bulk, and shows how a string action can emerge from a gauge theory in the large-N limit.

  9. String moduli inflation. An overview

    International Nuclear Information System (INIS)

    Cicoli, Michele; Quevedo, Fernando

    2011-06-01

    We present an overview of inflationary models derived from string theory focusing mostly on closed string moduli as inflatons. After a detailed discussion of the η-problem and different approaches to address it, we describe possible ways to obtain a de Sitter vacuum with all closed string moduli stabilised. We then look for inflationary directions and present some of the most promising scenarios where the inflatons are either the real or the imaginary part of Kaehler moduli. We pay particular attention on extracting potential observable implications, showing how most of the scenarios predict negligible gravitational waves and could therefore be ruled out by the Planck satellite. We conclude by briefly mentioning some open challenges in string cosmology beyond deriving just inflation. (orig.)

  10. String Formation Beyond Leading Colour

    CERN Document Server

    Christiansen, Jesper R.

    2015-08-03

    We present a new model for the hadronisation of multi-parton systems, in which colour correlations beyond leading $N_C$ are allowed to influence the formation of confining potentials (strings). The multiplet structure of $SU(3)$ is combined with a minimisation of the string potential energy, to decide between which partons strings should form, allowing also for "baryonic" configurations (e.g., two colours can combine coherently to form an anticolour). In $e^+e^-$collisions, modifications to the leading-colour picture are small, suppressed by both colour and kinematics factors. But in $pp$ collisions, multi-parton interactions increase the number of possible subleading connections, counteracting their naive $1/N_C^2$ suppression. Moreover, those that reduce the overall string lengths are kinematically favoured. The model, which we have implemented in the PYTHIA 8 generator, is capable of reaching agreement not only with the important $\\left(n_\\mathrm{charged})$ distribution but also with measured rates (and ra...

  11. The Consensus String Problem and the Complexity of Comparing Hidden Markov Models

    DEFF Research Database (Denmark)

    Lyngsø, Rune Bang; Pedersen, Christian Nørgaard Storm

    2002-01-01

    The basic theory of hidden Markov models was developed and applied to problems in speech recognition in the late 1960s, and has since then been applied to numerous problems, e.g. biological sequence analysis. Most applications of hidden Markov models are based on efficient algorithms for computing...... the probability of generating a given string, or computing the most likely path generating a given string. In this paper we consider the problem of computing the most likely string, or consensus string, generated by a given model, and its implications on the complexity of comparing hidden Markov models. We show...... that computing the consensus string, and approximating its probability within any constant factor, is NP-hard, and that the same holds for the closely related labeling problem for class hidden Markov models. Furthermore, we establish the NP-hardness of comparing two hidden Markov models under the L∞- and L1...

  12. The effect of gas and fluid flows on nonlinear lateral vibrations of rotating drill strings

    Science.gov (United States)

    Khajiyeva, Lelya; Kudaibergenov, Askar; Kudaibergenov, Askat

    2018-06-01

    In this work we develop nonlinear mathematical models describing coupled lateral vibrations of a rotating drill string under the effect of external supersonic gas and internal fluid flows. An axial compressive load and a torque also affect the drill string. The mathematical models are derived by the use of Novozhilov's nonlinear theory of elasticity with implementation of Hamilton's variation principle. Expressions for the gas flow pressure are determined according to the piston theory. The fluid flow is considered as added mass inside the curved tube of the drill string. Using an algorithm developed in the Mathematica computation program on the basis of the Galerkin approach and the stiffness switching method the numerical solution of the obtained approximate differential equations is found. Influences of the external loads, drill string angular speed of rotation, parameters of the gas and fluid flows on the drill string vibrations are shown.

  13. An automatic MRI/SPECT registration algorithm using image intensity and anatomical feature as matching characters: application on the evaluation of Parkinson's disease

    International Nuclear Information System (INIS)

    Lee, J.-D.; Huang, C.-H.; Weng, Y.-H.; Lin, K.-J.; Chen, C.-T.

    2007-01-01

    Single-photon emission computed tomography (SPECT) of dopamine transporters with 99m Tc-TRODAT-1 has recently been proposed to offer valuable information in assessing the functionality of dopaminergic systems. Magnetic resonance imaging (MRI) and SPECT imaging are important in the noninvasive examination of dopamine concentration in vivo. Therefore, this investigation presents an automated MRI/SPECT image registration algorithm based on a new similarity metric. This similarity metric combines anatomical features that are characterized by specific binding, the mean count per voxel in putamens and caudate nuclei, and the distribution of image intensity that is characterized by normalized mutual information (NMI). A preprocess, a novel two-cluster SPECT normalization algorithm, is also presented for MRI/SPECT registration. Clinical MRI/SPECT data from 18 healthy subjects and 13 Parkinson's disease (PD) patients are involved to validate the performance of the proposed algorithms. An appropriate color map, such as 'rainbow,' for image display enables the two-cluster SPECT normalization algorithm to provide clinically meaningful visual contrast. The proposed registration scheme reduces target registration error from >7 mm for conventional registration algorithm based on NMI to approximately 4 mm. The error in the specific/nonspecific 99m Tc-TRODAT-1 binding ratio, which is employed as a quantitative measure of TRODAT receptor binding, is also reduced from 0.45±0.22 to 0.08±0.06 among healthy subjects and from 0.28±0.18 to 0.12±0.09 among PD patients

  14. Chinese handwriting recognition an algorithmic perspective

    CERN Document Server

    Su, Tonghua

    2013-01-01

    This book provides an algorithmic perspective on the recent development of Chinese handwriting recognition. Two technically sound strategies, the segmentation-free and integrated segmentation-recognition strategy, are investigated and algorithms that have worked well in practice are primarily focused on. Baseline systems are initially presented for these strategies and are subsequently expanded on and incrementally improved. The sophisticated algorithms covered include: 1) string sample expansion algorithms which synthesize string samples from isolated characters or distort realistic string samples; 2) enhanced feature representation algorithms, e.g. enhanced four-plane features and Delta features; 3) novel learning algorithms, such as Perceptron learning with dynamic margin, MPE training and distributed training; and lastly 4) ensemble algorithms, that is, combining the two strategies using both parallel structure and serial structure. All the while, the book moves from basic to advanced algorithms, helping ...

  15. Strings in the abelized picture

    International Nuclear Information System (INIS)

    Embacher, F.

    1990-01-01

    The transformation properties of the bosonic string variables under the recently discovered abelizing operator are exhibited. The intimate relation of this operator to the light-cone gauge condition is illustrated for the classical string. As an application of the formalism, the derivation of the BRST cohomology by the method of Freemann and Olive is carried over to the abelized picture, where it takes a particularly simple from. (orig.)

  16. The W3 string spectrum

    International Nuclear Information System (INIS)

    Pope, C.N.; Stelle, K.S.

    1991-08-01

    We study the spectrum of W 3 strings. In particular, we show that for appropriately chosen space-time signature, one of the scalar fields is singled out be the spin-3 constraint and is ''frozen'': no creation operators from it can appear in physical states and the corresponding momentum must assume a specific fixed value. The remaining theory is unitary and resembles an ordinary string theory in d contains 26 with anomalies cancelled by appropriate background charges. (author). 8 refs

  17. Cooldown of superconducting magnet strings

    International Nuclear Information System (INIS)

    Yuecel, A.; Carcagno, R.H.

    1995-01-01

    A numerical model for the cooldown of the superconducting magnet strings in the Accelerator System String Test (ASST) Facility at the Superconducting Super Collider (SSC) Laboratory is presented. Numerical results are compared with experimental data from the ASST test runs. Agreement between the numerical predictions and experiments is very good over the entire range from room temperature to liquid helium temperatures. The model can be readily adapted to predict the cooldown and warmup behavior of other superconducting magnets or cold masses

  18. Strings in the abelized picture

    International Nuclear Information System (INIS)

    Embacher, F.

    1990-01-01

    The transformation properties of the bosonic string variables under the recently discovered abelizing operator are exhibited. The intimate relation of this operator to the light-cone gauge condition is illustrated for the classical string. As an application of the formalism, the derivation of the BRST cohomology by the method of Freeman and Olive is carried over to the abelized picture, where it takes a particulary simple form. 14 refs. (Author)

  19. An introduction to string theory

    OpenAIRE

    West, Peter C

    1989-01-01

    These notes are based on lectures given by Michael Green during Part III of the Mathematics Tripos (the Certificate for Advanced Study in Mathematics) in the Spring of 2003. The course provided an introduction to string theory, focussing on the Bosonic string, but treating the superstring as well. A background in quantum field theory and general relativity is assumed. Some background in particle physics, group theory and conformal field theory is useful, though not essential. A number of appe...

  20. Black strings and classical hair

    International Nuclear Information System (INIS)

    Horowitz, G.T.; Yang, H.

    1997-01-01

    We examine the geometry near the event horizon of a family of black string solutions with traveling waves. It has previously been shown that the metric is continuous there. Contrary to expectations, we find that the geometry is not smooth, and the horizon becomes singular whenever a wave is present. Both five-dimensional and six-dimensional black strings are considered with similar results. copyright 1997 The American Physical Society

  1. On Field Theory of Open Strings, Tachyon Condensation and Closed Strings

    OpenAIRE

    Shatashvili, Samson L.

    2001-01-01

    I review the physical properties of different vacua in the background independent open string field theory. Talk presented at Strings 2001, Mumbai, India, http://theory.theory.tifr.res.in/strings/Proceedings/#sha-s.

  2. Quark Synthesis String Theory From Dark Matter to Light Emitting Atoms

    Science.gov (United States)

    Webb, William

    2012-10-01

    Forefather physicists formulated fusion based on nucleosynthesis. They directed that whole nucleons synthesize. Quark Synthesis String Theory now shows that it's the string-like quarks that do the synthesizing: not whole nucleons. In a dark region, string-like quarks synthesize with other string-like quarks to make rope-like quarks. Quarks structure into threesomes bound only by electrostatic and gravitational forces. Quarks not structuring as threesomes remain dark. Balanced threesomes of string-like quarks become neutrons. Balanced threesomes of rope-like quarks become more massive neutroniumA nuclei. After their formation, neutrons and neutroniumAs quickly begin emitting electrons. This paper develops equations that correctly describe nuclear structures and their electron emissions. Electron emission beta decay is calculated for the 30 least massive neutroniumA nuclei and their subsequent transmutation thru 203 intermediate nuclei on their way to becoming well known nuclei centering the 30 least massive light emitting atoms. This is a perfect 233 for 233 match between calculations of Quark Synthesis String Theory and factual nuclear data. This perfect match provides affirmation that nuclei have no need for the unknown strong or week forces and mediating particles. Nuclear physics succeeds using a string theory that has the quarks doing the synthesizing.

  3. Experimental observation of Bethe strings

    Science.gov (United States)

    Wang, Zhe; Wu, Jianda; Yang, Wang; Bera, Anup Kumar; Kamenskyi, Dmytro; Islam, A. T. M. Nazmul; Xu, Shenglong; Law, Joseph Matthew; Lake, Bella; Wu, Congjun; Loidl, Alois

    2018-02-01

    Almost a century ago, string states—complex bound states of magnetic excitations—were predicted to exist in one-dimensional quantum magnets. However, despite many theoretical studies, the experimental realization and identification of string states in a condensed-matter system have yet to be achieved. Here we use high-resolution terahertz spectroscopy to resolve string states in the antiferromagnetic Heisenberg-Ising chain SrCo2V2O8 in strong longitudinal magnetic fields. In the field-induced quantum-critical regime, we identify strings and fractional magnetic excitations that are accurately described by the Bethe ansatz. Close to quantum criticality, the string excitations govern the quantum spin dynamics, whereas the fractional excitations, which are dominant at low energies, reflect the antiferromagnetic quantum fluctuations. Today, Bethe’s result is important not only in the field of quantum magnetism but also more broadly, including in the study of cold atoms and in string theory; hence, we anticipate that our work will shed light on the study of complex many-body systems in general.

  4. Dynamics of strings between walls

    International Nuclear Information System (INIS)

    Eto, Minoru; Fujimori, Toshiaki; Nagashima, Takayuki; Nitta, Muneto; Ohashi, Keisuke; Sakai, Norisuke

    2009-01-01

    Configurations of vortex strings stretched between or ending on domain walls were previously found to be 1/4 Bogomol'nyi-Prasad-Sommerfield (BPS) states in N=2 supersymmetric gauge theories in 3+1 dimensions. Among zero modes of string positions, the center of mass of strings in each region between two adjacent domain walls is shown to be non-normalizable whereas the rests are normalizable. We study dynamics of vortex strings stretched between separated domain walls by using two methods, the moduli space (geodesic) approximation of full 1/4 BPS states and the charged particle approximation for string end points in the wall effective action. In the first method we explicitly obtain the effective Lagrangian in the strong coupling limit, which is written in terms of hypergeometric functions, and find the 90 deg. scattering for head-on collision. In the second method the domain wall effective action is assumed to be U(1) N gauge theory, and we find a good agreement between two methods for well-separated strings.

  5. Is the string theory doomed?

    International Nuclear Information System (INIS)

    Le Meur, H.; Daninos, F.; Bachas, C.

    2007-01-01

    Since its beginning, in the sixties, the string theory has succeeded in overcoming a lot of theoretical difficulties but now the complete absence of experimental validation entertains doubts about its ability to represent the real world and questions its hegemony in today's theoretical physics. Other space-time theories like the twistors, or the non-commutative geometry, or the loop quantum gravity, or the causal dynamics triangulation might begin receiving more attention. Despite all that, the string theory can be given credit for 4 achievements. First, the string theory has provided a consistent quantum description of gravity. Secondly, the string theory has built a theoretical frame that has allowed the unification of the 4 basic interactions. Thirdly, the string theory applied to astrophysics issues has demonstrated that the evaporation of a black hole does not necessarily lead to a loss of information which comforts the universality of the conservation of the quantity of information in any system and as a consequence put a fatal blow to the so-called paradox observed in black holes. Fourthly, the string theory has given a new and original meaning on the true nature of space-time. (A.C.)

  6. String theory on the edge

    International Nuclear Information System (INIS)

    Thorlacius, L.

    1989-01-01

    Open string vacuum configurations are described in terms of a one-dimensional field theory on the worldsheet boundary. The one-dimensional path integral has direct physical interpretation as a source term for closed string fields. This means that the vacuum divergences (Mobius infinities) of the path integral must be renormalized correctly. The author shows that reparametrization invariance Ward identities, apart from specifying the equations of motion of spacetime background gauge fields, also serve to fix the renormalization scheme of the vacuum divergences. He argues that vacuum configurations of open strings correspond to Caldeira-Leggett models of dissipative quantum mechanics (DQM) evaluated at a delocalization critical point. This connection reveals that critical DQM will manifest reparametrization invariance (inherited from the conformal invariance of string theory) rather than just scale invariance. This connection should open up new ways of constructing analytic and approximate solutions of open string theory (in particular, topological solitons such as monopoles and instantons). Type I superstring theory gives rise to a supersymmetric boundary field theory. Bose-Fermi cancellation eliminates vacuum divergences but the one-loop beta function remains the same as in the bosonic theory. Reparametrization invariance Ward identities dictate a boundary state normalization which yields consistent string-loop corrections to spacetime equations of motion, in both the periodic and anti-periodic fermion sectors

  7. Chern-Simons couplings for dielectric F-strings in matrix string theory

    International Nuclear Information System (INIS)

    Brecher, Dominic; Janssen, Bert; Lozano, Yolanda

    2002-01-01

    We compute the non-abelian couplings in the Chern-Simons action for a set of coinciding fundamental strings in both the type IIA and type IIB Matrix string theories. Starting from Matrix theory in a weakly curved background, we construct the linear couplings of closed string fields to type IIA Matrix strings. Further dualities give a type IIB Matrix string theory and a type IIA theory of Matrix strings with winding. (Abstract Copyright[2002], Wiley Periodicals, Inc.)

  8. New expressions for string loop amplitudes leading to an ultra-simple conception of string dynamics

    International Nuclear Information System (INIS)

    Chan Hongmo; Tsou Sheungtsun; Bordes, J.; Nellen, L.

    1990-11-01

    New expressions are derived for string loop amplitudes as overlap integrals of string wave functionals. They are shown to take the form of exchange terms coming from the Bose-Einstein symmetrisation between string segments. One is thus led to the ultra-simple conception that string theory is basically free, and that 'string interactions' are due merely to the fact that strings are composite objects with Bose-Einstein segments as constituents. (author)

  9. General relativistic model of a spinning cosmic string

    International Nuclear Information System (INIS)

    Jensen, B.; Soleng, H.H.

    1991-11-01

    The authors investigate the infinite, straight, rotating cosmic string within the framework of Einstein's General Theory of Relativity. A class of exact interior solutions is derived for which the source satisfies the weak and the dominant energy conditions. The interior metric is matched smoothly to the exterior vacuum. A subclass of these solutions has closed time-like curves both in the interior and the exterior geometry. 39 refs., 2 figs

  10. Matching Supernovae to Galaxies

    Science.gov (United States)

    Kohler, Susanna

    2016-12-01

    developed a new automated algorithm for matching supernovae to their host galaxies. Their work builds on currently existing algorithms and makes use of information about the nearby galaxies, accounts for the uncertainty of the match, and even includes a machine learning component to improve the matching accuracy.Gupta and collaborators test their matching algorithm on catalogs of galaxies and simulated supernova events to quantify how well the algorithm is able to accurately recover the true hosts.Successful MatchingThe matching algorithms accuracy (purity) as a function of the true supernova-host separation, the supernova redshift, the true hosts brightness, and the true hosts size. [Gupta et al. 2016]The authors find that when the basic algorithm is run on catalog data, it matches supernovae to their hosts with 91% accuracy. Including the machine learning component, which is run after the initial matching algorithm, improves the accuracy of the matching to 97%.The encouraging results of this work which was intended as a proof of concept suggest that methods similar to this could prove very practical for tackling future survey data. And the method explored here has use beyond matching just supernovae to their host galaxies: it could also be applied to other extragalactic transients, such as gamma-ray bursts, tidal disruption events, or electromagnetic counterparts to gravitational-wave detections.CitationRavi R. Gupta et al 2016 AJ 152 154. doi:10.3847/0004-6256/152/6/154

  11. Matching the Hagedorn temperature in AdS/CFT correspondence

    International Nuclear Information System (INIS)

    Harmark, Troels; Orselli, Marta

    2006-01-01

    We match the Hagedorn/deconfinement temperature of planar N=4 super Yang-Mills (SYM) on RxS 3 to the Hagedorn temperature of string theory on AdS 5 xS 5 . The match is done in a near-critical region where both gauge theory and string theory are weakly coupled. The near-critical region is near a point with zero temperature and critical chemical potential. On the gauge-theory side we are taking a decoupling limit found in Ref. 7 in which the physics of planar N=4 SYM is given exactly by the ferromagnetic XXX 1/2 Heisenberg spin chain. We find moreover a general relation between the Hagedorn/deconfinement temperature and the thermodynamics of the Heisenberg spin chain and we use this to compute it in two distinct regimes. On the string-theory side, we identify the dual limit for which the string tension and string coupling go to zero. This limit is taken of string theory on a maximally supersymmetric pp-wave background with a flat direction, obtained from a Penrose limit of AdS 5 xS 5 . We compute the Hagedorn temperature of the string theory and find agreement with the Hagedorn/deconfinement temperature computed on the gauge-theory side

  12. With string model to time series forecasting

    Science.gov (United States)

    Pinčák, Richard; Bartoš, Erik

    2015-10-01

    Overwhelming majority of econometric models applied on a long term basis in the financial forex market do not work sufficiently well. The reason is that transaction costs and arbitrage opportunity are not included, as this does not simulate the real financial markets. Analyses are not conducted on the non equidistant date but rather on the aggregate date, which is also not a real financial case. In this paper, we would like to show a new way how to analyze and, moreover, forecast financial market. We utilize the projections of the real exchange rate dynamics onto the string-like topology in the OANDA market. The latter approach allows us to build the stable prediction models in trading in the financial forex market. The real application of the multi-string structures is provided to demonstrate our ideas for the solution of the problem of the robust portfolio selection. The comparison with the trend following strategies was performed, the stability of the algorithm on the transaction costs for long trade periods was confirmed.

  13. Functional integral approach to string theories

    International Nuclear Information System (INIS)

    Sakita, B.

    1987-01-01

    Fermionic string theory can be made supersymmetric: the superstring. It contains among others mass zero gauge fields of spin 1 and 2. The recent revival of interests in string field theories is due to the recognition of the compactified superstring theory as a viable theory of grandunification of all interactions, especially after Green and Schwarz's discovery of the gauge and gravitational anomaly cancellation in 0(32) superstring theory. New developments include string phenomenology, general discussions of compactification, new models, especially the heterotic string. These are either applications or extensions of string field theories. Although these are very exciting developments, the author limits his attention to the basics of the bosonic string theory

  14. String Theory for Pedestrians (1/3)

    CERN Multimedia

    CERN. Geneva

    2009-01-01

    This is a non-technical rapid course on string theory. Lecture 1 is an introduction to the basics of the subject: classical and quantum strings, D(irichlet) branes and string-string dualities. In lecture 2 I will discuss string unification of the fundamental forces, covering both its successes and failures. Finally in lecture 3 I will review string models of black hole microstates, the holographic gauge/gravity duality and, if time permits, potential applications to the physics of the strong interactions.

  15. String Theory for Pedestrians (2/3)

    CERN Multimedia

    CERN. Geneva

    2009-01-01

    This is a non-technical rapid course on string theory. Lecture 1 is an introduction to the basics of the subject: classical and quantum strings, D(irichlet) branes and string-string dualities. In lecture 2 I will discuss string unification of the fundamental forces, covering both its successes and failures. Finally in lecture 3 I will review string models of black hole microstates, the holographic gauge/gravity duality and, if time permits, potential applications to the physics of the strong interactions.

  16. String Theory for Pedestrians (3/3)

    CERN Multimedia

    CERN. Geneva

    2009-01-01

    This is a non-technical rapid course on string theory. Lecture 1 is an introduction to the basics of the subject: classical and quantum strings, D(irichlet) branes and string-string dualities. In lecture 2 I will discuss string unification of the fundamental forces, covering both its successes and failures. Finally in lecture 3 I will review string models of black hole microstates, the holographic gauge/gravity duality and, if time permits, potential applications to the physics of the strong interactions.

  17. A framework of DYNAMIC data structures for string processing

    DEFF Research Database (Denmark)

    Prezza, Nicola

    2017-01-01

    implemented using DYNAMIC with those of stateof-the-art tools performing the same task. Our experiments show that algorithms making use of dynamic compressed data structures can be up to three orders of magnitude more space-efficient (albeit slower) than classical ones performing the same tasks.......In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data structures for string manipulation. Our framework includes useful tools such as searchable partial sums, succinct/gap-encoded bitvectors, and entropy/run-length compressed strings and FM indexes. We...... prove close-to-optimal theoretical bounds for the resources used by our structures, and show that our theoretical predictions are empirically tightly verified in practice. To conclude, we turn our attention to applications. We compare the performance of five recently-published compression algorithms...

  18. Matching score based face recognition

    NARCIS (Netherlands)

    Boom, B.J.; Beumer, G.M.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.

    2006-01-01

    Accurate face registration is of vital importance to the performance of a face recognition algorithm. We propose a new method: matching score based face registration, which searches for optimal alignment by maximizing the matching score output of a classifier as a function of the different

  19. String Theory in a Nutshell

    International Nuclear Information System (INIS)

    Skenderis, Kostas

    2007-01-01

    The book 'String Theory in a Nutshell' by Elias Kiritsis provides a comprehensive introduction to modern string theory. String theory is the leading candidate for a theory that successfully unifies all fundamental forces of nature, including gravity. The subject has been continuously developing since the early 1970s, with classic textbooks on the subject being those of Green, Schwarz and Witten (1987) and Polchinski (1998). Since the latter was published there have been substantial developments, in particular in understanding black holes and gravity/gauge theory dualities. A textbook treatment of this important material is clearly needed, both by students and researchers in string theory and by mathematicians and physicists working in related fields. This book has a good selection of material, starting from basics and moving into classic and modern topics. In particular, Kiritsis' presentation of the basic material is complementary to that of the earlier textbooks and he includes a number of topics which are not easily found or covered adequately elsewhere, for example, loop corrections to string effective couplings. Overall the book nicely covers the major advances of the last ten years, including (non-perturbative) string dualities, black hole physics, AdS/CFT and matrix models. It provides a concise but fairly complete introduction to these subjects which can be used both by students and by researchers. Moreover the emphasis is on results that are reasonably established, as is appropriate for a textbook; concise summaries are given for subjects which are still in flux, with references to relevant reviews and papers. A positive feature of the book is that the bibliography sections at the end of each chapter provide a comprehensive guide to the literature. The bibliographies point to reviews and pedagogical papers on subjects covered in this book as well as those that were omitted. It is rare for a textbook to contain such a self-contained and detailed guide to

  20. Automatic Laser Pointer Detection Algorithm for Environment Control Device Systems Based on Template Matching and Genetic Tuning of Fuzzy Rule-Based Systems

    Directory of Open Access Journals (Sweden)

    F.

    2012-04-01

    Full Text Available In this paper we propose a new approach for laser-based environment device control systems based on the automatic design of a Fuzzy Rule-Based System for laser pointer detection. The idea is to improve the success rate of the previous approaches decreasing as much as possible the false offs and increasing the success rate in images with laser spot, i.e., the detection of a false laser spot (since this could lead to dangerous situations. To this end, we propose to analyze both, the morphology and color of a laser spot image together, thus developing a new robust algorithm. Genetic Fuzzy Systems have also been employed to improve the laser spot system detection by means of a fine tuning of the involved membership functions thus reducing the system false offs, which is the main objective in this problem. The system presented in this paper, makes use of a Fuzzy Rule-Based System adjusted by a Genetic Algorithm, which, based on laser morphology and color analysis, shows a better success rate than previous approaches.

  1. String Resonances at Hadron Colliders

    CERN Document Server

    Anchordoqui, Luis A; Dai, De-Chang; Feng, Wan-Zhe; Goldberg, Haim; Huang, Xing; Lust, Dieter; Stojkovic, Dejan; Taylor, Tomasz R

    2014-01-01

    [Abridged] We consider extensions of the standard model based on open strings ending on D-branes. Assuming that the fundamental string mass scale M_s is in the TeV range and that the theory is weakly coupled, we discuss possible signals of string physics at the upcoming HL-LHC run (3000 fb^{-1}) with \\sqrt{s} = 14 TeV, and at potential future pp colliders, HE-LHC and VLHC, operating at \\sqrt{s} = 33 and 100 TeV, respectively. In such D-brane constructions, the dominant contributions to full-fledged string amplitudes for all the common QCD parton subprocesses leading to dijets and \\gamma + jet are completely independent of the details of compactification, and can be evaluated in a parameter-free manner. We make use of these amplitudes evaluated near the first (n=1) and second (n=2) resonant poles to determine the discovery potential for Regge excitations of the quark, the gluon, and the color singlet living on the QCD stack. We show that for string scales as large as 7.1 TeV (6.1 TeV), lowest massive Regge exc...

  2. Differential geometry in string models

    International Nuclear Information System (INIS)

    Alvarez, O.

    1986-01-01

    In this article the author reviews the differential geometric approach to the quantization of strings. A seminal paper demonstrates the connection between the trace anomaly and the critical dimension. The role played by the Faddeev-Popov ghosts has been instrumental in much of the subsequent work on the quantization of strings. This paper discusses the differential geometry of two dimensional surfaces and its importance in the quantization of strings. The path integral quantization approach to strings will be carefully analyzed to determine the correct effective measure for string theories. The choice of measure for the path integral is determined by differential geometric considerations. Once the measure is determined, the manifest diffeomorphism invariance of the theory will have to be broken by using the Faddeev-Popov ansatz. The gauge fixed theory is studied in detail with emphasis on the role of conformal and gravitational anomalies. In the analysis, the path integral formulation of the gauge fixed theory requires summing over all the distinct complex structures on the manifold

  3. String theory or field theory?

    International Nuclear Information System (INIS)

    Marshakov, Andrei V

    2002-01-01

    The status of string theory is reviewed, and major recent developments - especially those in going beyond perturbation theory in the string theory and quantum field theory frameworks - are analyzed. This analysis helps better understand the role and place of string theory in the modern picture of the physical world. Even though quantum field theory describes a wide range of experimental phenomena, it is emphasized that there are some insurmountable problems inherent in it - notably the impossibility to formulate the quantum theory of gravity on its basis - which prevent it from being a fundamental physical theory of the world of microscopic distances. It is this task, the creation of such a theory, which string theory, currently far from completion, is expected to solve. In spite of its somewhat vague current form, string theory has already led to a number of serious results and greatly contributed to progress in the understanding of quantum field theory. It is these developments which are our concern in this review. (reviews of topical problems)

  4. Topological strings from quantum mechanics

    International Nuclear Information System (INIS)

    Grassi, Alba; Marino, Marcos; Hatsuda, Yasuyuki

    2014-12-01

    We propose a general correspondence which associates a non-perturbative quantum-mechanical operator to a toric Calabi-Yau manifold, and we conjecture an explicit formula for its spectral determinant in terms of an M-theoretic version of the topological string free energy. As a consequence, we derive an exact quantization condition for the operator spectrum, in terms of the vanishing of a generalized θ function. The perturbative part of this quantization condition is given by the Nekrasov-Shatashvili limit of the refined topological string, but there are non-perturbative corrections determined by the conventional topological string. We analyze in detail the cases of local P 2 , local P 1 x P 1 and local F 1 . In all these cases, the predictions for the spectrum agree with the existing numerical results. We also show explicitly that our conjectured spectral determinant leads to the correct spectral traces of the corresponding operators, which are closely related to topological string theory at orbifold points. Physically, our results provide a Fermi gas picture of topological strings on toric Calabi-Yau manifolds, which is fully non-perturbative and background independent. They also suggest the existence of an underlying theory of M2 branes behind this formulation. Mathematically, our results lead to precise, surprising conjectures relating the spectral theory of functional difference operators to enumerative geometry.

  5. Scalable Algorithms for Adaptive Statistical Designs

    Directory of Open Access Journals (Sweden)

    Robert Oehmke

    2000-01-01

    Full Text Available We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning algorithms for a stochastic environment, and we focus on the problem of optimally assigning patients to treatments in clinical trials. While adaptive designs have significant ethical and cost advantages, they are rarely utilized because of the complexity of optimizing and analyzing them. Computational challenges include massive memory requirements, few calculations per memory access, and multiply-nested loops with dynamic indices. We analyze the effects of various parallelization options, and while standard approaches do not work well, with effort an efficient, highly scalable program can be developed. This allows us to solve problems thousands of times more complex than those solved previously, which helps make adaptive designs practical. Further, our work applies to many other problems involving neighbor recurrences, such as generalized string matching.

  6. Optimizing the hydraulic program of cementing casing strings

    Energy Technology Data Exchange (ETDEWEB)

    Novakovic, M

    1984-01-01

    A technique is described for calculating the optimal parameters of the flow of plugging mud which takes into consideration the geometry of the annular space and the rheological characteristics of the muds. The optimization algorithm was illustrated by a block diagram. Examples are given for practical application of the optimization programs in production conditions. It is stressed that optimizing the hydraulic cementing program is effective if other technical-technological problems in cementing casing strings have been resolved.

  7. An exact bosonization rule for c = 1 noncritical string theory

    International Nuclear Information System (INIS)

    Ishibashi, Nobuyuki; Yamaguchi, Atsushi

    2007-01-01

    We construct a string field theory for c = 1 noncritical strings using the loop variables as the string field. We show how one can express the nonrelativistic free fermions which describes the theory, in terms of these string fields

  8. Latent palmprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2009-06-01

    The evidential value of palmprints in forensic applications is clear as about 30 percent of the latents recovered from crime scenes are from palms. While biometric systems for palmprint-based personal authentication in access control type of applications have been developed, they mostly deal with low-resolution (about 100 ppi) palmprints and only perform full-to-full palmprint matching. We propose a latent-to-full palmprint matching system that is needed in forensic applications. Our system deals with palmprints captured at 500 ppi (the current standard in forensic applications) or higher resolution and uses minutiae as features to be compatible with the methodology used by latent experts. Latent palmprint matching is a challenging problem because latent prints lifted at crime scenes are of poor image quality, cover only a small area of the palm, and have a complex background. Other difficulties include a large number of minutiae in full prints (about 10 times as many as fingerprints), and the presence of many creases in latents and full prints. A robust algorithm to reliably estimate the local ridge direction and frequency in palmprints is developed. This facilitates the extraction of ridge and minutiae features even in poor quality palmprints. A fixed-length minutia descriptor, MinutiaCode, is utilized to capture distinctive information around each minutia and an alignment-based minutiae matching algorithm is used to match two palmprints. Two sets of partial palmprints (150 live-scan partial palmprints and 100 latent palmprints) are matched to a background database of 10,200 full palmprints to test the proposed system. Despite the inherent difficulty of latent-to-full palmprint matching, rank-1 recognition rates of 78.7 and 69 percent, respectively, were achieved in searching live-scan partial palmprints and latent palmprints against the background database.

  9. An Implementation of Bigraph Matching

    DEFF Research Database (Denmark)

    Glenstrup, Arne John; Damgaard, Troels Christoffer; Birkedal, Lars

    We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model...

  10. Uma proposta de solução para o problema da construção de escalas de motoristas e cobradores de ônibus por meio do algoritmo do matching de peso máximo A proposed solution for bus driver and fare collector scheduling problems using the maximum weight matching algorithm

    Directory of Open Access Journals (Sweden)

    Paulo Henrique Siqueira

    2004-08-01

    Full Text Available O objetivo deste trabalho é mostrar a aplicação do Algoritmo do Matching de peso máximo, na elaboração de jornadas de trabalho para motoristas e cobradores de ônibus. Este problema deve ser resolvido levando-se em consideração o maior aproveitamento possível das tabelas de horários, com o objetivo de minimizar o número de funcionários, de horas extras e de horas ociosas. Desta forma, os custos das companhias de transporte público são minimizados. Na primeira fase do trabalho, supondo-se que as tabelas de horários já estejam divididas em escalas de curta e de longa duração, as escalas de curta duração são combinadas para a formação da jornada diária de trabalho de um funcionário. Esta combinação é feita com o Algoritmo do Matching de peso máximo, no qual as escalas são representadas por vértices de um grafo, e o peso máximo é atribuído às combinações de escalas que não formam horas extras e horas ociosas. Na segunda fase, uma jornada de final de semana é designada para cada jornada semanal de dias úteis. Por meio destas duas fases, as jornadas semanais de trabalho para motoristas e cobradores de ônibus podem ser construídas com custo mínimo. A terceira e última fase deste trabalho consiste na designação das jornadas semanais de trabalho para cada motorista e cobrador de ônibus, considerando-se suas preferências. O Algoritmo do Matching de peso máximo é utilizado para esta fase também. Este trabalho foi aplicado em três empresas de transporte público da cidade de Curitiba - PR, nas quais os algoritmos utilizados anteriormente eram heurísticos, baseados apenas na experiência do encarregado por esta tarefa.The purpose of this paper is to discuss how the maximum weight Matching Algorithm can be applied to schedule the workdays of bus drivers and bus fare collectors. This scheduling should be based on the best possible use of timetables in order to minimize the number of employees, overtime and

  11. Cosmic strings and black holes

    International Nuclear Information System (INIS)

    Aryal, M.; Ford, L.H.; Vilenkin, A.

    1986-01-01

    The metric for a Schwarzschild black hole with a cosmic string passing through it is discussed. The thermodynamics of such an object is considered, and it is shown that S = (1/4)A, where S is the entropy and A is the horizon area. It is noted that the Schwarzschild mass parameter M, which is the gravitational mass of the system, is no longer identical to its energy. A solution representing a pair of black holes held apart by strings is discussed. It is nearly identical to a static, axially symmetric solution given long ago by Bach and Weyl. It is shown how these solutions, which were formerly a mathematical curiosity, may be given a more physical interpretation in terms of cosmic strings

  12. Cooperative strings and glassy interfaces.

    Science.gov (United States)

    Salez, Thomas; Salez, Justin; Dalnoki-Veress, Kari; Raphaël, Elie; Forrest, James A

    2015-07-07

    We introduce a minimal theory of glass formation based on the ideas of molecular crowding and resultant string-like cooperative rearrangement, and address the effects of free interfaces. In the bulk case, we obtain a scaling expression for the number of particles taking part in cooperative strings, and we recover the Adam-Gibbs description of glassy dynamics. Then, by including thermal dilatation, the Vogel-Fulcher-Tammann relation is derived. Moreover, the random and string-like characters of the cooperative rearrangement allow us to predict a temperature-dependent expression for the cooperative length ξ of bulk relaxation. Finally, we explore the influence of sample boundaries when the system size becomes comparable to ξ. The theory is in agreement with measurements of the glass-transition temperature of thin polymer films, and allows quantification of the temperature-dependent thickness hm of the interfacial mobile layer.

  13. Vector superconductivity in cosmic strings

    International Nuclear Information System (INIS)

    Dvali, G.R.; Mahajan, S.M.

    1992-03-01

    We argue that in most realistic cases, the usual Witten-type bosonic superconductivity of the cosmic string is automatically (independent of the existence of superconducting currents) accompanied by the condensation of charged gauge vector bosons in the core giving rise to a new vector type superconductivity. The value of the charged vector condensate is related with the charged scalar expectation value, and vanishes only if the latter goes to zero. The mechanism for the proposed vector superconductivity, differing fundamentally from those in the literature, is delineated using the simplest realistic example of the two Higgs doublet standard model interacting with the extra cosmic string. It is shown that for a wide range of parameters, for which the string becomes scalarly superconducting, W boson condensates (the sources of vector superconductivity) are necessarily excited. (author). 14 refs

  14. QCD string in the baryon

    International Nuclear Information System (INIS)

    Kalashnikova, Yu.S.; Nefediev, A.V.

    1997-01-01

    The QCD-motivated constituent string model is extended to consider the baryon. The system of three quarks propagating in the confining background field is studied in the Wilson loop approach, and the effective action is obtained. The resulting Lagrangian at large interquark distances corresponds to the Mercedes Benz string configuration. Assuming the quarks to be heavy enough to allow the adiabatic separation of quark and string junction motion and using the hyperspherical expansion for the quark subsystem we write out and solve the classical equation of motion for the junction. We quantize the motion of the junction and demonstrate that the account of these modes leads to the effective swelling of baryon in comparison with standard potential picture. The effects of finite gluonic correlation length which do not affect the excited states but appear to be substantial for the baryonic ground state, reducing the swelling considerably is discussed

  15. Noncompact symmetries in string theory

    International Nuclear Information System (INIS)

    Maharana, J.; Schwarz, J.H.

    1993-01-01

    Noncompact groups, similar to those that appeared in various supergravity theories in the 1970's have been turning up in recent studies of string theory. First it was discovered that moduli spaces of toroidal compactification are given by noncompact groups modded out by their maximal compact subgroups and discrete duality groups. Then it was found that many other moduli spaces have analogous descriptions. More recently, noncompact group symmetries have turned up in effective actions used to study string cosmology and other classical configurations. This paper explores these noncompact groups in the case of toroidal compactification both from the viewpoint of low-energy effective field theory, using the method of dimensional reduction, and from the viewpoint of the string theory world-sheet. The conclusion is that all these symmetries are intimately related. In particular, we find that Chern-Simons terms in the three-form field strength H μνρ play a crucial role. (orig.)

  16. Introduction to strings and superstrings

    International Nuclear Information System (INIS)

    Rausch de Traubenberg, M.

    1988-01-01

    The string theory is applied in the construction of a theory which allows the coupling of the four fundamental interactions and matter. The original model of the string theory describes the hadronic phenomenon of duality. The model extension, which describes the closed strings and those with a spin, is studied. The supersymmetry and the supersymmetric partner concepts are considered, in order to obtain a superstrings theory. The supersymmetry allows the formulation of a ''supertheory'', including matter, fields and gravitation. In order to explain the mass of the observable particles, the mechanism of symmetry breaking must be taken into account. The scalar state concept, originated from the supersymmetry breaking, is analyzed. This ''supertheory'' is not entirely accepted by the scientific world [fr

  17. The NMSSM and string theory

    International Nuclear Information System (INIS)

    Lebedev, Oleg; Ramos-Sanchez, Saul

    2009-12-01

    We study the possibility of constructing the NMSSM from the heterotic string. String derived NMSSMs are much more rare than MSSMs due to the extra requirement that there exist a light singlet which couples to the Higgs pairs. They share the common feature that the singlet self-interactions are typically suppressed, leading to either the ''decoupling'' or to the Peccei-Quinn limit of the NMSSM. In the latter case, the spectrum contains a light pseudoscalar which may be relevant to the MSSM fine-tuning problem.We provide a Z 6 heterotic orbifold example of the NMSSM with approximate Peccei-Quinn symmetry, whose origin lies in the string selection rules combined with our choice of the vacuum configuration. (orig.)

  18. On the string equation at c=1

    International Nuclear Information System (INIS)

    Nakatsu, Toshio.

    1994-07-01

    The analogue of the string equation which specifies the partition function of c=1 string with a compactification radius β is an element of Z ≥1 is described in the framework of Toda lattice hierarchy. (author)

  19. Metastable cosmic strings in realistic models

    International Nuclear Information System (INIS)

    Holman, R.

    1992-01-01

    The stability of the electroweak Z-string is investigated at high temperatures. The results show that, while finite temperature corrections can improve the stability of the Z-string, their effect is not strong enough to stabilize the Z-string in the standard electroweak model. Consequently, the Z-string will be unstable even under the conditions present during the electroweak phase transition. Phenomenologically viable models based on the gauge group SU(2) L x SU(2) R x U(1) B-L are then considered, and it is shown that metastable strings exist and are stable to small perturbations for a large region of the parameter space for these models. It is also shown that these strings are superconducting with bosonic charge carriers. The string superconductivity may be able to stabilize segments and loops against dynamical contraction. Possible implications of these strings for cosmology are discussed

  20. Covariant amplitudes in Polyakov string theory

    International Nuclear Information System (INIS)

    Aoyama, H.; Dhar, A.; Namazie, M.A.

    1986-01-01

    A manifestly Lorentz-covariant and reparametrization-invariant procedure for computing string amplitudes using Polyakov's formulation is described. Both bosonic and superstring theories are dealt with. The computation of string amplitudes is greatly facilitated by this formalism. (orig.)