全文获取类型
收费全文 | 295篇 |
免费 | 11篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 3篇 |
综合类 | 22篇 |
化学工业 | 11篇 |
金属工艺 | 4篇 |
机械仪表 | 7篇 |
建筑科学 | 12篇 |
矿业工程 | 2篇 |
能源动力 | 2篇 |
轻工业 | 1篇 |
水利工程 | 1篇 |
石油天然气 | 9篇 |
武器工业 | 1篇 |
无线电 | 9篇 |
一般工业技术 | 10篇 |
自动化技术 | 220篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2019年 | 2篇 |
2018年 | 5篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 20篇 |
2013年 | 9篇 |
2012年 | 21篇 |
2011年 | 23篇 |
2010年 | 23篇 |
2009年 | 21篇 |
2008年 | 18篇 |
2007年 | 20篇 |
2006年 | 21篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 13篇 |
2002年 | 13篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1971年 | 2篇 |
排序方式: 共有314条查询结果,搜索用时 0 毫秒
21.
Eunsang Kim 《Information Processing Letters》2009,109(9):454-459
Bentley and Sedgewick proposed multikey Quicksort with ‘split-end’ partitioning for sorting strings. But it can be slow in case of many equal elements because it adopted ‘split-end’ partitioning that moves equal elements to the ends and swaps back to the middle. We present ‘collect-center’ partitioning to improve multikey Quicksort in that case. It moves equal elements to the middle directly like the ‘Dutch National Flag Problem’ partitioning approach and it uses two inner loops like Bentley and McIlroy's. In case of many equal elements such as DNA sequences, HTML files, and English texts, multikey Quicksort with ‘collect-center’ partitioning is faster than multikey Quicksort with ‘split-end’ partitioning. 相似文献
22.
String inclusion and non-inclusion problems have been vigorously studied in such diverse fields as molecular biology, data compression, and computer security. Among the well-known string inclusion or non-inclusion notions, we are interested in the longest common nonsuperstring. Given a set of strings, the longest common nonsuperstring problem is finding the longest string that is not a superstring of any string in the given set. It is known that the longest common nonsuperstring problem is solvable in polynomial time.In this paper, we propose an efficient algorithm for the longest common nonsuperstring problem. The running time of our algorithm is linear with respect to the sum of the lengths of the strings in the given set, using generalized suffix trees. 相似文献
23.
24.
We define three operations on strings and languages suggested by the process of gene assembly in hypotrichous ciliates. This
process is considered to be a prine example of DNA computing in vivo. This paper is devoted to some computational aspects
of these operations from a formal language point of view. The closure of the classes of regular and context-free languages
under these operations is settled. Then, we consider theld-macronuclear language of a given languageL, which consists of allld-macronuclear strings obtained from the strings ofL by iteratively applying the loop-direct repeat-excision. Finally, we discuss some open problems and further directions of
research.
Rudolf Freund: He received his master and doctor degree in computer science from the Vienna University of Technology, Austria, in 1980
and 1982, respectively. In 1986, he received his master degree in mathematics and physics from the University Vienna, Austria.
In 1988 he joined the Vienna University of Technology in Austria, where he became an Associate Professor in September 1995.
He has given various lectures in theoretical computer science, especially on formal languages and automata. His research interests
include array and graph grammars, regulated rewritung, infinite words, syntactic pattern recognition, neural networks, and
especially models and systems for biological computing. In these fields he is author of more than sixty scientific papers.
Carlos Martín-Vide: He is Professor and Head of the Research Group on Mathematical Linguistics at Rovira i Virgili University, Tarragona, Spain.
His specialities are formal language theory and mathematical linguistics. His last volume edited is Where Mathematics, Computer
Science, Linguistics and Biology Meet (Kluwer, 2001, with V. Mitrana). He published 150 papers in conference proceedings and
journals such as: Acta Informatica, BioSystems. Computational Linguistics, Computers and Artificial Intelligence, Information
Processing Letters, Information Sciences, International Journal of Computer Mathematics, New Generation Computing, Publicationes
Mathematicae Debrecen, and Theoretical Computer Science. He is the editor-in-chief of the journal Grammars (Kluwer), and the
chairman of the 1st International PhD School in Formal Languages and Applications (2001–2003).
Victor Mitrana, Ph.D.: He is Professor of Computer Science at the Faculty of Mathematics, University of Bucharest. He received his MSc and PhD
from the University of Bucharest in 1986 and 1993, respectively. In 1999 he was awarded with the “Gheorghe Lazar” Prize for
Mathematics of the Romanian Academy. His research interests include: formal language theory and applications, combinatorics
on words, computational models inspired from biology, mathematical linguistics. In these areas, he published three books,
more than 100 papers, and edited two books. He is an associate editor of “The Korean Journal of Computational and Applied
Mathematics” and an editor of “Journal of Universal Computer Science”. 相似文献
25.
Words that appear as constrained subsequences in a text-string are considered as possible indicators of the host string structure, hence also as a possible means of sequence comparison and classification. The constraint consists of imposing a bound on the number ω of positions in the text that may intervene between any two consecutive characters of a subsequence. A subset of such ω-sequences is then characterized that consists, in intuitive terms, of sequences that could not be enriched with more characters without losing some occurrence in the text. A compact spatial representation is then proposed for these representative sequences, within which a number of parameters can be defined and measured. In the final part of the paper, such parameters are empirically analyzed on a small collection of text-strings endowed with various degrees of structure. 相似文献
26.
We present a new simple algorithm that constructs an Aho Corasick automaton for a set of patterns, P, of total length n, in O(n) time and space for integer alphabets. Processing a text of size m over an alphabet Σ with the automaton costs O(mlog|Σ|+k), where there are k occurrences of patterns in the text.A new, efficient implementation of nodes in the Aho Corasick automaton is introduced, which works for suffix trees as well. 相似文献
27.
Giuditta Franco Maurice Margenstern 《Electronic Notes in Theoretical Computer Science》2007,171(2):15
We propose a biologically inspired system which computes on double structures of mobile strings by means of rewriting rules that have a biotechnological implementation, by resembling DNA computations. Its computational universality may be straight deduced from a few formal language theoretical results of one of the authors. Such a DNA-like computational device is naturally described by a membrane system which concludes the paper. 相似文献
28.
Branislav ?urian 《Information Processing Letters》2010,110(4):148-152
We present improved variations of the BNDM algorithm for exact string matching. At each alignment our bit-parallel algorithms process a q-gram before testing the state variable. In addition we apply reading a 2-gram in one instruction. Our point of view is practical efficiency of algorithms. Our experiments show that the new variations are faster than earlier algorithms in many cases. 相似文献
29.
30.
Gennaro Costagliola Vincenzo Deufemia Filomena Ferrucci Carmine Gravino 《Information and Computation》2003,187(2):209-245
Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension. 相似文献