全文获取类型
收费全文 | 245篇 |
免费 | 8篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 5篇 |
化学工业 | 46篇 |
机械仪表 | 3篇 |
建筑科学 | 6篇 |
能源动力 | 7篇 |
轻工业 | 11篇 |
水利工程 | 2篇 |
石油天然气 | 2篇 |
无线电 | 32篇 |
一般工业技术 | 25篇 |
冶金工业 | 38篇 |
自动化技术 | 79篇 |
出版年
2023年 | 2篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 14篇 |
2012年 | 9篇 |
2011年 | 10篇 |
2010年 | 4篇 |
2009年 | 16篇 |
2008年 | 16篇 |
2007年 | 12篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 14篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 2篇 |
1971年 | 1篇 |
排序方式: 共有256条查询结果,搜索用时 15 毫秒
1.
This paper describes a new formalism for inheritance systems, based on the formal semantics of set expressions. Using the formalism, it is possible to define new semantic classes by arbitrary set expressions operating on previously defined classes. Thus generalizing bothIS-A links andIS-NOT-A links and adding the set intersection operation. We present an efficient algorithm which follows these definitions to deduce the properties implied by the inheritance network, i.e., the properties of the classes containing a given element. The application which motivated the development of the formalism, namely semantic disambiguation of natural language, is also described. 相似文献
2.
Fractionation of partly hydrolysed polyvinyl acetate (PVA) was performed by warming of its aqueous solutions. The following properties of the obtained fractions were determined: viscosity, molecular weight and molecular weight distribution, surface tension, and absorbance in the IR range. The blockiness of the polymer molecules, characterized by their behaviour towards iodine-containing systems such as I2,-H3BO3 and I2,-KI, was estimated. Fractionation of the aqueous solutions of PVA by warming is based mainly on the different internal molecular structure of the separated products, i.e. on the length of the vinyl acetate blocks in the PVA molecules and, to a lesser extent, on the degree of hydrolysis and the degree of polymerization. The more blocklike are the PVA molecules, the less compatible are the polymers in the PVA-hydroxypropyl methylcellulose (HPMC)-water system. At phase separation in this sytem the PVA molecules which are not compatible with HPMC are, in the first place, those of the highest blockiness. 相似文献
3.
We say that a distribution over {0,1}n is (ε,k)-wise independent if its restriction to every k coordinates results in a distribution that is ε-close to the uniform distribution. A natural question regarding (ε,k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exist (ε,k)-wise independent distributions whose statistical distance is at least nO(k)·ε from any k-wise independent distribution. In addition, we show that for any (ε,k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is nO(k)·ε. 相似文献
4.
Alon M. Douek Mitra Amiri Khabooshan Jason Henry Sebastian-Alexander Stamatis Florian Kreuder Georg Ramm Minna-Liisa nk Donald Wlodkowic Jan Kaslin 《International journal of molecular sciences》2021,22(11)
Mucopolysaccharidosis IIIA (MPS IIIA, Sanfilippo syndrome type A), a paediatric neurological lysosomal storage disease, is caused by impaired function of the enzyme N-sulfoglucosamine sulfohydrolase (SGSH) resulting in impaired catabolism of heparan sulfate glycosaminoglycan (HS GAG) and its accumulation in tissues. MPS IIIA represents a significant proportion of childhood dementias. This condition generally leads to patient death in the teenage years, yet no effective therapy exists for MPS IIIA and a complete understanding of the mechanisms of MPS IIIA pathogenesis is lacking. Here, we employ targeted CRISPR/Cas9 mutagenesis to generate a model of MPS IIIA in the zebrafish, a model organism with strong genetic tractability and amenity for high-throughput screening. The sgshΔex5−6 zebrafish mutant exhibits a complete absence of Sgsh enzymatic activity, leading to progressive accumulation of HS degradation products with age. sgshΔex5−6 zebrafish faithfully recapitulate diverse CNS-specific features of MPS IIIA, including neuronal lysosomal overabundance, complex behavioural phenotypes, and profound, lifelong neuroinflammation. We further demonstrate that neuroinflammation in sgshΔex5−6 zebrafish is largely dependent on interleukin-1β and can be attenuated via the pharmacological inhibition of Caspase-1, which partially rescues behavioural abnormalities in sgshΔex5−6 mutant larvae in a context-dependent manner. We expect the sgshΔex5−6 zebrafish mutant to be a valuable resource in gaining a better understanding of MPS IIIA pathobiology towards the development of timely and effective therapeutic interventions. 相似文献
5.
Helmut Alt Esther M. Arkin Alon Efrat George Hart Ferran Hurtado Irina Kostitsyna Alexander Kröller Joseph S. B. Mitchell Valentin Polishchuk 《Theory of Computing Systems》2014,54(4):689-714
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons. 相似文献
6.
Abstract. A proper coloring of the edges of a graph G is called acyclic if there is no two-colored cycle in G . The acyclic edge chromatic number of G , denoted by a'(G) , is the least number of colors in an acyclic edge coloring of G . For certain graphs G , a'(G)\geq Δ(G)+2 where Δ(G) is the maximum degree in G . It is known that a'(G)≤ Δ + 2 for almost all Δ -regular graphs, including all Δ -regular graphs whose girth is at least cΔ log Δ . We prove that determining the acyclic edge chromatic number of an arbitrary graph is an NP-complete problem. For graphs
G with sufficiently large girth in terms of Δ(G) , we present deterministic polynomial-time algorithms that color the edges of G acyclically using at most Δ(G)+2 colors. 相似文献
7.
Derandomized graph products 总被引:1,自引:0,他引:1
Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to 1 to approximating clique within a factor ofn
(for some ). This reduction was further studied by Blum, who gave it the namerandomized graph products. We show that this reduction can be made deterministic (derandomized), using random walks on expander graphs. The main technical contribution of this paper is in proving a lower bound for the probability that all steps of a random walk stay within a specified set of vertices of a graph. (Previous work was mainly concerned with upper bounds for this probability.) This lower bound extends also to the case where different sets of vertices are specified for different time steps of the walk. 相似文献
8.
Alon Lerner Yiorgos Chrysanthou Ariel Shamir Daniel Cohen‐Or 《Computer Graphics Forum》2010,29(7):2197-2206
Many times, even if a crowd simulation looks good in general, there could be some specific individual behaviors which do not seem correct. Spotting such problems manually can become tedious, but ignoring them may harm the simulation's credibility. In this paper we present a data‐driven approach for evaluating the behaviors of individuals within a simulated crowd. Based on video‐footage of a real crowd, a database of behavior examples is generated. Given a simulation of a crowd, an analog analysis is performed on it, defining a set of queries, which are matched by a similarity function to the database examples. The results offer a possible objective answer to the question of how similar are the simulated individual behaviors to real observed behaviors. Moreover, by changing the video input one can change the context of evaluation. We show several examples of evaluating simulated crowds produced using different techniques and comprising of dense crowds, sparse crowds and flocks. 相似文献
9.
The Meteor Automatic Metric for Machine Translation evaluation, originally developed and released in 2004, was designed with the explicit goal of producing sentence-level scores which correlate well with human judgments of translation quality. Several key design decisions were incorporated into Meteor in support of this goal. In contrast with IBM’s Bleu, which uses only precision-based features, Meteor uses and emphasizes recall in addition to precision, a property that has been confirmed by several metrics as being critical for high correlation with human judgments. Meteor also addresses the problem of reference translation variability by utilizing flexible word matching, allowing for morphological variants and synonyms to be taken into account as legitimate correspondences. Furthermore, the feature ingredients within Meteor are parameterized, allowing for the tuning of the metric’s free parameters in search of values that result in optimal correlation with human judgments. Optimal parameters can be separately tuned for different types of human judgments and for different languages. We discuss the initial design of the Meteor metric, subsequent improvements, and performance in several independent evaluations in recent years. 相似文献
10.
Visualization of heterogeneous data 总被引:1,自引:0,他引:1