Small-scale Computer Research Articles

A Method of Reliability Assessment Based on Fine Tuning Deep Learning Model for Open Source Software in Edge Computing

Recently, the computing service has been changing from the cloud computing to the edge one. The edge computing is very important to serve nearly the IoT devices. In particular, several IoT devices have no-large scale computer storage. Therefore, the edge servers will be able to solve the problems of small-scale computer storage. Also, the edge computing is structured by several open source software. Then, the open source software updates version-up day by day. The version-upgradation is the characteristic of open source software. This paper focuses on the keywords such as the edge computing, deep learning, reliability assessment, and open source software. We propose the method of reliability assessment based on deep learning.

Etched fiber Bragg grating probe using a regular CNC machine and a 3D printer

Etched fiber Bragg gratings (EFBGs) have been widely employed for refractive index (RI) measurements that can be used to monitor sugar consumption during the fermentation of alcoholic beverages. EFBGs are obtained by removing the cladding of a fiber Bragg grating, which is traditionally performed by a chemical attack with hydrogen fluoride, an extremely hazardous corrosive substance that causes severe wounds and even death. To overcome such drawbacks, this technical note presents a simple, practical, and low cost method for the diameter reduction of single mode optical fibers by mechanical polishing, employing a small scale computer numerical control device and an ad hoc 3D-printed rod. The sensor probe obtained was tested using sucrose aqueous solutions with RIs between 1.333 and 1.394, measured in an Abbe refractometer. The results show a linear shift of the Bragg wavelength with respect to RI with a correlation of 0.928.

Multi-level down-sampling scheme for accelerated solution in magnetotelluric forward modelling

The efficiency of the forward modelling procedure in three-dimensional electromagnetic methods is one of the keys of successful inversion applications, especially on small-scale computation platforms. To improve the computational efficiency, we propose a multi-level down-sampling algorithm based on finite difference method for accelerating the computation of electric fields. This scheme reduces the number of the discrete electric fields horizontally in the original grid to form a reduced electromagnetic system, without introducing coarser grids as in the multi-resolution methods. After the reduced electromagnetic system is solved, the fields abandoned in this scheme can be recovered with a simple interpolation operation. For maximum efficiency and accuracy, we propose a way to automatically determine the applicable down-sampling domain in a specific discrete model for a given period of the electromagnetic field. Additionally, we prove that the discretized derivatives for the electric fields are first-order accurate in our scheme. The scheme is verified by test cases with both synthetic and real-world three-dimensional models. The results show that the electromagnetic field calculated with our scheme is accurate compared to solutions from the standard staggered-grid scheme. An up to 35% acceleration is observed for high-frequency calculations in the real-world three-dimensional model test.

Enabling self-adaptability of small scale and large scale security systems using dynamic partial reconfiguration

The application areas of field programmable gate arrays (FPGAs) are increasing due to its hardware acceleration and reprogrammable features. From large-scale computation systems like cloud, aerospace, and defence to small-scale computation systems like home automation and mobile phones, the dynamic partial reconfiguration property is found to be attractive to design adaptive systems for self-reconfiguration and self-healing. The article presents two self- adaptive security systems for small scale as well as for large-scale systems. The security system is designed to include encryption accelerators and hash code generation accelerators. The security system designed for small-scale systems saves space and power using hardware adaptation by loading or creating only the required accelerator during execution of the application. It uses light weight cryptographic algorithms. A second design for large-scale systems focuses on getting more throughput by allocating more resources to the required accelerator at runtime. Two designs are created for hardware adaptation based on the accelerator requirement at runtime. Proposed adaptive design for small-scale systems achieved 68.50% decrease in resource consumption and design for large-scale systems achieved 25.93% more throughput than the best existing implementations.

A Probabilistic Approach for Cooperative Computation Offloading in MEC-Assisted Vehicular Networks

Mobile edge computing (MEC) has been an effective paradigm for supporting computation-intensive applications by offloading resources at network edge. Especially in vehicular networks, the MEC server, is deployed as a small-scale computation server at the roadside and offloads computation-intensive task to its local server. However, due to the unique characteristics of vehicular networks, including high mobility of vehicles, dynamic distribution of vehicle densities and heterogeneous capacities of MEC servers, it is still challenging to implement efficient computation offloading mechanism in MEC-assisted vehicular networks. In this article, we investigate a novel scenario of computation offloading in MEC-assisted architecture, where task upload coordination between multiple vehicles, task migration between MEC/cloud servers and heterogeneous computation capabilities of MEC/cloud severs, are comprehensively investigated. On this basis, we formulate cooperative computation offloading (CCO) problem by modeling the procedure of task upload, migration and computation based on queuing theory, which aims at minimizing the delay of task completion. To tackle the CCO problem, we propose a probabilistic computation offloading (PCO) algorithm, which enables MEC server to independently make online scheduling based on the derived allocation probability. Specifically, the PCO transforms the objective function into augmented Lagrangian and achieves the optimal solution in an iterative way, based on a convex framework called Alternating Direction Method of Multipliers (ADMM). Last but not the least, we implement the simulation model. The comprehensive simulation results show the superiority of the proposed algorithm under a wide range of scenarios.

