全文获取类型
收费全文 | 202篇 |
免费 | 16篇 |
专业分类
电工技术 | 4篇 |
化学工业 | 56篇 |
金属工艺 | 1篇 |
机械仪表 | 1篇 |
建筑科学 | 11篇 |
能源动力 | 12篇 |
轻工业 | 20篇 |
水利工程 | 2篇 |
无线电 | 17篇 |
一般工业技术 | 49篇 |
冶金工业 | 5篇 |
自动化技术 | 40篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 13篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 16篇 |
2012年 | 15篇 |
2011年 | 21篇 |
2010年 | 15篇 |
2009年 | 11篇 |
2008年 | 6篇 |
2007年 | 12篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有218条查询结果,搜索用时 46 毫秒
101.
Thomas Bolander Hans van Ditmarsch Andreas Herzig Emiliano Lorini Pere Pardo François Schwarzentruber 《Journal of Logic, Language and Information》2016,25(1):1-35
In public announcement logic it is assumed that all agents pay attention to the announcement. Weaker observational conditions can be modelled in action model logic. In this work, we propose a version of public announcement logic wherein it is encoded in the states of the epistemic model which agents pay attention to the announcement. This logic is called attention-based announcement logic. We give an axiomatization of the logic and prove that complexity of satisfiability is the same as that of public announcement logic, and therefore lower than that of action model logic. An attention-based announcement can also be described as an action model. We extend our logic by integrating attention change. Finally, we add the notion of common belief to the language, we exploit this to formalize the concept of joint attention, that has been widely discussed in the philosophical and cognitive science literature, and we provide a corresponding axiomatization. This axiomatization also employs the auxiliary notion of attention-based relativized common belief. 相似文献
102.
Coverage Path Planning with Real‐time Replanning and Surface Reconstruction for Inspection of Three‐dimensional Underwater Structures using Autonomous Underwater Vehicles 下载免费PDF全文
Enric Galceran Ricard Campos Narcís Palomeras David Ribas Marc Carreras Pere Ridao 《野外机器人技术杂志》2015,32(7):952-983
We present a novel method for planning coverage paths for inspecting complex structures on the ocean floor using an autonomous underwater vehicle (AUV). Our method initially uses a 2.5‐dimensional (2.5D) prior bathymetric map to plan a nominal coverage path that allows the AUV to pass its sensors over all points on the target area. The nominal path uses a standard mowing‐the‐lawn pattern in effectively planar regions, while in regions with substantial 3D relief it follows horizontal contours of the terrain at a given offset distance. We then go beyond previous approaches in the literature by considering the vehicle's state uncertainty rather than relying on the unrealistic assumption of an idealized path execution. Toward that end, we present a replanning algorithm based on a stochastic trajectory optimization that reshapes the nominal path to cope with the actual target structure perceived in situ. The replanning algorithm runs onboard the AUV in real time during the inspection mission, adapting the path according to the measurements provided by the vehicle's range‐sensing sonars. Furthermore, we propose a pipeline of state‐of‐the‐art surface reconstruction techniques we apply to the data acquired by the AUV to obtain 3D models of the inspected structures that show the benefits of our planning method for 3D mapping. We demonstrate the efficacy of our method in experiments at sea using the GIRONA 500 AUV, where we cover part of a breakwater structure in a harbor and an underwater boulder rising from 40 m up to 27 m depth. 相似文献
103.
The aim of this paper is to propose an argumentation-based defeasible logic, called t-DeLP, that focuses on forward temporal reasoning for causal inference. We extend the language of the DeLP logical framework by associating temporal parameters to literals. A temporal logic program is a set of basic temporal facts and (strict or defeasible) durative rules. Facts and rules combine into durative arguments representing temporal processes. As usual, a dialectical procedure determines which arguments are undefeated, and hence which literals are warranted, or defeasibly follow from the program. t-DeLP, though, slightly differs from DeLP in order to accommodate temporal aspects, like the persistence of facts. The output of a t-DeLP program is a set of warranted literals, which is first shown to be non-contradictory and be closed under sub-arguments. This basic framework is then modified to deal with programs whose strict rules encode mutex constraints. The resulting framework is shown to satisfy stronger logical properties like indirect consistency and closure. 相似文献
104.
Ramzi Belhassen José Alberto Méndez Sami Boufi Joan Pere López Josep Puig Angels Pèlach Pere Mutjé 《应用聚合物科学杂志》2009,114(1):313-321
In this work, preparation and properties of biocomposites based on jute fibers and blend of plasticized starch and poly(β‐hydroxybutyrate) (PHB) have been investigated. Different amounts of glycerol and aliphatic polyesters (PHB) have been added to native starch to obtain a processable biodegradable matrix. In the same way natural jute fibers up to 30 wt % loading were added to improve the mechanical and thermal stability of the material. Tensile mechanical, thermal, and thermomecahnical analyses have been performed to characterize the ensuing materials. Significant enhancement in the mechanical properties and water sensitivity were noted by the addition of 8 wt % PHB. The fibers incorporation into the biopolymer matrix brings about an increase in both the mechanical strength and modulus as much higher as the fibers loading is important. © 2009 Wiley Periodicals, Inc. J Appl Polym Sci, 2009 相似文献
105.
Sarah Schneider Mariana Gutiérrez Tatyana Sandalova Dr. Gunter Schneider Prof. Dr. Pere Clapés Dr. Georg A. Sprenger Prof. Dr. Anne K. Samland Dr. 《Chembiochem : a European journal of chemical biology》2010,11(5):681-690
Recently, we reported on a transaldolase B variant (TalB F178Y) that is able to use dihydroxyacetone (DHA) as donor in aldol reactions. In a second round of protein engineering, we aimed at improving the affinity of this variant towards nonphosphorylated acceptor aldehydes, that is, glyceraldehyde (GA). The anion binding site was identified in the X‐ray structure of TalB F178Y where a sulfate ion from the buffer was bound in the active site. Therefore, we performed site‐directed saturation mutagenesis at three residues forming the putative phosphate binding site, Arg181, Ser226 and Arg228. The focused libraries were screened for the formation of D ‐fructose from DHA and d,l ‐GA by using an adjusted colour assay. The best results with respect to the synthesis of D ‐fructose were achieved with the TalB F178Y/R181E variant, which exhibited an at least fivefold increase in affinity towards d,l ‐GA (KM=24 mM ). We demonstrated that this double mutant can use D ‐GA, glycolaldehyde and the L ‐isomer, L ‐GA, as acceptor substrates. This resulted in preparative synthesis of D ‐fructose, D ‐xylulose and L ‐sorbose when DHA was used as donor. Hence, we engineered a DHA‐dependent aldolase that can synthesise the formation of polyhydroxylated compounds from simple and cheap substrates at preparative scale. 相似文献
106.
Rafel Xampeny Pere Grima Xavier Tort‐Martorell 《Quality and Reliability Engineering International》2019,35(4):934-945
This article analyzes the increase in the probability of committing type I and type II errors in assessing the significance of the effects when some properly selected runs have not been carried out, and their responses have been estimated from the interactions considered null from scratch. This is done by simulating the responses from known models that represent a wide variety of practical situations that the experimenter will encounter; the responses considered to be missing are then estimated, and the significance of the effects is assessed. Through comparison with the parameters of the model, the errors are then identified. To assess the significance of the effects when there are missing values, the Box‐Meyer method has been used. The conclusions are that one missing value in eight run designs, and up to three missing values in 16 run designs experiments can be estimated without hardly any notable increase in the probability of error when assessing the significance of the effects. 相似文献
107.
Raoul Walther Pere Monge Andreas Bøtker Pedersen Anja Benderoth Jannik Nedergaard Pedersen Azad Farzadfard Ole A. Mandrup Kenneth A. Howard Daniel E. Otzen Prof. Alexander N. Zelikin 《Chembiochem : a European journal of chemical biology》2021,22(14):2478-2485
Chemical glycosylation of proteins is a powerful tool applied widely in biomedicine and biotechnology. However, it is a challenging undertaking and typically relies on recombinant proteins and site-specific conjugations. The scope and utility of this nature-inspired methodology would be broadened tremendously by the advent of facile, scalable techniques in glycosylation, which are currently missing. In this work, we investigated a one-pot aqueous protocol to achieve indiscriminate, surface-wide glycosylation of the surface accessible amines (lysines and/or N-terminus). We reveal that this approach afforded minimal if any change in the protein activity and recognition events in biochemical and cell culture assays, but at the same time provided a significant benefit of stabilizing proteins against aggregation and fibrillation - as demonstrated on serum proteins (albumins and immunoglobulin G, IgG), an enzyme (uricase), and proteins involved in neurodegenerative disease (α-synuclein) and diabetes (insulin). Most importantly, this highly advantageous result was achieved via a one-pot aqueous protocol performed on native proteins, bypassing the use of complex chemical methodologies and recombinant proteins. 相似文献
108.
Pere Brunet Isabel Navazo Jarek Rossignac & Carlos Saona-Vázquez 《Computer Graphics Forum》2001,20(3):431-442
Most visibility culling algorithms require convexity of occluders. Occluder synthesis algorithms attempt to construct large convex occluders inside bulky non-convex sets. Occluder fusion algorithms generate convex occluders that are contained in the umbra cast by a group of objects given an area light. In this paper we prove that convexity requirements can be shifted from the occluders to their umbra with no loss of efficiency, and use this property to show how some special non-planar, non-convex closed polylines that we call "hoops" can be used to compute occlusion efficiently for objects that have no large interior convex sets and were thus rejected by previous approaches. 相似文献
109.
Xavier Garrabou Jesús Joglar Teodor Parella Ramon Crehuet Jordi Bujons Pere Claps 《Advanced Synthesis \u0026amp; Catalysis》2011,353(1):89-99
The aldol addition of unphosphorylated dihydroxyacetone (DHA) to aldehydes catalyzed by L ‐rhamnulose‐1‐phosphate aldolase (RhuA), a dihydroxyacetone phosphate‐dependent aldolase, is reported. Moreover, a single point mutation in the phosphate binding site of the RhuA wild type, that is, substitution of aspartate for asparagine at position N29, increased by 3‐fold the of aldol addition reactions of DHA to other aldehyde acceptors rather than the natural L ‐lactaldehyde. The RhuA N29D mutant modified the optimum enzyme design for the natural substrate and changed its catalytic properties making the aldolase more versatile to other aldol additions of DHA. 相似文献
110.