Parameterized String Matching Algorithms with Application to ...
African Journals Online (AJOL)
In the parameterized string matching problem, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. Salmela and Tarhio solve the parameterized string matching problem in sub-linear time by applying the concept of q-gram in the Horspool algorithm ...
Fast algorithms for approximate circular string matching.
Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P
2014-03-22
Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate circular string matching is a rather undeveloped area. In this article, we present a suboptimal average-case algorithm for exact circular string matching requiring time O(n). Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for moderate values of k, that is k=O(m/logm). We show how the same results can be easily obtained under the edit distance model. The presented algorithms are also implemented as library functions. Experimental results demonstrate that the functions provided in this library accelerate the computations by more than three orders of magnitude compared to a naïve approach. We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice. The importance of our contribution is underlined by the fact that the provided functions may be seamlessly integrated into any biological pipeline. The source code of the library is freely available at http://www.inf.kcl.ac.uk/research/projects/asmf/.
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.
A string matching based algorithm for performance evaluation of ...
Indian Academy of Sciences (India)
matching that is not intuitive. For that, we have proposed a novel structure encoded string representation that is independent of any editable format. Structure encoded strings retain the structure (spatial relationships like superscript, subscript, etc.) and do not contain any extraneous symbols. As structure encoded strings ...
A string matching based algorithm for performance evaluation of ...
Indian Academy of Sciences (India)
Levenshtein edit distance can be applied. This approach is intuitive as extraneous symbols are not involved in the matching process. The paper is organized as follows. .... For example, consider an ME: ai+1. 2 and its LATEX string given by: aˆ{i+1}_2. In LATEX,ˆ and _ designate superscript (northern subexpression) and ...
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 – speedup...... over traditional algorithms that examine each character individually. Our solution can be efficiently implemented, unlike prior theoretical packed string matching work. We adapt the standard RAM model and only use its AC0 instructions (i.e., no multiplication) plus two specialized AC0 packed string...
Botwicz, Jakub; Buciak, Piotr; Sapiecha, Piotr
2006-03-01
Intrusion Prevention Systems (IPSs) have become widely recognized as a powerful tool and an important element of IT security safeguards. The essential feature of network IPSs is searching through network packets and matching multiple strings, that are fingerprints of known attacks. String matching is highly resource consuming and also the most significant bottleneck of IPSs. In this article an extension of the classical Karp-Rabin algorithm and its implementation architectures were examined. The result is a software, which generates a source code of a string matching module in hardware description language, that could be easily used to create an Intrusion Prevention System implemented in reconfigurable hardware. The prepared module matches the complete set of Snort IPS signatures achieving throughput of over 2 Gbps on an Altera Stratix I1 evaluation board. The most significant advantage of the proposed architecture is that the update of the patterns database does not require reconfiguration of the circuitry.
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 ...
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.
Towards optimal packed string matching
DEFF Research Database (Denmark)
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2014-01-01
In the packed string matching problem, it is assumed that each machine word can accommodate up to α characters, thus an n-character string occupies n/α memory words.(a) We extend the Crochemore–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real......-time, achieving a factor α speedup over traditional algorithms that examine each character individually. Our macro-level algorithm only uses the standard AC0 instructions of the word-RAM model (i.e. no integer multiplication) plus two specialized micro-level AC0 word-size packed-string instructions. The main word...... matching work.(b) We also consider the complexity of the packed string matching problem in the classical word-RAM model in the absence of the specialized micro-level instructions wssm and wslm. We propose micro-level algorithms for the theoretically efficient emulation using parallel algorithms techniques...
Keylogger Application to Monitoring Users Activity with Exact String Matching Algorithm
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.
Techniques Used in String Matching for Network Security
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.
Pattern recognition and string matching
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...
String matching with variable length gaps
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel
2012-01-01
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in T that match P. This problem is a basic...
Face recognition using ensemble string matching.
Chen, Weiping; Gao, Yongsheng
2013-12-01
In this paper, we present a syntactic string matching approach to solve the frontal face recognition problem. String matching is a powerful partial matching technique, but is not suitable for frontal face recognition due to its requirement of globally sequential representation and the complex nature of human faces, containing discontinuous and non-sequential features. Here, we build a compact syntactic Stringface representation, which is an ensemble of strings. A novel ensemble string matching approach that can perform non-sequential string matching between two Stringfaces is proposed. It is invariant to the sequential order of strings and the direction of each string. The embedded partial matching mechanism enables our method to automatically use every piece of non-occluded region, regardless of shape, in the recognition process. The encouraging results demonstrate the feasibility and effectiveness of using syntactic methods for face recognition from a single exemplar image per person, breaking the barrier that prevents string matching techniques from being used for addressing complex image recognition problems. The proposed method not only achieved significantly better performance in recognizing partially occluded faces, but also showed its ability to perform direct matching between sketch faces and photo faces.
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
DEFF Research Database (Denmark)
Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li
2007-01-01
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds. In practical applications the space is likely to be a bottleneck and therefore this is of crucial importance....
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
DEFF Research Database (Denmark)
Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li
2009-01-01
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck....
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
Pencocokan String Berdasarkan Kemiripan Ucapan (Phonetic String Matching) dalam Bahasa Inggris
Syaroni, Mokhamad; Munir, Rinaldi
2009-01-01
Perkembangan teknologi informasi dan komunikasi yang semakin pesat, mengakibatkan pencarianinformasi semakin mudah. Pencarian informasi yang tepat dan sesuai kebutuhan menjadi sangat penting. Olehkarena itu, teknik untuk memperoleh dokumen dengan isi yang sesuai dengan kebutuhan informasi sangatdiperlukan. Untuk mengetahui isi dokumen sesuai dengan kebutuhan informasi, diperlukan metode pencarianstring (string searching) isi dokumen yang bagus. Proses pencocokan string (string matching) yang ...
Pencocokan String Berdasarkan Kemiripan Ucapan (Phonetic String Matching) Dalam Bahasa Inggris
Syaroni, Mokhamad; Munir, Rinaldi
2005-01-01
Perkembangan teknologi informasi dan komunikasi yang semakin pesat, mengakibatkan pencarianinformasi semakin mudah. Pencarian informasi yang tepat dan sesuai kebutuhan menjadi sangat penting. Olehkarena itu, teknik untuk memperoleh dokumen dengan isi yang sesuai dengan kebutuhan informasi sangatdiperlukan. Untuk mengetahui isi dokumen sesuai dengan kebutuhan informasi, diperlukan metode pencarianstring (string searching) isi dokumen yang bagus. Proses pencocokan string (string matching) yang ...
Algorithms and data structures for grammar-compressed strings
DEFF Research Database (Denmark)
Cording, Patrick Hagge
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......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...
Families of FPGA-Based Accelerators for Approximate String Matching.
Van Court, Tom; Herbordt, Martin C
2007-03-05
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many implementations have reported impressive speed-ups, but have typically been point solutions - highly specialized and addressing only one or a few of the many possible options. The problem to be solved is creating a hardware description that implements a broad range of behavioral options without losing efficiency due to feature bloat. We report a set of three component types that address different parts of the approximate string matching problem. This allows each application to choose the feature set required, then make maximum use of the FPGA fabric according to that application's specific resource requirements. Multiple, interchangeable implementations are available for each component type. We show that these methods allow the efficient generation of a large, if not complete, family of accelerators for this application. This flexibility was obtained while retaining high performance: We have evaluated a sample against serial reference codes and found speed-ups of from 150× to 400× over a high-end PC.
Implementation of Multipattern String Matching Accelerated with GPU for Intrusion Detection System
Nehemia, Rangga; Lim, Charles; Galinium, Maulahikmah; Rinaldi Widianto, Ahmad
2017-04-01
As Internet-related security threats continue to increase in terms of volume and sophistication, existing Intrusion Detection System is also being challenged to cope with the current Internet development. Multi Pattern String Matching algorithm accelerated with Graphical Processing Unit is being utilized to improve the packet scanning performance of the IDS. This paper implements a Multi Pattern String Matching algorithm, also called Parallel Failureless Aho Corasick accelerated with GPU to improve the performance of IDS. OpenCL library is used to allow the IDS to support various GPU, including popular GPU such as NVIDIA and AMD, used in our research. The experiment result shows that the application of Multi Pattern String Matching using GPU accelerated platform provides a speed up, by up to 141% in term of throughput compared to the previous research.
Typed and unambiguous pattern matching on strings using regular expressions
DEFF Research Database (Denmark)
Brabrand, Claus; Thomsen, Jakob G.
2010-01-01
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterization of ambiguity of regular expressions that leads to a sound and complete static analysis. The analysis is capable...... of pinpointing all ambiguities in terms of the structure of the regular expression and report shortest ambiguous strings. We also show how pattern matching can be integrated into statically typed programming languages for deconstructing strings and reproducing typed and structured values. We validate our...... approach by giving a full implementation of the approach presented in this paper. The resulting tool, reg-exp-rec, adds typed and unambiguous pattern matching to Java in a stand-alone and non-intrusive manner. We evaluate the approach using several realistic examples....
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.
Typed and Unambiguous Pattern Matching on Strings using Regular Expressions
DEFF Research Database (Denmark)
Brabrand, Claus; Thomsen, Jakob Grauenkjær
2010-01-01
capable of pinpointing all ambiguities in terms of the structure of the regular expression and report shortest ambiguous strings. We also show how pattern matching can be integrated into statically typed programming languages for deconstructing strings and reproducing typed and structured values. We validate our...... approach by giving a full implementation of the approach presented in this paper. The resulting tool, reg-exp-rec, adds typed and unambiguous pattern matching to Java in a stand-alone and non-intrusive manner. We evaluate the approach using several realistic examples....
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.
Encoded expansion: an efficient algorithm to discover identical string motifs.
Azmi, Aqil M; Al-Ssulami, Abdulrakeeb
2014-01-01
A major task in computational biology is the discovery of short recurring string patterns known as motifs. Most of the schemes to discover motifs are either stochastic or combinatorial in nature. Stochastic approaches do not guarantee finding the correct motifs, while the combinatorial schemes tend to have an exponential time complexity with respect to motif length. To alleviate the cost, the combinatorial approach exploits dynamic data structures such as trees or graphs. Recently (Karci (2009) Efficient automatic exact motif discovery algorithms for biological sequences, Expert Systems with Applications 36:7952-7963) devised a deterministic algorithm that finds all the identical copies of string motifs of all sizes [Formula: see text] in theoretical time complexity of [Formula: see text] and a space complexity of [Formula: see text] where [Formula: see text] is the length of the input sequence and [Formula: see text] is the length of the longest possible string motif. In this paper, we present a significant improvement on Karci's original algorithm. The algorithm that we propose reports all identical string motifs of sizes [Formula: see text] that occur at least [Formula: see text] times. Our algorithm starts with string motifs of size 2, and at each iteration it expands the candidate string motifs by one symbol throwing out those that occur less than [Formula: see text] times in the entire input sequence. We use a simple array and data encoding to achieve theoretical worst-case time complexity of [Formula: see text] and a space complexity of [Formula: see text] Encoding of the substrings can speed up the process of comparison between string motifs. Experimental results on random and real biological sequences confirm that our algorithm has indeed a linear time complexity and it is more scalable in terms of sequence length than the existing algorithms.
Highly Scalable Matching Pursuit Signal Decomposition Algorithm
National Aeronautics and Space Administration — In this research, we propose a variant of the classical Matching Pursuit Decomposition (MPD) algorithm with significantly improved scalability and computational...
Efficient parallel algorithms for string editing and related problems
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).
FPGA-accelerated algorithm for the regular expression matching system
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.
PUMA: The Positional Update and Matching Algorithm
Line, J. L. B.; Webster, R. L.; Pindor, B.; Mitchell, D. A.; Trott, C. M.
2017-01-01
We present new software to cross-match low-frequency radio catalogues: the Positional Update and Matching Algorithm. The Positional Update and Matching Algorithm combines a positional Bayesian probabilistic approach with spectral matching criteria, allowing for confusing sources in the matching process. We go on to create a radio sky model using Positional Update and Matching Algorithm based on the Murchison Widefield Array Commissioning Survey, and are able to automatically cross-match 98.5% of sources. Using the characteristics of this sky model, we create simple simulated mock catalogues on which to test the Positional Update and Matching Algorithm, and find that Positional Update and Matching Algorithm can reliably find the correct spectral indices of sources, along with being able to recover ionospheric offsets. Finally, we use this sky model to calibrate and remove foreground sources from simulated interferometric data, generated using OSKAR (the Oxford University visibility generator). We demonstrate that there is a substantial improvement in foreground source removal when using higher frequency and higher resolution source positions, even when correcting positions by an average of 0.3 arcmin given a synthesised beam-width of 2.3 arcmin.
A robust line extraction and matching algorithm
Hussien, B.; Sridhar, B.
1993-01-01
This paper presents an algorithm for extracting straight lines from intensity mages and describes a line matching algorithm for solving the line correspondence problem. The line extraction process begins by detecting edges in the intensity image. Next, line support regions are formed where image points (pixels) have similar gradient orientation. A line fitting algorithm is then used to fit a line to the points in the line support region based on a least means square fitting algorithm. Finally, line segments are linked together to form the final lines by using an adaptive line linking method; this results in much stronger lines and a smaller set of lines to be considered. Once the lines are detected in a sequence of images, a line matching algorithm is used to match lines in one image to the lines in the other image. The images are either from a motion or stereo sequence. The matched lines may then be used with the sensor position and orientation data to estimate range to objects corresponding to the lines. We present results based on applying the line extraction and line matching algorithms to a synthetic image and an outdoor scene captured by a camera on a helicopter.
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...
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...
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....
Effects of string stiffness on muscle fatigue after a simulated tennis match.
Fabre, Jean Bernard; Martin, Vincent; Borelli, Gil; Theurel, Jean; Grélot, Laurent
2014-06-01
We tested the influence of string stiffness on the occurrence of forearm muscle fatigue during a tennis match. Sixteen tennis players performed two prolonged simulated tennis matches with low-stiffness or high-stiffness string. Before and immediately after exercise, muscle fatigability was evaluated on the forearm muscles during a maximal intermittent gripping task. Groundstroke ball speeds and the profile of acceleration of the racquet frame at collision were recorded during each match. The peak-to-peak amplitude of acceleration and the resonant frequency of the frame were significantly greater with high- (5060 ± 1892 m/s(2) and 204 ± 29 Hz, respectively) than with low-stiffness string (4704 ± 1671 m/s(2) and 191 ± 16 Hz, respectively). The maximal and the averaged gripping forces developed during the gripping task were significantly reduced after the tennis match with high- (-15 ± 14%, and -22 ± 14%, respectively), but not with low-stiffness string. The decrease of ball speed during the simulated matches tended to be greater with high- than with low-stiffness string (P = .06). Hence, playing tennis with high-stiffness string promotes forearm muscle fatigue development, which could partly contribute to the groundstroke ball speed decrement during the game.
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...... different computational models [Fre82,FS89,Fen94, HSS11, HR03, HRS96,RRR01, PD04]. We solve the partial sums problem in the ultra wide word-RAM model, recently introduced by Farzan et al. [FLONS15], where we, in constant time, are allowed to manipulate words of size w2 and access w memory locations. Farzan...... et al. [FLONS15] additionally gave a solution to the dynamic partial sums problem by simulating the RAMBO model to obtain a result by Brodnik et al. [BKMN06]. In this paper we present an improved solution to the dynamic partial sums problem in the ultra wide word-RAM model that supports all...
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.
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.
Visual Approach of Searching Process using Boyer-Moore Algorithm
Rahim, Robbi; Saleh Ahmar, Ansari; Putri Ardyanti, Ayu; Nofriansyah, Dicky
2017-12-01
This research shows the process of string matching using a Boyer-Moore algorithm in the form of visual simulation by doing string searching of a pattern string, the result of visualization is recognized that Boyer-Moore algorithm will compare a n string from the right and will test to n-1 String to get the appropriate character of the desired input string.
Fast randomized approximate string matching with succinct hash data structures.
Policriti, Alberto; Prezza, Nicola
2015-01-01
The high throughput of modern NGS sequencers coupled with the huge sizes of genomes currently analysed, poses always higher algorithmic challenges to align short reads quickly and accurately against a reference sequence. A crucial, additional, requirement is that the data structures used should be light. The available modern solutions usually are a compromise between the mentioned constraints: in particular, indexes based on the Burrows-Wheeler transform offer reduced memory requirements at the price of lower sensitivity, while hash-based text indexes guarantee high sensitivity at the price of significant memory consumption. In this work we describe a technique that permits to attain the advantages granted by both classes of indexes. This is achieved using Hamming-aware hash functions--hash functions designed to search the entire Hamming sphere in reduced time--which are also homomorphisms on de Bruijn graphs. We show that, using this particular class of hash functions, the corresponding hash index can be represented in linear space introducing only a logarithmic slowdown (in the query length) for the lookup operation. We point out that our data structure reaches its goals without compressing its input: another positive feature, as in biological applications data is often very close to be un-compressible. The new data structure introduced in this work is called dB-hash and we show how its implementation--BW-ERNE--maintains the high sensitivity and speed of its (hash-based) predecessor ERNE, while drastically reducing space consumption. Extensive comparison experiments conducted with several popular alignment tools on both simulated and real NGS data, show, finally, that BW-ERNE is able to attain both the positive features of succinct data structures (that is, small space) and hash indexes (that is, sensitivity). In applications where space and speed are both a concern, standard methods often sacrifice accuracy to obtain competitive throughputs and memory footprints
Geringer, John M.; MacLeod, Rebecca B.; Ellis, Julia C.
2014-01-01
We investigated pitch perception of string vibrato tones among string players in two separate studies. In both studies we used tones of acoustic instruments (violin and cello) as stimuli. In the first, we asked 192 high school and university string players to listen to a series of tonal pairs: one tone of each pair was performed with vibrato and…
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...
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 ... Arun Agarwal1 Chakravarthy Bhagvati1. School of Computer and Information Sciences, University of Hyderabad, Hyderabad 500 046, India ...
Alternative confidence measure for local matching stereo algorithms
CSIR Research Space (South Africa)
Ndhlovu, T
2009-11-01
Full Text Available by analyzing the correlation curve produced during the matching process. The authors also test the confidence measure by developing an easily parallelized local matching algorithm, and use our confidence measure to filter out unreliable disparity estimates...
A Track Matching Algorithm for the LHCb upgrade
Esen, Sevda
2016-01-01
This document presents a description and performance estimate of the Track Matching algorithm for the LHCb Upgrade. The algorithm combines tracks reconstructed in the Vertex Locator and in the three stations of the Scintillating Fibre Tracker.
Algorithms and Data Structures for Strings, Points and Integers
DEFF Research Database (Denmark)
Vind, Søren Juhl
where patterns must 1) contain at most k don’t cares that each match a single character, and 2) have at least q occurrences. Both k and q are input parameters. We show how to extract such patterns and their occurrences from a text of length n in O(nk+k3occ) time and space, where occ is the total number...... classic solutions, typically storing the points in a tree. We show that almost any such classic data structure can be compressed without asymptotically increasing the time spent answering queries. This allows us to reduce the required space use if the point set contains geometric repetitions (copies...... of equal point set that are translated relative to each other). Our result captures most classic data structures, such as Range Trees, KD-trees, R-trees and Quad Trees. We also show a hierarchical clustering algorithm for ensuring that geometric repetitions are compressed. Points with Colors. Colored...
Selection method of terrain matching area for TERCOM algorithm
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%
Efficient Approximation Algorithms for Weighted $b$-Matching
Energy Technology Data Exchange (ETDEWEB)
Khan, Arif; Pothen, Alex; Mostofa Ali Patwary, Md.; Satish, Nadathur Rajagopalan; Sundaram, Narayanan; Manne, Fredrik; Halappanavar, Mahantesh; Dubey, Pradeep
2016-01-01
We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for the problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed for the Matching problem. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.
The String Stability of a Trajectory-Based Interval Management Algorithm in the Midterm Airspace
Swieringa, Kurt A.
2015-01-01
NASA's first Air Traffic Management (ATM) Technology Demonstration (ATD-1) was created to facilitate the transition of mature ATM technologies from the laboratory to operational use. The technologies selected for demonstration are the Traffic Management Advisor with Terminal Metering (TMA-TM), which provides precise time-based scheduling in the terminal airspace; Controller Managed Spacing (CMS), which provides terminal controllers with decision support tools enabling precise schedule conformance; and Interval Management (IM), which consists of flight deck automation that enables aircraft to achieve or maintain a precise spacing interval behind a target aircraft. As the percentage of IM equipped aircraft increases, controllers may provide IM clearances to sequences, or strings, of IM-equipped aircraft. It is important for these strings to maintain stable performance. This paper describes an analytic analysis of the string stability of the latest version of NASA's IM algorithm and a fast-time simulation designed to characterize the string performance of the IM algorithm. The analytic analysis showed that the spacing algorithm has stable poles, indicating that a spacing error perturbation will be reduced as a function of string position. The fast-time simulation investigated IM operations at two airports using constraints associated with the midterm airspace, including limited information of the target aircraft's intended speed profile and limited information of the wind forecast on the target aircraft's route. The results of the fast-time simulation demonstrated that the performance of the spacing algorithm is acceptable for strings of moderate length; however, there is some degradation in IM performance as a function of string position.
Research and Implementation of Signature Detection Based on Matching Algorithm
Shi, Jie; Tang, YingJie; Chen, ShiBin
2018-03-01
Errors such as wrong signature or upside down signature occur mostly during gathering in a bookbinding production line, and affect the quality of bookbinding. This paper presents a new algorithm for signature detection to detect these errors rapidly and accurately. The algorithm constructs scale space firstly by making use of pyramid method in morphology, then creates a region of interest by selecting a appropriate Pyramid image, extracts features from regions of interest, and make them matching templates, furthermore, filters the sample image and extracts the contour, finally selects the appropriate similarity coefficient for template matching, and obtain the matching results. This algorithm is implemented with MVtec Haclon software. Experiments show that the algorithm can anti-rotation, has strong robustness. The matching accuracy is 100%, meanwhile, the low time consumption of the algorithm can meet the demand of high-speed production.
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.
Geomagnetic matching navigation algorithm based on robust estimation
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.
Target Image Matching Algorithm Based on Binocular CCD Ranging
Directory of Open Access Journals (Sweden)
Dongming Li
2014-01-01
Full Text Available This paper proposed target image in a subpixel level matching algorithm for binocular CCD ranging, which is based on the principle of binocular CCD ranging. In the paper, firstly, we introduced the ranging principle of the binocular ranging system and deduced a binocular parallax formula. Secondly, we deduced the algorithm which was named improved cross-correlation matching algorithm and cubic surface fitting algorithm for target images matched, and it could achieve a subpixel level matching for binocular CCD ranging images. Lastly, through experiment we have analyzed and verified the actual CCD ranging images, then analyzed the errors of the experimental results and corrected the formula of calculating system errors. Experimental results showed that the actual measurement accuracy of a target within 3 km was higher than 0.52%, which meet the accuracy requirements of the high precision binocular ranging.
Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching
Energy Technology Data Exchange (ETDEWEB)
Tumeo, Antonino; Villa, Oreste; Chavarría-Miranda, Daniel
2012-12-28
DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.
Research of image matching algorithm based on local features
Sun, Wei
2015-07-01
For the problem of low efficiency in SIFT algorithm while using exhaustive method to search the nearest neighbor and next nearest neighbor of feature points, this paper introduces K-D tree algorithm, to index the feature points extracted in database images according to the tree structure, at the same time, using the concept of a weighted priority, further improves the algorithm, to further enhance the efficiency of feature matching.
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.
Directory of Open Access Journals (Sweden)
Riionheimo Janne
2003-01-01
Full Text Available We describe a technique for estimating control parameters for a plucked string synthesis model using a genetic algorithm. The model has been intensively used for sound synthesis of various string instruments but the fine tuning of the parameters has been carried out with a semiautomatic method that requires some hand adjustment with human listening. An automated method for extracting the parameters from recorded tones is described in this paper. The calculation of the fitness function utilizes knowledge of the properties of human hearing.
DEFF Research Database (Denmark)
Tafti, Hossein Dehghani; Maswood, Ali Iftekhar; Pou, Josep
2016-01-01
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...... 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...
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
A blind matching algorithm for cognitive radio networks
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.
Automated segment matching algorithm-theory, test, and evaluation
Kalcic, M. T. (Principal Investigator)
1982-01-01
Results to automate the U.S. Department of Agriculture's process of segment shifting and obtain results within one-half pixel accuracy are presented. Given an initial registration, the digitized segment is shifted until a more precise fit to the LANDSAT data is found. The algorithm automates the shifting process and performs certain tests for matching and accepting the computed shift numbers. Results indicate the algorithm can obtain results within one-half pixel accuracy.
An improved ASIFT algorithm for indoor panorama image matching
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.
Algorithmic complexity for short binary strings applied to psychology: a primer.
Gauvrit, Nicolas; Zenil, Hector; Delahaye, Jean-Paul; Soler-Toscano, Fernando
2014-09-01
As human randomness production has come to be more closely studied and used to assess executive functions (especially inhibition), many normative measures for assessing the degree to which a sequence is randomlike have been suggested. However, each of these measures focuses on one feature of randomness, leading researchers to have to use multiple measures. Although algorithmic complexity has been suggested as a means for overcoming this inconvenience, it has never been used, because standard Kolmogorov complexity is inapplicable to short strings (e.g., of length l ≤ 50), due to both computational and theoretical limitations. Here, we describe a novel technique (the coding theorem method) based on the calculation of a universal distribution, which yields an objective and universal measure of algorithmic complexity for short strings that approximates Kolmogorov-Chaitin complexity.
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...
Global stereo matching algorithm based on disparity range estimation
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.
Resource selection matching algorithm in underlay cognitive radio networks
Chen, Jiangjingxian; Zhu, Zhipei; Zhang, Shibing
2017-11-01
In this paper, the resource allocation in an underlay cognitive radio network is considered, in which the SUs can operate on the same spectrum band with the primary users simultaneously. In order to maximize the total throughput of SUs, an optimal selection matching (OSM) algorithm is proposed to allocate the resource in the underlay cognitive radio network. It makes every SU find the satisfied spectrum resource, and meanwhile the interference from SUs is induced. Simulation results show that the proposed algorithm has the significant improvement in total throughput compared with others.
An efficient algorithm for systematic analysis of nucleotide strings suitable for siRNA design
Directory of Open Access Journals (Sweden)
Bode Jonathan
2011-05-01
Full Text Available Abstract Background The "off-target" silencing effect hinders the development of siRNA-based therapeutic and research applications. Existing solutions for finding possible locations of siRNA seats within a large database of genes are either too slow, miss a portion of the targets, or are simply not designed to handle a very large number of queries. We propose a new approach that reduces the computational time as compared to existing techniques. Findings The proposed method employs tree-based storage in a form of a modified truncated suffix tree to sort all possible short string substrings within given set of strings (i.e. transcriptome. Using the new algorithm, we pre-computed a list of the best siRNA locations within each human gene ("siRNA seats". siRNAs designed to reside within siRNA seats are less likely to hybridize off-target. These siRNA seats could be used as an input for the traditional "set-of-rules" type of siRNA designing software. The list of siRNA seats is available through a publicly available database located at http://web.cos.gmu.edu/~gmanyam/siRNA_db/search.php Conclusions In attempt to perform top-down prediction of the human siRNA with minimized off-target hybridization, we developed an efficient algorithm that employs suffix tree based storage of the substrings. Applications of this approach are not limited to optimal siRNA design, but can also be useful for other tasks involving selection of the characteristic strings specific to individual genes. These strings could then be used as siRNA seats, as specific probes for gene expression studies by oligonucleotide-based microarrays, for the design of molecular beacon probes for Real-Time PCR and, generally, any type of PCR primers.
A dual-adaptive support-based stereo matching algorithm
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.
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...
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.
Medical record linkage in health information systems by approximate string matching and clustering.
Sauleau, Erik A; Paumier, Jean-Philippe; Buemi, Antoine
2005-10-11
Multiplication of data sources within heterogeneous healthcare information systems always results in redundant information, split among multiple databases. Our objective is to detect exact and approximate duplicates within identity records, in order to attain a better quality of information and to permit cross-linkage among stand-alone and clustered databases. Furthermore, we need to assist human decision making, by computing a value reflecting identity proximity. The proposed method is in three steps. The first step is to standardise and to index elementary identity fields, using blocking variables, in order to speed up information analysis. The second is to match similar pair records, relying on a global similarity value taken from the Porter-Jaro-Winkler algorithm. And the third is to create clusters of coherent related records, using graph drawing, agglomerative clustering methods and partitioning methods. The batch analysis of 300,000 "supposedly" distinct identities isolates 240,000 true unique records, 24,000 duplicates (clusters composed of 2 records) and 3,000 clusters whose size is greater than or equal to 3 records. Duplicate-free databases, used in conjunction with relevant indexes and similarity values, allow immediate (i.e. real-time) proximity detection when inserting a new identity.
Medical record linkage in health information systems by approximate string matching and clustering
Directory of Open Access Journals (Sweden)
Buemi Antoine
2005-10-01
Full Text Available Abstract Background Multiplication of data sources within heterogeneous healthcare information systems always results in redundant information, split among multiple databases. Our objective is to detect exact and approximate duplicates within identity records, in order to attain a better quality of information and to permit cross-linkage among stand-alone and clustered databases. Furthermore, we need to assist human decision making, by computing a value reflecting identity proximity. Methods The proposed method is in three steps. The first step is to standardise and to index elementary identity fields, using blocking variables, in order to speed up information analysis. The second is to match similar pair records, relying on a global similarity value taken from the Porter-Jaro-Winkler algorithm. And the third is to create clusters of coherent related records, using graph drawing, agglomerative clustering methods and partitioning methods. Results The batch analysis of 300,000 "supposedly" distinct identities isolates 240,000 true unique records, 24,000 duplicates (clusters composed of 2 records and 3,000 clusters whose size is greater than or equal to 3 records. Conclusion Duplicate-free databases, used in conjunction with relevant indexes and similarity values, allow immediate (i.e.: real-time proximity detection when inserting a new identity.
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 ...... 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....
An accurate algorithm to match imperfectly matched images for lung tumor detection without markers.
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
Matched field localization based on CS-MUSIC algorithm
Guo, Shuangle; Tang, Ruichun; Peng, Linhui; Ji, Xiaopeng
2016-04-01
The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered. A matched field localization algorithm based on CS-MUSIC (Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning. The signal matrix is calculated through the SVD (Singular Value Decomposition) of the observation matrix. The observation matrix in the sparse mathematical model is replaced by the signal matrix, and a new concise sparse mathematical model is obtained, which means not only the scale of the localization problem but also the noise level is reduced; then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS (Compressive Sensing) method and MUSIC (Multiple Signal Classification) method. The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots, and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large, which will be proved in this paper.
Directory of Open Access Journals (Sweden)
Yinghua eWu
2013-08-01
Full Text Available Copy number variations (CNVs are associated with many complex diseases. Next generation sequencing data enable one to identify precise CNV breakpoints to better under the underlying molecular mechanisms and to design more efficient assays. Using the CIGAR strings of the reads, we develop a method that can identify the exact CNV breakpoints, and in cases when the breakpoints are in a repeated region, the method reports a range where the breakpoints can slide.Our method identifies the breakpoints of a CNV using both the positions and CIGAR strings of the reads that cover breakpoints of a CNV. A read with a long soft clipped part (denoted as $S$ in CIGAR at its 3'(right end can be used to identify the 5'(left-side of the breakpoints, and a read with a long $S$ part at the 5' end can be used to identify the breakpoint at the 3'-side. To ensure both types of reads cover the same CNV, we require the overlapped common string to include both of the soft clipped parts. When a CNV starts and ends in the same repeated regions, its breakpoints are not unique, in which case our method reports the left most positions for the breakpoints and a range within which the breakpoints can be incremented without changing the variant sequence.We have implemented the methods in a C++ package intended for the current Illumina Miseq and Hiseq platforms for both whole genome and exon-sequencing. Our simulation studies have shown that our method compares favorably with other similar methods in terms of true discovery rate, false positive rate and breakpoint accuracy. Our results from a real application have shown that the detected CNVs are consistent with zygosity and read depth information. The software package is available at http://statgene.med.upenn.edu/softprog.html.
Fabry, Paul; Baud, Robert; Burgun, Anita; Lovis, Christian
2006-07-01
Terminologia anatomica is the new standard in anatomical terminology. This terminology is available only in Latin and English and its worldwide adoption is subject to the addition of terms from others languages. On the other hand, Nomina anatomica, the previous standard, has been widely translated. Aim of this work was to append foreign terms to Terminologia by using similarity-matching algorithm between its Latin terms and those from Nomina. A semi-automatic matching of Latin terms from Terminologia with those of Nomina was performed using a string-to-string distance algorithm and manual assessment. We used a French-Latin version of Nomina together with Terminologia and we suggested French terms for Terminologia. Coverage was evaluated by the number of exact and approximate matches. A target of 78% was set due to the higher number of terms in Terminologia compared to Nomina. Relevance was estimated by manually comparing the meanings of the English and French terms related to the same Latin term. The question was whether they refer to the same anatomical structure. Exact or approximate matches were found for 5982 terms (76.5%) of Terminologia. Our results indicated that more than 75% of the terms from Terminologia came from Nomina, most of them were left unchanged and all were used with the same meaning. This method produces relevant results, reaching our 78% target. The method is based only on Latin terms and can be used for other languages. We consider this work as a starting point for adding terms to other knowledge sources, such as the foundational model of anatomy or the Unified Medical Language System (UMLS).
Optimizing Fukushima Emissions Through Pattern Matching and Genetic Algorithms
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.
On algorithmic equivalence of instruction sequences for computing bit string functions
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
On algorithmic equivalence of instruction sequences for computing bit string functions
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
Directory of Open Access Journals (Sweden)
SUN Wenbin
2016-11-01
Full Text Available In order to improve the accuracy of low frequency (sampling interval greater than 1 minute trajectory data matching algorithm, this paper proposed a novel matching algorithm termed HMDP-Q (History Markov Decision Processes Q-learning. The new algorithm is based on reinforced learning on historic trajectory. First, we extract historic trajectory data according to incremental matching algorithm as historical reference, and filter the trajectory dataset through the historic reference, the shortest trajectory and the reachability. Then we model the map matching process as the Markov decision process, and build up reward function using deflected distance between trajectory points and historic trajectories. The largest reward value of the Markov decision process was calculated by using the reinforced learning algorithm, which is the optimal matching result of trajectory and road. Finally we calibrate the algorithm by utilizing city's floating cars data to experiment. The results show that this algorithm can improve the accuracy between trajectory data and road. The matching accuracy is 89.2% within 1 minute low-frequency sampling interval, and the matching accuracy is 61.4% when the sampling frequency is 16 minutes. Compared with IVVM (Interactive Voting-based Map Matching, HMDP-Q has a higher matching accuracy and computing efficiency. Especially, when the sampling frequency is 16 minutes, HMDP-Q improves the matching accuracy by 26%.
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...
The choice of a 'Best' assisted history matching algorithm
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
Algorithm-Architecture Matching for Signal and Image Processing
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
Treat a new and efficient match algorithm for AI production system
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
Missile placement analysis based on improved SURF feature matching algorithm
Yang, Kaida; Zhao, Wenjie; Li, Dejun; Gong, Xiran; Sheng, Qian
2015-03-01
The precious battle damage assessment by use of video images to analysis missile placement is a new study area. The article proposed an improved speeded up robust features algorithm named restricted speeded up robust features, which combined the combat application of TV-command-guided missiles and the characteristics of video image. Its restrictions mainly reflected in two aspects, one is to restrict extraction area of feature point; the second is to restrict the number of feature points. The process of missile placement analysis based on video image was designed and a video splicing process and random sample consensus purification were achieved. The RSURF algorithm is proved that has good realtime performance on the basis of guarantee the accuracy.
Length-Bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection
Yi-Shan Lin; Chun-Liang Lee; Yaw-Chung Chen
2017-01-01
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 progra...
Wei, Yanbo; Lu, Zhizhong; Yuan, Gannan; Fang, Zhao; Huang, Yu
2017-05-13
In this paper, the application of the emerging compressed sensing (CS) theory and the geometric characteristics of the targets in radar images are investigated. Currently, the signal detection algorithms based on the CS theory require knowing the prior knowledge of the sparsity of target signals. However, in practice, it is often impossible to know the sparsity in advance. To solve this problem, a novel sparsity adaptive matching pursuit (SAMP) detection algorithm is proposed. This algorithm executes the detection task by updating the support set and gradually increasing the sparsity to approximate the original signal. To verify the effectiveness of the proposed algorithm, the data collected in 2010 at Pingtan, which located on the coast of the East China Sea, were applied. Experiment results illustrate that the proposed method adaptively completes the detection task without knowing the signal sparsity, and the similar detection performance is close to the matching pursuit (MP) and orthogonal matching pursuit (OMP) detection algorithms.
Fast block matching algorithm based on the winner-update strategy.
Chen, Y S; Hung, Y P; Fuh, C S
2001-01-01
Block matching is a widely used method for stereo vision, visual tracking, and video compression. Many fast algorithms for block matching have been proposed in the past, but most of them do not guarantee that the match found is the globally optimal match in a search range. This paper presents a new fast algorithm based on the winner-update strategy which utilizes an ascending lower bound list of the matching error to determine the temporary winner. Two lower bound lists derived by using partial distance and by using Minkowski's inequality are described. The basic idea of the winner-update strategy is to avoid, at each search position, the costly computation of the matching error when there exists a lower bound larger than the global minimum matching error. The proposed algorithm can significantly speed up the computation of the block matching because: 1) computational cost of the lower bound we use is less than that of the matching error itself; 2) an element in the ascending lower bound list will be calculated only when its preceding element has already been smaller than the minimum matching error computed so far; 3) for many search positions, only the first several lower bounds in the list need to be calculated. Our experiments have shown that, when applying to motion vector estimation for several widely-used test videos, 92% to 98% of operations can be saved while still guaranteeing the global optimality. Moreover, the proposed algorithm can be easily modified either to meet the limited time requirement or to provide an ordered list of best candidate matches. Our source codes of the proposed algorithm are available at http://smart.iis.sinica.edu.tw/html/winup.html.
Uncertainty-Based Map Matching: The Space-Time Prism and k-Shortest Path Algorithm
Directory of Open Access Journals (Sweden)
Bart Kuijpers
2016-11-01
Full Text Available Location-aware devices can be used to record the positions of moving objects for further spatio-temporal data analysis. For instance, we can analyze the routes followed by a person or a group of people, to discover hidden patterns in trajectory data. Typically, the positions of moving objects are registered by GPS devices, and most of the time, the recorded positions do not match the road actually followed by the object carrying the device, due to different sources of errors. Thus, matching the moving object’s actual position to a location on a digital map is required. The problem of matching GPS-recorded positions to a road network is called map matching (MM. Although many algorithms have been proposed to solve this problem, few of them consider the uncertainty caused by the absence of information about the moving object’s position in-between consecutive recorded locations. In this paper, we study the relationship between map matching and uncertainty, and we propose a novel MM algorithm that uses space-time prisms in combination with weighted k-shortest path algorithms. We applied our algorithm to real-world cases and to computer-generated trajectory samples with a variety of properties. We compare our results against a number of well-known algorithms that we have also implemented and show that it outperforms existing algorithms, allowing us to obtain better matches, with a negligible loss in performance. In addition, we propose a novel accuracy measure that allows a better comparison between different MM algorithms. We applied this novel measure to compare our algorithm against existing algorithms.
The Study of Address Tree Coding Based on the Maximum Matching Algorithm in Courier Business
Zhou, Shumin; Tang, Bin; Li, Wen
As an important component of EMS monitoring system, address is different from user name with great uncertainty because there are many ways to represent it. Therefore, address standardization is a difficult task. Address tree coding has been trying to resolve that issue for many years. Zip code, as its most widely used algorithm, can only subdivide the address down to a designated post office, not the recipients' address. This problem needs artificial identification method to be accurately delivered. This paper puts forward a new encoding algorithm of the address tree - the maximum matching algorithm to solve the problem. This algorithm combines the characteristics of the address tree and the best matching theory, and brings in the associated layers of tree nodes to improve the matching efficiency. Taking the variability of address into account, the thesaurus of address tree should be updated timely by increasing new nodes automatically through intelligent tools.
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
A novel SAR image precise-matching method based on SIFT algorithm
Yan, Wenwen; Li, Bin; Yang, Dekun; Tian, Jinwen; Yu, Qiong
2013-10-01
As for SAR image, it has a relatively great geometric distortion, and contains a lot of speckle noise. So a lot of research has been done to find a good method for SAR image matching. SIFT (Scale Invariant Feature Transform) has been proved to a good algorithm for the SAR image matching. This operator can dispose of matching problem such as rotation, affine distortion and noise. In this passage, firstly, in the preprocessing process, we use BM3D to denoise the image which can perform well comparing to other denoise method. Then, regardless of traditional SIFT-RANSAC method, SIFT-TC is used to complete image matching. By using this method, the image matching is proved to have better predominance in the matching efficiency, speed and robustness.
BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks
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
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%.
Research on rolling element bearing fault diagnosis based on genetic algorithm matching pursuit
Rong, R. W.; Ming, T. F.
2017-12-01
In order to solve the problem of slow computation speed, matching pursuit algorithm is applied to rolling bearing fault diagnosis, and the improvement are conducted from two aspects that are the construction of dictionary and the way to search for atoms. To be specific, Gabor function which can reflect time-frequency localization characteristic well is used to construct the dictionary, and the genetic algorithm to improve the searching speed. A time-frequency analysis method based on genetic algorithm matching pursuit (GAMP) algorithm is proposed. The way to set property parameters for the improvement of the decomposition results is studied. Simulation and experimental results illustrate that the weak fault feature of rolling bearing can be extracted effectively by this proposed method, at the same time, the computation speed increases obviously.
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.
Parallel algorithm for determining motion vectors in ice floe images by matching edge features
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.
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.
EFFICIENT BLOCK MATCHING ALGORITHMS FOR MOTION ESTIMATION IN H.264/AVC
Directory of Open Access Journals (Sweden)
P. Muralidhar
2015-02-01
Full Text Available In Scalable Video Coding (SVC, motion estimation and inter-layer prediction play an important role in elimination of temporal and spatial redundancies between consecutive layers. This paper evaluates the performance of widely accepted block matching algorithms used in various video compression standards, with emphasis on the performance of the algorithms for a didactic scalable video codec. Many different implementations of Fast Motion Estimation Algorithms have been proposed to reduce motion estimation complexity. The block matching algorithms have been analyzed with emphasis on Peak Signal to Noise Ratio (PSNR and computations using MATLAB. In addition to the above comparisons, a survey has been done on Spiral Search Motion Estimation Algorithms for Video Coding. A New Modified Spiral Search (NMSS motion estimation algorithm has been proposed with lower computational complexity. The proposed algorithm achieves 72% reduction in computation with a minimal (<1dB reduction in PSNR. A brief introduction to the entire flow of video compression H.264/SVC is also presented in this paper.
Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH
Energy Technology Data Exchange (ETDEWEB)
Volk, Jochen [ETH Zuerich, Institut fuer Molekularbiologie und Biophysik (Switzerland); Herrmann, Torsten [Universite de Lyon, CNRS/ENS Lyon/UCB-Lyon 1 (France); Wuethrich, Kurt [ETH Zuerich, Institut fuer Molekularbiologie und Biophysik (Switzerland)], E-mail: wuthrich@mol.biol.ethz.ch
2008-07-15
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.
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...
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.
Definition of an Ontology Matching Algorithm for Context Integration in Smart Cities.
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.
Performance Testing of GPU-Based Approximate Matching Algorithm on Network Traffic
2015-03-01
Academic Group iv THIS PAGE INTENTIONALLY LEFT BLANK v ABSTRACT Insider threat is one of the risks both government and private organizations have...Karp algorithm is very useful in detecting plagiarism because it is capable of performing multiple pattern matching. (2) Knuth-Morris-Pratt (KMP
An improved SIFT algorithm in the application of close-range Stereo image matching
Zhang, Xuehua; Wang, Xiaoqing; Yuan, Xiaoxiang; Wang, Shumin
2016-11-01
As unmanned aerial vehicle (UAV) remote sensing is applied in small area aerial photogrammetry surveying, disaster monitoring and emergency command, 3D urban construction and other fields, the image processing of UAV has become a hot topic in current research. The precise matching of UAV image is a key problem, which affects the subsequent processing precision directly, such as 3D reconstruction and automatic aerial triangulation, etc. At present, SIFT (Scale Invariant Feature Transform) algorithm proposed by DAVID G. LOWE as the main method is, is widely used in image matching, since its strong stability to image rotation, shift, scaling, and the change of illumination conditions. It has been successfully applied in target recognition, SFM (Structure from Motion), and many other fields. SIFT algorithm needs the colour images to be converted into grayscale images, detects extremum points under different scales and uses neighbourhood pixels to generate descriptor. As we all know that UAV images with rich colour information, the SIFT algorithm improved through combining with the image colour information in this paper, the experiments are conducted from matching efficiency and accuracy compared with the original SIFT algorithm. The results show that the method which proposed in this paper decreases on the efficiency, but is improved on the precision and provides a basis choice for matching method.
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
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.
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.
International Nuclear Information System (INIS)
Rozario, T; Bereg, S; Chiu, T; Liu, H; Kearney, V; Jiang, L; Mao, W
2014-01-01
Purpose: In order to locate lung tumors on projection images without internal markers, digitally reconstructed radiograph (DRR) is created and compared with projection images. Since lung tumors always move and their locations change on projection images while they are static on DRRs, a special DRR (background DRR) is generated based on modified anatomy from which lung tumors are removed. In addition, global discrepancies exist between DRRs and projections due to their different image originations, scattering, and noises. This adversely affects comparison accuracy. A simple but efficient comparison algorithm is reported. Methods: This method divides global images into a matrix of small tiles and similarities will be evaluated by calculating normalized cross correlation (NCC) between corresponding tiles on projections and DRRs. The tile configuration (tile locations) will be automatically optimized to keep the tumor within a single tile which has bad matching with the corresponding DRR tile. A pixel based linear transformation will be determined by linear interpolations of tile transformation results obtained during tile matching. The DRR will be transformed to the projection image level and subtracted from it. The resulting subtracted image now contains only the tumor. A DRR of the tumor is registered to the subtracted image to locate the tumor. Results: This method has been successfully applied to kV fluoro images (about 1000 images) acquired on a Vero (Brainlab) for dynamic tumor tracking on phantom studies. Radiation opaque markers are implanted and used as ground truth for tumor positions. Although, other organs and bony structures introduce strong signals superimposed on tumors at some angles, this method accurately locates tumors on every projection over 12 gantry angles. The maximum error is less than 2.6 mm while the total average error is 1.0 mm. Conclusion: This algorithm is capable of detecting tumor without markers despite strong background signals
A fast stereo matching algorithm for 3D reconstruction of internal organs in laparoscopic surgery
Okada, Yoshimichi; Koishi, Takeshi; Ushiki, Suguru; Nakaguchi, Toshiya; Tsumura, Norimichi; Miyake, Yoichi
2008-03-01
We propose a fast stereo matching algorithm for 3D reconstruction of internal organs using a stereoscopic laparoscope. Stoyanov et al. have proposed a technique for recovering the 3D depth of internal organs from images taken by a stereoscopic laparoscope. In their technique, the dense stereo correspondence is solved by registration of the entire image. However, the computational cost is very high because registration of the entire image requires multidimensional optimization. In this paper, we propose a new algorithm based on a local area registration method that requires only low-dimensional optimization for reduction of computational cost. We evaluated the computational cost of the proposed algorithm using a stereoscopic laparoscope. We also evaluated the accuracy of the proposed algorithm using three types of images of abdominal models taken by a 3D laser scanner. In the matching step, the size of the template used to calculate the correlation coefficient, on which the computational cost is strongly dependent, was reduced by a factor of 16 as compared with the conventional algorithm. On the other hand, the average depth errors were 4.68 mm, 7.18 mm, and 7.44 mm respectively, and accuracy was approximately as same as the conventional algorithm.
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
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.
A Multi-view Dense Matching Algorithm of High Resolution Aerial Images Based on Graph Network
Directory of Open Access Journals (Sweden)
YAN Li
2016-10-01
Full Text Available A multi-view dense matching algorithm of high resolution aerial images based on graph network was presented. Overlap ratio and direction between adjacent images was used to find the candidate stereo pairs and build the graph network, then a Coarse-to-Fine strategy based on modified semi-global matching algorithm (SGM was adapted to calculate the disparity map of stereo pairs. Finally, dense point cloud was generated and fused using a multi-triangulation method based on graph network. In the experiment part, the Vaihingen aerial image dataset and the oblique nadir image block of Zürich in ISPRS/EuroSDR project were used to test the algorithm above. Experiment results show that out method is effective for multi-view dense matching of high resolution aerial images in consideration of completeness, efficiency and precision, while the RMS of average reprojection error can reach subpixel level and the actual deviation is better than 1.5 GSD. Due to the introduction of guided median filter, regions of sharp discontinuities, weak textureness or repeat textureness like buildings, vegetation and water body can also be matched well.
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.
A novel retinal vessel extraction algorithm based on matched filtering and gradient vector flow
Yu, Lei; Xia, Mingliang; Xuan, Li
2013-10-01
The microvasculature network of retina plays an important role in the study and diagnosis of retinal diseases (age-related macular degeneration and diabetic retinopathy for example). Although it is possible to noninvasively acquire high-resolution retinal images with modern retinal imaging technologies, non-uniform illumination, the low contrast of thin vessels and the background noises all make it difficult for diagnosis. In this paper, we introduce a novel retinal vessel extraction algorithm based on gradient vector flow and matched filtering to segment retinal vessels with different likelihood. Firstly, we use isotropic Gaussian kernel and adaptive histogram equalization to smooth and enhance the retinal images respectively. Secondly, a multi-scale matched filtering method is adopted to extract the retinal vessels. Then, the gradient vector flow algorithm is introduced to locate the edge of the retinal vessels. Finally, we combine the results of matched filtering method and gradient vector flow algorithm to extract the vessels at different likelihood levels. The experiments demonstrate that our algorithm is efficient and the intensities of vessel images exactly represent the likelihood of the vessels.
Taxamatch, an Algorithm for Near (‘Fuzzy’) Matching of Scientific Names in Taxonomic Databases
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
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.
A fast and accurate feature-matching algorithm for minimally-invasive endoscopic images.
Puerto-Souza, Gustavo A; Mariottini, Gian-Luca
2013-07-01
The ability to find image similarities between two distinct endoscopic views is known as feature matching, and is essential in many robotic-assisted minimally-invasive surgery (MIS) applications. Differently from feature-tracking methods, feature matching does not make any restrictive assumption about the chronological order between the two images or about the organ motion, but first obtains a set of appearance-based image matches, and subsequently removes possible outliers based on geometric constraints. As a consequence, feature-matching algorithms can be used to recover the position of any image feature after unexpected camera events, such as complete occlusions, sudden endoscopic-camera retraction, or strong illumination changes. We introduce the hierarchical multi-affine (HMA) algorithm, which improves over existing feature-matching methods because of the larger number of image correspondences, the increased speed, and the higher accuracy and robustness. We tested HMA over a large (and annotated) dataset with more than 100 MIS image pairs obtained from real interventions, and containing many of the aforementioned sudden events. In all of these cases, HMA outperforms the existing state-of-the-art methods in terms of speed, accuracy, and robustness. In addition, HMA and the image database are made freely available on the internet.
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.
A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection.
Lee, Chun-Liang; Lin, Yi-Shan; Chen, Yaw-Chung
2015-01-01
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.
Validation of Map Matching Algorithms using High Precision Positioning with GPS
Quddus, Mohammed A.; Noland, Robert B.; Ochieng, Washington Y.
2005-05-01
Map Matching (MM) algorithms are usually employed for a range of transport telematics applications to correctly identify the physical location of a vehicle travelling on a road network. Two essential components for MM algorithms are (1) navigation sensors such as the Global Positioning System (GPS) and dead reckoning (DR), among others, to estimate the position of the vehicle, and (2) a digital base map for spatial referencing of the vehicle location. Previous research by the authors (Quddus et al., 2003; Ochieng et al., 2003) has developed improved MM algorithms that take account of the vehicle speed and the error sources associated with the navigation sensors and the digital map data previously ignored in conventional MM approaches. However, no validation study assessing the performance of MM algorithms has been presented in the literature. This paper describes a generic validation strategy and results for the MM algorithm previously developed in Ochieng et al. (2003). The validation technique is based on a higher accuracy reference (truth) of the vehicle trajectory as determined by high precision positioning achieved by the carrier-phase observable from GPS. The results show that the vehicle positions determined from the MM results are within 6 m of the true positions. The results also demonstrate the importance of the quality of the digital map data to the map matching process.
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.
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/.
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/.
GPU-accelerated Block Matching Algorithm for Deformable Registration of Lung CT Images.
Li, Min; Xiang, Zhikang; Xiao, Liang; Castillo, Edward; Castillo, Richard; Guerrero, Thomas
2015-12-01
Deformable registration (DR) is a key technology in the medical field. However, many of the existing DR methods are time-consuming and the registration accuracy needs to be improved, which prevents their clinical applications. In this study, we propose a parallel block matching algorithm for lung CT image registration, in which the sum of squared difference metric is modified as the cost function and the moving least squares approach is used to generate the full displacement field. The algorithm is implemented on Graphic Processing Unit (GPU) with the Compute Unified Device Architecture (CUDA). Results show that the proposed parallel block matching method achieves a fast runtime while maintaining an average registration error (standard deviation) of 1.08 (0.69) mm.
Duodenal parasites test; Giardia - string test ... To have this test, you swallow a string with a weighted gelatin capsule on the end. The string is pulled out 4 hours later. Any bile , blood, or mucus attached to ...
Automated rotation rate tracking of pigmented cells by a customized block-matching algorithm.
Zhang, Guanglie; Ouyang, Mengxing; Mai, John; Li, Wen Jung; Liu, Wing Keung
2013-04-01
This article describes an automated rotation rate tracking algorithm for pigmented cells that undergo rotation in a dielectrophoretic (DEP) force field. In a completely automated process, we preprocess each frame of a video sequence, then analyze the sequence frame by frame using a rotating-circle template with a block-matching algorithm, and finally estimate the rotation rate of the pigmented cells using a pixel-patch correlation. The algorithm has been demonstrated to accurately calculate the DEP-induced rotation rate of the cell up to 250 rpm. Cell rotation rates in various DEP force fields (i.e., by varying the applied voltages, frequencies, and waveforms to induce different force fields) were analyzed using this automated algorithm and reported in this article. Most importantly, the algorithm is accurate even when the cells have simultaneous translational and rotational motions across the video image sequence. Also, the algorithm is capable of tracking changes in rotation speed over a long period of time (90 s) by stably analyzing a massive data set of video image frames.
Video error concealment using block matching and frequency selective extrapolation algorithms
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.
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.
A new accurate curvature matching and optimal tool based five-axis machining algorithm
Energy Technology Data Exchange (ETDEWEB)
Lin, Than; Lee, Jae Woo [Konkuk University, Seoul (Korea, Republic of); Bohez, Erik L. J. [Asian Institute of Technology, Bangkok (Thailand)
2009-10-15
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
Parallel implementation of DNA sequences matching algorithms using PWM on GPU architecture.
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.
DiBattista, Andrew; Noble, J Alison
2014-03-01
An efficient block matching and spectral shift estimation algorithm for freehand quasi-static ultrasound elastography is described in this paper. The proposed method provides a balance between computational speed and robustness against displacement estimation error and bias; a fundamental aspect of elastography. The new algorithm was tested on an extensive set of simulated 1-D RF ultrasound signals, replicating various strain profiles. Additionally, real 2-D scans were conducted on an ultrasound phantom with prescribed elastic properties; the algorithm output was further validated with a comparison to a finite element model (FEM) of the phantom. Clinical data from a breast cancer study and histology slides were used to demonstrate the in vivo use of the new elastography technique. The algorithm showed a significant computational savings (at least 60 times faster) over existing spectral shift analysis methods. Accurate strain images were produced in as little as 2 s with the scope for further speed enhancements through parallel processing; making real-time implementation a future possibility. Moreover, it demonstrated a robustness toward displacement estimation error when compared with conventional gradient-based techniques, and was able to perform at high strain values (>5%) while showing relative insensitivity to various parameters settings, such as sample rate and block window size; a desirable performance for a practical clinical tool.
Jiménez, Felipe; Monzón, Sergio; Naranjo, Jose Eugenio
2016-02-04
Vehicle positioning is a key factor for numerous information and assistance applications that are included in vehicles and for which satellite positioning is mainly used. However, this positioning process can result in errors and lead to measurement uncertainties. These errors come mainly from two sources: errors and simplifications of digital maps and errors in locating the vehicle. From that inaccurate data, the task of assigning the vehicle's location to a link on the digital map at every instant is carried out by map-matching algorithms. These algorithms have been developed to fulfil that need and attempt to amend these errors to offer the user a suitable positioning. In this research; an algorithm is developed that attempts to solve the errors in positioning when the Global Navigation Satellite System (GNSS) signal reception is frequently lost. The algorithm has been tested with satisfactory results in a complex urban environment of narrow streets and tall buildings where errors and signal reception losses of the GPS receiver are frequent.
A matched-filter algorithm to detect amperometric spikes resulting from quantal secretion.
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.
Directory of Open Access Journals (Sweden)
Effat Soleimani
2011-06-01
Conclusion: Both block-matching and maximum-gradient algorithms can be used to extract the radial displacement of the carotid artery wall and in addition, with respect to the pixel size as error, the same results can be obtained.
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.
PocketMatch: a new algorithm to compare binding sites in protein structures.
Yeturu, Kalidas; Chandra, Nagasuma
2008-12-17
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. 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. 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 along with the new alignment strategy used, it is sufficient to
National Research Council Canada - National Science Library
Keller, Martin G
1999-01-01
In the fields of computational vision and image understanding, the object recognition problem can be formulated as a problem of matching a collection of model features to features extracted from an observed scene...
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.
Domain Walls with Strings Attached
Energy Technology Data Exchange (ETDEWEB)
Shmakova, Marina
2001-08-20
We have constructed a bulk and brane action of IIA theory which describes a pair of BPS domain walls on S{sub 1}/Z{sub 2}, with strings attached. The walls are given by two orientifold O8-planes with coincident D8-branes and F1-D0-strings are stretched between the walls. This static configuration satisfies all matching conditions for the string and domain wall sources and has 1/4 of unbroken supersymmetry.
An enhanced block matching algorithm for fast elastic registration in adaptive radiotherapy.
Malsch, U; Thieke, C; Huber, P E; Bendl, R
2006-10-07
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.
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.)
Orthogonal matching pursuit algorithm and power line noise suppression of magnetotelluric signal
Li, Guang; Tang, Jingtian
2017-11-01
Power-line noise is mainly comes from power systems and has become one of the most common noises during the acquisition of magnetotelluric (MT) signal, its components including a fundamental frequency signal and a lot of odd harmonics. There are trap circuits designed in most of the acquisition instruments to separate these noise, however, the fundamental frequency of the power line noise will fluctuate with the changing of load current, but the center frequency of the trap circuits are fixed, hence the MT data are still seriously disturbed by the power line noise. To mitigate the disturbance of power line noise, a novel denoising method was proposed based on orthogonal matching pursuit (OMP) algorithm. Semisynthetic experiments and real data obtained from Lu-Zong ore-concentration district illustrate that the proposed method can effectively suppress the power line noise while remain the useful MT signal, the apparent resistivity and phase curves are greatly improved over previous.
2D-pattern matching image and video compression: theory, algorithms, and experiments.
Alzina, Marc; Szpankowski, Wojciech; Grama, Ananth
2002-01-01
In this paper, we propose a lossy data compression framework based on an approximate two-dimensional (2D) pattern matching (2D-PMC) extension of the Lempel-Ziv (1977, 1978) lossless scheme. This framework forms the basis upon which higher level schemes relying on differential coding, frequency domain techniques, prediction, and other methods can be built. We apply our pattern matching framework to image and video compression and report on theoretical and experimental results. Theoretically, we show that the fixed database model used for video compression leads to suboptimal but computationally efficient performance. The compression ratio of this model is shown to tend to the generalized entropy. For image compression, we use a growing database model for which we provide an approximate analysis. The implementation of 2D-PMC is a challenging problem from the algorithmic point of view. We use a range of techniques and data structures such as k-d trees, generalized run length coding, adaptive arithmetic coding, and variable and adaptive maximum distortion level to achieve good compression ratios at high compression speeds. We demonstrate bit rates in the range of 0.25-0.5 bpp for high-quality images and data rates in the range of 0.15-0.5 Mbps for a baseline video compression scheme that does not use any prediction or interpolation. We also demonstrate that this asymmetric compression scheme is capable of extremely fast decompression making it particularly suitable for networked multimedia applications.
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.
A Morse-code recognition system with LMS and matching algorithms for persons with disabilities.
Shih, C H; Luo, C H
1997-05-01
Single-switch communication is an effective auxiliary method for persons with disabilities. However, it is not easy to recognize the Morse codes typed by them. In our earlier proposed Morse code auto-recognition method, using the Least-Mean-Square (LMS) adaptive algorithm, it was demonstrated that the system could successfully recognize the Morse-coded messages at unstable typing speeds. However, the speed variation had to be limited to a range between 0.67 and two times the present speed. In the case of beginners or those with heavy disabilities, this rule can not always be complied with, producing a low recognition rate of 20%. To address this limitation, this paper offers an advanced recognition method which combines the Least-Mean-Square algorithm with a character-by-character matching technique. The recognition rate for this method from simulated and real data from various sources is as high as 75% or more on average. This practical application of the single-switch method means a step forward toward alternative communication for disabled persons.
A multichannel block-matching denoising algorithm for spectral photon-counting CT images.
Harrison, Adam P; Xu, Ziyue; Pourmorteza, Amir; Bluemke, David A; Mollura, Daniel J
2017-06-01
We present a denoising algorithm designed for a whole-body prototype photon-counting computed tomography (PCCT) scanner with up to 4 energy thresholds and associated energy-binned images. Spectral PCCT images can exhibit low signal to noise ratios (SNRs) due to the limited photon counts in each simultaneously-acquired energy bin. To help address this, our denoising method exploits the correlation and exact alignment between energy bins, adapting the highly-effective block-matching 3D (BM3D) denoising algorithm for PCCT. The original single-channel BM3D algorithm operates patch-by-patch. For each small patch in the image, a patch grouping action collects similar patches from the rest of the image, which are then collaboratively filtered together. The resulting performance hinges on accurate patch grouping. Our improved multi-channel version, called BM3D_PCCT, incorporates two improvements. First, BM3D_PCCT uses a more accurate shared patch grouping based on the image reconstructed from photons detected in all 4 energy bins. Second, BM3D_PCCT performs a cross-channel decorrelation, adding a further dimension to the collaborative filtering process. These two improvements produce a more effective algorithm for PCCT denoising. Preliminary results compare BM3D_PCCT against BM3D_Naive, which denoises each energy bin independently. Experiments use a three-contrast PCCT image of a canine abdomen. Within five regions of interest, selected from paraspinal muscle, liver, and visceral fat, BM3D_PCCT reduces the noise standard deviation by 65.0%, compared to 40.4% for BM3D_Naive. Attenuation values of the contrast agents in calibration vials also cluster much tighter to their respective lines of best fit. Mean angular differences (in degrees) for the original, BM3D_Naive, and BM3D_PCCT images, respectively, were 15.61, 7.34, and 4.45 (iodine); 12.17, 7.17, and 4.39 (galodinium); and 12.86, 6.33, and 3.96 (bismuth). We outline a multi-channel denoising algorithm tailored for
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.
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.)
A block matching-based registration algorithm for localization of locally advanced lung tumors.
Robertson, Scott P; Weiss, Elisabeth; Hugo, Geoffrey D
2014-04-01
To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. 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. 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-right, anterior-posterior, and
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
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
More Speed and More Compression: Accelerating Pattern Matching by Text Compression
Matsumoto, Tetsuya; Hagio, Kazuhito; Takeda, Masayuki
2007-01-01
This paper addresses the problem of speeding up string matching by text compression, and presents a compressed pattern matching (CPM) algorithm which finds a pattern within a text given as a collage system that variable sequence S is encoded by byte-oriented Huffman coding. The compression ratio is high compared with existing CPM algorithms addressing the problem, and the search time reduction ratio compared to the Knuth-Morris-Pratt algorithm over uncompressed text is nearly the same as the...
Genetic Algorithm-Based Optimization to Match Asteroid Energy Deposition Curves
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.
Directory of Open Access Journals (Sweden)
Yajie Sun
2017-01-01
Full Text Available In order to ensure the safety of composite components, structural health monitoring is needed to detect structural performance in real-time at the early stage of damage occurred. This is difficult to detect complex components with single sensor detection technology, so that ultrasonic phased array technology using multisensor detection will be selected. Ultrasonic phased array technology can scan the structure in all directions and angles without moving or less moving the probe and becomes the first choice of structural health monitoring. However, a large amount of data will be generated when using ultrasonic phased array with Nyquist sampling theorem for structural health monitoring and is difficult to storage, transmission, and processing. Besides, traditional Nyquist sampling cannot satisfy the sampling of large amounts of data without distortion, so a more efficient acquisition technique must be chosen. Compressive sensing theory can ensure that if the signal is sparse, it can be sampled in low sampling rate which is much less than two times of the sampling rate as defined by Nyquist sampling theorem for a large number of data and reconstructed in high probability. Then, the experiment result indicated that the orthogonal matching pursuit algorithm can reconstruct the signal completely and accurately.
Genetic Algorithm-based Optimization to Match Asteroid Energy Deposition Curves
Tarano, Ana Maria; Mathias, Donovan; Wheeler, Lorien; Close, Sigrid
2017-10-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 space-borne 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, ablation coefficient, and strength scaling, from simulations using FCM. The previous parameters’ fitness evaluation involves minimizing residuals and comparing the incremental energy deposited 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.
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.
Soleimani, Effat; Dizaji, Manijhe Mokhtari; Saberi, Hajir
2011-01-01
Radial movement of the arterial wall is a well-known indicator of the mechanical properties of arteries in arterial disease examinations. In the present study, two different motion estimation methods, based on the block-matching and maximum-gradient algorithms, were examined to extract the radial displacement of the carotid artery wall. Each program was separately implemented to the same axial consecutive ultrasound images of the carotid artery of 10 healthy men, and the radial displacement waveform of this artery was extracted during two cardiac cycles. The results of the two methods were compared using the linear regression and Bland-Altman statistical analyses. The maximum and mean displacements traced by the block-matching algorithm were compared with the same parameters traced by the maximum-gradient algorithm. The frame numbers in which the maximum displacement of the wall occurred were compared too. There were no significant differences between the maximum and the mean displacements traced by the block-matching algorithm and the same parameters traced by the maximum-gradient algorithm according to the pair t-test analysis (p value > 0.05). There was a significant correlation between the radial movement of the common carotid artery measured with the block-matching and maximum-gradient methods (with a correlation coefficient of 0.89 and p value block-matching and maximum-gradient algorithms can be used to extract the radial displacement of the carotid artery wall and in addition, with respect to the pixel size as error, the same results can be obtained.
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
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.
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.
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.
Cosmological Quantum String Vacua and String-String Duality
Rey, Soo-Jong
1996-01-01
Implications of string-string dualities to cosmological string vacua are discussed. Cosmological vacua of classical string theories comprise of disjoint classses mapped one another by scale-factor T-duality. Each classes are, however, afflicted with initial/final cosmological singularities. It is argued that quantum string theories and string-string dualities dramatically resolve these cosmological singularities out so that disjoint classical cosmological vacua are continuously connected in a...
Cover array string reconstruction
Crochemore, Maxime; S. Iliopoulos, Costas; P. Pissis, Solon; Tischler, German
2010-01-01
International audience; A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer array C is the minimal-cover (resp. maximal-cover) array of y if C[i] is the minimal (resp. maximal) length of covers of y[0.. i], or zero if no cover exists. In this paper, we present a constructive algorithm checking the validity of an array as a minimal-cover or maximal-cover array of some str...
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
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
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
González, Diego; Botella, Guillermo; García, Carlos; Prieto, Manuel; Tirado, Francisco
2013-12-01
This contribution focuses on the optimization of matching-based motion estimation algorithms widely used for video coding standards using an Altera custom instruction-based paradigm and a combination of synchronous dynamic random access memory (SDRAM) with on-chip memory in Nios II processors. A complete profile of the algorithms is achieved before the optimization, which locates code leaks, and afterward, creates a custom instruction set, which is then added to the specific design, enhancing the original system. As well, every possible memory combination between on-chip memory and SDRAM has been tested to achieve the best performance. The final throughput of the complete designs are shown. This manuscript outlines a low-cost system, mapped using very large scale integration technology, which accelerates software algorithms by converting them into custom hardware logic blocks and showing the best combination between on-chip memory and SDRAM for the Nios II processor.
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.
DEFF Research Database (Denmark)
Franceschini, A.; Simonovic, M.; Roth, A.
2013-01-01
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...
Directory of Open Access Journals (Sweden)
Iván Amón
2012-06-01
Full Text Available Con frecuencia datos que deberían estar escritos de forma idéntica no lo están debido a errores ortográficos y tipográficos, variaciones en el orden de las palabras, uso de prefijos y sufijos, entre otros. Las técnicas fonéticas para detección de duplicados no están orientadas al idioma español, lo que dificulta la identificación y corrección de problemas como errores ortográficos en textos escritos en este idioma. En este artículo de investigación se propone un algoritmo denominado PhoneticSpanish para la detección de cadenas de texto duplicadas el cual considera la presencia de errores ortográficos en el idioma español. El algoritmo propuesto se comparó con nueve técnicas para la detección de duplicados. Los resultados del algoritmo fueron satisfactorios ya que se obtuvieron mejores resultados que las otras técnicas y evidencian oportunidades para mejorar el análisis de información en el idioma español.Often data that should be written so they are not identical due to misspellings and typos, variations in word order, use of prefixes and suffixes, among others. Phonetic techniques for duplicate detection are not geared toward the Spanish language, which makes the identification and correction of problems such as spelling errors in texts written in this language. In this paper we propose an algorithm called PhoneticSpanish to detect duplicate text strings which considers the presence of spelling errors in Spanish. The proposed algorithm was compared with nine techniques to detect duplicates. The results were satisfactory and the algorithm that performed better than the other techniques and demonstrate opportunities for improved analysis of information in Spanish.
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
MapSnapper: engineering an efficient algorithm for matching images of maps from mobile phones
Hare, Jonathon S.; Lewis, Paul H.; Gordon, Layla; Hart, Glen
2008-01-01
The MapSnapper project aimed to develop a system for robust matching of low-quality images of a paper map taken from a mobile phone against a high quality digital raster representation of the same map. The paper presents a novel methodology for performing content-based image retrieval and object recognition from query images that have been degraded by noise and subjected to transformations through the imaging system. In addition the paper also provides an insight into the evaluation-driven development process that was used to incrementally improve the matching performance until the design specifications were met.
Isambert, A; Bonniaud, G; Lavielle, F; Malandain, G; Lefkopoulos, D
2008-12-01
The aim of the present study was to quantitatively assess the performance of a block matching-based automatic registration algorithm integrated within the commercial treatment planning system designated ISOgray from Dosisoft. The accuracy of the process was evaluated by a phantom study on computed tomography (CT), magnetic resonance (MR) and positron emission tomography (PET) images. Two phantoms were used to carry out this study: the cylindrical Jaszczak phantom and the anthropomorphic Liqui-Phil Head Phantom (the Phantom Laboratory), containing fillable spheres. External fiducial markers were used to quantify the accuracy of 41 CT/CT, MR/CT and PET/CT automatic registrations with images of the rotated and tilted phantoms. The study first showed that a cylindrical phantom was not adapted for the evaluation of the performance of a block matching-based registration software. Secondly, the Liqui-Phil Head Phantom study showed that the algorithm was able to perform automatic registrations of CT/CT and MR/CT images with differences of up to 40 degrees in phantom rotation and of up to 20-30 degrees for PET/CT with accuracy below the image voxel size. The study showed that the block matching-based automatic registration software under investigation was robust, reliable and yielded very satisfactory results. This phantom-based test can be integrated into a periodical quality assurance process and used for any commissioning of image registration software for radiation therapy.
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.
A New FPGA Architecture of FAST and BRIEF Algorithm for On-Board Corner Detection and Matching.
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.
Clustering Words to Match Conditions: An Algorithm for Stimuli Selection in Factorial Designs
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…
A novel iris patterns matching algorithm of weighted polar frequency correlation
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.
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.
Energy Technology Data Exchange (ETDEWEB)
Mizoguchi, Shun’ya [Theory Center, Institute of Particle and Nuclear Studies, KEK,1-1 Oho, Tsukuba, Ibaraki, 305-0801 (Japan); SOKENDAI (The Graduate University for Advanced Studies),1-1 Oho, Tsukuba, Ibaraki, 305-0801 (Japan); Tani, Taro [National Institute of Technology, Kurume College,1-1-1 Komorino, Kurume, Fukuoka, 830-8555 (Japan)
2016-11-09
It is now well known that the moduli space of a vector bundle for heterotic string compactifications to four dimensions is parameterized by a set of sections of a weighted projective space bundle of a particular kind, known as Looijenga’s weighted projective space bundle. We show that the requisite weighted projective spaces and the Weierstrass equations describing the spectral covers for gauge groups E{sub N}(N=4,⋯,8) and SU(n+1)(n=1,2,3) can be obtained systematically by a series of blowing-up procedures according to Tate’s algorithm, thereby the sections of correct line bundles claimed to arise by Looijenga’s theorem can be automatically obtained. They are nothing but the four-dimensional analogue of the set of independent polynomials in the six-dimensional F-theory parameterizing the complex structure, which is further confirmed in the constructions of D{sub 4}, A{sub 5}, D{sub 6}, E{sub 3} and SU(2)×SU(2) bundles. We also explain why we can obtain them in this way by using the structure theorem of the Mordell-Weil lattice, which is also useful for understanding the relation between the singularity and the occurrence of chiral matter in F-theory.
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.
Energy Technology Data Exchange (ETDEWEB)
Engquist, J. [Institute for Theoretical Physics and Spinoza Institute, Utrecht University (Netherlands); Sundell, P. [INFN, Pisa (Italy); Scuola Normale Superiore, Pisa (Italy); Tamassia, L. [Instituut voor Theoretische Fysica, Katholieke Universiteit Leuven, Celestijnenlaan 200D, 3001 Leuven (Belgium)
2007-05-15
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.)
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.
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)
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
Directory of Open Access Journals (Sweden)
KARL CAEZAR P. CARRERA
2014-08-01
Full Text Available —In this study the researchers developed a human computer interface system where the dynamic gestures on the American Sign Language can be recognized. This is another way of communicating by people who understands and do not understand American Sign Language. They proposed the application of template matching algorithm for the recognition of dynamic gestures where it is based on the number of templates per gesture, which must be taken by the user, to be trained and saved in the system. To be able to recognize the dynamic gestures three things must be considered. These are the number of templates required for the algorithm to be able to recognize the gestures, the factors in handling different hand orientation of other users, and the reliability of the system in terms of communication
New York State Education Dept., Albany. Bureau of Secondary Curriculum Development.
Intended primarily for use by instrumental music teachers who do not have a major concentration in strings, this guide provides pertinent basic resources, materials, teaching--learning expectation, and a general overall guide to achievement levels at various stages of development. Discussions are presented of Choosing the Proper Method Book,…
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.
A Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
Directory of Open Access Journals (Sweden)
Anastasios Hamosfakidis
2002-06-01
Full Text Available Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS, four-step search (4SS, new three-step search (NTSS, and recently proposed diamond search (DS methods. Experimental results show that the proposed technique provides competitive performance with reduced computational complexity.
Readjoiner: a fast and memory efficient string graph-based sequence assembler
Directory of Open Access Journals (Sweden)
Gonnella Giorgio
2012-05-01
Full Text Available Abstract Background Ongoing improvements in throughput of the next-generation sequencing technologies challenge the current generation of de novo sequence assemblers. Most recent sequence assemblers are based on the construction of a de Bruijn graph. An alternative framework of growing interest is the assembly string graph, not necessitating a division of the reads into k-mers, but requiring fast algorithms for the computation of suffix-prefix matches among all pairs of reads. Results Here we present efficient methods for the construction of a string graph from a set of sequencing reads. Our approach employs suffix sorting and scanning methods to compute suffix-prefix matches. Transitive edges are recognized and eliminated early in the process and the graph is efficiently constructed including irreducible edges only. Conclusions Our suffix-prefix match determination and string graph construction algorithms have been implemented in the software package Readjoiner. Comparison with existing string graph-based assemblers shows that Readjoiner is faster and more space efficient. Readjoiner is available at http://www.zbh.uni-hamburg.de/readjoiner.
Semantic Data Matching: Principles and Performance
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.
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.
Directory of Open Access Journals (Sweden)
Jason D Hipp
2011-01-01
Full Text Available Introduction: Historically, effective clinical utilization of image analysis and pattern recognition algorithms in pathology has been hampered by two critical limitations: 1 the availability of digital whole slide imagery data sets and 2 a relative domain knowledge deficit in terms of application of such algorithms, on the part of practicing pathologists. With the advent of the recent and rapid adoption of whole slide imaging solutions, the former limitation has been largely resolved. However, with the expectation that it is unlikely for the general cohort of contemporary pathologists to gain advanced image analysis skills in the short term, the latter problem remains, thus underscoring the need for a class of algorithm that has the concurrent properties of image domain (or organ system independence and extreme ease of use, without the need for specialized training or expertise. Results: In this report, we present a novel, general case pattern recognition algorithm, Spatially Invariant Vector Quantization (SIVQ, that overcomes the aforementioned knowledge deficit. Fundamentally based on conventional Vector Quantization (VQ pattern recognition approaches, SIVQ gains its superior performance and essentially zero-training workflow model from its use of ring vectors, which exhibit continuous symmetry, as opposed to square or rectangular vectors, which do not. By use of the stochastic matching properties inherent in continuous symmetry, a single ring vector can exhibit as much as a millionfold improvement in matching possibilities, as opposed to conventional VQ vectors. SIVQ was utilized to demonstrate rapid and highly precise pattern recognition capability in a broad range of gross and microscopic use-case settings. Conclusion: With the performance of SIVQ observed thus far, we find evidence that indeed there exist classes of image analysis/pattern recognition algorithms suitable for deployment in settings where pathologists alone can effectively
A hybrid metaheuristic for closest string problem.
Mousavi, Sayyed Rasoul
2011-01-01
The Closest String Problem (CSP) is an optimisation problem, which is to obtain a string with the minimum distance from a number of given strings. In this paper, a new metaheuristic algorithm is investigated for the problem, whose main feature is relatively high speed in obtaining good solutions, which is essential when the input size is large. The proposed algorithm is compared with four recent algorithms suggested for the problem, outperforming them in more than 98% of the cases. It is also remarkably faster than all of them, running within 1 s in most of the experimental cases.
Indonesian name matching using machine learning supervised approach
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.
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.
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.
Hoover, Todd F.
2010-01-01
The "Magic" String is a discrepant event that includes a canister with what appears to be the end of two strings protruding from opposite sides of it. Due to the way the strings are attached inside the canister, it appears as if the strings can magically switch the way they are connected. When one string end is pulled, the observer's expectation…
A spectral CT denoising algorithm based on weighted block matching 3D filtering
Salehjahromi, Morteza; Zhang, Yanbo; Yu, Hengyong
2017-09-01
In spectral CT, an energy-resolving detector is capable of counting the number of received photons in different energy channels with appropriate post-processing steps. Because the received photon number in each energy channel is low in practice, the generated projections suffer from low signal-to-noise ratio. This poses a challenge to perform image reconstruction of spectral CT. Because the reconstructed multi-channel images are for the same object but in different energies, there is a high correlation among these images and one can make full use of this redundant information. In this work, we propose a weighted block-matching and three-dimensional (3-D) filtering (BM3D) based method for spectral CT denoising. It is based on denoising of small 3-D data arrays formed by grouping similar 2-D blocks from the whole 3-D data image. This method consists of the following two steps. First, a 2-D image is obtained using the filtered back-projection (FBP) in each energy channel. Second, the proposed weighted BM3D filtering is performed. It not only uses the spatial correlation within each channel image but also exploits the spectral correlation among the channel images. The proposed method is evaluated on both numerical simulation and realistic preclinical datasets, and its merits are demonstrated by the promising results.
The automated reference toolset: A soil-geomorphic ecological potential matching algorithm
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 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.
The automated reference toolset: A soil-geomorphic ecological potential matching algorithm
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.
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....... 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...... 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...
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...
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.
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.
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.)
A String Model Etching Algorithm
1979-10-18
simulator, and especially to T. Van Duzer , who has provided continuous encouragement, suggestions, and computer funds. References [1] A.R...Neureuther, R.E. Jewett, P.I. Hagouel and T. Van Duzer , "Surface Etching Simula- tion and Applications in IC Processing", Kodak Microelectronics Seminar
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.
From cosmic string to superconducting string
Kim, H C; Lee, B K
1999-01-01
We consider the dynamical symmetry breaking of a chirally-invariant Nambu-Jona-Lasinio model in the background gravity of a local cosmic string. By analyzing the one-loop effective action, we show how a cosmic string at a very high energy scale forms a global superconducting string to the spontaneous chiral symmetry breaking at a low energy.
Huger, S; Graff, P; Harter, V; Marchesi, V; Royer, P; Diaz, J C; Aouadi, S; Wolf, D; Peiffert, D; Noel, A
2014-05-01
To compare the accuracy of the Block Matching deformable registration (DIR) against rigid image registration (RIR) for head-and-neck multi-modal images CT to cone-beam CT (CBCT) registration. Planning-CT and weekly CBCT of 10 patients were used for this study. Several volumes, including medullary canal (MC), thyroid cartilage (TC), hyoid bone (HB) and submandibular gland (SMG) were transposed from CT to CBCT images using either DIR or RIR. Transposed volumes were compared with the manual delineation of these volumes on every CBCT. The parameters of similarity used for analysis were: Dice Similarity Index (DSI), 95%-Hausdorff Distance (95%-HD) and difference of volumes (cc). With DIR, the major mean difference of volumes was -1.4 cc for MC, revealing limited under-segmentation. DIR limited variability of DSI and 95%-HD. It significantly improved DSI for TC and HB and 95%-HD for all structures but SMG. With DIR, mean 95%-HD (mm) was 3.01 ± 0.80, 5.33 ± 2.51, 4.99 ± 1.69, 3.07 ± 1.31 for MC, TC, HB and SMG, respectively. With RIR, it was 3.92 ± 1.86, 6.94 ± 3.98, 6.44 ± 3.37 and 3.41 ± 2.25, respectively. Block Matching is a valid algorithm for deformable multi-modal CT to CBCT registration. Values of 95%-HD are useful for ongoing development of its application to the cumulative dose calculation. Copyright © 2013 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.
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
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...... 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......, and by employing this MCA, balanced three-phase grid currents can be realized under 100% unbalanced loads. The steady-state fluctuation and the transient drop of the DC bus voltage can also be restrained. This paper establishes the mathematical model of the UPQC, analyzes the mechanism of the DC bus voltage...... 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...
Algorithmic and user study of an autocompletion algorithm on a large medical vocabulary.
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.
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
Compact q-gram Profiling of Compressed Strings
DEFF Research Database (Denmark)
Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li
2013-01-01
We consider the problem of computing the q-gram profile of a string T of size N compressed by a context-free grammar with n production rules. We present an algorithm that runs in O(N − α) expected time and uses O(n + k T , q ) space, where N − α ≤ qn is the exact number of characters decompressed...... by the algorithm and k T , q ≤ N − α is the number of distinct q-grams in T . This simultaneously matches the current best known time bound and improves the best known space bound. Our space bound is asymptotically optimal in the sense that any algorithm storing the grammar and the q-gram profile must use Ω(n + k...... T , q ) space. To achieve this we introduce the q-gram graph that space-efficiently captures the structure of a string with respect to its q-grams, and show how to construct it from a grammar....
Compact q-gram profiling of compressed strings
DEFF Research Database (Denmark)
Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li
2014-01-01
We consider the problem of computing the q-gram profile of a string T of size N compressed by a context-free grammar with n production rules. We present an algorithm that runs in O(N−α) expected time and uses O(n+q+kT,q) space, where N−α≤qnN−α≤qn is the exact number of characters decompressed...... by the algorithm and kT,q≤N−α is the number of distinct q-grams in T . This simultaneously matches the current best known time bound and improves the best known space bound. Our space bound is asymptotically optimal in the sense that any algorithm storing the grammar and the q-gram profile must use Ω......(n+q+kT,q) space. To achieve this we introduce the q-gram graph that space-efficiently captures the structure of a string with respect to its q-grams, and show how to construct it from a grammar....
Fuzzy automata and pattern matching
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.
Directory of Open Access Journals (Sweden)
Jung Hyunchul
2011-03-01
Full Text Available Abstract Background Cross-platform analysis of gene express data requires multiple, intricate processes at different layers with various platforms. However, existing tools handle only a single platform and are not flexible enough to support custom changes, which arise from the new statistical methods, updated versions of reference data, and better platforms released every month or year. Current tools are so tightly coupled with reference information, such as reference genome, transcriptome database, and SNP, which are often erroneous or outdated, that the output results are incorrect and misleading. Results We developed AnyExpress, a software package that combines cross-platform gene expression data using a fast interval-matching algorithm. Supported platforms include next-generation-sequencing technology, microarray, SAGE, MPSS, and more. Users can define custom target transcriptome database references for probe/read mapping in any species, as well as criteria to remove undesirable probes/reads. AnyExpress offers scalable processing features such as binding, normalization, and summarization that are not present in existing software tools. As a case study, we applied AnyExpress to published Affymetrix microarray and Illumina NGS RNA-Seq data from human kidney and liver. The mean of within-platform correlation coefficient was 0.98 for within-platform samples in kidney and liver, respectively. The mean of cross-platform correlation coefficients was 0.73. These results confirmed those of the original and secondary studies. Applying filtering produced higher agreement between microarray and NGS, according to an agreement index calculated from differentially expressed genes. Conclusion AnyExpress can combine cross-platform gene expression data, process data from both open- and closed-platforms, select a custom target reference, filter out undesirable probes or reads based on custom-defined biological features, and perform quantile-normalization with
Closed String Amplitudes from Gauge Fixed String Field Theory
Drukker, Nadav
2002-01-01
Closed string diagrams are derived from cubic open string field theory using a gauge fixed kinetic operator. The basic idea is to use a string propagator that does not generate a boundary to the world sheet. Using this propagator and the closed string vertex, the moduli space of closed string surfaces is covered, so closed string scattering amplitudes should be reproduced. This kinetic operator could be a gauge fixed form of the string field theory action around the closed string vacuum.
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
FSG: Fast String Graph Construction for De Novo Assembly.
Bonizzoni, Paola; Vedova, Gianluca Della; Pirola, Yuri; Previtali, Marco; Rizzi, Raffaella
2017-10-01
The string graph for a collection of next-generation reads is a lossless data representation that is fundamental for de novo assemblers based on the overlap-layout-consensus paradigm. In this article, we explore a novel approach to compute the string graph, based on the FM-index and Burrows and Wheeler Transform. We describe a simple algorithm that uses only the FM-index representation of the collection of reads to construct the string graph, without accessing the input reads. Our algorithm has been integrated into the string graph assembler (SGA) as a standalone module to construct the string graph. The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.
2015-10-01
UNCLASSIFIED AD-E403 689 Technical Report ARWSE-TR-14026 STD ::STRING APPEND Tom Nealis...DATES COVERED (From – To) 4. TITLE AND SUBTITLE STD ::STRING APPEND 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...two or more strings together while developing a C++ application is a very common task. For std ::strings, there are two primary ways to achieve the
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
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 StringForce ...
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.
Landmine detection using two-tapped joint orthogonal matching pursuits
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.
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
Muckenhuber, Stefan; Sandven, Stein
2017-08-01
An open-source sea ice drift algorithm for Sentinel-1 SAR imagery is introduced based on the combination of feature tracking and pattern matching. Feature tracking produces an initial drift estimate and limits the search area for the consecutive pattern matching, which provides small- to medium-scale drift adjustments and normalised cross-correlation values. The algorithm is designed to combine the two approaches in order to benefit from the respective advantages. The considered feature-tracking method allows for an efficient computation of the drift field and the resulting vectors show a high degree of independence in terms of position, length, direction and rotation. The considered pattern-matching method, on the other hand, allows better control over vector positioning and resolution. The preprocessing of the Sentinel-1 data has been adjusted to retrieve a feature distribution that depends less on SAR backscatter peak values. Applying the algorithm with the recommended parameter setting, sea ice drift retrieval with a vector spacing of 4 km on Sentinel-1 images covering 400 km × 400 km, takes about 4 min on a standard 2.7 GHz processor with 8 GB memory. The corresponding recommended patch size for the pattern-matching step that defines the final resolution of each drift vector is 34 × 34 pixels (2.7 × 2.7 km). To assess the potential performance after finding suitable search restrictions, calculated drift results from 246 Sentinel-1 image pairs have been compared to buoy GPS data, collected in 2015 between 15 January and 22 April and covering an area from 80.5 to 83.5° N and 12 to 27° E. We found a logarithmic normal distribution of the displacement difference with a median at 352.9 m using HV polarisation and 535.7 m using HH polarisation. All software requirements necessary for applying the presented sea ice drift algorithm are open-source to ensure free implementation and easy distribution.
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.
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.)
Al Nasr, Kamal; Ranjan, Desh; Zubair, Mohammad; Chen, Lin; He, Jing
2014-01-01
Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be detected as cylindrical sticks and β-sheets can be detected as plain-like regions. A critical question in de novo modeling from cryo-EM images is to determine the match between the detected secondary structures from the image and those on the protein sequence. We formulate this matching problem into a constrained graph problem and present an O(Δ(2)N(2)2(N)) algorithm to this NP-Hard problem. The algorithm incorporates the dynamic programming approach into a constrained K-shortest path algorithm. Our method, DP-TOSS, has been tested using α-proteins with maximum 33 helices and α-β proteins up to five helices and 12 β-strands. The correct match was ranked within the top 35 for 19 of the 20 α-proteins and all nine α-β proteins tested. The results demonstrate that DP-TOSS improves accuracy, time and memory space in deriving the topologies of the secondary structure elements for proteins with a large number of secondary structures and a complex skeleton.
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
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.
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
Citation Matching in Sanskrit Corpora Using Local Alignment
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.
Indian Academy of Sciences (India)
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 language Is called a program. From activities 1-3, we can observe that: • Each activity is a command.
Electric drill-string telemetry
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.
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.)
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
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.
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.
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
International Nuclear Information System (INIS)
Ooguri, H.
1995-08-01
In physics, solvable models have played very important roles. Understanding a simple model in detail teaches us a lot about more complicated models in generic situations. Five years ago, C. Vafa and I found that the closed N = 2 string theory, that is a string theory with the N = 2 local supersymmetry on the worldsheet, is classically equivalent to the self-dual Einstein gravity in four spacetime dimensions. Thus this string theory is solvable at the classical level. More recently, we have examined the N = 2 string partition function for spacial compactifications, and computed it to all order in the string perturbation expansion. The fact that such computation is possible at all suggests that the N = 2 string theory is solvable even quantum mechanically
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.
Kroupnova, Natalia H.; Korsten, Maarten J.
1997-04-01
The paper describes a framework for fast objects recognition and its application in a system for recognition of certain electronic components on printed circuit boards (PCB) for recycling purposes. Objects in the DB and in the image are represented as attributed graph, where vertices are regions with attributes (color, shape) and edges are spatial relations between the regions (adjacent, surrounds). The task of finding model objects in the input data thus becomes a problem of inexact subgraph isomorphism finding. The suggested algorithm finds all the occurrences of all model graphs in the input graph in the presence of the low-level processing errors and model uncertainty. Using the ideas of inexact network algorithm (INA) we build a network from the model graphs, so that in cases when the models share identical substructures these substructures have to be matched only once. Because different models share the same substructures mostly in case when they belong to the same more general class, we incorporate the possibility of attribute refining in our model network. To further speed up the matching, we introduce the notion of a `key' vertex, so that recognition goes from easily recognizable substructures to more ambiguous ones. The algorithm was applied to real images of PCB's. The results show the effectiveness of INA and suggested modifications in this application.
Indian Academy of Sciences (India)
algorithms such as synthetic (polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language ... ·1 x:=sln(theta) x : = sm(theta) 1. ~. Idl d.t Read A.B,C. ~ lei ~ Print x.y.z. L;;;J. Figure 2 Symbols used In flowchart language to rep- resent Assignment, Read.
Indian Academy of Sciences (India)
In the previous articles, we have discussed various common data-structures such as arrays, lists, queues and trees and illustrated the widely used algorithm design paradigm referred to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted ...
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
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.
Zimmerman Jones, Andrew
2010-01-01
Making Everything Easier!. String Theory for Dummies. Learn:. The basic concepts of this controversial theory;. How string theory builds on physics concepts;. The different viewpoints in the field;. String theory's physical implications. Andrew Zimmerman Jones. Physics Guide, About.com. with Daniel Robbins, PhD in Physics. Your plain-English guide to this complex scientific theory. String theory is one of the most complicated sciences being explored today. Not to worry though! This informative guide clearly explains the basics of this hot topic, discusses the theory's hypotheses and prediction
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)
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
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.)
Directory of Open Access Journals (Sweden)
S. Muckenhuber
2017-08-01
Full Text Available An open-source sea ice drift algorithm for Sentinel-1 SAR imagery is introduced based on the combination of feature tracking and pattern matching. Feature tracking produces an initial drift estimate and limits the search area for the consecutive pattern matching, which provides small- to medium-scale drift adjustments and normalised cross-correlation values. The algorithm is designed to combine the two approaches in order to benefit from the respective advantages. The considered feature-tracking method allows for an efficient computation of the drift field and the resulting vectors show a high degree of independence in terms of position, length, direction and rotation. The considered pattern-matching method, on the other hand, allows better control over vector positioning and resolution. The preprocessing of the Sentinel-1 data has been adjusted to retrieve a feature distribution that depends less on SAR backscatter peak values. Applying the algorithm with the recommended parameter setting, sea ice drift retrieval with a vector spacing of 4 km on Sentinel-1 images covering 400 km × 400 km, takes about 4 min on a standard 2.7 GHz processor with 8 GB memory. The corresponding recommended patch size for the pattern-matching step that defines the final resolution of each drift vector is 34 × 34 pixels (2.7 × 2.7 km. To assess the potential performance after finding suitable search restrictions, calculated drift results from 246 Sentinel-1 image pairs have been compared to buoy GPS data, collected in 2015 between 15 January and 22 April and covering an area from 80.5 to 83.5° N and 12 to 27° E. We found a logarithmic normal distribution of the displacement difference with a median at 352.9 m using HV polarisation and 535.7 m using HH polarisation. All software requirements necessary for applying the presented sea ice drift algorithm are open-source to ensure free implementation and easy
Efficient Disk-Based Techniques for Manipulating Very Large String Databases
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.
Approximating Tree Edit Distance through String Edit Distance
Akutsu, Tatsuya; Fukagawa, Daiji; Takasu, Atsuhiro
2010-01-01
We present an algorithm to approximate edit distance between two ordered and rooted trees of bounded degree. In this algorithm, each input tree is transformed into a string by computing the Euler string, where labels of some edges in the input trees are modified so that structures of small subtrees are reflected to the labels. We show that the edit distance between trees is at least 1/6 and at most O(n 3/4) of the edit distance between the transformed strings, where n is the maximum size of t...
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.
Bator, Marcin; Nieniewski, Mariusz
2011-01-01
Optimization of brightness distribution in the template used for detection of cancerous masses in mammograms by means of correlation coefficient is presented. This optimization is performed by the evolutionary algorithm using an auxiliary mass classifier. Brightness along the radius of the circularly symmetric template is coded indirectly by its second derivative. The fitness function is defined as the area under curve (AUC) of the receiver operating characteristic (ROC) for the mass classifi...
Superfermionic superconformal string model
International Nuclear Information System (INIS)
Kudryavtsev, V.A.
1994-01-01
A new approach to superconformal dynamics of string interactions is formulated in terms of two-dimensional fermion fields and without boson fields commonly used in string theories. The vertex operators for emission of π-mesons are constructed within the framework of this approach. 5 refs
Semilocal and electroweak strings
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
Indian Academy of Sciences (India)
Furthermore, the success of this description indicates that inflation is likely to be associated with physics at energies considerably higher than the weak scale, for which string theory is arguably our most promising candidate. These observations strongly motivate a detailed search for inflation within string theory, although it ...
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.)
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...
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.
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.
2016-08-15
deliber- ately deviate from each other. In those cases, the exercise served as a cross-validation to ensure that the discrepancies between the HMAs...requirements R1–R11. As a consequence, this exercise does not necessarily reflect their behavior in daily rou- tine where for certain reasons other...al. Genotype List String: a grammar for describing HLA and KIR genotyping results in a text string. Tissue Antigens 2013: 82: 106–12. 22. Allele code
String graph construction using incremental hashing.
Ben-Bassat, Ilan; Chor, Benny
2014-12-15
New sequencing technologies generate larger amount of short reads data at decreasing cost. De novo sequence assembly is the problem of combining these reads back to the original genome sequence, without relying on a reference genome. This presents algorithmic and computational challenges, especially for long and repetitive genome sequences. Most existing approaches to the assembly problem operate in the framework of de Bruijn graphs. Yet, a number of recent works use the paradigm of string graph, using a variety of methods for storing and processing suffixes and prefixes, like suffix arrays, the Burrows-Wheeler transform or the FM index. Our work is motivated by a search for new approaches to constructing the string graph, using alternative yet simple data structures and algorithmic concepts. We introduce a novel hash-based method for constructing the string graph. We use incremental hashing, and specifically a modification of the Karp-Rabin fingerprint, and Bloom filters. Using these probabilistic methods might create false-positive and false-negative edges during the algorithm's execution, but these are all detected and corrected. The advantages of the proposed approach over existing methods are its simplicity and the incorporation of established probabilistic techniques in the context of de novo genome sequencing. Our preliminary implementation is favorably comparable with the first string graph construction of Simpson and Durbin (2010) (but not with subsequent improvements). Further research and optimizations will hopefully enable the algorithm to be incorporated, with noticeable performance improvement, in state-of-the-art string graph-based assemblers. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Bator, Marcin; Nieniewski, Mariusz
2012-02-01
Optimization of brightness distribution in the template used for detection of cancerous masses in mammograms by means of correlation coefficient is presented. This optimization is performed by the evolutionary algorithm using an auxiliary mass classifier. Brightness along the radius of the circularly symmetric template is coded indirectly by its second derivative. The fitness function is defined as the area under curve (AUC) of the receiver operating characteristic (ROC) for the mass classifier. The ROC and AUC are obtained for a teaching set of regions of interest (ROIs), for which it is known whether a ROI is true-positive (TP) or false-positive (F). The teaching set is obtained by running the mass detector using a template with a predetermined brightness. Subsequently, the evolutionary algorithm optimizes the template by classifying masses in the teaching set. The optimal template (OT) can be used for detection of masses in mammograms with unknown ROIs. The approach was tested on the training and testing sets of the Digital Database for Screening Mammography (DDSM). The free-response receiver operating characteristic (FROC) obtained with the new mass detector seems superior to the FROC for the hemispherical template (HT). Exemplary results are the following: in the case of the training set in the DDSM, the true-positive fraction (TPF) = 0.82 for the OT and 0.79 for the HT; in the case of the testing set, TPF = 0.79 for the OT and 0.72 for the HT. These values were obtained for disease cases, and the false-positive per image (FPI) = 2.
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
Indian Academy of Sciences (India)
In the program shown in Figure 1, we have repeated the algorithm. M times and we can make the following observations. Each block is essentially a different instance of "code"; that is, the objects differ by the value to which N is initialized before the execution of the. "code" block. Thus, we can now avoid the repetition of the ...
Indian Academy of Sciences (India)
algorithms built into the computer corresponding to the logic- circuit rules that are used to .... For the purpose of carrying ou t ari thmetic or logical operations the memory is organized in terms .... In fixed point representation, one essentially uses integer arithmetic operators assuming the binary point to be at some point other ...
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.)
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.
CERN. Geneva
2007-01-01
In this 3-lecture series I will discuss the basics of string theory, some physical applications, and the outlook for the future. I will begin with the main concepts of the classical theory and the application to the study of cosmic superstrings. Then I will turn to the quantum theory and discuss applications to the investigation of hadronic spectra and the recently discovered quark-gluon plasma. I will conclude with a sketch of string models of particle physics and showing some avenues that may lead to a complete formulation of string theory.
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
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.)
International conference on string theory
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.
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.
Casper, William L [Rigby, ID; Clark, Don T [Idaho Falls, ID; Grover, Blair K [Idaho Falls, ID; Mathewson, Rodney O [Idaho Falls, ID; Seymour, Craig A [Idaho Falls, ID
2008-10-07
A drill string comprises a first drill string member having a male end; and a second drill string member having a female end configured to be joined to the male end of the first drill string member, the male end having a threaded portion including generally square threads, the male end having a non-threaded extension portion coaxial with the threaded portion, and the male end further having a bearing surface, the female end having a female threaded portion having corresponding female threads, the female end having a non-threaded extension portion coaxial with the female threaded portion, and the female end having a bearing surface. Installation methods, including methods of installing instrumented probes are also provided.
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.)
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)
Energy Technology Data Exchange (ETDEWEB)
Amorim, R.; Barcelos-Neto, J.
1988-05-01
We describe bosonic strings by using a kind of Lagrangian compatible with the zero tension limit. The work is developed on an extended configuration space and the quantization is carried out with details.
International Nuclear Information System (INIS)
Ramond, P.
1986-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 - L 0 -bar = 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 invariant formalism at the price of being unable to extract the equations of motion from a Lagrangian. 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. 20 refs
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.
String theory compactifications
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.
Directory of Open Access Journals (Sweden)
Vinga Susana
2012-05-01
Full Text Available Abstract Background Chaos Game Representation (CGR is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2-L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations. Results The exploratory analysis described here consisted of selecting foundational string problems and refactoring them using CGR-based algorithms. We found that CGR can take the role of suffix trees and emulate sophisticated string algorithms, efficiently solving exact and approximate string matching problems such as finding all palindromes and tandem repeats, and matching with mismatches. The common feature of these problems is that they use longest common extension (LCE queries as subtasks of their procedures, which we show to have a constant time solution with CGR. Additionally, we show that CGR can be used as a rolling hash function within the Rabin-Karp algorithm. Conclusions The analysis of biological sequences relies on algorithmic foundations facing mounting challenges, both logistic (performance and analytical (lack of unifying mathematical framework. CGR is found to provide the latter and to promise the former: graph-based data structures for sequence analysis operations are entailed by numerical-based data structures produced by CGR maps, providing a unifying analytical framework for a diversity of pattern matching problems.
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.
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.)
Wang, Jinhu; Lindenbergh, Roderik; Menenti, Massimo
2017-06-01
Urban road environments contain a variety of objects including different types of lamp poles and traffic signs. Its monitoring is traditionally conducted by visual inspection, which is time consuming and expensive. Mobile laser scanning (MLS) systems sample the road environment efficiently by acquiring large and accurate point clouds. This work proposes a methodology for urban road object recognition from MLS point clouds. The proposed method uses, for the first time, shape descriptors of complete objects to match repetitive objects in large point clouds. To do so, a novel 3D multi-scale shape descriptor is introduced, that is embedded in a workflow that efficiently and automatically identifies different types of lamp poles and traffic signs. The workflow starts by tiling the raw point clouds along the scanning trajectory and by identifying non-ground points. After voxelization of the non-ground points, connected voxels are clustered to form candidate objects. For automatic recognition of lamp poles and street signs, a 3D significant eigenvector based shape descriptor using voxels (SigVox) is introduced. The 3D SigVox descriptor is constructed by first subdividing the points with an octree into several levels. Next, significant eigenvectors of the points in each voxel are determined by principal component analysis (PCA) and mapped onto the appropriate triangle of a sphere approximating icosahedron. This step is repeated for different scales. By determining the similarity of 3D SigVox descriptors between candidate point clusters and training objects, street furniture is automatically identified. The feasibility and quality of the proposed method is verified on two point clouds obtained in opposite direction of a stretch of road of 4 km. 6 types of lamp pole and 4 types of road sign were selected as objects of interest. Ground truth validation showed that the overall accuracy of the ∼170 automatically recognized objects is approximately 95%. The results demonstrate
String scattering amplitudes and deformed cubic string field theory
Directory of Open Access Journals (Sweden)
Sheng-Hong Lai
2018-01-01
Full Text Available We study string scattering amplitudes by using the deformed cubic string field theory which is equivalent to the string field theory in the proper-time gauge. The four-string scattering amplitudes with three tachyons and an arbitrary string state are calculated. The string field theory yields the string scattering amplitudes evaluated on the world sheet of string scattering whereas the conventional method, based on the first quantized theory brings us the string scattering amplitudes defined on the upper half plane. For the highest spin states, generated by the primary operators, both calculations are in perfect agreement. In this case, the string scattering amplitudes are invariant under the conformal transformation, which maps the string world sheet onto the upper half plane. If the external string states are general massive states, generated by non-primary field operators, we need to take into account carefully the conformal transformation between the world sheet and the upper half plane. We show by an explicit calculation that the string scattering amplitudes calculated by using the deformed cubic string field theory transform into those of the first quantized theory on the upper half plane by the conformal transformation, generated by the Schwarz–Christoffel mapping.
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.
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.
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
Dabholkar, Atish
This thesis is divided into two chapters. Chapter I is about the dynamics of radiating axionic strings and the lower bound on the mass of the invisible axion. It has been suggested that, without inflation, the decay of axionic strings produced after the Peccei -Quinn phase transition is the primary source of cosmic relic axions. Knowing the density of these axions would then allow the derivation of a cosmological bound on the mass of the axion. In order to obtain a sharp bound it is essential to know the spectrum of the emitted axions and the detailed motion of a global string strongly coupled to the axionic field. To this end, following the analogy with Dirac's treatment of classical radiating electrons, self-consistent renormalized equations are obtained that describe the dynamics of a radiating global string interacting with its surrounding axionic field. The numerical formalism for evolving string trajectories using these equations is described, and is applied to the case of a circular loop. It is argued that for large wavelength oscillations of cosmic string loops, the motion is well approximated by the motion of a free Nambu-Goto string with appropriate renormalization. Consequently, a lower bound of 10 ^{-3} eV on the mass of the axion is obtained. Together with the recent upperbound of 4 times 10^{-4 } eV from the supernova SN1987a, it marginally rules out the invisible axion. Chapter II is about superstrings and solitons. It is shown that the quantum renormalization of the superstring tension vanishes to all orders in string perturbation theory. A low-energy analysis of macroscopic superstrings is presented and various analogies between these superstrings and solitons in supersymmetric theories are discussed. These include the existence of exact multi-string solutions of the low -energy supergravity super-Yang-Mills equations of motion and a Bogomol'nyi bound for the energy per unit length which is saturated by these solutions. Arguments are presented that
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.
Width of the confining string in Yang-Mills theory.
Gliozzi, F; Pepe, M; Wiese, U-J
2010-06-11
We investigate the transverse fluctuations of the confining string connecting two static quarks in (2+1)D SU(2) Yang-Mills theory using Monte Carlo calculations. The exponentially suppressed signal is extracted from the large noise by a very efficient multilevel algorithm. The resulting width of the string increases logarithmically with the distance between the static quark charges. Corrections at intermediate distances due to universal higher-order terms in the effective string action are calculated analytically. They accurately fit the numerical data.
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
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)
New Developments in String Gravity and String Cosmology.A Summary Report
Sanchez, Norma G.
2002-01-01
New Developments in String Gravity and String Cosmology are reported: 1-String driven cosmology and its Predictions. 2-The primordial gravitational wave background in string cosmology. 3-Non-singular string cosmologies from Exact Conformal Field Theories. 4-Quantum Field Theory, String Temperature and the String Phase of de Sitter space-time, 5-Hawking Radiation in String Theory and the String Phase of Black Holes. 6-New Dual Relation between Quantum Field Theory regimes and String regimes in...
International Nuclear Information System (INIS)
Amore, Paolo; Fernández, Francisco M.; Garcia, Javier; Gutierrez, German
2014-01-01
We study both analytically and numerically the spectrum of inhomogeneous strings with PT-symmetric density. We discuss an exactly solvable model of PT-symmetric string which is isospectral to the uniform string; for more general strings, we calculate exactly the sum rules Z(p)≡∑ n=1 ∞ 1/E n p , with p=1,2,… and find explicit expressions which can be used to obtain bounds on the lowest eigenvalue. A detailed numerical calculation is carried out for two non-solvable models depending on a parameter, obtaining precise estimates of the critical values where pair of real eigenvalues become complex. -- Highlights: •PT-symmetric Hamiltonians exhibit real eigenvalues when PT symmetry is unbroken. •We study PT-symmetric strings with complex density. •They exhibit regions of unbroken PT symmetry. •We calculate the critical parameters at the boundaries of those regions. •There are exact real sum rules for some particular complex densities
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.
Perspectives on string phenomenology
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...
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.
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
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
Controlled synthesis of target strings in a class of splicing systems.
Chen, Peter C Y
2005-08-01
This article presents an approach for synthesizing target strings in a class of computational models of DNA recombination. The computational models are formalized as splicing systems in the context of formal languages. Given a splicing system (of a restricted type) and a target string to be synthesized, we construct (i) a rule-embedded splicing automaton that recognizes languages containing strings embedded with symbols representing splicing rules, and (ii) an automaton that implicitly recognizes the target string. By manipulating these two automata, we extract all rule sequences that lead to the production of the target string (if that string belongs to the splicing language). An algorithm for synthesizing a certain type of target strings based on such rule sequences is presented.
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.
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.)
Energy Technology Data Exchange (ETDEWEB)
Kiritsis, Elias [APC, Université Paris 7, CNRS/IN2P3, CEA/IRFU, Obs. de Paris, Sorbonne Paris Cité,Bâtiment Condorcet, F-75205, Paris Cedex 13 (UMR du CNRS 7164) (France); Theory Group, Physics Department, CERN,CH-1211, Geneva 23 (Switzerland); Crete Center for Theoretical Physics, Department of Physics, University of Crete,71003 Heraklion (Greece); Mazzanti, Liuba [Institute for Theoretical Physics and Spinoza Institute, Utrecht University,3508 TD Utrecht (Netherlands); Nitti, Francesco [APC, Université Paris 7, CNRS/IN2P3, CEA/IRFU, Obs. de Paris, Sorbonne Paris Cité,Bâtiment Condorcet, F-75205, Paris Cedex 13 (UMR du CNRS 7164) (France)
2014-02-19
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.
Evans, N
2003-01-01
String theory began life in the late 1960s as an attempt to understand the properties of nuclear matter such as protons and neutrons. Although it was not successful it has since developed a life of its own as a possible theory of everything - with the potential to incorporate quantum gravity as well as the other forces of nature. However, in a remarkable about face in the last five years, it has now been discovered that string theory and the standard theory of nuclear matter - QCD - might in fact describe the same physics. This is an exciting development that was the centre of discussion at a major workshop in Seattle in February. After spending 30 years as a possible theory of everything, string theory is returning to its roots to describe the interactions of quarks and gluons. (U.K.)
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
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.
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
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
Matrix string partition function
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.
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.
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
String theory in four dimensions
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.
Why Strings? Grand Masters Series.
Klotman, Robert H.
2000-01-01
Discusses the reasons to teach stringed instruments: (1) strings can be adapted to the size of the child; (2) home performance material resource availability; (3) stringed music skills contribute to developing basic skills; and (4) the importance of interaction in music. (CMK)
New String Reconfiguration Technique for Residential Photovoltaic System Generation Enhancement
Directory of Open Access Journals (Sweden)
CORBA, Z.
2016-02-01
Full Text Available Improvement of photovoltaic (PV power plant performance under partial shading conditions aiming to increase electrical energy generation is in the focus of this research. This paper proposes the performance optimization of PV power plant under partial shading conditions by new PV string reconfiguration technique. The Matlab/Simulink model is used to simulate the operation of the PV string under partial shading conditions and with the proposed recombination technique. Simulated operational conditions have experimentally been verified by string characteristics measurement on the existing roof-top PV system at the Faculty of Technical Sciences in Novi Sad. Simulation and experimental results showed a high degree of matching, while the obtained values proved that proposed method leads to output power increase and higher PV system generation in PV string operation under partial shading.
Person, Christophe; Louis-Dorr, Valérie; Poussier, Sylvain; Commowick, Olivier; Malandain, Grégoire; Maillard, Louis; Wolf, Didier; Gillet, Nicolas; Roch, Véronique; Karcher, Gilles; Marie, Pierre-Yves
2012-03-01
Statistical Parametric Mapping (SPM) is widely used for the quantitative analysis of brain images from ¹⁸F fluorodeoxyglucose positron emission tomography (FDG PET). SPM requires an initial step of spatial normalization to align all images to a standard anatomic model (the template), but this may lead to image distortion and artifacts, especially in cases of marked brain abnormalities. This study aimed at assessing a block-matching (BM) normalization algorithm, where most transformations are not directly computed on the overall brain volume but through small blocks, a principle that is likely to minimize artifacts. Large and/or small hypometabolic areas were artificially simulated in initially normal FDG PET images to compare the results provided by statistical tests computed after either SPM or BM normalization. Results were enhanced by BM, compared with SPM, with regard to (i) errors in the estimation of large defects volumes (about 2-fold lower) because of a lower image distortion, and (ii) rates of false-positive foci when numerous or extended abnormalities were simulated. These observations were strengthened by analyses of FDG PET examinations from epileptic patients. Results obtained with the BM normalization of brain FDG PET appear more precise and robust than with SPM normalization, especially in cases of numerous or extended abnormalities.
Su, Tung-Ching
2017-06-01
Linear regression models are a popular choice for the relationships between water quality parameters and bands (or band ratios) of remote sensing data. However, this research regards the phenomena of mixed pixels, specular reflection, and water fluidity as the challenges to establish a robust regression model. Based on the data of measurements in situ and remote sensing data, this study presents an enumeration-based algorithm, called matching pixel by pixel (MPP), and tests its performance in an empirical model of water quality mapping. Four small reservoirs, which cover a mere several hundred-thousand m2, in Kinmen, Taiwan, are selected as the study sites. The multispectral sensors, carried on an unmanned aerial vehicle (UAV), are adopted to acquire remote sensing data regarding water quality parameters, including chlorophyll-a (Chl-a), Secchi disk depth (SDD), and turbidity in the reservoirs. The experimental results indicate that, while MPP can reduce the influence of specular reflection on regression model establishment, specular reflection does hamper the correction of thematic map production. Due to water fluidity, sampling in situ should be followed by UAV imaging as soon as possible. Excluding turbidity, the obtained estimation accuracy can satisfy the national standard.
Bridging Database Applications and Declarative Similarity Matching
Andrade Ribeiro, Leonardo; Schneider, Natália Cristina; de Souza Inácio, Andrei; Wagner, Harley Michel; von Wangenheim, Aldo
2017-01-01
Effective manipulation of string data is of fundamental importance to modern database applications. Very often, textual inconsistencies render equality comparisons meaningless and strings have to be matched in terms of their similarity. Previous work has proposed techniques to express similarity operations using declarative SQL statements. However, the non-trivial issue of embedding similarity support into object-oriented applications has received little attention. Particularly, declarative s...
Tsutsumanova, Gichka; Russev, Stoyan
2013-01-01
A simple experiment demonstrating the excitation of a standing wave in a metal string is presented here. Several tasks using the set-up are considered, which help the students to better understand the standing waves, the interaction between electric current and magnetic field and the resonance phenomena. This can serve also as a good lecture…
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.
On exceptional instanton strings
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
Hypermultiplets and topological strings
Rocek, M.; Vafa, C.; Vandoren, S.
2005-01-01
The c-map relates classical hypermultiplet moduli spaces in compactifications of type II strings on a Calabi-Yau threefold to vector multiplet moduli spaces via a further compactification on a circle. We give an off-shell description of the c-map in N = 2 superspace. The superspace Lagrangian for
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
DEFF Research Database (Denmark)
Schäfer, Mirko; Greiner, Martin
Chaotic strings are coupled Tchebyscheff maps on a ring-network. With a well-specified empirical prescription they are able to explain the coupling constants of the standard model of elementary particle physics. This empirical relationship is tested further by introducing a tunable disorder to ch...
DEFF Research Database (Denmark)
Schäfer, Mirko; Greiner, Martin
2011-01-01
Chaotic strings are coupled Tchebyscheff maps on a ring-network. With a well-specified empirical prescription they are able to explain the coupling constants of the standard model of elementary particle physics. This empirical relationship is tested further by introducing a tunable disorder to ch...
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)
On exceptional instanton strings
Del Zotto, Michele; Lockhart, Guglielmo
2017-09-01
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) , F 4 , E 6 , E 7, and E 8. These exceptional models have BPS strings which are also instantons for the corresponding gauge groups. For G simply-laced, we determine the 2d N=(0,4) worldsheet theories of such BPS instanton strings by a simple geometric engineering argument. These are given by a twisted S 2 compactification of the 4d N=2 theories of type H 2 , D 4 , E 6 , E 7 and E 8 (and their higher rank generalizations), where the 6d instanton number is mapped to the rank of the corresponding 4d SCFT. This determines their anomaly polynomials and, via topological strings, establishes an interesting relation among the corresponding T 2 × S 2 partition functions and the Hilbert series for moduli spaces of G instantons. Such relations allow to bootstrap the corresponding elliptic genera by modularity. As an example of such procedure, the elliptic genera for a single instanton string are determined. The same method also fixes the elliptic genus for case of one F 4 instanton. These results unveil a rather surprising relation with the Schur index of the corresponding 4d N=2 models.
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)
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
Device for balancing parallel strings
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.
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
Arab-Baferani, Zahra; Mokhtari-Dizaji, Manijhe; Roshanali, Farideh
2013-02-01
Due to limitations in measuring the torsion angle in the short-axis view when studying through-plane motion and so it is dependent on reference levels, in this study, we follow myocardial movement along the long-axis of the left ventricle (LV). Then, LV torsion is estimated in the long-axis view and compared with LV torsion in the short-axis view. Two dimensional echocardiographic images of healthy persons were recorded in cine loop format position throughout four cardiac cycles at basal and apical levels in the long- and short-axis views. The motion vectors for reign of interest in the horizontal and vertical directions were obtained by block matching algorithm. Correlation between the values of automated analysis and manual tracing was performed by Pearson correlation analysis. Then, the maximum rotation angles of the short- and long-axis views at basal and apical levels were assessed. Left-ventricular torsion angles in short-axis and long-axis views were calculated and compared based on rotation angles. There was a high correlation between the measured myocardial wall displacement of automated analysis (BM algorithm) and manual tracing (R=0.96, p<0.05). The maximum rotation angles of basal and apical levels in the short-axis view are 7.96±1.57° and 9.49±1.72° and so in the long-axis view are 18.51±3.41° and 14.74±2.91°, respectively. The LV torsion angles and the time to reach peak LV torsion angles in the short-axis views are 17.26±2.53°, 293±26ms and in the long-axis view are 32.26±5.60° and 290±22ms respectively. There was a high correlation between the left-ventricular torsion angle in the short-axis view and the long-axis view (R=0.92, p<0.05). There was also a high correlation between the time to reach peak left-ventricular torsion angle in the short-axis view as compared to the long-axis view (R=0.97, p<0.05). This study suggested that the LVtorsion angles in the short- and long-axis views were significantly correlated. It is concluded that
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
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.
Energy Technology Data Exchange (ETDEWEB)
Svrcek, Peter; /Stanford U., Phys. Dept. /SLAC; Witten, Edward; /Princeton, Inst. Advanced Study
2006-06-09
In the context of string theory, axions appear to provide the most plausible solution of the strong CP problem. However, as has been known for a long time, in many string-based models, the axion coupling parameter Fa is several orders of magnitude higher than the standard cosmological bounds. We re-examine this problem in a variety of models, showing that Fa is close to the GUT scale or above in many models that have GUT-like phenomenology, as well as some that do not. On the other hand, in some models with Standard Model gauge fields supported on vanishing cycles, it is possible for Fa to be well below the GUT scale.
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.
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)
Half-string oscillator approach to string field theory
International Nuclear Information System (INIS)
Bordes, J.; Chan Hongmo; Nellen, L.; Tsou Sheungtsun
1989-05-01
We give an operator formulation of the string field theory proposed by E. Witten using half-string oscillator modes. This formalism, identifying the physical string states as infinite matrices, is developed in such a way that interactions at the level of vertices can be calculated in terms of products and traces of these matrices without relying on ill-defined manipulations of functional integrals. (author)
Best matching theory & applications
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...
Energy Technology Data Exchange (ETDEWEB)
Fradkin, E.S.; Tseytlin, A.A.
1982-10-15
We discuss and compare the Lorentz covariant path integral quantization of the three bose string models, namely, the Nambu, Eguchi and Brink-Di Vecchai-Howe-Polyakov (BDHP) ones. Along with a critical review of the subject with some uncertainties and ambiguities clearly stated, various new results are presented. We work out the form of the BDHP string ansatz for the Wilson average and prove a formal inequivalence of the exact Nambu and BDHP models for any space-time dimension d. The above three models known to be equivalent on the classical level, are shown to be equivalent in a semiclassical approximation near a minimal surface and also in the leading 1/d-approximation for the static q-barq-potential. We analyze scattering amplitudes predicted by the BDHP string and find that when exactly calculated for d<26 they are different from the old dual ones, and possess a non-linear spectrum which may be considered as free from tachyons in the ground state.
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
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.
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...
Energy Technology Data Exchange (ETDEWEB)
Theiler, James P [Los Alamos National Laboratory
2009-01-01
Following an analogous distinction in statistical hypothesis testing, we investigate variants of machine learning where the training set comes in matched pairs. We demonstrate that even conventional classifiers can exhibit improved performance when the input data has a matched-pair structure. Online algorithms, in particular, converge quicker when the data is presented in pairs. In some scenarios (such as the weak signal detection problem), matched pairs can be generated from independent samples, with the effect not only doubling the nominal size of the training set, but of providing the structure that leads to better learning. A family of 'dipole' algorithms is introduced that explicitly takes advantage of matched-pair structure in the input data and leads to further performance gains. Finally, we illustrate the application of matched-pair learning to chemical plume detection in hyperspectral imagery.
Counting Dependent and Independent Strings
Zimand, Marius
We derive quantitative results regarding sets of n-bit strings that have different dependency or independency properties. Let C(x) be the Kolmogorov complexity of the string x. A string y has α dependency with a string x if C(y) - C(y |x) ≥ α. A set of strings {x 1, ..., x t } is pairwise α-independent if for all inot=j, C(x i ) - C(x i |x j ) ≤ α. A tuple of strings (x 1, ..., x t ) is mutually α-independent if C(x π(1) ... x π(t)) ≥ C(x 1) + ... + C(x t ) - α, for every permutation π of [t]. We show that:
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)
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.
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
Classical theory of radiating strings
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.
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
Cosmic strings and galaxy formation
International Nuclear Information System (INIS)
Kibble, T.W.B.
1986-01-01
The evolution of a system of strings created at a phase transition early in the history of the universe is reviewed. The two possible end points are a string-dominated universe, which behaves much like a matter-dominated one, and a scaling solution, in which the persistence length of the system of strings scales with the horizon distance. The latter is the basis for a very attractive theory of galaxy formation. (Auth.)
Merging of multi-string BWTs with applications.
Holt, James; McMillan, Leonard
2014-12-15
The throughput of genomic sequencing has increased to the point that is overrunning the rate of downstream analysis. This, along with the desire to revisit old data, has led to a situation where large quantities of raw, and nearly impenetrable, sequence data are rapidly filling the hard drives of modern biology labs. These datasets can be compressed via a multi-string variant of the Burrows-Wheeler Transform (BWT), which provides the side benefit of searches for arbitrary k-mers within the raw data as well as the ability to reconstitute arbitrary reads as needed. We propose a method for merging such datasets for both increased compression and downstream analysis. We present a novel algorithm that merges multi-string BWTs in [Formula: see text] time where LCS is the length of their longest common substring between any of the inputs, and N is the total length of all inputs combined (number of symbols) using [Formula: see text] bits where F is the number of multi-string BWTs merged. This merged multi-string BWT is also shown to have a higher compressibility compared with the input multi-string BWTs separately. Additionally, we explore some uses of a merged multi-string BWT for bioinformatics applications. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
String tightening as a self-organizing phenomenon.
Banerjee, Bonny
2007-09-01
The phenomenon of self-organization has been of special interest to the neural network community throughout the last couple of decades. In this paper, we study a variant of the self-organizing map (SOM) that models the phenomenon of self-organization of the particles forming a string when the string is tightened from one or both of its ends. The proposed variant, called the string tightening self-organizing neural network (STON), can be used to solve certain practical problems, such as computation of shortest homotopic paths, smoothing paths to avoid sharp turns, computation of convex hull, etc. These problems are of considerable interest in computational geometry, robotics path-planning, artificial intelligence (AI) (diagrammatic reasoning), very large scale integration (VLSI) routing, and geographical information systems. Given a set of obstacles and a string with two fixed terminal points in a 2-D space, the STON model continuously tightens the given string until the unique shortest configuration in terms of the Euclidean metric is reached. The STON minimizes the total length of a string on convergence by dynamically creating and selecting feature vectors in a competitive manner. Proof of correctness of this anytime algorithm and experimental results obtained by its deployment have been presented in the paper.
Splitting strings on integrable backgrounds
International Nuclear Information System (INIS)
Vicedo, Benoit
2011-05-01
We use integrability to construct the general classical splitting string solution on R x S 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 σ-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 2 (C). (orig.)
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
Evolution of cosmic string networks
International Nuclear Information System (INIS)
Albrecht, A.; Turok, N.; Princeton Univ., NJ
1989-06-01
We summarize our new results on cosmic strings. These results include: the application of non-equilibrium statistical mechanics to cosmic string evolution, a simple ''one scale'' model for the long strings which has a great deal of predictive power, results from large scale numerical simulations, and a discussion of the observational consequences of our results. An upper bond on Gμ of approximately 10 -7 emerges from the millisecond pulsar gravity wave bound. We discuss how numerical uncertainties affect this. Any changes which weaken the bound would probably also give the long strings the dominant role in producing observational consequences. 22 refs
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...
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.
Text string detection from natural scenes by structure-based partition and grouping.
Yi, Chucai; Tian, YingLi
2011-09-01
Text information in natural scene images serves as important clues for many image-based applications such as scene understanding, content-based image retrieval, assistive navigation, and automatic geocoding. However, locating text from a complex background with multiple colors is a challenging task. In this paper, we explore a new framework to detect text strings with arbitrary orientations in complex natural scene images. Our proposed framework of text string detection consists of two steps: 1) image partition to find text character candidates based on local gradient features and color uniformity of character components and 2) character candidate grouping to detect text strings based on joint structural features of text characters in each text string such as character size differences, distances between neighboring characters, and character alignment. By assuming that a text string has at least three characters, we propose two algorithms of text string detection: 1) adjacent character grouping method and 2) text line grouping method. The adjacent character grouping method calculates the sibling groups of each character candidate as string segments and then merges the intersecting sibling groups into text string. The text line grouping method performs Hough transform to fit text line among the centroids of text candidates. Each fitted text line describes the orientation of a potential text string. The detected text string is presented by a rectangle region covering all characters whose centroids are cascaded in its text line. To improve efficiency and accuracy, our algorithms are carried out in multi-scales. The proposed methods outperform the state-of-the-art results on the public Robust Reading Dataset, which contains text only in horizontal orientation. Furthermore, the effectiveness of our methods to detect text strings with arbitrary orientations is evaluated on the Oriented Scene Text Dataset collected by ourselves containing text strings in nonhorizontal
Instruction sequence expressions for the Karatsuba multiplication algorithm
Bergstra, J.A.; Middelburg, C.A.
2013-01-01
The Karatsuba multiplication algorithm is an algorithm for computing the product of two natural numbers represented in the binary number system. This means that the algorithm actually computes a function on bit strings. The restriction of this function to bit strings of any given length can be
Vibration of a string against multiple spring-mass-damper stoppers
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.
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
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.
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
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%.
International Nuclear Information System (INIS)
Wands, David
2002-01-01
I discuss cosmological models either derived from, or inspired by, string theory or M-theory. In particular, I discuss solutions in the low-energy effective theory and the role of the dilaton, moduli and antisymmetric form fields in the dimensionally reduced effective action. The pre-big-bang model is an attempt to use cosmological solutions to make observational predictions. I then discuss the effective theory of gravity found in recent braneworld models where we live on a 3-brane embedded in a five-dimensional spacetime and how the study of cosmological perturbations may enable us to test these ideas
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)
Energy Technology Data Exchange (ETDEWEB)
Kachru, Shamit; McAllister, Liam; Sundrum, Raman
2007-04-04
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.
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
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.
New ambitwistor string theories
Energy Technology Data Exchange (ETDEWEB)
Casali, Eduardo [DAMTP, University of Cambridge,Wilberforce Road, Cambridge CB3 0WA (United Kingdom); Geyer, Yvonne; Mason, Lionel; Monteiro, Ricardo [Mathematical Institute, University of Oxford,Woodstock Road, Oxford OX2 6GG (United Kingdom); Roehrig, Kai A. [DAMTP, University of Cambridge,Wilberforce Road, Cambridge CB3 0WA (United Kingdom)
2015-11-05
We describe new ambitwistor string theories that give rise to the recent amplitude formulae for Einstein-Yang-Mills, (Dirac)-Born-Infeld, Galileons and others introduced by Cachazo, He and Yuan. In the case of the Einstein-Yang-Mills amplitudes, an important role is played by a novel worldsheet conformal field theory that provides the appropriate colour factors precisely without the spurious multitrace terms of earlier models that had to be ignored by hand. This is needed to obtain the correct multitrace terms that arise when Yang-Mills is coupled to gravity.
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…
Experimenting with String Musical Instruments
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…
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.
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
Progress in string theory research
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...
Deformations of topological open strings
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.
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
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.
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)
String theory and cosmological singularities
Indian Academy of Sciences (India)
recent times, string theory is providing new perspectives of such singularities which may lead to an understanding of these in the standard framework of time evolution in quantum mechanics. In this article, we describe some of these approaches. Keywords. String theory; cosmological singularities. PACS Nos 11.25.
String theory and particle physics
International Nuclear Information System (INIS)
Uranga, Angel
2006-01-01
I will provide a basic introduction to string theory as a unified theory of gravitational and gauge interactions. I will review recent constructions of string theory models leading at low energies to the Standard Model of particle interactions, and which include interesting new phenomenology beyond the standard model, like supersymmetry, boranes, and (possible large) extra dimensions
Bianchi type I string cosmologies
Indian Academy of Sciences (India)
sidered to portray early universe reasonably well. Letelier [2] obtained some particular. Bianchi type I string-dust models in which at a certain epoch, strings disappear with a phase transition to an anisotropic fluid. Another Bianchi type I model has been presented by Banerjee et al [3] which obeys Takabayashi's equation of ...
String theory : physics or metaphysics?
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.
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.
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.
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.
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.
Antusch, Stefan; Cefalà, Francesco; Krippendorf, Sven; Muia, Francesco; Orani, Stefano; Quevedo, Fernando
2018-01-01
A generic feature of string compactifications is the presence of many scalar fields, called moduli. Moduli are usually displaced from their post-inflationary minimum during inflation. Their relaxation to the minimum could lead to the production of oscillons: localised, long-lived, non-linear excitations of the scalar fields. Here we discuss under which conditions oscillons can be produced in string cosmology and illustrate their production and potential phenomenology with two explicit examples: the case of an initially displaced volume modulus in the KKLT scenario and the case of a displaced blow-up Kähler modulus in the Large Volume Scenario (LVS). One, in principle, observable consequence of oscillon dynamics is the production of gravitational waves which, contrary to those produced from preheating after high scale inflation, could have lower frequencies, closer to the currently observable range. We also show that, for the considered parameter ranges, oscillating fibre and volume moduli do not develop any significant non-perturbative dynamics. Furthermore, we find that the vacua in the LVS and the KKLT scenario are stable against local overshootings of the field into the decompatification region, which provides an additional check on the longevity of these metastable configurations.
't Hooft, Gerardus
QCD was proposed as a theory for the strong interactions long before we had any idea as to how it could be that its fundamental constituents, the quarks, are never seen as physical particles. Massless gluons also do not exist as free particles. How can this be explained? The first indication that this question had to be considered in connection with the topological structure of a gauge theory came when Nielsen and Olesen observed the occurrence of stable magnetic vortex structures [1] in the Abelian Higgs model. Expanding on such ideas, the magnetic monopole solution was found [2]. Other roundabout attempts to understand confinement involve instantons. Today, we have better interpretations of these topological structures, including a general picture of the way they do lead to unbound potentials confining quarks. It is clear that these unbound potentials can be ascribed to a string-like structure of the vortices formed by the QCD field lines. Can string theory be used to analyze QCD? Many researchers think so. The leading expert on this is Sacha Polyakov. In his instructive account he adds how he experienced the course of events in Gauge Theory, emphasizing the fact that quite a few discoveries often ascribed to researchers from the West, actually were made independently by scientists from the Soviet Union…
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.)
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.)
Twist Field as Three String Interaction Vertex in Light Cone String Field Theory
Kishimoto, Isao; Moriyama, Sanefumi; Teraguchi, Shunsuke
2006-01-01
It has been suggested that matrix string theory and light-cone string field theory are closely related. In this paper, we investigate the relation between the twist field, which represents string interactions in matrix string theory, and the three-string interaction vertex in light-cone string field theory carefully. We find that the three-string interaction vertex can reproduce some of the most important OPEs satisfied by the twist field.
A framework of DYNAMIC data structures for string processing
DEFF Research Database (Denmark)
Prezza, Nicola
2017-01-01
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...... 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....
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
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
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)
Impedance-matched drilling telemetry system
Normann, Randy A [Edgewood, NM; Mansure, Arthur J [Albuquerque, NM
2008-04-22
A downhole telemetry system that uses inductance or capacitance as a mode through which signal is communicated across joints between assembled lengths of pipe wherein efficiency of signal propagation through a drill string, for example, over multiple successive pipe segments is enhanced through matching impedances associated with the various telemetry system components.
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 σ......, we show how to preprocess S in O(n) (deterministic) time and space O(n) such that given a packed pattern string of length m we can support queries in (deterministic) time O (m/α + log m + log log σ), where α = w/log σ is the number of characters packed in a word of size w = θ(log n). Our query time...
Bug Diagnosis by String Matching: Application to ILTS for Translation.
Chen, Liang; Tokuda, Naoyuki
2003-01-01
Discusses a new template-automaton-based knowledge database system for an interactive intelligent language tutoring system (ILTS) for Japanese-English translation, whereby model translations as well as a taxonomy of bugs extracted from ill-formed translations typical of nonnative learners are collected. (Author/VWL)
Fast Partial Evaluation of Pattern Matching in Strings
DEFF Research Database (Denmark)
Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm
2003-01-01
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...
Fast Partial Evaluation of Pattern Matching in Strings
DEFF Research Database (Denmark)
Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm
2003-01-01
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...
Energy Technology Data Exchange (ETDEWEB)
Amorim, R.; Barcelos-Neto, J. (Universidade Federal do Rio de Janeiro, RJ (Brazil). Inst. de Fisica)
1993-06-01
With the motivation that critical dimensions D[ne]4 might be suggeting that string theories have not been completely formulated, we study more general alternatives. We first consider a direct extension in the world-sheet formulation with N[sub B] bosons and N[sub F] fermions and analyze the conditions for canceling the anomaly in all possible combinations of N[sub B], N[sub F] and D. Later on we incorporate degrees of freedom of antisymmetric tensors to the previous model. The only possibility to cancel the anomaly in this case is with N[sub B]=N[sub F]=1 and the our everyday spacetime dimension D=4. (orig.).
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(logN) query time, and for Linear SLPs (an SLP derivative that captures LZ78 compression and its variations) we get O(loglogN) query time...
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
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.
On the Classical String Solutions and String/Field Theory Duality
Aleksandrova, D.; Bozhilov, P.
2003-01-01
We classify almost all classical string configurations, considered in the framework of the semi-classical limit of the string/gauge theory duality. Then, we describe a procedure for obtaining the conserved quantities and the exact classical string solutions in general string theory backgrounds, when the string embedding coordinates depend non-linearly on the worldsheet time parameter.
String Formatting Considered Harmful for Novice Programmers
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…
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 ﬁeld 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.
Interaction of cosmic strings with gravitational waves
International Nuclear Information System (INIS)
Frolov, V.P.; Garfinkle, D.
1990-01-01
We find solutions of Einstein's equation representing a gravitational wave interacting with a cosmic-string traveling wave. The motion of test cosmic strings in the gravitational field of a cosmic-string traveling wave is also examined. A solution representing traveling waves on several parallel cosmic strings is also found
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.
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.)
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.)
Plucked Strings and the Harpsichord
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.
Nonassociative gravity in string theory?
Energy Technology Data Exchange (ETDEWEB)
Blumenhagen, R [Max-Planck-Institut fuer Physik (Werner-Heisenberg-Institut), Foehringer Ring 6, 80805 Muenchen (Germany); Plauschinn, E, E-mail: ralph.blumenhagen@mpp.mpg.d, E-mail: e.plauschinn@uu.n [Institute for Theoretical Physics and Spinoza Institute, Utrecht University, 3508 TD Utrecht (Netherlands)
2011-01-07
In an on-shell conformal field theory approach, we find indications of a three-bracket structure for target space coordinates in general closed string backgrounds. This generalizes the appearance of noncommutative gauge theories for open strings in two-form backgrounds to a putative noncommutative/nonassociative gravity theory for closed strings probing curved backgrounds with non-vanishing three-form flux. Several aspects and consequences of the three-bracket structure are discussed and a new type of generalized uncertainty principle is proposed.
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
M-strings, Elliptic Genera and N=4 String Amplitudes
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.
M-strings, elliptic genera and N = 4 string amplitudes
International Nuclear Information System (INIS)
Hohenegger, S.; Iqbal, A.
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 C 2 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. (Copyright copyright 2014 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)
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.
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
Charting the landscape of supercritical string theory.
Hellerman, Simeon; Swanson, Ian
2007-10-26
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.
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
Matrix string theory on pp-waves
Energy Technology Data Exchange (ETDEWEB)
Bonelli, Giulio
2003-06-21
After a brief review on matrix string theory on flat backgrounds, we formulate matrix string models on different pp-wave backgrounds. This will be done both in the cases of constant and variable RR background flux for certain exact string geometries. We exhibit the non-perturbative representation of string interaction and show how the eigenvalue tunnelling drives the WKB expansion to give the usual perturbative string interaction also in supersymmetric pp-wave background cases.
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...
String theory and cosmological singularities
Indian Academy of Sciences (India)
time' can have a beginning or end. Well-known examples are singularities inside black holes and initial or final singularities in expanding or contracting universes. In recent times, string theory is providing new perspectives of such singularities ...
Cache-oblivious string dictionaries
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf
2006-01-01
We present static cache-oblivious dictionary structures for strings which provide analogues of tries and suffix trees in the cache-oblivious model. Our construction takes as input either a set of strings to store, a single string for which all suffixes are to be stored, a trie, a compressed trie......, or a suffix tree, and creates a cache-oblivious data structure which performs prefix queries in O(logB n + |P|/B) I/Os, where n is the number of leaves in the trie, P is the query string, and B is the block size. This query cost is optimal for unbounded alphabets. The data structure uses linear space....
String and Sticky Tape Experiments.
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)
Spin chains and string theory.
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.
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.)
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
On Field Theory of Open Strings, Tachyon Condensation and Closed Strings
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.
Quark Synthesis String Theory From Dark Matter to Light Emitting Atoms
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.
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
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)
Semiclassical Strings in Supergravity PFT
Banerjee, Aritra; Biswas, Sagar; Panigrahi, Kamal L.
2014-01-01
Puff field theory (PFT) is an example of a non-local field theory which arises from a novel embedding of D-branes in a Melvin universe. We study several rotating and pulsating string solutions of the F-string equations of motion in the supergravity dual of the PFT. Further, we find a PP-wave geometry from this non-local spacetime by applying a Penrose limit and comment on its similarity with the maximally supersymmetric PP-wave background.
Robust weighted scan matching with quadtrees
Visser, A.; Slamet, B.A.; Pfingsthorn, M.
2009-01-01
This paper presents the improvement of the robustness and accuracy of the weighted scan matching algorithm matching against the union of earlier acquired scans. The approach allows to reduce the correspondence error, which is explicitly modeled in the weighted scan matching algorithm, by providing a
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
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.
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
Experimental observation of Bethe strings
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.
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 ...... of a mobile phone system in a bigraphical representation of the polyadic π calculus.......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...
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.)
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)
Goetschius, John; Smith, Helen C; Vacek, Pamela M; Holterman, Leigh Ann; Shultz, Sandra J; Tourville, Timothy W; Slauterbeck, James; Johnson, Robert J; Beynnon, Bruce D
2012-09-01
When landing from a jump, the production of increased intersegmental knee abduction moments and coupled valgus motions has been associated with an increased risk of suffering a noncontact anterior cruciate ligament (ACL) injury in one study. This research has led to the development of a clinic-based algorithm that utilizes measures of knee valgus motion, knee flexion range of motion, body mass, tibial length, and quadriceps-to-hamstring strength ratio data to predict the probability of a high knee abduction moment (pKAM) when landing from a jump in female athletes. The ability of this algorithm to identify athletes at increased risk of suffering ACL injury has not been assessed. The pKAM is associated with ACL injury in female athletes. Case-control study; Level of evidence, 3. This study was based on secondary analysis of data obtained from a previous investigation that focused on the use of the drop vertical jump (DVJ) test to assess the risk of ACL injury in female athletes. The DVJ screenings were performed on 1855 female high school and college athletes over 3 years. Knee valgus motion, knee flexion range of motion, and tibial length were measured from videos of the DVJ obtained during preseason screenings. Mass was measured using a physician's scale, and quadriceps-to-hamstring strength ratio was included using a surrogate value. These data were entered into the clinic-based algorithm that determined the pKAM. The association of pKAM with ACL injury was assessed using conditional logistic regression. A total of 20 athletes sustained ACL injury and were matched with 45 uninjured control athletes who were recruited from the same teams. There was no relationship between the risk of suffering ACL injury and pKAM, as determined by the clinic-based algorithm. The pKAM was not associated with noncontact ACL injury in our group of injured athletes and matched controls.
Matching Supernovae to Galaxies
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
With string model to time series forecasting
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.
Conformal supergravity in twistor-string theory
Energy Technology Data Exchange (ETDEWEB)
Berkovits, Nathan [Instituto de Fisica Teorica, Universidade Estadual Paulista, Rua Pamplona 145, 01405-900, Sao Paulo, SP (Brazil)]. E-mail: nberkovi@ift.unesp.br; Witten, Edward [School of Natural Sciences, Institute for Advanced Study, Princeton NJ 08540 (United States)
2004-08-01
Conformal supergravity arises in presently known formulations of twistor-string theory either via closed strings or via gauge-singlet open strings. We explore this sector of twistor-string theory, relating the relevant string modes to the particles and fields of conformal supergravity. We use the twistor-string theory to compute some tree level scattering amplitudes with supergravitons. Since the supergravitons interact with the same coupling constant as the Yang-Mills fields, conformal supergravity states will contribute to loop amplitudes of Yang-Mills gluons in these theories. Those loop amplitudes will therefore not coincide with the loop amplitudes of pure super Yang-Mills theory. (author)
Gravitational Lensing Signatures of Long Cosmic Strings
De Laix, A A; Vachaspati, T; Laix, Andrew A. de; Krauss, Lawrence M.; Vachaspati, Tanmay
1997-01-01
The gravitational lensing by long, wiggly cosmic strings is shown to produce a large number of lensed images of a background source. In addition to pairs of images on either side of the string, a number of small images outline the string due to small-scale structure on the string. This image pattern could provide a highly distinctive signature of cosmic strings. Since the optical depth for multiple imaging of distant quasar sources by long strings may be comparable to that by galaxies, these image patterns should be clearly observable in the next generation of redshift surveys such as the Sloan Digital Sky Survey.
String Theory for Pedestrians (1/3)
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.
String Theory for Pedestrians (2/3)
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.
String Theory for Pedestrians (3/3)
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.
Ureteric stent placement with extraction string: no strings attached?
Bockholt, Nathan A; Wild, Trevor T; Gupta, Amit; Tracy, Chad R
2012-12-01
Study Type--Therapy (case series) Level of Evidence 4 What's known on the subject? and What does the study add? Of patients treated with an indwelling ureteric stent 80-90% experience lower urinary tract symptoms that are a hindrance to health-related quality of life. The prevalence of the extraction/retrieval string after ureteroscopy for stone disease and stent placement varies significantly between surgeons and published series, but the benefits of eliminating the need for a secondary procedure such as cystoscopy and stent removal, as well as the decrease in cost to the patient are well established. Published reports have not addressed the prevalence of post-procedure related events (PREs) in patients who have received an indwelling ureteric stent with the extraction/retrieval string still intact after ureteroscopy for stone disease. By analysing PREs (Emergency Room visits, unscheduled clinic visits, and telephone calls) related to their stent or procedure for patients with and without an extraction/retrieval string, the feasibility of the extraction string can be validated and the misconceptions about their use can be alleviated. • To review a retrospective ureteric stent cohort with and without extraction string to compare post-procedure related events (PRE), as ureteric stent placement after endoscopic management of urolithiasis is common, but data regarding the potential benefits or disadvantages of ureteric stent placement with extraction string are sparse. • Between June 2009 and June 2010, 293 patients underwent ureteroscopy with or without lithotripsy for stone disease. • In all, 181 patients had a unilateral procedure and underwent stent placement postoperatively. • Records were retrospectively reviewed for operative data and PRE occurring within the first 6 weeks after surgery, defined as unscheduled clinic or Emergency Room visits, or adverse event telephone calls. • Of 181 patients who underwent ureteric stent placement, 43 (23
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
Energy Technology Data Exchange (ETDEWEB)
Skenderis, Kostas [Institute of Theoretical Physics, Universiteit van Amsterdam, Valckenierstraat 65, NL-1018 XE Amsterdam (Netherlands)
2007-11-21
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
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
Matching score based face recognition
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
Topological strings from quantum mechanics
Energy Technology Data Exchange (ETDEWEB)
Grassi, Alba; Marino, Marcos [Geneve Univ. (Switzerland). Dept. de Physique Theorique et Section de Mathematique; Hatsuda, Yasuyuki [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group
2014-12-15
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{sup 2}, local P{sup 1} x P{sup 1} and local F{sub 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.
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
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.
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)
String Resonances at Hadron Colliders
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...
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.
Black strings ending on horizons
Haddad, Nidal
2012-12-01
We construct an approximate static gravitational solution of the Einstein equations, with negative cosmological constant, describing a test black string stretching from the boundary of the Schwarzschild-AdS5 black brane toward the horizon. The construction builds on a derivative expansion method, assuming that the black brane metric changes slowly along the black string direction. We provide a solution up to second order in derivatives, and it implies, in particular, that the black string must shrink to zero size at the horizon of the black brane. In the near-horizon region of the black brane, where the two horizons intersect, we provide an exact solution of a cone that describes two intersecting horizons at different temperatures. Moreover, we show that this solution equally describes a thin and long black droplet.
Cooperative strings and glassy interfaces.
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.
Quantum Inhomogeneities in String Cosmology
Buonanno, A; Ungarelli, C; Veneziano, Gabriele
1998-01-01
Within two specific string cosmology scenarios --differing in the way the pre- and post-big bang phases are joined-- we compute the size and spectral slope of various types of cosmologically amplified quantum fluctuations that arise in generic compactifications of heterotic string theory. By further imposing that these perturbations become the dominant source of energy at the onset of the radiation era, we obtain physical bounds on the background's moduli, and discuss the conditions under which both a (quasi-) scale-invariant spectrum of axionic perturbations and sufficiently large seeds for the galactic magnetic fields are generated. We also point out a potential problem with achieving the exit to the radiation era when the string coupling is near its present value.
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
DEFF Research Database (Denmark)
Szklarczyk, Damian; Franceschini, Andrea; Kuhn, Michael
2011-01-01
and computational prediction techniques. However, public efforts to collect and present protein interaction information have struggled to keep up with the pace of interaction discovery, partly because protein-protein interaction information can be error-prone and require considerable effort to annotate. Here, we...... 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......, and accessory information such as protein domains and 3D structures is made available, all within a stable and consistent identifier space. New features in STRING include an interactive network viewer that can cluster networks on demand, updated on-screen previews of structural information including homology...
General relativity, strings, and mathematical physics
Porrati, Massimo
1999-01-01
We give a historical review of some aspects of string theory relevant to our present understanding of general relativity, and connected with Einstein's unification program. We also point out to various mathematical fallouts of $9 string theory. (31 refs).
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)
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
Introduction to field theory of strings
International Nuclear Information System (INIS)
Kikkawa, K.
1987-01-01
The field theory of bosonic string is reviewed. First, theory is treated in a light-cone gauge. After a brief survey of the first quantized theory of free string, the second quantization is discussed. All possible interactions of strings are introduced based on a smoothness condition of work sheets swept out by strings. Perturbation theory is developed. Finally a possible way to the manifest covariant formalism is discussed
DEFF Research Database (Denmark)
Szklarczyk, Damian; Morris, John H; Cook, Helen
2017-01-01
A system-wide understanding of cellular function requires knowledge of all functional interactions between the expressed proteins. The STRING database aims to collect and integrate this information, by consolidating known and predicted protein-protein association data for a large number of organi......A system-wide understanding of cellular function requires knowledge of all functional interactions between the expressed proteins. The STRING database aims to collect and integrate this information, by consolidating known and predicted protein-protein association data for a large number...
Semiclassical strings in supergravity PFT
Energy Technology Data Exchange (ETDEWEB)
Banerjee, Aritra; Biswas, Sagar; Panigrahi, Kamal L. [Indian Institute of Technology Kharagpur, Department of Physics, Kharagpur (India)
2014-10-15
Puff field theory (PFT) is an example of a non-local field theory which arises from a novel embedding of D-branes in a Melvin universe. We study several rotating and pulsating string solutions of the F-string equations of motion in the supergravity dual of the PFT. Further, we find a PP-wave geometry from this non-local spacetime by applying a Penrose limit and comment on its similarity with the maximally supersymmetric PP-wave background. (orig.)
Cosmic string in gravity's rainbow
Momeni, Davood; Upadhyay, Sudhaker; Myrzakulov, Yerlan; Myrzakulov, Ratbay
2017-09-01
In this paper, we study the various cylindrical solutions (cosmic strings) in gravity's rainbow scenario. In particular, we calculate the gravitational field equations corresponding to energy-dependent background. Further, we discuss the possible Kasner, quasi-Kasner and non-Kasner exact solutions of the field equations. In this framework, we find that quasi-Kasner solutions cannot be realized in gravity's rainbow. Assuming only time-dependent metric functions, we also analyse the time-dependent vacuum cosmic strings in gravity's rainbow, which are completely different than the other GR solutions.
Reliable Transition State Searches Integrated with the Growing String Method.
Zimmerman, Paul
2013-07-09
The growing string method (GSM) is highly useful for locating reaction paths connecting two molecular intermediates. GSM has often been used in a two-step procedure to locate exact transition states (TS), where GSM creates a quality initial structure for a local TS search. This procedure and others like it, however, do not always converge to the desired transition state because the local search is sensitive to the quality of the initial guess. This article describes an integrated technique for simultaneous reaction path and exact transition state search. This is achieved by implementing an eigenvector following optimization algorithm in internal coordinates with Hessian update techniques. After partial convergence of the string, an exact saddle point search begins under the constraint that the maximized eigenmode of the TS node Hessian has significant overlap with the string tangent near the TS. Subsequent optimization maintains connectivity of the string to the TS as well as locks in the TS direction, all but eliminating the possibility that the local search leads to the wrong TS. To verify the robustness of this approach, reaction paths and TSs are found for a benchmark set of more than 100 elementary reactions.
The Physics of "String Passing through Ice"
Mohazzabi, Pirooz
2011-01-01
One of the oldest yet interesting experiments related to heat and thermodynamics is placing a string on a block of ice and hanging two masses from the ends of the string. Sometime later, it is discovered that the string has passed through the ice without cutting it in half. A simple explanation of this effect is that the pressure caused by the…
The Illusive Sound of a Bundengan String
Parikesit, Gea O. F.; Kusumaningtyas, Indraswari
2017-01-01
The acoustics of a vibrating string is frequently used as a simple example of how physics can be applied in the field of art. In this paper we describe a simple experiment and analysis using a clipped string. This experiment can generate scientific curiosity among students because the sound generated by the string seem surprising to our senses.…
How Do String Majors Become Teachers?
Ha, Joy
2015-01-01
This study was motivated by the desire to understand how to support the development of competent and confident string instrument teachers. This research investigates early-career string instrument teachers' experiences of pre-service tertiary education and induction, and how these experiences impacted early-career string teachers' competence to…
The Picture Brightens (Slightly) for String Programs
Olson, Cathy Applefeld
2010-01-01
It may not be the best of times for the school's string and orchestra programs, but things certainly are looking up. This article focuses on a recent report which cites the numerous positives, including an increase in the number of districts offering strings classes, a greater variety in the racial mix of strings students, and a less drastic…
Bergshoeff, Eric A.; Riccioni, Fabio
We construct for arbitrary dimensions a universal T-duality covariant expression for the Wess-Zumino terms of supersymmetric String Solitons in toroidally compactified string theories with 32 supercharges. The worldvolume fields occurring in the effective action of these String Solitons form either
Symmetries and Interactions in Matrix String Theory
Hacquebord, F.H.
1999-01-01
This PhD-thesis reviews matrix string theory and recent developments therein. The emphasis is put on symmetries, interactions and scattering processes in the matrix model. We start with an introduction to matrix string theory and a review of the orbifold model that flows out of matrix string theory
Glueballs as rotating folded closed strings
Sonnenschein, Jacob; Weissman, Dorin
2015-12-01
In previous papers [1, 2] we argued that mesons and baryons can be described as rotating open strings in holographic backgrounds. Now we turn to closed strings, which should be the duals of glueballs. We look at the rotating folded closed string in both flat and curved backgrounds.
Open bosonic string in background electromagnetic field
International Nuclear Information System (INIS)
Nesterenko, V.V.
1987-01-01
The classical and quantum dynamics of an open string propagating in the D-dimensional space-time in the presence of a background electromagnetic field is investigated. An important point in this consideration is the use of the generalized light-like gauge. There are considered the strings of two types; the neutral strings with charges at their ends obeying the condition q 1 +q 2 =0 and the charged strings having a net charge q 1 +q 2 ≠ 0. The consistency of theory demands that the background electric field does not exceed its critical value. The distance between the mass levels of the neutral open string decreases (1-e 2 ) times in comparison with the free string, where e is the dimensionless strength of the electric field. The magnetic field does not affect this distance. It is shown that at a classical level the squared mass of the neutral open string has a tachyonic contribution due to the motion of the string as a whole in transverse directions. The tachyonic term disappears if one considers, instead of M 2 , the string energy in a special reference frame where the projection of the total canonical momentum of the string onto the electric field vanishes. The contributions due to zero point fluctuations to the energy spectrum of the neutral string and to the Virasoro operators in the theory of charged string are found
String duality and novel theories without gravity
International Nuclear Information System (INIS)
Kachru, Shamit
1998-01-01
We describe some of the novel 6d quantum field theories which have been discovered in studies of string duality. The role these theories (and their 4d descendants) may play in alleviating the vacuum degeneracy problem in string theory is reviewed. The DLCQ of these field theories is presented as one concrete way of formulating them, independent of string theory
Transverse structure of the QCD string
International Nuclear Information System (INIS)
Meyer, Harvey B.
2010-01-01
The characterization of the transverse structure of the QCD string is discussed. We formulate a conjecture as to how the stress-energy tensor of the underlying gauge theory couples to the string degrees of freedom. A consequence of the conjecture is that the energy density and the longitudinal-stress operators measure the distribution of the transverse position of the string, to leading order in the string fluctuations, whereas the transverse-stress operator does not. We interpret recent numerical measurements of the transverse size of the confining string and show that the difference of the energy and longitudinal-stress operators is a particularly natural probe at next-to-leading order. Second, we derive the constraints imposed by open-closed string duality on the transverse structure of the string. We show that a total of three independent ''gravitational'' form factors characterize the transverse profile of the closed string, and obtain the interpretation of recent effective string theory calculations: the square radius of a closed string of length β defined from the slope of its gravitational form factor, is given by (d-1/2πσ)log(β/4r 0 ) in d space dimensions. This is to be compared with the well-known result that the width of the open string at midpoint grows as (d-1/2πσ)log(r/r 0 ). We also obtain predictions for transition form factors among closed-string states.
Architectures and representations for string transduction
Chrupala, Grzegorz
2015-01-01
String transduction problems are ubiquitous in natural language processing: they include transliteration, grapheme-to-phoneme conversion, text normalization and translation. String transduction can be reduced to the simpler problems of sequence labeling by expressing the target string as a sequence
The issue of supersymmetry breaking in strings
International Nuclear Information System (INIS)
Binetruy, P.
1989-12-01
We discuss the central role that supersymmetry plays in string models, both in spacetime and at the level of the string world-sheet. The problems associated with supersymmetry-breaking are reviewed together with some of the attempts to solve them, in the string as well as the field theory approach
General relativity invariance and string field theory
International Nuclear Information System (INIS)
Aref'eva, I.Ya.; Volovich, I.V.
1987-04-01
The general covariance principle in the string field theory is considered. The algebraic properties of the string Lie derivative are discussed. The string vielbein and spin connection are introduced and an action invariant under general co-ordinate transformation is proposed. (author). 18 refs
String loop divergences and effective lagrangians
International Nuclear Information System (INIS)
Fischler, W.; Klebanov, I.; Susskind, L.
1988-01-01
We isolate logarithmic divergences from bosonic string amplitudes on a disc. These divergences are compared with 'tadpole' divergences in the effective field theory, with a covariant cosmological term implied by the counting of string coupling constants. We find an inconsistency between the two. This might be a problem in eliminating divergences from the bosonic string. (orig.)
Test particle trajectories near cosmic strings
Indian Academy of Sciences (India)
Gauge strings have their energy concentrated in a very thin tube, the radius of which is of the order of the symmetry- breaking scale whereas the global strings are such that their energy extends to regions far beyond the central core. Strings have an important astrophysical consequence, namely, the double quasar problem ...
Introduction to the theory of strings
International Nuclear Information System (INIS)
Peskin, M.E.
1985-10-01
These lectures present, from an introductory perspective, some basic aspects of the quantum theory of strings. They treat (1) the kinematics, spectrum, and scattering amplitude of the bosonic string, (2) the spectrum and supersymmetry of Green-Schwarz superstring, and (3) the identification of the underlying gauge invariances of the string theory. 43 refs
Chandran K S, Subhash; Mishra, Ashutosh; Shirhatti, Vinay; Ray, Supratim
2016-03-23
Signals recorded from the brain often show rhythmic patterns at different frequencies, which are tightly coupled to the external stimuli as well as the internal state of the subject. In addition, these signals have very transient structures related to spiking or sudden onset of a stimulus, which have durations not exceeding tens of milliseconds. Further, brain signals are highly nonstationary because both behavioral state and external stimuli can change on a short time scale. It is therefore essential to study brain signals using techniques that can represent both rhythmic and transient components of the signal, something not always possible using standard signal processing techniques such as short time fourier transform, multitaper method, wavelet transform, or Hilbert transform. In this review, we describe a multiscale decomposition technique based on an over-complete dictionary called matching pursuit (MP), and show that it is able to capture both a sharp stimulus-onset transient and a sustained gamma rhythm in local field potential recorded from the primary visual cortex. We compare the performance of MP with other techniques and discuss its advantages and limitations. Data and codes for generating all time-frequency power spectra are provided. Copyright © 2016 the authors 0270-6474/16/363399-10$15.00/0.