全文获取类型
收费全文 | 119篇 |
免费 | 10篇 |
专业分类
化学工业 | 10篇 |
金属工艺 | 10篇 |
机械仪表 | 5篇 |
建筑科学 | 2篇 |
能源动力 | 2篇 |
轻工业 | 14篇 |
水利工程 | 2篇 |
无线电 | 4篇 |
一般工业技术 | 25篇 |
冶金工业 | 23篇 |
自动化技术 | 32篇 |
出版年
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 4篇 |
2015年 | 4篇 |
2014年 | 2篇 |
2013年 | 2篇 |
2012年 | 3篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 10篇 |
2007年 | 5篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有129条查询结果,搜索用时 0 毫秒
1.
ABSTRACT: Crack development during freezing (CDF) is one of the major challenges in individually quick frozen (IQF) cut and peel carrot processing. The effects of processing and freezer storage on crack development were examined on the cut and peel carrot variety, Sugarsnax. Carrot samples were removed from the major processing steps, the trans-slicer, the shaper, the blancher, and the dryer, and examined for crack development by measuring percentage cracked, crack morphology, total soluble solids, moisture levels, and membrane injury index immediately after processing. These parameters were also examined following 20 wk of standard freezer storage for cut and peels. Approximately 2% of nonprocessed carrots were cracked compared to 45% of carrots after the initial trans-slicing stage. As the processing continued, cracking decreased due to the removal of the outer epidermis to 16% of the finished product. This suggests that CDF was initiated at the 1st processing stage. Crack width and depth were 2.3 and 2.6 mm, respectively, at the trans-slicer stage and decreased to 1.1 and 1.8 mm at the end of the line. It was found that CDF was further exacerbated by freezer storage due to inefficient water removal at the dryer stage. Crack width and depth increased to 1.5 and 3.0 mm after 20 wk for freezer storage. Root size also played a role in CDF, suggesting that larger pieces are more susceptible to crack development. Total soluble solid concentrations did not play a role in crack formation during cut and peel processing. 相似文献
2.
Efficient tile sets for self assembling rectilinear shapes is of critical importance in algorithmic self assembly. A lower bound on the tile complexity of any deterministic self assembly system for an n?×?n square is $\Upomega(\frac{\log(n)}{\log(\log(n))})$ (inferred from the Kolmogrov complexity). Deterministic self assembly systems with an optimal tile complexity have been designed for squares and related shapes in the past. However designing $\Uptheta(\frac{\log(n)}{\log(\log(n))})$ unique tiles specific to a shape is still an intensive task in the laboratory. On the other hand copies of a tile can be made rapidly using PCR (polymerase chain reaction) experiments. This led to the study of self assembly on tile concentration programming models. We present two major results in this paper on the concentration programming model. First we show how to self assemble rectangles with a fixed aspect ratio (??:??), with high probability, using $\Uptheta(\alpha+\beta)$ tiles. This result is much stronger than the existing results by Kao et?al. (Randomized self-assembly for approximate shapes, LNCS, vol 5125. Springer, Heidelberg, 2008) and Doty (Randomized self-assembly for exact shapes. In: proceedings of the 50th annual IEEE symposium on foundations of computer science (FOCS), IEEE, Atlanta. pp 85?C94, 2009)??which can only self assembly squares and rely on tiles which perform binary arithmetic. On the other hand, our result is based on a technique called staircase sampling. This technique eliminates the need for sub-tiles which perform binary arithmetic, reduces the constant in the asymptotic bound, and eliminates the need for approximate frames (Kao et?al. Randomized self-assembly for approximate shapes, LNCS, vol 5125. Springer, Heidelberg, 2008) . Our second result applies staircase sampling on the equimolar concentration programming model (The tile complexity of linear assemblies. In: proceedings of the 36th international colloquium automata, languages and programming: Part I on ICALP ??09, Springer-Verlag, pp 235?C253, 2009), to self assemble rectangles (of fixed aspect ratio) with high probability. The tile complexity of our algorithm is $\Uptheta(\log(n))$ and is optimal on the probabilistic tile assembly model (PTAM)??n being an upper bound on the dimensions of a rectangle. 相似文献
3.
4.
Tumor detection in T1, T2, FLAIR and MPR brain images using a combination of optimization and fuzzy clustering improved by seed‐based region growing algorithm
下载免费PDF全文
![点击此处可从《International journal of imaging systems and technology》网站下载免费的PDF全文](/ch/ext_images/free.gif)
G. Vishnuvarthanan M. Pallikonda Rajasekaran N. Anitha Vishnuvarthanan T. Arun Prasath M. Kannan 《International journal of imaging systems and technology》2017,27(1):33-45
Tumor and Edema region present in Magnetic Resonance (MR) brain image can be segmented using Optimization and Clustering merged with seed‐based region growing algorithm. The proposed algorithm shows effectiveness in tumor detection in T1 ‐ w, T2 – w, Fluid Attenuated Inversion Recovery and Multiplanar Reconstruction type MR brain images. After an initial level segmentation exhibited by Modified Particle Swarm Optimization (MPSO) and Fuzzy C – Means (FCM) algorithm, the seed points are initialized using the region growing algorithm and based on these seed points; tumor detection in MR brain images is done. The parameters taken for comparison with the conventional techniques are Mean Square Error, Peak Signal to Noise Ratio, Jaccard (Tanimoto) index, Dice Overlap indices and Computational Time. These parameters prove the efficacy of the proposed algorithm. Heterogeneous type tumor regions present in the input MR brain images are segmented using the proposed algorithm. Furthermore, the algorithm shows augmentation in the process of brain tumor identification. Availability of gold standard images has led to the comparison of the suggested algorithm with MPSO‐based FCM and conventional Region Growing algorithm. Also, the algorithm recommended through this research is capable of producing Similarity Index value of 0.96, Overlap Fraction value of 0.97 and Extra Fraction value of 0.05, which are far better than the values articulated by MPSO‐based FCM and Region Growing algorithm. The proposed algorithm favors the segmentation of contrast enhanced images. © 2017 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 27, 33–45, 2017 相似文献
5.
Optimisation is the process of trying to find out the best possible solution to any problem satisfying constraints. Soft computing is the class of methods which have been inspired by the biological computational methods and nature's problem-solving strategies. Currently, these methods include neural networks, evolutionary computational models such as genetic algorithms, random cost and linguistic models such as fuzzy logic. Ant colony optimisation (ACO) is one such method applied for large engineering combinatorial optimisation problems. A design procedure utilising an ACO technique is developed for discrete optimisation of reticulated steel space trusses. The ACO algorithm is motivated by the analogy with natural phenomena, in particular the ability of a colony of ants to ‘optimise’ their collective endeavours. In this paper, the computational implementation of ACO is presented in a structural design context. The objective function considered is the total weight/cost of the structure subjected to material and performance constraints in the form of stress and deflection limits. In the case of reticulated space trusses, the design variables are the cross-sectional areas of members belonging to various groups. The objective function and constraints are obtained by using structural analysis package FEAST (Anonymous, 1995. FEAST user manual. Trivandrum, India: SEG, SDS Group, ISRO, VSSC) in case of structures subjected to static loading and SAP90 (Anonymous, 1990. SAP90, ETABS, SAFE – computer software for structural and earthquake engineering. Berkeley, CA: Computers and Structures) for earthquake loading for reticulated steel space trusses. The numerical examples presented demonstrate the computational advantage of the ACO for large-scale optimisation problems. 相似文献
6.
Application of Sequential Learning Neural Networks to Civil Engineering Modeling Problems 总被引:1,自引:0,他引:1
A sequential orthogonal approach to the building and training of a single hidden layer neural network is presented in this
paper. The Sequential Learning Neural Network (SLNN) model proposed by Zhang and Morris [1]is used in this paper to tackle
the common problem encountered by the conventional Feed Forward Neural Network (FFNN) in determining the network structure
in the number of hidden layers and the number of hidden neurons in each layer. The procedure starts with a single hidden neuron
and sequentially increases in the number of hidden neurons until the model error is sufficiently small. The classical Gram–Schmidt
orthogonalization method is used at each step to form a set of orthogonal bases for the space spanned by output vectors of
the hidden neurons. In this approach it is possible to determine the necessary number of hidden neurons required. However,
for the problems investigated in this paper, one hidden neuron itself is sufficient to achieve the desired accuracy. The neural
network architecture has been trained and tested on two practical civil engineering problems – soil classification, and the
prediction o strength and workability of high performance concrete. 相似文献
7.
8.
9.
S. Sathikh S. Rajasekaran Jayakumar C. Jebaraj 《Canadian Metallurgical Quarterly》2000,126(2):132-139
A general discrete thin rod model to study the preslip response of a strand of helical wires having wires-to-core friction contacts under constant curvature free bending has been developed for the case of Coulomb stick friction that considers together (a) all the three wire forces and three wire couples; (b) more appropriate equations for the wire shear forces; (c) the wire normal force as one of the contributors to strand bending moment; (d) wire external equilibrium; and (e) wire rolling with or without zero net shear on the strand cross section. The individual contributions of wire forces and couples to the strand bending moment for 10 models including EPRI model are compared. Several earlier models are shown to be special cases of the present general model. 相似文献
10.
S. V. Rajasekaran T. Tite Y.-M. Chang R. Sankar F. C. Chou 《Journal of Materials Science》2011,46(23):7582-7587
We have investigated the structural and magnetic properties of Fe1.15Te and Fe1.03Te0.62Se0.38 single crystals grown by slow cooling method using a specially designed double-walled quartz ampoule. X-ray diffraction reveals
significant local inhomogeneity as a result of fractional substitution of Te site by Se in single crystal Fe1.03Te0.62Se0.38. The existence of superconductivity is confirmed for Se substitution to the Te site of Fe1.03Te0.62Se0.38 but with persistent Fe7Se8 impurity phase. Raman spectroscopy confirmed the surface structural instability when the samples were exposed to moderate
laser irradiation in the atmospheric environment. With high intensity laser irradiation, Fe(Se,Te) compounds can be decomposed
into Fe2O3 hematite phase. 相似文献