全文获取类型
收费全文 | 194篇 |
免费 | 11篇 |
学科分类
工业技术 | 205篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 8篇 |
2018年 | 13篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 15篇 |
2012年 | 20篇 |
2011年 | 6篇 |
2010年 | 11篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 3篇 |
1979年 | 1篇 |
1976年 | 2篇 |
1968年 | 1篇 |
排序方式: 共有205条查询结果,搜索用时 46 毫秒
1.
2.
3.
This paper studies the behavior of motions of large-scale (LS) semistate systems (SSS) governed byP
i
(t)x
i
=M
i
(t,x
i
)x
i
+f
i
(t)+h
i
(t, x), i=1,2,...,s, =(x
1
T
x
2
T
x
s
T
)T, where matricesP
i
(t) are singular. Using Lyapunov's approach and the tools for LS system analysis, a variant of attractivity and ultimate boundedness of appropriate time-variable sets are investigated. The results are based on a specific choice of the aggregate functions. It is assumed that the reduction of equations to a normal form of lower order is inconvenient. The aggregation-decomposition approach used in this paper reduces the dimensionality of an aggregate matrix of the system to the number of its systems. Motion properties of LS systems are deduced from the properties of its isolated subsystems, the character of interconnections, and the conditions imposed on the system aggregate matrix. Sufficient algebraic conditions for the above-mentioned motion properties are developed. 相似文献
4.
Roshan Lalintha Peiris Mili John Tharakan Owen Noel Newton Fernando Adrian David Cheok 《Multimedia Tools and Applications》2013,66(1):81-94
This paper presents, AmbiKraf, a non-emissive fabric display that subtly animates patterns on common fabrics. We use thermochromic inks and peltier semiconductor elements to achieve this technology. With this technology we have produced numerous prototypes from animated wall paintings to pixilated fabric displays. The ability of this technology to subtly and ubiquitously change the color of the fabric itself has made us able to merge different fields and technologies with AmbiKraf. In addition, with an animated room divider screen, Ambikraf merged its technology with Japanese Byobu art to tighten the gap between traditional arts and contemporary technologies. Through this AmbiKraf Byobu art installation and other installations, we discuss the impact of this technology as a ubiquitous fabric display. With focus to improvements of some limitations of the existing system, we present our future vision that enables us to merge this technology into more applications fields thus making this technology a platform for ubiquitous interactions on our daily peripherals. 相似文献
5.
Hakim Akeb Mhand Hifi Rym M'Hallah 《International Transactions in Operational Research》2010,17(5):553-575
This paper addresses the circular packing problem (CPP), which consists in packing n circles Ci, each of known radius ri, i∈N={1, …, n}, into the smallest containing circle C. The objective is to determine the radius r of C as well as the coordinates (xi, yi) of the center of Ci, i∈N. CPP is solved using two adaptive algorithms that adopt a binary search to determine r, and a beam search to check the feasibility of packing n circles into C when the radius is fixed at r. A node of level ?, ?=1, …, n, of the beam search tree corresponds to a partial packing of ? circles of N into C. The potential of each node of the tree is assessed using a lookahead strategy that, starting with the partial packing of the current node, assigns each unpacked circle to its maximum hole degree position. The beam search stops either when the lookahead strategy identifies a feasible packing or when it has fathomed all nodes. The computational tests on a set of benchmark instances show the effectiveness of the proposed adaptive algorithms. 相似文献
6.
This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M’Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model. 相似文献
7.
Many decision-makers in industry, government and academia routinely make decisions whose outcome depends on the evolution of software technology trends. Even though the stakes of these decisions are usually very high, decision makers routinely depend on expert opinions and qualitative assessments to model the evolution of software technology; both of these sources of decision-making information are subjective, are based on opinions rather than facts, and are prone to error. In this paper, we report on our ongoing work to build quantitative models of the evolution of software technology trends. In particular, we discuss how we took specific evolutionary models and merged them into a single (general-purpose) model. The original specific models are derived empirically using statistical methods on trend data we had collected over several years, and have been validated individually; in this paper we further validate the generic (general-purpose) model. 相似文献
8.
Design patterns codify proven solutions to recurring design problems. Their proper use within a development context requires that: (i) we understand them; (ii) we ascertain their applicability or relevance to the design problem at hand; and (iii) we apply them faithfully to the problem at hand. We argue that an explicit representation of the design problem solved by a design pattern is key to supporting the three tasks in an integrated fashion. We propose a model‐driven representation of design patterns consisting of triples < MP, MS, T > where MP is a model of the problem solved by the pattern, MS is a model of the solution proposed by the pattern, and T is a model transformation of an instance of the problem into an instance of the solution. Given an object‐oriented design model, we look for model fragments that match MP (call them instances of MP), and when one is found, we apply the transformation T yielding an instance of MS. Easier said than done. Experimentation with an Eclipse Modeling Framework‐based implementation of our approach applied to a number of open‐source software application's raised fundamental questions about: (i) the nature of design patterns in general, and the ones that lend themselves to our approach, and (ii) our understanding and codification of seemingly simple design patterns. In this paper, we present the principles behind our approach, report on the results of applying the approach to the Gang of Four (GoF) design patterns, and discuss the representability of design problems solved by these patterns. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
9.
10.
Ben Ammar Nour Elhouda Essid Rym Saied Taieb en Murat Elkahoui Salem Hamzaoui Ahmed Hichem 《Polymer Bulletin》2020,77(3):1343-1357
Polymer Bulletin - The aim of this study was to elaborate a suitable hydrogel to be used as drug carrier for antileishmanial treatment. Therefore, a PVP hydrogel was synthesized using gamma... 相似文献