全文获取类型
收费全文 | 63篇 |
免费 | 1篇 |
专业分类
化学工业 | 14篇 |
建筑科学 | 4篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 8篇 |
冶金工业 | 4篇 |
自动化技术 | 32篇 |
出版年
2021年 | 2篇 |
2017年 | 1篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 4篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有64条查询结果,搜索用时 0 毫秒
51.
T. Zimmermann G. W. Fischer J. Teller H. Dehne B. Olk 《Advanced Synthesis \u0026amp; Catalysis》1989,331(5):843-852
Pyrylium Compounds. 43. Arylsubstituted 5-(2-Dialkylamino-thiazol-5-yl)-pentadienones from 2,4,6-Triarylpyrylium Salts and 2-Dialkylamino-4-aryl-thiazoles 2,4,6-Triarylpyrylium salts 1 react with 2-dialkylamino-4-aryl-thiazoles 7 (used in substance or prepared in situ from α-thiocyanato-acetophenones 9 ) in the presence of an appropriate acid-binding agent (e.g. piperidine acetate or sodium acetate) to give 5-(2-dialkylamino-4-aryl-thiazol-5-yl)-1,3,5-triaryl-penta-2,4-dien-1-ones 8 . As reaction medium aliphatic alcohols (ethanol, n-propanol), dipolar aprotic solvents (acetonitrile) or chlorinated hydrocarbons (methylene chloride, chloroform) can be used. On the other hand, under the same conditions 2-amino-4-phenyl-thiazole ( 10 ) reacts with salts of type 1 via pyrylium ring transformation yielding 2,4,6-triaryl-1-(4-phenyl-thiazol-2-yl)-pyridinium perchlorates 11 . 相似文献
52.
The synthesis of 4-thiazoline 2-iminium sulfinates ( 3 ) is described. From the salts 3 and NBS the 2-(arylsulfonylimino)-4-thiazolines ( 4 ) were formed, which have also been prepared by oxidation of 2-(arylsulfenylimino)-4-thiazolines ( 5 ) and by reaction of the arylsulfonyl chlorides ( 6 ) with 2-imino-4-thiazolines ( 2 ). The treatment of 5 with NBS (or NIS) in dry solvents results in 2-(arylsulfenylimino)-5-bromo (or iodo)-4-thiazolines ( 7 ); in the presence of NaHCO3 2-(arylsulfonylimino)-5-bromo-4-thiazolines ( 8 ) are formed. 2-(Arylsulfinylimino)-4-thiazolines ( 10 ) have also been halo- genated in the same manner with NBS or NIS to give the products ( 11 ). 相似文献
53.
Amlia Uamusse Heinz Dehne Helmut Reinke Jrgen Dobbertin Christoph Schick Siegmar Diele 《Advanced Synthesis \u0026amp; Catalysis》1998,340(7):608-612
The syntheses and the properties of new sulfurligated liquid crystalline sulfones, containing biphenyl units, as well as the influence of lateral nitro groups on their phase behaviour are described. Differential scanning calorimetry, optical polarizing microscopy and X-ray diffraction measurements reveal liquid crystalline properties for most of the synthesized bis(4-alkoxy-biphenyl-3-yl)sulfones ( 4 ). The mesomorphic behaviour of these compounds is compared with that of the corresponding nitro compounds 6 . The bis(4-alkoxy-6-nitrobiphenyl-3-yl)sulfones ( 6 ) are not mesogenic. The results demonstrate that lateral nitro groups introduced into the biphenyl unit, changing the length-breadth relation, depress the thermal stability and lead to the loss of the mesomorphic properties. 相似文献
54.
The time complexity of searching a sorted list ofn elements in parallel on a coarse grained network of diameterD and consisting ofN processors (wheren may be much larger thanN) is studied. The worst case period and latency of a sequence of pipeline search operation are easity seen to be (logn–logN) and (D+logn–logN), respectively. Since forn=N
1+(1) the worst-case period is (logn) (which can be achieved by a single processor), coarse-grained networks appear to be unsuitable for the search problem. By contrast, it is demonstrated using standard queuing theory techniques that a constant expected period can be achieved provided thatn=O(N2
N
).This research was supported by the Natural Sciences and Engineering Research Council of Canada under Grants A3336 and A9173. 相似文献
55.
External memory (EM) algorithms are designed for large-scale computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Typical EM algorithms are specially crafted for the EM situation. In the past, several attempts have been made to relate the large body of work on parallel algorithms to EM, but with limited success. The combination of EM computing, on multiple disks, with multiprocessor parallelism has been posted as a challenge by the ACM Working Group on Storage I/ O for Large-Scale Computing. In this paper we provide a simulation technique which produces efficient parallel EM algorithms from efficient BSP-like parallel algorithms. The techniques obtained can accommodate one or multiple processors on the EM target machine, each with one or more disks, and they also adapt to the disk blocking factor of the target machine. When applied to existing BSP-like algorithms, our simulation technique produces improved parallel EM algorithms for a large number of problems. 相似文献
56.
We present a randomized parallel list ranking algorithm for distributed memory multiprocessors, using a BSP type model. We first describe a simple version which requires, with high probability, log(3p)+log ln(n)=Õ(logp+log logn) communication rounds (h-relations withh=Õ(n/p)) andÕ(n/p)) local computation. We then outline an improved version that requires high probability, onlyr?(4k+6) log(2/3p)+8=Õ(k logp) communication rounds wherek=min{i?0 |ln(i+1)n?(2/3p)2i+1}. Notekn) is an extremely small number. Forn andp?4, the value ofk is at most 2. Hence, for a given number of processors,p, the number of communication rounds required is, for all practical purposes, independent ofn. Forn?1, 500,000 and 4?p?2048, the number of communication rounds in our algorithm is bounded, with high probability, by 78, but the actual number of communication rounds observed so far is 25 in the worst case. Forn?10010100 and 4?p?2048, the number of communication rounds in our algorithm is bounded, with high probability, by 118; and we conjecture that the actual number of communication rounds required will not exceed 50. Our algorithm has a considerably smaller member of communication rounds than the list ranking algorithm used in Reid-Miller’s empirical study of parallel list ranking on the Cray C-90.(1) To our knowledge, Reid-Miller’s algorithm(1) was the fastest list ranking implementation so far. Therefore, we expect that our result will have considerable practical relevance. 相似文献
57.
In this paper, we study the time-dependent shortest paths problem for two types of time-dependent FIFO networks. First, we consider networks where the availability of links, given by a set of disjoint time intervals for each link, changes over time. Here, each interval is assigned a non-negative real value which represents the travel time on the link during the corresponding interval. The resulting shortest path problem is the time-dependent shortest path problem for availability intervals ( $\mathcal{TDSP}_{\mathrm{int}}$ ), which asks to compute all shortest paths to any (or all) destination node(s) d for all possible start times at a given source node s. Second, we study time-dependent networks where the cost of using a link is given by a non-decreasing piece-wise linear function of a real-valued argument. Here, each piece-wise linear function represents the travel time on the link based on the time when the link is used. The resulting shortest paths problem is the time-dependent shortest path problem for piece-wise linear functions ( $\mathcal{TDSP}_{\mathrm{lin}}$ ) which asks to compute, for a given source node s and destination d, the shortest paths from s to d, for all possible starting times. We present an algorithm for the $\mathcal{TDSP}_{\mathrm{lin}}$ problem that runs in time O((F d +γ)(|E|+|V|log?|V|)) where F d is the output size (i.e., number of linear pieces needed to represent the earliest arrival time function to d) and γ is the input size (i.e., number of linear pieces needed to represent the local earliest arrival time functions for all links in the network). We then solve the $\mathcal{TDSP}_{\mathrm{int}}$ problem in O(λ(|E|+|V|log?|V|)) time by reducing it to an instance of the $\mathcal{TDSP}_{\mathrm{lin}}$ problem. Here, λ denotes the total number of availability intervals in the entire network. Both methods improve significantly on the previously known algorithms. 相似文献
58.
Abstract. External memory (EM) algorithms are designed for large-scale computational problems in which the size of the internal memory
of the computer is only a small fraction of the problem size. Typical EM algorithms are specially crafted for the EM situation.
In the past, several attempts have been made to relate the large body of work on parallel algorithms to EM, but with limited
success. The combination of EM computing, on multiple disks, with multiprocessor parallelism has been posted as a challenge
by the ACM Working Group on Storage I/ O for Large-Scale Computing.
In this paper we provide a simulation technique which produces efficient parallel EM algorithms from efficient BSP-like parallel algorithms. The techniques obtained can accommodate one or multiple processors
on the EM target machine, each with one or more disks, and they also adapt to the disk blocking factor of the target machine.
When applied to existing BSP-like algorithms, our simulation technique produces improved parallel EM algorithms for a large number of problems. 相似文献
59.
Frank Dehne Michael Fellows Michael Langston Frances Rosamond Kim Stevens 《Theory of Computing Systems》2007,41(3):479-492
We describe an algorithm for the Feedback Vertex Set problem on undirected graphs, parameterized
by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the number of vertices in the graph. The best previous algorithms were based on the method of
bounded search trees, branching on short cycles. The best previous running time of an FPT algorithm for this problem, due
to Raman, Saurabh and Subramanian, has a parameter function of the form 2O(k log k /log log k). Whether an exponentially linear in k FPT algorithm for this problem is possible has been previously noted as a significant
challenge. Our algorithm is based on the new FPT technique of iterative compression. Our result holds for a more general form
of the problem, where a subset of the vertices may be marked as forbidden to belong to the feedback set. We also establish
"exponential optimality" for our algorithm by proving that no FPT algorithm with a parameter function of the form O(2o(k)) is possible, unless there is an unlikely collapse of parameterized complexity classes, namely FPT = M[1]. 相似文献
60.