A new tool for rapid development of electron microscopy negatives and micrographs: Initial impressions of the MOHR/PRO-8 processor

Author(s):  
James C. Long

Over the years, many techniques and products have been developed to reduce the amount of time spent in a darkroom processing electron microscopy negatives and micrographs. One of the latest tools, effective in this effort, is the Mohr/Pro-8 film and rc paper processor.At the time of writing, a unit has been recently installed in the photographic facilities of the Electron Microscopy Center at Texas A&M University. It is being evaluated for use with TEM sheet film, SEM sheet film, 35mm roll film (B&W), and rc paper.Originally designed for use in the phototypesetting industry, this processor has only recently been introduced to the field of electron microscopy.The unit is a tabletop model, approximately 1.5 × 1.5 × 2.0 ft, and uses a roller transport method of processing. It has an adjustable processing time of 2 to 6.5 minutes, dry-to-dry. The installed unit has an extended processing switch, enabling processing times of 8 to 14 minutes to be selected.

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2220
Author(s):  
Georg Saxl ◽  
Manuel Ferdik ◽  
Moritz Fischer ◽  
Martin Maderboeck ◽  
Thomas Ussmueller

Ultra high frequency radio frequency identification (UHF RFID) is becoming a key technology in the Internet of Things. It allows the implementation of batteryless and wireless nodes, including sensors and actuators. Due to its possible transmission range of >10 m and potential to carry critical information, security is a highly important topic. For this reason, the International Organization for Standardization has published several crypto suites for UHF RFID within the ISO-29167 standard in 2014. Recently, research has focused on implementing those encryption features on the transponder side. However, currently no crypto enabled UHF RFID readers are available. In order to cope with the rapid development in this field, ‘open’ and flexible readers based on software defined radios are needed. They make it possible to quickly adapt the protocol and to test new functionalities such as encryption. This paper deals with the first implementation of the ISO 29167-19 standardized RAMON decryption on a software defined radio. The programming of this hardware is done in LabVIEW which allows for controlling the built-in transceiver modules. However, first measurements show that the decryption takes 51 s. This is because LabVIEW is not suitable for handling very large numbers like they are utilized in cryptography. Because such a long processing time is not feasible in experiments nor in a real-life scenarios, this method is not suitable for a prototyping platform. Thus, a different approach is chosen to optimize the decryption processing time. LabVIEW still provides the framework for handling the protocol and controlling the transceivers, but the decryption is performed in a Java application. In that way, the entire decryption process takes only about 2.2 ms, which is 23,318 times faster than the implementation in LabVIEW. Thus, this new approach meets the necessary timing requirements and is suitable for realistic application scenarios. The shown method allows development and testing of new functionalities in UHF RFID systems but may also be employed in any application that require long processing times in LabVIEW. Furthermore, the implementation of decryption features is the first necessary step towards a fully compliant, crypto enabled interrogator for UHF RFID, featuring a high adaptability.


2016 ◽  
Vol 33 (01) ◽  
pp. 1650001 ◽  
Author(s):  
Chun-Lai Liu ◽  
Jian-Jun Wang

In this paper, we study the problem of unrelated parallel machine scheduling with controllable processing times and deteriorating maintenance activity. The jobs are nonresumable. The processing time of each job is a linear function of the amount of a continuously divisible resource allocated to the job. During the planning horizon, there is at most one maintenance activity scheduled on each machine. Additionally, if the starting time of maintenance activity is delayed, the length of the maintenance activity required to perform will increase. Considering the total completion times of all jobs, the impact of maintenance activity in the form of the variation in machine load and the amounts of compression, we need to determine the job sequence on each machine, the location of maintenance activities and processing time compression of each job simultaneously. Accordingly, a polynomial time solution to the problem is provided.


2013 ◽  
Vol 534 ◽  
pp. 141-145 ◽  
Author(s):  
Yuto Hakamada ◽  
Shunji Ozaki