Effects of material heterogeneity on surface fatigue for rough lubricated rolling–sliding contacts

In view of increasingly severe operating conditions and the use of composite (strongly) heterogeneous materials, detailed modelling and optimisation methods are needed to predict the effects of subsurface material topology, either by design or resulting from inclusions and material anisotropy, on rolling-sliding contact fatigue life. In this paper, a method is proposed showing that such predictions can at present be obtained for realistic configurations on small-scale computers by integrating efficient numerical solution of the 3D displacement and stress field in the (heterogeneous) material with fast rough surface-lubricated contact models. Contact pressures, subsurface stresses and surface fatigue effects are shown for cases of bonded individual or multiple (clusters) of statistically distributed inhomogeneities close to the surface in realistic actual rolling–sliding rough contact geometries. The model contributes to the development of optimised failure criteria for composite/heterogeneous materials close to the surface.

Reducing quantum overhead

Quantum Computing A quantum computer is expected to outperform its classical counterpart in certain tasks. One such task is the factorization of large integers, the technology that underpins the security of bank cards and online privacy. Using a small-scale quantum computer comprising five trapped

A Weak Quantum Blind Signature with Entanglement Permutation

Motivated by the permutation encryption algorithm, a weak quantum blind signature (QBS) scheme is proposed. It involves three participants, including the sender Alice, the signatory Bob and the trusted entity Charlie, in four phases, i.e., initializing phase, blinding phase, signing phase and verifying phase. In a small-scale quantum computation network, Alice blinds the message based on a quantum entanglement permutation encryption algorithm that embraces the chaotic position string. Bob signs the blinded message with private parameters shared beforehand while Charlie verifies the signature’s validity and recovers the original message. Analysis shows that the proposed scheme achieves the secure blindness for the signer and traceability for the message owner with the aid of the authentic arbitrator who plays a crucial role when a dispute arises. In addition, the signature can neither be forged nor disavowed by the malicious attackers. It has a wide application to E-voting and E-payment system, etc.

Probing the limits of gate-based charge sensing.

Quantum computation requires a qubit-specific measurement capability to readout the final state of individual qubits. Promising solid-state architectures use external readout electrometers but these can be replaced by a more compact readout element, an in situ gate sensor. Gate-sensing couples the qubit to a resonant circuit via a gate and probes the qubit's radiofrequency polarizability. Here we investigate the ultimate performance of such a resonant readout scheme and the noise sources that limit its operation. We find a charge sensitivity of 37 μe Hz(-1/2), the best value reported for this technique, using the example of a gate sensor strongly coupled to a double quantum dot at the corner states of a silicon nanowire transistor. We discuss the experimental factors limiting gate detection and highlight ways to optimize its sensitivity. In total, resonant gate-based readout has advantages over external electrometers both in terms of reduction of circuit elements as well as absolute charge sensitivity.

Co-spanning tree restoration mechanism for metro Ethernet switched networks

Ethernet, a popular technology in IT industry, with high transmission rate, simple maintenance, and compatibility with different types of links was invented for local and small-scale computer networks. However, current spanning tree-based Ethernet protocols do not meet the requirements for metro Ethernet networks in terms of network resilience. One of the most important weaknesses is slow re-convergence time in the event of a link failure when a new spanning tree must be reconstructed to ensure the survivability of networks. In this paper, we propose a co-spanning tree restoration (CSTR) mechanism for metro Ethernet switched networks to handle the link failures. Upon failure of a link on the network, a distributed failure restoration protocol will be activated to reconstruct the damaged spanning tree using a $$co\text {-}tree$$co-tree link. We explain the details of the protocol, including advertisement tables and fundamental reconfiguration processes. In addition, we propose a simple and effective solution for a double link failure and develop an optional feature to control unnecessary topology changes. The simulated results of CSTR on different network topologies show its features of efficiency and quick recovery.

Microcontroller-based Feedback Control Laboratory Experiments

