Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- extended-abstractJune 2024
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC
SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and ArchitecturesPages 293–295https://doi.org/10.1145/3626183.3660265In the Massively Parallel Computation (MPC) model, data is distributed across multiple processors, and we call an algorithm space-efficient if each machine has n^1-ε + o(1) memory with a machine count of Ømega(n^ε).
In this paper, we study the string ...
- research-articleJune 2024
Hardness and Tight Approximations of Demand Strip Packing
SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and ArchitecturesPages 479–489https://doi.org/10.1145/3626183.3659971We settle the pseudo-polynomial complexity of the Demand Strip Packing (DSP) problem: Given a strip of fixed width and a set of items with widths and heights, the items must be placed inside the strip with the objective of minimizing the peak height. ...
- research-articleJuly 2023
Fréchet Distance for Uncertain Curves
ACM Transactions on Algorithms (TALG), Volume 19, Issue 3Article No.: 29, Pages 1–47https://doi.org/10.1145/3597640In this article, we study a wide range of variants for computing the (discrete and continuous) Fréchet distance between uncertain curves. An uncertain curve is a sequence of uncertainty regions, where each region is a disk, a line segment, or a set of ...
- abstractNovember 2022
An Interactive Haptic Display System with Changeable Hardness Using Magneto-Rheological Fluid
VRST '22: Proceedings of the 28th ACM Symposium on Virtual Reality Software and TechnologyArticle No.: 41, Pages 1–2https://doi.org/10.1145/3562939.3565673We present a haptic display system with changeable hardness using magneto-rheological (MR) fluid. The major component is the haptic device with layers of MR fluid, contact point and pressure sensors, and electromagnet. The system enables multi-modal ...
- research-articleSeptember 2019
The microstructure, hardness and friction and wear behavior of AM60B magnesium alloy by friction stir processing
RICAI '19: Proceedings of the 2019 International Conference on Robotics, Intelligent Control and Artificial IntelligencePages 73–76https://doi.org/10.1145/3366194.3366207The effect of friction stir process (FSP) parameters on the microstructure and mechanical properties of AM60B magnesium alloy was investigated in this paper. The alloy was friction stir processed with rotation speed of 1600 rpm and three traverse speeds ...
-
- research-articleMay 2019
Recognition of Object Hardness from Images Using a Capsule Network
ACIT '19: Proceedings of the 7th ACIS International Conference on Applied Computing and Information TechnologyArticle No.: 3, Pages 1–5https://doi.org/10.1145/3325291.3325358Hardness is often used as an index to compare similar objects. To measure an object's hardness, a hardness meter is required and certain conditions must be met. The object and the hardness meter corresponding to that object have to be close at hand. ...
- research-articleJuly 2017
On the average-case complexity of MCSP and its variants
CCC '17: Proceedings of the 32nd Computational Complexity ConferenceArticle No.: 7, Pages 1–20We prove various results on the complexity of MCSP (Minimum Circuit Size Problem) and the related MKTP (Minimum Kolmogorov Time-Bounded Complexity Problem):
• We observe that under standard cryptographic assumptions, MCSP has a pseudorandom self-...
- articleDecember 2015
Query Complexity in Errorless Hardness Amplification
Computational Complexity (COCO), Volume 24, Issue 4Pages 823–850https://doi.org/10.1007/s00037-015-0117-4An errorless circuit for a Boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of errorless hardness amplification is to show that if f has no size s errorless circuit that ...
- research-articleSeptember 2015
Improving the Compressive Strength of Carbon Nanotube Turfs by Adding Iron Nanowires to the Nanotube Core
IEEE Transactions on Nanotechnology (ITN), Volume 14, Issue 5Pages 806–809https://doi.org/10.1109/TNANO.2015.2447215The cores of carbon nanotubes (CNTs) are partially filled by Fe nanowires during synthesis by chemical vapor deposition from an acetylene-ferrocene mixture. A Fe-filled CNT turf is produced with a height exceeding 100 μm and a Fe-filling ratio of ...
- research-articleJune 2015
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingPages 401–408https://doi.org/10.1145/2746539.2746597Algorithmic mechanism design (AMD) studies the delicate interplay between computational efficiency, truthfulness, and optimality. We focus on AMD's paradigmatic problem: combinatorial auctions. We present a new generalization of the VC dimension to ...
- ArticleSeptember 2012
Prediction of Hardness in Titanium Aluminium Nitride TiA1N Coating Process: A Review
This paper reviewed on prediction of hardness performances for Titanium Aluminium Nitride (TiA1N) coating process. A new application in predicting the hardness performances of TiA1N coatings using a method called support vector machine (SVM) is ...
- ArticleJuly 2012
Microstructure and Hardness of Electroless Ni-La-P Coatings on 2024 Aluminum Alloys for Aircraft Structure
the microstructure and hardness of electroless Ni-La-P alloy plating on 2024 aluminum alloys substrate in an alkaline plating bath with sodium hydrophosphite as reducing agent were investigated. The effects of LaNO3 concentration on the plating rate ...
- ArticleJuly 2012
Impact of the energy model on the complexity of RNA folding with pseudoknots
CPM'12: Proceedings of the 23rd Annual conference on Combinatorial Pattern MatchingPages 321–333https://doi.org/10.1007/978-3-642-31265-6_26Predicting the folding of an RNA sequence, while allowing general pseudoknots (PK), consists in finding a minimal free-energy matching of its n positions. Assuming independently contributing base-pairs, the problem can be solved in Θ(n3)-time using a ...
- articleApril 2012
On new approaches of assessing network vulnerability: hardness and approximation
IEEE/ACM Transactions on Networking (TON), Volume 20, Issue 2Pages 609–619https://doi.org/10.1109/TNET.2011.2170849Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vital for planning and risk management. Existing approaches to vulnerability ...
- ArticleDecember 2011
Chemical and phase composition of vacuum oxy-nitrocarburized pure iron, carbon and low alloyed steels
In this study different substrates are saturated in vacuum with N, C and O in NH3 and CO2 gas mixture in order to increase their surfaces' properties. The carbon amount (CO2) in the nitriding atmosphere (NH3) was 10 vol. % at a pressure of 8.104 Pa and ...
- articleDecember 2011
Hardness of Approximating the Closest Vector Problem with Pre-Processing
Computational Complexity (COCO), Volume 20, Issue 4Pages 741–753https://doi.org/10.1007/s00037-011-0031-3We show that the pre-processing versions of the closest vector problem and the nearest codeword problem are $${\mathsf {NP}}$$ -hard to approximate within any constant factor.
- posterSeptember 2011
Jamming attack in WSN: a spatial perspective
UbiComp '11: Proceedings of the 13th international conference on Ubiquitous computingPages 563–564https://doi.org/10.1145/2030112.2030214We propose a new jamming attack model from spatial perspective: given k jammers, how does the attacker minimize the pair-wise connectivity among the nodes in Wireless Sensor Network (WSN)? We call this problem k-Jammer Deployment Problem (k-JDP). First, ...
- ArticleAugust 2011
Flattening fixed-angle chains is strongly NP-hard
WADS'11: Proceedings of the 12th international conference on Algorithms and data structuresPages 314–325Planar configurations of fixed-angle chains and trees are well studied in polymer science and molecular biology. We prove that it is strongly NP-hard to decide whether a polygonal chain with fixed edge lengths and angles has a planar configuration ...
- ArticleAugust 2011
Experimental Study for "Quasi-uniform Wearability" Treatment of Cylinder Liner Inner Surface
ICDMA '11: Proceedings of the 2011 Second International Conference on Digital Manufacturing & AutomationPages 515–518https://doi.org/10.1109/ICDMA.2011.131For improving the working Life of engine cyLinder Liner, using relevant equipments, instruments and methods, the test studys the wear-resistant treatment to CyLinder Liner Inner Surface. The results showed that: after plasma beam scanning, cyLinder ...
- research-articleOctober 2010
Complexity of 3-D floorplans by analysis of graph cuboidal dual hardness
ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 15, Issue 4Article No.: 33, Pages 1–22https://doi.org/10.1145/1835420.1835426Interconnect dominated electronic design stimulates a demand for developing circuits on the third dimension, leading to 3-D integration. Recent advances in chip fabrication technology enable 3-D circuit manufacturing. However, there is still a possible ...