全文获取类型
收费全文 | 1056篇 |
免费 | 69篇 |
专业分类
电工技术 | 13篇 |
综合类 | 1篇 |
化学工业 | 289篇 |
金属工艺 | 29篇 |
机械仪表 | 17篇 |
建筑科学 | 32篇 |
矿业工程 | 1篇 |
能源动力 | 72篇 |
轻工业 | 116篇 |
水利工程 | 9篇 |
石油天然气 | 1篇 |
无线电 | 78篇 |
一般工业技术 | 190篇 |
冶金工业 | 82篇 |
原子能技术 | 7篇 |
自动化技术 | 188篇 |
出版年
2023年 | 7篇 |
2022年 | 47篇 |
2021年 | 52篇 |
2020年 | 27篇 |
2019年 | 35篇 |
2018年 | 37篇 |
2017年 | 49篇 |
2016年 | 41篇 |
2015年 | 29篇 |
2014年 | 63篇 |
2013年 | 76篇 |
2012年 | 50篇 |
2011年 | 86篇 |
2010年 | 56篇 |
2009年 | 57篇 |
2008年 | 43篇 |
2007年 | 46篇 |
2006年 | 37篇 |
2005年 | 27篇 |
2004年 | 24篇 |
2003年 | 22篇 |
2002年 | 21篇 |
2001年 | 14篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 16篇 |
1997年 | 12篇 |
1996年 | 14篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 9篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1975年 | 5篇 |
1969年 | 3篇 |
1964年 | 2篇 |
排序方式: 共有1125条查询结果,搜索用时 31 毫秒
11.
Angelo Alessandro Mazzotti 《Nexus Network Journal》2014,16(2):389-415
This paper is about drawing ovals using a given number of certain parameters. New constructions are displayed, including the case when the symmetry axes are not given. Many of these constructions make use of a recent conjecture by Ragazzo, for which a Euclidean proof is found, thus suggesting it might have been known at the time Borromini chose the ovals for the dome of San Carlo alle Quattro Fontane. A geometric proof of the same conjecture—as well as constructions—in the more general case of eggs and polycentric curves is the subject of the first part of this same research (Mazzotti, a Euclidean approach to eggs and polycentric curves, 2014). 相似文献
12.
Luis Carlos da Silva Ramos Joao Shogiro Tango Angelo Savi Nilson Roberto Leal 《Journal of the American Oil Chemists' Society》1984,61(12):1841-1843
Thirty-six castorbean varieties were surveyed for oil and fatty acid composition, in order to determine variability of these
seed compounds. A large variability of seed oil percentage was observed, ranging from 39.6 to 59.5%. Concerning the fatty
acids, little variability was observed for ricinoleic acid, which was the most abundant in the oil, ranging from 83.65 to
90.00%. The other fatty acids appeared in small concentrations and showed a small range: 0.87 to 2.35, 0.68 to 1.84, 2.96
to 5.64, 3.19 to 5.98, and 0.34 to 0.91%, for palmitic, stearic, oleic, linoleic, and linolenic acid, respectively. Non-significant
correlations were observed between fatty acids and seed oil percentage. However, significant correlations were observed among
fatty acid concentrations: positive and negative ones. These significant correlations could be associated with the biosynthetic
pathways of the fatty acids, which are not fully elucidated. They suggest, however, that selection for a particular fatty
acid will tend to increase those positively correlated, and decrease those negative ones. Selection and plant breeding techniques
could then be applied to modify the oil content of the castorbean seeds, considering the variability observed. For the fatty
acid composition, however, the variability was not large enough to make substantial changes in their concentrations by selection
procedures. More varieties should be surveyed to find out if such variability is available. 相似文献
13.
John?Augustine Ioannis?CaragiannisEmail author Angelo?Fanelli Christos?Kalaitzis 《Algorithmica》2015,72(1):44-82
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to share the cost of the network to be established according to a well-defined rule. The design proposed by the network designer should now be consistent not only with the connectivity requirements but also with the selfishness of the users. Essentially, the users are players in a so-called network design game and the network designer has to propose a design that is an equilibrium for this game. As it is usually the case when selfishness comes into play, such equilibria may be suboptimal. In this paper, we consider the following question: can the network designer enforce particular designs as equilibria or guarantee that efficient designs are consistent with users’ selfishness by appropriately subsidizing some of the network links? In an attempt to understand this question, we formulate corresponding optimization problems and present positive and negative results. 相似文献
14.
Adriana Caione Anna Lisa Guido Angelo Martella Roberto Paiano Andrea Pandurino 《Information Systems and E-Business Management》2016,14(3):533-576
Enterprise activities are governed by regulations and laws that are multiple, heterogeneous and not always easy to understand. The arising and/or the modification of these regulations and laws can cause a significant impact in the business context, especially in terms of enterprise information systems adaptation. Currently, there are many methodological and technological tools that facilitate the application of regulations and procedures, but they are not integrated enough to ensure a complete problem management. Therefore, they are not sufficient to support organizations and companies in the management of their business processes. In this paper we propose a methodological and technological solution, able to model, manage, execute and monitor business processes of complex domains. The system allows both the design of an information system and its prototyping as a web application, by the extension of an appropriately selected Business Process Management suite. During both the design and the usage phases of the prototyped information system, it is possible to interface with a knowledge base that contains information about regulations and aspects that characterize the enterprise (organizational chart, tasks, etc.). 相似文献
15.
Angelo Brayner Author Vitae Aretusa Lopes Author Vitae 《Journal of Systems and Software》2008,81(3):328-342
A wireless sensor network (WSN) is composed of tens or hundreds of spatially distributed autonomous nodes, called sensors. Sensors are devices used to collect data from the environment related to the detection or measurement of physical phenomena. In fact, a WSN consists of groups of sensors where each group is responsible for providing information about one or more physical phenomena (e.g., group for collecting temperature data). Sensors are limited in power, computational capacity, and memory. Therefore, a query engine and query operators for processing queries in WSNs should be able to handle resource limitations such as memory and battery life. Adaptability has been explored as an alternative approach when dealing with these conditions. Adaptive query operators (algorithms) can adjust their behavior in response to specific events that take place during data processing. In this paper, we propose an adaptive in-network aggregation operator for query processing in sensor nodes of a WSN, called ADAGA (ADaptive AGgregation Algorithm for sensor networks). The ADAGA adapts its behavior according to memory and energy usage by dynamically adjusting data-collection and data-sending time intervals. ADAGA can correctly aggregate data in WSNs with packet replication. Moreover, ADAGA is able to predict non-performed detection values by analyzing collected values. Thus, ADAGA is able to produce results as close as possible to real results (obtained when no resource constraint is faced). The results obtained through experiments prove the efficiency of ADAGA. 相似文献
16.
The Amazon rainforest is one of the world's greatest natural wonders and holds great importance and significance for the world's environmental balance. Around 60% of the Amazon rainforest is located in the Brazilian territory. The two biggest states of the Amazon region are Amazonas (the upper Amazon) and Pará (the lower Amazon), which together account for around 73% of the Brazilian Legal Amazon, and are the only states that are serviced by international airports in Brazil's north region. The purpose of this paper is to model and forecast sustainable international tourism demand for the states of Amazonas, Pará, and the aggregate of the two states. By sustainable tourism is meant a distinctive type of tourism that has relatively low environmental and cultural impacts. Economic progress brought about by illegal wood extraction and commercial agriculture has destroyed large areas of the Amazon rainforest. The sustainable tourism industry has the potential to contribute to the economic development of the Amazon region without destroying the rainforest. The paper presents unit root tests for monthly and annual data, estimates alternative time series models and conditional volatility models of the shocks to international tourist arrivals, and provides forecasts for 2006 and 2007. 相似文献
17.
Angelo Oddi Riccardo Rasconi Amedeo Cesta Stephen F. Smith 《Annals of Mathematics and Artificial Intelligence》2011,62(3-4):371-402
This paper presents a heuristic algorithm for solving a job-shop scheduling problem with sequence dependent setup times and min/max separation constraints among the activities (SDST-JSSP/max). The algorithm relies on a core constraint-based search procedure, which generates consistent orderings of activities that require the same resource by incrementally imposing precedence constraints on a temporally feasible solution. Key to the effectiveness of the search procedure is a conflict sampling method biased toward selection of most critical conflicts and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This constraint-based search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically both on a set of previously studied job-shop scheduling benchmark problems with sequence dependent setup times and by introducing a new benchmark with setups and generalized precedence constraints. 相似文献
18.
Vittorio Bilò Angelo Fanelli Michele Flammini Luca Moscardelli 《Theory of Computing Systems》2011,49(1):24-45
We investigate the approximation ratio of the solutions achieved after a one-round walk in linear congestion games. We consider the social functions Sum, defined as the sum of the players’ costs, and Max, defined as the maximum cost per player, as a measure of the quality of a given solution. For the social function Sum and one-round walks starting from the empty strategy profile, we close the gap between the upper bound of \(2+\sqrt{5}\approx 4.24\) given in Christodoulou et al. (Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS), LNCS, vol. 3884, pp. 349–360, Springer, Berlin, 2006) and the lower bound of 4 derived in Caragiannis et al. (Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP), LNCS, vol. 4051, pp. 311–322, Springer, Berlin, 2006) by providing a matching lower bound whose construction and analysis require non-trivial arguments. For the social function Max, for which, to the best of our knowledge, no results were known prior to this work, we show an approximation ratio of \(\Theta(\sqrt[4]{n^{3}})\) (resp. \(\Theta(n\sqrt{n})\)), where n is the number of players, for one-round walks starting from the empty (resp. an arbitrary) strategy profile. 相似文献
19.
Franco Cicirelli Angelo Furfaro Andrea Giordano Libero Nigro 《Simulation Modelling Practice and Theory》2011,19(1):283-300
RePast is a popular agent toolkit with proven capabilities to fulfil the modelling challenges of large multi-agent systems (MASs). The toolkit, though, is normally used on a standalone workstation and therefore its practical use can be constrained (in space and time) by the limited available computing resources. This paper proposes an original approach – HLA_ACTOR_REPAST – aimed to distributing RePast models for high-performance simulation of complex scalable models. Novel in HLA_ACTOR_REPAST is an exploitation of a lean actor infrastructure implemented in Java. Actors bring to RePast agents such features as migration, location-transparent naming, efficient communications, and a control-centric framework. Actors can be orchestrated by an in-the-large custom control structure which is in charge of ensuring the necessary message causality constraints. Distribution and time management concerns depend on the IEEE standard HLA middleware. The paper first discusses details of the software engineering process underlying the development of HLA_ACTOR_REPAST. The mapping techniques, assisted by Java text annotations and aspect-oriented programming, try to minimize “code intrusions” in the original model and favour model transparency. The paper then furnishes some experimental data which witness the good performance results achieved by applying HLA_ACTOR_REPAST to a distributed version of a classic MAS benchmark model. 相似文献
20.
Combinatorial testing is as an effective testing technique to reveal failures in a given system, based on input combinations
coverage and combinatorial optimization. Combinatorial testing of strength
t (t ≥ 2) requires that each t-wise tuple of values of the different system input parameters is covered by at least one test case. Combinatorial test suite generation
algorithms aim at producing a test suite covering all the required tuples in a small (possibly minimal) number of test cases,
in order to reduce the cost of testing. The most used combinatorial technique is the pairwise testing (t = 2) which requires coverage of all pairs of input values. Constrained combinatorial testing takes also into account constraints
over the system parameters, for instance forbidden tuples of inputs, modeling invalid or not realizable input values combinations. In this paper a new approach to combinatorial
testing, tightly integrated with formal logic, is presented. In this approach, test predicates are used to formalize combinatorial
testing as a logical problem, and an external formal logic tool is applied to solve it. Constraints over the input domain
are expressed as logical predicates too, and effectively handled by the same tool. Moreover, inclusion or exclusion of select
tuples is supported, allowing the user to customize the test suite layout. The proposed approach is supported by a prototype
tool implementation and results of experimental assessment are also presented. 相似文献