this paper is a result of the implementation of the recommendations on enhancing hands-on experience of control engineering education using single chip, small scale computers such as microcontrollers. A set of microcontroller-based feedback control experiments was developed for the Electrical Engineering curriculum at the University of North Florida. These experiments provided hands-on techniques that students can utilize in the development of complete solutions for a number of servo control problems. Significant effort was devoted to software development of feedback controllers and the associated signal conditioning circuits interfacing between the microcontroller and the physical plant. These experiments have stimulated the interest of our students in control engineering.

AN ARBITRATED QUANTUM SIGNATURE SCHEME BASED ON HYPERCHAOTIC QUANTUM CRYPTOSYSTEM

A chaos-based arbitrated quantum signature (AQS) scheme is designed on the basis of an improved quantum chaotic encryption algorithm whose security is ensured due to the implementation of the quantum one-time pad that embraces the key-dependent chaotic operation string. It involves in a small-scale quantum computation network with three participants in three phases, i.e. initializing phase, signing phase and verifying phase. The signatory signs the encrypted message and then the receiver verifies the signature is valid with the aid of an arbitrator who plays a crucial role when a dispute arises. Analysis shows that the signature can neither be forged nor disavowed by the malicious attackers.

On The Non-Adoption Of Present Value Depreciation In Managerial Performance Evaluation

Present value depreciation has long been advocated as a way to improve the dominant return on investment (ROI) managerial performance measure. Yet, to date, reported adoptions of this approach have been rare. Since providing appropriate managerial incentives is increasingly important in this era of intensifying global competition, it is useful to explore why firms are foregoing this theoretically superior approach. This paper points out that the non-adoption of present value depreciation may be an economically rational choice. It notes that advocates of present value depreciation have failed to consider some potentially significant implementation costs. In addition, a small scale computer simulation reveals that under conditions of uncertainty and correlated cash flows, ROI calculated under conventional depreciation procedures can often closely approximate the theoretically correct value. Hence, besides providing a specific analysis of present value depreciation, this study also underlines afresh the importance of cost/benefit considerations in developing or adopting new approaches to business problems.

Stochastic Lagrangian method for downscaling problems in computational fluid dynamics

This work aims at introducing modelization, theoretical and numerical studies related to a new downscaling technique applied to Computational Fluid Dynamics. Our method consists in building a local model, forced by large scale information computed thanks to a classical numerical weather predictor. The local model, compatible with the Navier-Stokes equations, is used for the small scale computation (downscaling) of the considered fluid. It is inspired by S.B. Pope's works on turbulence, and consists in a so-called Langevin system of stochastic differential equations. We introduce this model and exhibit its links with classical RANS models. Well-posedness, as well as mean-field interacting particle approximations and boundary condition issues are addressed. We present the numerical discretization of the stochastic downscaling method and investigate the accuracy of the proposed algorithm on simplified situations.

THE CONSTRUCTION OF A PUN GENERATOR FOR LANGUAGE SKILLS DEVELOPMENT