SiOx nanowires were grown on Si substrates by a simple vapor transport method of heating the mixture of silicon monoxide and carbon powders at 1000 °C in a tube of the furnace. The dependence of the growth velocity on the growth temperature and on the radius of nanowires indicates that the SiOx nanowires grow through the vaporliquidsolid (VLS) growth mechanism. The properties of the nanowires are characterized using scanning electron microscopy (SEM), X-ray photoelectron spectroscopy (XPS), and photoluminescence (PL).


1986 ◽  
Vol 23 (03) ◽  
pp. 841-847 ◽  
Author(s):  
R. R. Weber ◽  
P. Varaiya ◽  
J. Walrand

A number of jobs are to be processed using a number of identical machines which operate in parallel. The processing times of the jobs are stochastic, but have known distributions which are stochastically ordered. A reward r(t) is acquired when a job is completed at time t. The function r(t) is assumed to be convex and decreasing in t. It is shown that within the class of non-preemptive scheduling strategies the strategy SEPT maximizes the expected total reward. This strategy is one which whenever a machine becomes available starts processing the remaining job with the shortest expected processing time. In particular, for r(t) = – t, this strategy minimizes the expected flowtime.


2015 ◽  
Vol 55 (1) ◽  
pp. 113 ◽  
Author(s):  
Eva Salazar ◽  
Adela Abellán ◽  
José M. Cayuela ◽  
Ángel Poto ◽  
Francisco Girón ◽  
...  

The compositional and sensory parameters of Chato Murciano dry-cured ham at different ripening times (14, 18, 22 and 24 months of processing) were studied. A sensory consumer study of dry-cured ham with a short ripening stage (14 months of processing) and a similar ham with a long ripening stage (22 months of processing) was carried out. Dry-cured hams remained in the ripening stage at 18−20°C and 70–75% relative humidity. The different processing times studied had no effect on the ash, intramuscular fat, sodium chloride and protein contents of the final ham, but significantly affected the moisture (P < 0.05) and saturated (P < 0.01) and monounsaturated (P < 0.05) fatty acid contents. Sensory analysis showed that processing time enhanced redness, fat colour, all of the odour and flavour traits studied, and all the texture traits except juiciness. In the taste profile, only saltiness showed a significant increase. However, sensory changes were only significant up to 22 months of processing (for most of the parameters), the resulting ham showing higher level of consumer preference and acceptability than dry-cured ham with the shorter ripening. Based on these results, it is recommended that an appropriate processing time to obtain a high-quality Chato Murciano dry-cured ham is 22 months.


2020 ◽  
Vol 12 (2) ◽  
pp. 1-21
Author(s):  
Helge Nissen ◽  
Monique Janneck

Participants increasingly use mobile devices, especially smartphones, to fill out online questionnaires. However, standard questionnaire templates are often not optimized for presentation on smartphones, raising the question of whether an unfavorable layout may influence the survey results. In this study, interaction with questionnaires on different devices was investigated regarding processing time, data quality, and user experience of the questionnaire itself. Several standard and newly developed questionnaire layout templates were evaluated by means of an online study (N=301). Results show that processing times are higher on smartphones compared to desktop computers. However, there were no differences regarding data quality. The comparison of different mobile layouts among smartphone users revealed effects on processing time and user experience. Design recommendations are derived.


Author(s):  
Cepi Ramdani ◽  
Indah Soesanti ◽  
Sunu Wibirama

Fuzzy C Means algorithm or FCM is one of many clustering algorithms that has better accuracy to solve problems related to segmentation. Its application is almost in every aspects of life and many disciplines of science. However, this algorithm has some shortcomings, one of them is the large amount of processing time consumption. This research conducted mainly to do an analysis about the effect of segmentation parameters towards processing time in sequential and parallel. The other goal is to reduce the processing time of segmentation process using parallel approach. Parallel processing applied on Nvidia GeForce GT540M GPU using CUDA v8.0 framework. The experiment conducted on natural RGB color image sized 256x256 and 512x512. The settings of segmentation parameter values were done as follows, weight in range (2-3), number of iteration (50-150), number of cluster (2-8), and error tolerance or epsilon (0.1 – 1e-06). The results obtained by this research as follows, parallel processing time is faster 4.5 times than sequential time with similarity level of image segmentations generated both of processing types is 100%. The influence of segmentation parameter values towards processing times in sequential and parallel can be concluded as follows, the greater value of weight parameter then the sequential processing time becomes short, however it has no effects on parallel processing time. For iteration and cluster parameters, the greater their values will make processing time consuming in sequential and parallel become large. Meanwhile the epsilon parameter has no effect or has an unpredictable tendency on both of processing time.


