172,944 research outputs found
Design of a smart turning tool with application to in-process cutting force measurement in ultraprecision and micro cutting
In modern micromachining, there is a need to measure and monitor certain machining process parameters in process so as to detect tool wear in real time, to optimize the process parameters setup, and to render the machining process some level of smartness and intelligence. This paper presents the innovative design of a smart turning tool using two pieces of piezoelectric films to measure cutting and feed force in real time. The tool was tested on its performance through the calibration and cutting trials against the commercial dynamometer. The results show the smart turning tool has achieved the performance as designed
Privacy-Preserving Outsourcing of Large-Scale Nonlinear Programming to the Cloud
The increasing massive data generated by various sources has given birth to
big data analytics. Solving large-scale nonlinear programming problems (NLPs)
is one important big data analytics task that has applications in many domains
such as transport and logistics. However, NLPs are usually too computationally
expensive for resource-constrained users. Fortunately, cloud computing provides
an alternative and economical service for resource-constrained users to
outsource their computation tasks to the cloud. However, one major concern with
outsourcing NLPs is the leakage of user's private information contained in NLP
formulations and results. Although much work has been done on
privacy-preserving outsourcing of computation tasks, little attention has been
paid to NLPs. In this paper, we for the first time investigate secure
outsourcing of general large-scale NLPs with nonlinear constraints. A secure
and efficient transformation scheme at the user side is proposed to protect
user's private information; at the cloud side, generalized reduced gradient
method is applied to effectively solve the transformed large-scale NLPs. The
proposed protocol is implemented on a cloud computing testbed. Experimental
evaluations demonstrate that significant time can be saved for users and the
proposed mechanism has the potential for practical use.Comment: Ang Li and Wei Du equally contributed to this work. This work was
done when Wei Du was at the University of Arkansas. 2018 EAI International
Conference on Security and Privacy in Communication Networks (SecureComm
Performance of multiple-input multiple-output wireless communications systems using distributed antennas
In this contribution we propose and investigate a multiple-input multiple-output (MIMO) wireless communications system, where multiple receive antennas are distributed in the area covered by a cellular cell and connected with the base-station (BS). We first analyze the total received power by the BS through the distributed antennas, when assuming that the mobile's signal is transmitted over lognormal shadowed Rayleigh fading channels. Then, the outage probability of the distributed antenna MIMO systems is investigated, when considering various antenna distribution patterns. Furthermore, space-time coding at the mobile transmitter is considered for enhancing the outage performance of the distributed antenna MIMO system. Our study and simulation results show that the outage performance of a distributed antenna MIMO system can be significantly improved, when either increasing the number of distributed receive antennas or increasing the number of mobile transmit antennas
Proof of a Conjecture of Hirschhorn and Sellers on Overpartitions
Let denote the number of overpartitions of . It was
conjectured by Hirschhorn and Sellers that \bar{p}(40n+35)\equiv 0\ ({\rm
mod\} 40) for . Employing 2-dissection formulas of quotients of theta
functions due to Ramanujan, and Hirschhorn and Sellers, we obtain a generating
function for modulo 5. Using the -parametrization of
theta functions given by Alaca, Alaca and Williams, we give a proof of the
congruence \bar{p}(40n+35)\equiv 0\ ({\rm mod\} 5). Combining this congruence
and the congruence \bar{p}(4n+3)\equiv 0\ ({\rm mod\} 8) obtained by
Hirschhorn and Sellers, and Fortin, Jacob and Mathieu, we give a proof of the
conjecture of Hirschhorn and Sellers.Comment: 11 page
- âŠ