Since the early 1990s, there have been a number of small-scale computer programs that automatically constructed simple verbal jokes (puns), but none of these were fully developed systems that could be used for a practical application. We describe the building and testing of the STANDUP program – a large-scale, robust, interactive, user-friendly pun-generator (inspired by Binsted's JAPE program), which is aimed at allowing children, particularly those with communication disabilities, to develop their linguistic skills. The STANDUP system was designed in consultation with potential users and suitable experts, was rigorously engineered using public-domain linguistic data, and has a special purpose, child-friendly, graphical user interface. The software was tested successfully with real users (children with complex communication needs).

A lightweight web-based vulnerability scanner for small-scale computer network security assessment

There appears to be a common perception amongst average computer users pointing towards a global lack of trust when using the Internet. The resolution of this lack of trust relating to the use of the Internet, particularly orientated towards its commercial use and online purchasing, requires partly from website developers to create and maintain web applications that are robust and provide a certain degree of resilience to attack from outside threats. This project intends to contribute to this particular aspect by providing site developers and system testers, as well as simple site users, with a tool for reconnaissance, vulnerability scanning and remote network mapping that is easily accessible and useable due to its web-based and visual, event-driven interface. It is anticipated that the cumbersome task of learning to use a number of command line tools and their exact functionality and parameters can be avoided through this and similar developments, and hence that this will potentially widen the access to security testing, particularly to small and medium businesses.

Membrane Media Create Small Nanospaces for Molecular Computation

Molecular computation is fashionable because of the small device sizes that should be possible. For instance, information processing in nanospaces is widespread in biology. However, experimental cases with computing molecules occupy rather large volumes until now (ca. 1012 nm3). Now we demonstrate small-scale computation using a designed logic gate in spheres of 3 nm radius (volume = ca. 102 nm3) which are produced by detergent micelles. The logic gate accommodated in the small nanospace fluoresces only when both H+ and Na+ ions are available.

Pattern evaluation for in-plane displacement measurement of thin films

Ultra-lightweight spacecraft incorporating “gossamer” structures are extremely compliant, which complicates control, design, and ground testing in full scale. One approach to model the behavior of a full-scale gossamer structure is to construct a small-scale model test article that can be used to verify a corresponding small-scale computer model. Once the predictions of the computer model have been verified by measurement of the physical test article, it can be scaled up to allow computation of the full-scale structure behavior. As model verification requires accurate deflection measurements at multiple points along the surface of the structure, a sensing system that provides full-field data without changing the dynamic response of the structure must be developed. Hence, an optical approach is taken. Since the thin films used in gossamer space structures are typically smooth and featureless, targets must be incorporated into the film surface to enable tracking of both in-plane and out-of-plane displacements. A krypton fluoride excimer laser system was used to etch 35 μm wide linear features approximately 0.1 μm into the surface metallization of both 50.8 μm polyester and 127 μm polyimide films. These optically diffuse surface features, designed mainly to investigate the precision of the laser etching method, were used as targets for ultra-close-range photogrammetry, the method chosen for displacement tracking. A force applied to the surface of the etched mirror (test article) produced in-plane and out-of-plane deformations that were resolved via ultra-close-range photogrammetry. To measure the in-plane tracking resolution, 1.5 and 3.0 mm circular dots were added (using ink) to the surface of the thin film, and some of these targets were tracked as the test article was translated on a precision linear stage. In-plane tracking resolution using ultra-close-range photogrammetry was related to the ground sample distance of the camera, which in this case was 51.25 μm pixel−1 (equal to the ratio of sample dimension to number of pixels in the field of view). Using a manual technique to identify features of the etched pattern for tracking, the mean tracking error was about 13 μm (σ=43 μm). Using an automated, subpixel marking technique to identify the 1.5 mm circular targets, the mean tracking error was 22 μm (σ=13 μm). Neither of these methods achieved the desired 10 μm tracking resolution.

Pattern Evaluation for In-plane Displacement Measurement of Thin Films

Ultra-lightweight spacecraft incorporating “gossamer” structures are extremely compliant, which complicates control, design, and ground testing in full scale. One approach to model the behavior of a full-scale gossamer structure is to construct a small-scale model test article that can be used to verify a corresponding small-scale computer model. Once the predictions of the computer model have been verified by measurement of the physical test article, it can be scaled up to allow computation of the full-scale structure behavior. As model verification requires accurate deflection measurements at multiple points along the surface of the structure, a sensing system that provides full-field data without changing the dynamic response of the structure must be developed. Hence, an optical approach is taken. Since the thin films used in gossamer space structures are typically smooth and featureless, targets must be incorporated into the film surface to enable tracking of both in-plane and out-of-plane displacements. A krypton fluoride excimer laser system was used to etch 35 μm wide linear features approximately 0.1 μm into the surface metallization of both 50.8 μm polyester and 127 μm polyimide films. These optically diffuse surface features, designed mainly to investigate the precision of the laser etching method, were used as targets for ultra-close-range photogrammetry, the method chosen for displacement tracking. A force applied to the surface of the etched mirror (test article) produced in-plane and out-of-plane deformations that were resolved via ultra-close-range photogrammetry. To measure the in-plane tracking resolution, 1.5 and 3.0 mm circular dots were added (using ink) to the surface of the thin film, and some of these targets were tracked as the test article was translated on a precision linear stage. In-plane tracking resolution using ultra-close-range photogrammetry was related to the ground sample distance of the camera, which in this case was 51.25 μm pixel−1 (equal to the ratio of sample dimension to number of pixels in the field of view). Using a manual technique to identify features of the etched pattern for tracking, the mean tracking error was about 13 μm (σ=43 μm). Using an automated, subpixel marking technique to identify the 1.5 mm circular targets, the mean tracking error was 22 μm (σ=13 μm). Neither of these methods achieved the desired 10 μm tracking resolution.

Developing a Knowledge-Based Videoconference System for Non-Expert Users

We present a design and implementation of a Flexible Videoconference System, FVCS. FVCS aims to reduce the botheration of the users under operational environments with insufficient computational resources, such as the Internet environment with the small-scale computers at home and offices, by embedding flexibility into the conventional videoconference system. In this paper, we propose a design and implementation of FVCS with knowledge-based multiagent framework. We implement some kinds of prototype systems of FVCS with different types of knowledge embedded in the agent. We also perform some experiments using the prototype systems to evaluate the adaptability of the systems in response to the observed operational situations. From the results of the experiments, the adaptability is influenced by knowledge of agent, and we conclude that the knowledge-based design and implementation is reasonable for construction of FVCS.