scholarly journals An Analysis of the Optical System of a Length Measurement Comparator

Mechanika ◽  
2020 ◽  
Vol 26 (6) ◽  
pp. 518-525
Author(s):  
Rimantas LAZDINAS ◽  
Mindaugas JUREVICIUS ◽  
Vladas VEKTERIS ◽  
Vytautas TURLA ◽  
Eugenijus JURKONIS
Keyword(s):  
Optical System ◽  
Processing Speed ◽  
Length Measurement ◽  
Identification Algorithm ◽  
High Processing Speed ◽  
Image Blurring ◽  
Scale Calibration ◽  
Calibration Accuracy ◽  
The Impact ◽  
High Processing

In the paper, the optical system of a precise bar length measuring comparator is analysed. The requirements for such a system are determined and systematized. The impact of the resolution, signal discretization frequency, image blurring, bar edge measurement indeterminacy and camera noise on measuring the bar width and establishing the bar position is discussed upon. Various algorithms have been analysed and finally a bar edge identification algorithm oriented to the scale calibration accuracy and the high processing speed was proposed. In the end of the paper, conclusions are provided.

Flour Bag Counting System Based on Machine Vision

2012 ◽  
Vol 562-564 ◽  
pp. 1625-1629 ◽  
Author(s):  
Chun Xia Ma ◽  
Wen He Song ◽  
Jun Wu ◽  
Yue Wang ◽  
Zhi Tao Xiao
Keyword(s):  
Processing Speed ◽  
Counting Process ◽  
Plant Production ◽  
Detection Accuracy ◽  
Test Results ◽  
Counting System ◽  
High Processing Speed ◽  
Flour Production ◽  
High Processing ◽  
Time Acquisition

According to the specific characteristics of Flour Plant production line, the bag counting system for Flour Plant based on Daheng Image acquisition card DH-CG410 and Microsoft VC++ 2005 platform is designed. Using digital image processing technology, the system can be used to detect flour bag by analyzing real-time acquisition video of the flour bag. So it is available for flour production counting. Test results show that the system has the advantages of stable working state, high detection accuracy, high processing speed. It can systematize and standardize the Flour Plant flour bag counting process.

Application of Unpiloted Aircraft in Land Resource Management of Sichuan Province

2012 ◽  
Vol 562-564 ◽  
pp. 1732-1737
Author(s):  
Si Cheng ◽  
Fei Yu Chen ◽  
Yun Sheng Wang
Keyword(s):  
Resource Management ◽  
Processing Speed ◽  
Low Cost ◽  
Sichuan Province ◽  
Land Resource ◽  
High Definition ◽  
Resource Protection ◽  
High Processing Speed ◽  
Aircraft System ◽  
High Processing

For defects of traditional aviation photography and remote sensing satellite, developing unpiloted aircraft technology for land resource management in Sichuan Province is essential for land resource administration. Unpiloted aircraft technology is a development of traditional aviation photography, which wipes out many shortages of those technologies. It has features of low cost, easy control, quick responsiveness, high processing speed, and capacity of taking high definition aviation photography. This article focuses on features, system organization, and unsolved problems of unpiloted aircraft photography system. The research team has to use knowledge in many categories to design an unpiloted aircraft system, such as artificial intelligence, aviation, topography, and information technology. Moreover, this article introduces applications of this technology in land resource management, geo-hazard prevention, mineral resource protection, and many other orientations in Sichuan Province. In addition the perspective of using unpiloted aircraft in geo-hazard prevention is analyzed and some ideal results are also introduced.

Network Communication System Based on AT91SAM92 Hardware Design

2011 ◽  
Vol 55-57 ◽  
pp. 614-617
Author(s):  
Dong Yun Luo ◽  
You Mu Zhang
Keyword(s):  
Processing Speed ◽  
Communication System ◽  
Modular Design ◽  
Hardware Design ◽  
Design Concept ◽  
Network Communication ◽  
High Processing Speed ◽  
High Processing

The network communication system is presented for controller of AT91SAM9261 architecture which is based on ARM926EJ-S core, modular design concept is given by the each har­d­ware related module and driver design. High processing speed of the system on the basis of this system can be extended .

ALGORITHMIC DECOMPOSITION AND REDUCTION OF LARGE MATHEMATICAL MODELS