2001 ◽  
Vol 15 (4) ◽  
pp. 465-479 ◽  
Author(s):  
Ger Koole ◽  
Rhonda Righter

We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flow time. The problem is much more difficult than the corresponding deterministic problem, and the optimal policy may have many counterintuitive properties. We prove various structural properties of the optimal policy and use these to develop a polynomial-time algorithm to compute the optimal policy.


Author(s):  
Zalinda Othman ◽  
Shahrul Kamaruddin ◽  
Mohd. Shihabudin Ismail

Artikel ini membincangkan peruntukan penampan optimum untuk talian pengeluaran unpaced yang pendek dan boleh diharap (tiada mesin rosak). Parameter utama yang mempengaruhi talian dalam kajian ini adalah min masa pemprosesan (μ) dan pekali variasinya (Cv). Lapan taburan min masa pemprosesan telah dikaji. Setiap taburan dipadankan dengan 15 konfigurasi peruntukan penampan. Kaedah simulasi digunakan bagi menganggar kadar keluaran talian untuk setiap kes. Keputusan kajian menunjukkan peruntukan penampan tertentu mempengaruhi kadar keluaran talian. Bagi talian yang boleh diharap dan min seimbang, peruntukan penampan yang optima adalah dengan mengagihkan bilangan penampan secara sama rata ke setiap slot penampan. Jika penampan tambahan diperlukan selepas agihan dilakukan, letakkan penampan tambahan tersebut pada slot penampan yang di tengah. Manakala bentuk peruntukan penampan yang baik bagi talian yang mempunyai min tidak seimbang (dengan anggapan setiap stesen mempunyai Cv tetap dan boleh diharap) ialah mengikut bentuk taburan min masa pemprosesan talian tersebut. Kata kunci: Talian pengeluaran unpaced, min tidak seimbang, peruntukan penampan optima, talian seimbang, talian pengeluaran unpaced boleh diharap This article discusses an optimal buffer allocation for short unpaced production line and it is assumed reliable (no machines breakdown). The main parameters that affect the line are mean processing time (μ) and its coefficient of variation (Cv). Eight different mean processing time distributions were studied. Each distribution was matched with 15 different buffer allocations. Simulation method was used to estimate the line throughput rate. The results showed that the allocation of buffers affect the throughput rate. For a reliable and balanced line, the optimum buffer allocation is by equally distributing the number of buffers to each buffer slot. In the case of an extra buffer is needed after equally distribution, it is placed at the center buffer slot. Meanwhile, the best buffer allocation shape for a line with unbalanced mean (with the assumption that each station is having fixed Cv and is reliable) follows the shape of the mean processing times of that line. Key words: Unpaced production line, unbalanced mean, optimal buffer allocation, balanced line, reliable unpaced production line


2018 ◽  
Vol 207 ◽  
pp. 03023
Author(s):  
Masataka Ijiri ◽  
Toshihiko Yoshimura

In this study, to further improve current multifunction cavitation (MFC) techniques, the surface modification of Cr‒Mo steel was further investigated using 1200 W ultrasonic power. In MFC using 1200 W ultrasonic power, the corrosion resistance, and compressive residual stress of the specimens were improved when the processing time was 10 min; however, decarburization occurred at longer processing times, causing these characteristics to worsen. The decarburization that occurs at high ultrasonic outputs may be caused by an increase in the water temperature, and of the heating of the specimen surface.


Sign in / Sign up

Export Citation Format

Share Document