首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   183篇
  免费   1篇
电工技术   1篇
化学工业   51篇
金属工艺   10篇
机械仪表   2篇
建筑科学   3篇
能源动力   1篇
轻工业   7篇
水利工程   1篇
无线电   8篇
一般工业技术   48篇
冶金工业   10篇
自动化技术   42篇
  2024年   3篇
  2023年   3篇
  2022年   13篇
  2021年   10篇
  2020年   5篇
  2019年   3篇
  2018年   7篇
  2017年   5篇
  2016年   5篇
  2015年   5篇
  2014年   12篇
  2013年   6篇
  2012年   10篇
  2011年   13篇
  2010年   5篇
  2009年   13篇
  2008年   3篇
  2007年   5篇
  2006年   5篇
  2005年   2篇
  2004年   11篇
  2003年   9篇
  2002年   3篇
  2001年   4篇
  2000年   2篇
  1999年   2篇
  1998年   5篇
  1997年   1篇
  1996年   2篇
  1994年   2篇
  1993年   2篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
  1984年   1篇
  1981年   1篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
排序方式: 共有184条查询结果,搜索用时 15 毫秒
51.
We consider the following scenario: There are two individuals, say Q (Questioner) and R (Responder), involved in a search game. Player R chooses a number, say x, from the set S={1,…,M}. Player Q has to find out x by asking questions of type: “which one of the sets A1,A2,…,Aq, does x belong to?”, where the sets A1,…,Aq constitute a partition of S. Player R answers “i” to indicate that the number x belongs to Ai. We are interested in the least number of questions player Q has to ask in order to be always able to correctly guess the number x, provided that R can lie at most e times. The case e=0 obviously reduces to the classical q-ary search, and the necessary number of questions is [logqM]. The case q=2 and e1 has been widely studied, and it is generally referred to as Ulam's game. In this paper we consider the general case of arbitrary q2. Under the assumption that player R is allowed to lie at most twice throughout the game, we determine the minimum number of questions Q needs to ask in order to successfully search for x in a set of cardinality M=qi, for any i1. As a corollary, we obtain a counterexample to a recently proposed conjecture of Aigner, for the case of an arbitrary number of lies. We also exactly solve the problem when player R is allowed to lie a fixed but otherwise arbitrary number of times e, and M=qi, with i not too large with respect to q. For the general case of arbitrary M, we give fairly tight upper and lower bounds on the number of the necessary questions.  相似文献   
52.
We consider the basic problem of searching for an unknown m-bit number by asking the minimum possible number of yes–no questions, when up to a finite number e of the answers may be erroneous. In case the (i+1)th question is adaptively asked after receiving the answer to the ith question, the problem was posed by Ulam and Rényi and is strictly related to Berlekamp's theory of error correcting communication with noiseless feedback. Conversely, in the fully non-adaptive model when all questions are asked before knowing any answer, the problem amounts to finding a shortest e-error correcting code. Let qe(m) be the smallest integer q satisfying Berlekamps bound . Then at least qe(m) questions are necessary, in the adaptive, as well as in the non-adaptive model. In the fully adaptive case, optimal searching strategies using exactly qe(m) questions always exist up to finitely many exceptional m's. At the opposite non-adaptive case, searching strategies with exactly qe(m) questions—or equivalently, e-error correcting codes with 2m codewords of length qe(m)—are rather the exception, already for e=2, and are generally not known to exist for e>2. In this paper, for each e>1 and all sufficiently large m, we exhibit searching strategies that use a first batch of m non-adaptive questions and then, only depending on the answers to these m questions, a second batch of qe(m)−m non-adaptive questions. These strategies are automatically optimal. Since even in the fully adaptive case, qe(m)−1 questions do not suffice to find the unknown number, and qe(m) questions generally do not suffice in the non-adaptive case, the results of our paper provide e fault tolerant searching strategies with minimum adaptiveness and minimum number of tests.  相似文献   
53.
The evolution in time of the strength and porosity of mortars made with the same type of high-alumina cement and two different types of aggregate, calcareous and siliceous, is studied, and the effects of aggregate composition on both parameters are analysed. It is found that between strength and porosity a linear correlation exists. The effects of pore diameter on such correlation is investigated and it is ascertained that the best correlation can be obtained for total cumulative porosity. The results show that this correlation can be useful for the determination of compressive strengthin situ.
Résumé On étudie l’évolution dans le temps de la résistance et de la porosité de mortiers confectionnés avec le même type de ciment alumineux et deux types différents de granulats, calcaire et siliceux, et on analyse les effets de la composition du granulat sur les deux paramètres. On constate qu’il existe une corrélation linéaire entre la résistance et la porosité. On examine les effets du diamètre des pores sur une telle corrélation et on établit qu’on peut obtenir la meilleure corrélation pour la porosité totale. Les résultats montrent que cette corrélation peut servir pour déterminer la résistance à la compressionin situ.
  相似文献   
54.
Electronic structure methods have been used to investigate conducting copolymers of 3,4-ethylenedioxythiophene (EDOT) and pyrrole (Py). The calculations show the planar anti conformation and the syn conformers have extended conjugation. In the anti conformation the EDOT–Py dimer is calculated to have a lower reorganization energy (0.390 eV) than either homodimer (0.423 eV EDOT; 0.455 eV Py) and consequently is expected to have higher charge carrier mobility. The HOMO–LUMO gap of the copolymers is intermediate between the two homopolymers and for regular sequences varies monotonically as a function of the monomer content.  相似文献   
55.
56.
    
In an effort to optimize visualization and editing of OWL ontologies we have developed GrOWL—a browser and visual editor for OWL that accurately visualizes the underlying DL semantics of OWL ontologies while avoiding the difficulties of the verbose OWL syntax. In this paper, we discuss GrOWL visualization model and the essential visualization techniques implemented in GrOWL.  相似文献   
57.
58.
    
Guanine-rich sequences are known to fold into G-quadruplex (G4) arrangements, which are present in oncogenes and in the telomeric regions of chromosomes. In particular, G4s represent an obstacle to functioning of telomerase, an enzyme overexpressed in cancer cells causing their immortalization. Therefore, G4 stabilization using small molecules represents an appealing strategy for the medicinal chemist. Ligands based on an anthraquinone scaffold, to which peptidic side chains were attached by an amide bond, were previously reported. We envisioned improving this ligand concept leveraging the click chemistry approach, which, besides representing a flexible, high yielding synthetic strategy, allows an elongation of the side chains and an increase of π–π stacking and H-bond interactions with the nucleobases through the triazole ring. Compounds were tested for their ability to interact with G4 DNA with a multiple analytical approach, demonstrating an elevated aptitude to stabilize the G4 and high selectivity over double stranded DNA.  相似文献   
59.
In this study, a novel physical approach is proposed to detect damages due to earthquakes using dual polarimetric (DP) coherent Synthetic Aperture Radar (SAR) imagery. An optimization method, aimed at enhancing scattering basis differences between measurements collected before and after the event, is designed exploiting Lagrange optimization of the difference between two polarimetric covariance matrices. A meaningful showcase is presented to demonstrate the soundness of the proposed approach that consists of processing Sentinel–1 C–band scenes related to 2016 Central Italy Earthquake. The proposed approach, which is contrasted with the conventional coherence based single– and dual–polarization approaches, results in the best sensitivity to damages.  相似文献   
60.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号