2019 ◽  
Author(s):  
Rogoza W. ◽  
Ischenko A.
Keyword(s):  
Processing Speed ◽  
Large Data ◽  
Data Models ◽  
Software Developers ◽  
High Processing Speed ◽  
Special Software ◽  
Complex Engineering ◽  
Mathematical Equations ◽  
Mapreduce Model ◽  
High Processing

The problems associated with the processing of large amounts of data, initiated research in the field of creating special software that allows us to process this data online. A well-known example of such software is the MapReduce computational model developed and implemented by Google. The advantages of MapReduce are the high processing speed of large data arrays, achieved through data decomposition and reduction, as well as the ability to implement this model on standard hardware. Creating algorithms and programs that comply with the principles of the MapReduce model, depends on the specifics of the tasks that are solved, and relies on the software developers. Most of the algorithms known today are designed to process large arrays of data coming to a computer system online without changing data models (i.e. the data is processed as it enters the system in the data stream). At the same time, it is possible to distinguish classes of tasks for which the data on the objects under study are redundant, and their volume can be significantly reduced even before this data is available for their transformation. As is shown in the article, this class includes the tasks of mathematical simulation of complex engineering objects, the data models of which are represented in the form of mathematical equations that describe the physical states of the objects. The authors discuss the problems of decomposition and reduction of models at the level of transformations of the mentioned mathematical equations, which is why the authors call this approach algorithmic decomposition and reduction.

FQC: A novel approach for efficient compression, archival, and dissemination of fastq datasets

2015 ◽  
Vol 13 (03) ◽  
pp. 1541003 ◽  
Author(s):  
Anirban Dutta ◽  
Mohammed Monzoorul Haque ◽  
Tungadri Bose ◽  
C. V. S. K. Reddy ◽  
Sharmila S. Mande
Keyword(s):  
Processing Speed ◽  
Sequence Data ◽  
Compression Method ◽  
Data Repositories ◽  
Compression Efficiency ◽  
Compression Algorithms ◽  
Novel Approach ◽  
High Processing Speed ◽  
High Processing ◽  
Efficiency Data

Sequence data repositories archive and disseminate fastq data in compressed format. In spite of having relatively lower compression efficiency, data repositories continue to prefer GZIP over available specialized fastq compression algorithms. Ease of deployment, high processing speed and portability are the reasons for this preference. This study presents FQC, a fastq compression method that, in addition to providing significantly higher compression gains over GZIP, incorporates features necessary for universal adoption by data repositories/end-users. This study also proposes a novel archival strategy which allows sequence repositories to simultaneously store and disseminate lossless as well as (multiple) lossy variants of fastq files, without necessitating any additional storage requirements. For academic users, Linux, Windows, and Mac implementations (both 32 and 64-bit) of FQC are freely available for download at: https://metagenomics.atc.tcs.com/compression/FQC .

scholarly journals A probabilistic model for assigning queries at the edge

Computing ◽  
2019 ◽  
Vol 102 (4) ◽  
pp. 865-892 ◽  
Author(s):  
Kostas Kolomvatsos ◽  
Christos Anagnostopoulos
Keyword(s):  
Processing Speed ◽  
Optimal Allocation ◽  
Large Set ◽  
Typical Data ◽  
Proposed Model ◽  
High Processing Speed ◽  
Low Load ◽  
Decision Making Model ◽  
High Processing ◽  
Or Applications

AbstractData management at the edge of the network can increase the performance of applications as the processing is realized close to end users limiting the observed latency in the provision of responses. A typical data processing involves the execution of queries/tasks defined by users or applications asking for responses in the form of analytics. Query/task execution can be realized at the edge nodes that can undertake the responsibility of delivering the desired analytics to the interested users or applications. In this paper, we deal with the problem of allocating queries to a number of edge nodes. The aim is to support the goal of eliminating further the latency by allocating queries to nodes that exhibit a low load and high processing speed, thus, they can respond in the minimum time. Before any allocation, we propose a method for estimating the computational burden that a query/task will add to a node and, afterwards, we proceed with the final assignment. The allocation is concluded by the assistance of an ensemble similarity scheme responsible to deliver the complexity class for each query/task and a probabilistic decision making model. The proposed scheme matches the characteristics of the incoming queries and edge nodes trying to conclude the optimal allocation. We discuss our mechanism and through a large set of simulations and the adoption of benchmarking queries, we reveal the potentials of the proposed model supported by numerical results.

Sign in / Sign up

Export Citation Format

Share Document