全文获取类型
收费全文 | 4623篇 |
免费 | 57篇 |
专业分类
公路运输 | 966篇 |
综合类 | 1095篇 |
水路运输 | 1501篇 |
铁路运输 | 306篇 |
综合运输 | 812篇 |
出版年
2023年 | 9篇 |
2022年 | 47篇 |
2021年 | 67篇 |
2020年 | 64篇 |
2019年 | 33篇 |
2018年 | 377篇 |
2017年 | 342篇 |
2016年 | 339篇 |
2015年 | 79篇 |
2014年 | 102篇 |
2013年 | 313篇 |
2012年 | 208篇 |
2011年 | 393篇 |
2010年 | 389篇 |
2009年 | 216篇 |
2008年 | 345篇 |
2007年 | 288篇 |
2006年 | 153篇 |
2005年 | 146篇 |
2004年 | 85篇 |
2003年 | 106篇 |
2002年 | 56篇 |
2001年 | 42篇 |
2000年 | 58篇 |
1999年 | 30篇 |
1998年 | 37篇 |
1997年 | 34篇 |
1996年 | 36篇 |
1995年 | 51篇 |
1994年 | 17篇 |
1993年 | 31篇 |
1992年 | 17篇 |
1991年 | 17篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 12篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1972年 | 4篇 |
排序方式: 共有4680条查询结果,搜索用时 15 毫秒
101.
102.
This paper proposes a recursive least squares algorithm for a nonlinear additive system with time delay. By the Weierstrass approximation theorem and the key term separation principle, the model can be simplified as an identification model. Based on the identification model, a recursive least squares identification algorithm is used to estimate all the unknown parameters of the time-delayed additive system. An example is provided to show the effectiveness of the proposed algorithm. 相似文献
103.
Along with higher and higher integration of intellectual properties (IPs) on a single chip, traditional bus-based system-on-chips (SoC) meets several design difficulties (such as low scalability, high power consumption, packet latency and clock tree problem). As a promising solution, network-on-chips (NoC) has been proposed and widely studied. In this work, a novel algorithm for NoC topology synthesis, which is decomposing and cluster refinement (DCR) algorithm, has been proposed to minimize the total power consumption of application-specific NoC. This algorithm is composed of two stages: decomposing with cluster generation, and cluster refinement. For partitioning and cluster generation, an initial low-power solution for NoC topology is generated. For cluster refinement, the clustering is optimized by performing floorplan to further reduce power consumption. Meanwhile, a good tradeoff between power consumption and CPU time can be achieved. Experimental results show that the proposed method outperforms the existing work. 相似文献
104.
张传勇 《上海交通大学学报(英文版)》2016,21(1):33-43
As more and more Chinese and foreign-funded banks settle in the China (Shanghai) Pilot Free Trade Zone (CSPFTZ), it has become an imperative to enhance risk management of offshore banking. At the international level, the regulatory effort for offshore banking mainly focuses on tax evasion and money laundering. Existing regulatory frameworks have established standards to identify countries providing facilities for money laundering and developed punitive measures. In terms of strategy, it is suggested that, firstly, relevant regulatory measures should be improved in the short term, and it is necessary to define the scope of offshore banking and regulatory measures for Chinese banks and foreign-funded banks under a suitable legal framework. Secondly, it is necessary to establish risk exposure mechanism and risk evaluation system for the offshore banking in the CSPFTZ, while risk management measures are implemented based on on-site supervision. Thirdly, in the medium and long term, it is necessary to enhance management of potential risks which can be created by offshore banking due to deregulation. Fourthly, on the one hand, specific regulations should be formulated to provide a regulatory basis for taxation; on the other hand, tax informational exchange agreements (TIEAs) may be used as a reference for achieving effective tax regulation. 相似文献
105.
Paul Musili Wambua 《WMU Journal of Maritime Affairs》2012,11(1):95-113
Since 2008 Kenya has distinguished itself in the global war against piracy by undertaking prosecutions in the national courts
of suspected pirates arrested in the high seas and handed over by navies of leading maritime nations under bilateral agreements
(MOUs) entered into between Kenya and these leading maritime nations. As of July 2011, Kenya had over 20 convicted pirates
serving jail terms ranging between 7 and 20 years and over 100 suspected pirates awaiting trial in national courts. This is
the largest number of suspected pirates held and tried in any one state at any given time in modern history. To achieve this,
Kenya had to effect far reaching changes in the law. In the initial stages, suspected pirates were charged under Kenya’s Penal
Code (Cap 63 Laws of Kenya). However, the high court in the case of Re Mohamud Mohamed Dashi and eight others [2010] eKLR,
ruled that Kenya had no jurisdiction to try suspected pirates under that law. In September 2009, Kenya passed a new law (the
Merchant Shipping Act), which not only defined more comprehensively and extensively the offence of piracy, but also extended
the jurisdiction of Kenyan courts to try piracy committed by non-nationals. Though the law gives Kenya a very broad jurisdiction
to try suspected pirates, the process is still fraught with challenges due to lack of financial and human resources. In the
case of Republic vs Hassan Jama Haleys Alias Hassan Jamal and five others [2010] eKLR, the court commented thus:
“… I must note that the ‘piracy trials’ have presented a unique challenge to the Kenyan legal system. We cannot ignore the fact that these are suspects who having been arrested by foreign naval forces on the High Seas are brought to Kenya for trial. They are strangers in the country, do not understand the legal system, may not know what their rights are and do not understand the language… the Kenyan Government and the International partners supporting these trials put in place a system to provide free legal representation for the suspects…” 相似文献
106.
A novel type of control law was adopted to reduce the vertical acceleration of a fast ferry as well as the motion sickness incidence suffered by the passengers onboard by means of a submerged T-foil. Considering the system changing characteristics under high disturbances, a model-free approach was adopted. In addition, an upgraded proportional-derivative (PD) controller with correction terms resulting from a fast-online estimation of the system dynamics was designed. The overall controller, known as intelligent PD (i-PD) controller, was tested, and the obtained results were compared with those of a classic PD controller. The controllers were also tested in a changing environment and at different operating velocities. The results confirmed the effectiveness of the i-PD controller to smooth the motions with low computational cost control schemes. Furthermore, thanks to ability of the i-PD controller to continually update the estimated dynamics of the system, it showed a better reduction in both vertical motions and the seasickness level of the passengers with the needed robustness under external disturbances and system changing parameters. 相似文献
107.
Full duplex communication highly improves spectrum efficiency of a wireless communication link. However, when it is applied to a cellular network, the capacity gain from this technology remains unknown. The reason is that full duplex communication changes the aggregate interference experienced by each communication link in cellular networks. In this paper, the capacity gain from full duplex communication is studied for cellular networks of 4G and beyond, where the same frequency channel is adopted in each cell. A two-layer Poisson point process (PPP) is adopted to model the network topology, and stochastic geometry is employed to derive the coverage probability and the average capacity of typical link in a cellular network. On the basis of these derived parameters, the capacity gain from full duplex communication is determined. Numerical results reveal that without mutual interference cancellation (MIC), the capacity gain is small under various power levels; with perfect MIC at base stations, the capacity gain can exceed 60%; with imperfect MIC at base stations, the capacity gain decreases quickly even with a slight drop of MIC performance. 相似文献
108.
109.
With the simultaneous rise of energy costs and demand for cloud computing, efficient control of data centers becomes crucial. In the data center control problem, one needs to plan at every time step how many servers to switch on or off in order to meet stochastic job arrivals while trying to minimize electricity consumption. This problem becomes particularly challenging when servers can be of various types and jobs from different classes can only be served by certain types of server, as it is often the case in real data centers. We model this problem as a robust Markov decision process (i.e., the transition function is not assumed to be known precisely). We give sufficient conditions (which seem to be reasonable and satisfied in practice) guaranteeing that an optimal threshold policy exists. This property can then be exploited in the design of an efficient solving method, which we provide. Finally, we present some experimental results demonstrating the practicability of our approach and compare with a previous related approach based on model predictive control. 相似文献
110.
Web page classification is an important application in many fields of Internet information retrieval, such as providing directory classification and vertical search. Methods based on query log which is a light weight version of Web page classification can avoid Web content crawling, making it relatively high in efficiency, but the sparsity of user click data makes it difficult to be used directly for constructing a classifier. To solve this problem, we explore the semantic relations among different queries through word embedding, and propose three improved graph structure classification algorithms. To reflect the semantic relevance between queries, we map the user query into the low-dimensional space according to its query vector in the first step. Then, we calculate the uniform resource locator (URL) vector according to the relationship between the query and URL. Finally, we use the improved label propagation algorithm (LPA) and the bipartite graph expansion algorithm to classify the unlabeled Web pages. Experiments show that our methods make about 20% more increase in F1-value than other Web page classification methods based on query log. 相似文献