| {: , : 2016, : , : , : [, , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2016, : , : , : [, ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2016, : , : , : [, , ], : , : null, : , : [], : [], : true, : [], : , : , : } |
| {: , : 2016, : , : , : [, , , , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2016, : , : , : [, , ], : , : null, : , : [], : [], : true, : [], : , : , : } |
| {: , : 2017, : , : , : [, , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2017, : , : , : [, , , ], : , : null, : , : [], : [], : true, : [], : , : , : } |
| {: , : 2017, : , : , : [, , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2017, : , : , : [], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2017, : , : , : [, , , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2018, : , : , : [, ], : , : , : , : [], : [, ], : true, : [], : , : , : } |
| {: , : 2018, : , : , : [], : onig (Science 2018) proved an unconditional\nseparation between the computational powers of small-depth quantum and\nclassical circuits for a relation. In this paper we show a similar separation\nin the average-case setting that gives stronger evidence of the superiority of\nsmall-depth quantum computation: we construct a computational task that can be\nsolved on all inputs by a quantum circuit of constant depth with bounded-fanin\ngates (a \ quantum circuit) and show that any classical circuit with\nbounded-fanin gates solving this problem on a non-negligible fraction of the\ninputs must have logarithmic depth. Our results are obtained by introducing a\ntechnique to create quantum states exhibiting global quantum correlations from\nany graph, via a construction that we call the \\emph{extended graph}.\n Similar results have been very recently (and independently) obtained by\nCoudron, Stark and Vidick (arXiv:1810.04233), and Bene Watts, Kothari,\nSchaeffer and Tal (STOC 2019).\ndoi10.4230/lipics.ccc.2019.21arxiv_id1810.12792pdf_urlshttps://arxiv.org/pdf/1810.12792githubis_oasourcesopen-arxivtypeconferencejournal_refProceedings of the 34th Computational Complexity Conference (CCC\n 2019), 21:1-21:20, 2019categoriesquant-ph cs.CC |
| titleUniversality of EPR pairs in Entanglement-Assisted Communication\n Complexity, and the Communication Cost of State Conversionyearvenue_abbrCCCvenue_nameComputational Complexity ConferenceauthorsMatthew CoudronAram W. Harrowabstract Entanglement assistance is known to reduce the quantum communication\ncomplexity of evaluating functions with distributed inputs. But does the type\nof entanglement matter, or are EPR pairs always sufficient? This is a natural\nquestion because in several other settings maximally entangled states are known\nto be less useful as a resource than some partially entangled state. These\ninclude non-local games, tasks with quantum communication between players and\nreferee, and simulating bipartite unitaries or communication channels. By\ncontrast, we prove that the bounded-error entanglement-assisted quantum\ncommunication complexity of a function cannot be improved by more than a\nconstant factor by replacing maximally entangled states with arbitrary\nentangled states. In particular, we show that every quantum communication\nprotocol using $Q$ qubits of communication and arbitrary shared entanglement\ncan be $\\epsilon$-approximated by a protocol using\n$O(Q/\\epsilon+\\log(1/\\epsilon)/\\epsilon)$ qubits of communication and only EPR\npairs as shared entanglement.\n Our second result concerns an old question in quantum information theory: How\nmuch quantum communication is required to approximately convert one pure\nbipartite entangled state into another? We show that the communication cost of\nconverting between two bipartite quantum states is upper bounded, up to a\nconstant multiplicative factor, by a natural and efficiently computable\nquantity which we call the $\\ell_{\\infty}$-Earth Mover's Distance (EMD) between\nthose two states. Furthermore, we prove a complementary lower bound on the cost\nof state conversion by the $\\epsilon$-smoothed $\\ell_{\\infty}$-EMD, which is a\nnatural smoothing of the $\\ell_{\\infty}$-EMD that we will define via a\nconnection with optimal transport theory.\n", "doi": "10.4230/lipics.ccc.2019.20", "arxiv_id": "1902.07699", "pdf_urls": ["https://arxiv.org/pdf/1902.07699"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "34th Computational Complexity Conference (CCC 2019), pp.\n 20:1--20:25", "categories": "quant-ph"} |
| {"title": "Quantum Lower Bounds for Approximate Counting via Laurent Polynomials", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Scott Aaronson", "Robin Kothari", "William Kretschmer", "Justin Thaler"], "abstract": " We study quantum algorithms that are given access to trusted and untrusted\nquantum witnesses. We establish strong limitations of such algorithms, via new\ntechniques based on Laurent polynomials (i.e., polynomials with positive and\nnegative integer exponents). Specifically, we resolve the complexity of\napproximate counting, the problem of multiplicatively estimating the size of a\nnonempty set $S \\subseteq [N]$, in two natural generalizations of quantum query\ncomplexity.\n Our first result holds in the standard Quantum Merlin--Arthur\n($\\mathsf{QMA}$) setting, in which a quantum algorithm receives an untrusted\nquantum witness. We show that, if the algorithm makes $T$ quantum queries to\n$S$, and also receives an (untrusted) $m$-qubit quantum witness, then either $m\n= \\Omega(|S|)$ or $T=\\Omega \\bigl(\\sqrt{N/\\left| S\\right| } \\bigr)$. This is\noptimal, matching the straightforward protocols where the witness is either\nempty, or specifies all the elements of $S$. As a corollary, this resolves the\nopen problem of giving an oracle separation between $\\mathsf{SBP}$, the\ncomplexity class that captures approximate counting, and $\\mathsf{QMA}$.\n In our second result, we ask what if, in addition to a membership oracle for\n$S$, a quantum algorithm is also given \"QSamples\" -- i.e., copies of the state\n$\\left| S\\right\\rangle = \\frac{1}{\\sqrt{\\left| S\\right| }} \\sum_{i\\in\nS}|i\\rangle$ -- or even access to a unitary transformation that enables\nQSampling? We show that, even then, the algorithm needs either $\\Theta\n\\bigl(\\sqrt{N/\\left| S\\right| }\\bigr)$ queries or else $\\Theta \\bigl(\\min\n\\bigl\\{\\left| S\\right| ^{1/3}, \\sqrt{N/\\left| S\\right| }\\bigr\\}\\bigr)$ QSamples\nor accesses to the unitary.\n Our lower bounds in both settings make essential use of Laurent polynomials,\nbut in different ways.\n", "doi": "10.4230/lipics.ccc.2020.7", "arxiv_id": "1904.08914", "pdf_urls": ["https://arxiv.org/pdf/1904.08914"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "35th Computational Complexity Conference (CCC 2020), Leibniz\n International Proceedings in Informatics (LIPIcs) 169, pp. 7:1-7:47 (2020)", "categories": "quant-ph cs.CC"} |
| {"title": "Efficient Attack Correlation and Identification of Attack Scenarios\n based on Network-Motifs", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Steffen Haas", "Florian Wilkens", "Mathias Fischer"], "abstract": " An Intrusion Detection System (IDS) to secure computer networks reports\nindicators for an attack as alerts. However, every attack can result in a\nmultitude of IDS alerts that need to be correlated to see the full picture of\nthe attack. In this paper, we present a correlation approach that transforms\nclusters of alerts into a graph structure on which we compute signatures of\nnetwork motifs to characterize these clusters. A motif representation of attack\ncharacteristics is magnitudes smaller than the original alert data, but still\nallows to efficiently compare and correlate attacks with each other and with\nreference signatures. This allows not only to identify known attack scenarios,\ne.g., DDoS, scan, and worm attacks, but also to derive new reference signatures\nfor unknown scenarios. Our results indicate a reliable identification of\nscenarios, even when attacks differ in size and at least slightly in their\ncharacteristics. Applied on real-world alert data, our approach can classify\nand assign attack scenarios of up to 96% of all attacks and can represent their\ncharacteristics using 1% of the size of the full alert data.\n", "doi": "10.1109/ipccc47392.2019.8958734", "arxiv_id": "1905.06685", "pdf_urls": ["https://arxiv.org/pdf/1905.06685"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2019 IEEE 38th International Performance Computing and\n Communications Conference (IPCCC), London, United Kingdom, 2019, pp. 1-11", "categories": "cs.CR cs.NI"} |
| {"title": "Assessing Workers Perceived Risk During Construction Task Using A\n Wristband-Type Biosensor", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Byungjoo Choi", "Gaang Lee", "Houtan Jebelli", "SangHyun Lee"], "abstract": " The construction industry has demonstrated a high frequency and severity of\naccidents. Construction accidents are the result of the interaction between\nunsafe work conditions and workers unsafe behaviors. Given this relation,\nperceived risk is determined by an individual response to a potential work\nhazard during the work. As such, risk perception is critical to understand\nworkers unsafe behaviors. Established methods of assessing workers perceived\nrisk have mainly relied on surveys and interviews. However, these post-hoc\nmethods, which are limited to monitoring dynamic changes in risk perception and\nconducting surveys at a construction site, may prove cumbersome to workers.\nAdditionally, these methods frequently suffer from self-reported bias. To\novercome the limitations of previous subjective measures, this study aims to\ndevelop a framework for the objective and continuous prediction of construction\nworkers perceived risk using physiological signals [e.g., electrodermal\nactivity (EDA)] acquired from workers wristband-type biosensors. To achieve\nthis objective, physiological signals were collected from eight construction\nworkers while they performed regular tasks in the field. Various filtering\nmethods were applied to exclude noises recorded in the signal and to extract\nvarious features of the signals as workers experienced different risk levels.\nThen, a supervised machine-learning model was trained to explore the\napplicability of the collected physiological signals for the prediction of risk\nperception. The results showed that features based on EDA data collected from\nwristbands are feasible and useful to the process of continuously monitoring\nworkers perceived risk during ongoing work. This study contributes to an\nin-depth understanding of construction workers perceived risk by developing a\nnoninvasive means of continuously monitoring workers perceived risk.\n", "doi": null, "arxiv_id": "1908.05133", "pdf_urls": ["https://arxiv.org/pdf/1908.05133"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Creative Construction Conference (CCC 2019)", "categories": "eess.SP cs.HC"} |
| {"title": "Quantitative analysis of Matthew effect and sparsity problem of\n recommender systems", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Hao Wang", "Zonghu Wang", "Weishi Zhang"], "abstract": " Recommender systems have received great commercial success. Recommendation\nhas been used widely in areas such as e-commerce, online music FM, online news\nportal, etc. However, several problems related to input data structure pose\nserious challenge to recommender system performance. Two of these problems are\nMatthew effect and sparsity problem. Matthew effect heavily skews recommender\nsystem output towards popular items. Data sparsity problem directly affects the\ncoverage of recommendation result. Collaborative filtering is a simple\nbenchmark ubiquitously adopted in the industry as the baseline for recommender\nsystem design. Understanding the underlying mechanism of collaborative\nfiltering is crucial for further optimization. In this paper, we do a thorough\nquantitative analysis on Matthew effect and sparsity problem in the particular\ncontext setting of collaborative filtering. We compare the underlying mechanism\nof user-based and item-based collaborative filtering and give insight to\nindustrial recommender system builders.\n", "doi": "10.1109/icccbda.2018.8386490", "arxiv_id": "1909.12798", "pdf_urls": ["https://arxiv.org/pdf/1909.12798"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2018 IEEE 3rd International Conference on Cloud Computing and Big\n Data Analysis (ICCCBDA)", "categories": "cs.IR cs.LG"} |
| {"title": "Search problems in algebraic complexity, GCT, and hardness of generator\n for invariant rings", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Ankit Garg", "Christian Ikenmeyer", "Visu Makam", "Rafael Oliveira", "Michael\n Walter", "Avi Wigderson"], "abstract": " We consider the problem of computing succinct encodings of lists of\ngenerators for invariant rings for group actions. Mulmuley conjectured that\nthere are always polynomial sized such encodings for invariant rings of\n$\\SL_n(\\C)$-representations. We provide simple examples that disprove this\nconjecture (under standard complexity assumptions).\n We develop a general framework, denoted \\emph{algebraic circuit search\nproblems}, that captures many important problems in algebraic complexity and\ncomputational invariant theory. This framework encompasses various proof\nsystems in proof complexity and some of the central problems in invariant\ntheory as exposed by the Geometric Complexity Theory (GCT) program, including\nthe aforementioned problem of computing succinct encodings for generators for\ninvariant rings.\n", "doi": "10.4230/lipics.ccc.2020.12", "arxiv_id": "1910.01251", "pdf_urls": ["https://arxiv.org/pdf/1910.01251"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "35th Computational Complexity Conference (CCC 2020), Leibniz\n International Proceedings in Informatics, vol. 169, 2020, pp. 12:1 - 12:17", "categories": "cs.CC math.RA math.RT"} |
| {"title": "Unsupervised video summarization framework using keyframe extraction and\n video skimming", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Shruti Jadon", "Mahmood Jasim"], "abstract": " Video is one of the robust sources of information and the consumption of\nonline and offline videos has reached an unprecedented level in the last few\nyears. A fundamental challenge of extracting information from videos is a\nviewer has to go through the complete video to understand the context, as\nopposed to an image where the viewer can extract information from a single\nframe. Apart from context understanding, it almost impossible to create a\nuniversal summarized video for everyone, as everyone has their own bias of\nkeyframe, e.g; In a soccer game, a coach person might consider those frames\nwhich consist of information on player placement, techniques, etc; however, a\nperson with less knowledge about a soccer game, will focus more on frames which\nconsist of goals and score-board. Therefore, if we were to tackle problem video\nsummarization through a supervised learning path, it will require extensive\npersonalized labeling of data. In this paper, we attempt to solve video\nsummarization through unsupervised learning by employing traditional\nvision-based algorithmic methodologies for accurate feature extraction from\nvideo frames. We have also proposed a deep learning-based feature extraction\nfollowed by multiple clustering methods to find an effective way of summarizing\na video by interesting key-frame extraction. We have compared the performance\nof these approaches on the SumMe dataset and showcased that using deep\nlearning-based feature extraction has been proven to perform better in case of\ndynamic viewpoint videos.\n", "doi": "10.1109/iccca49541.2020.9250764", "arxiv_id": "1910.04792", "pdf_urls": ["https://arxiv.org/pdf/1910.04792"], "github": ["https://github.com/shruti-jadon/Video-Summarization-using-Keyframe-Extraction-and-Video-Skimming", "https://gitlab.com/williamsdaniel888/valma", "https://github.com/SachinGokal/capstone-final"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2020 IEEE 5th International Conference on Computing Communication\n and Automation (ICCCA)", "categories": "cs.IR cs.CV cs.LG eess.IV"} |
| {"title": "On the Quantum Complexity of Closest Pair and Related Problems", "year": 2019, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Scott Aaronson", "Nai-Hui Chia", "Han-Hsuan Lin", "Chunhao Wang", "Ruizhe\n Zhang"], "abstract": " The closest pair problem is a fundamental problem of computational geometry:\ngiven a set of $n$ points in a $d$-dimensional space, find a pair with the\nsmallest distance. A classical algorithm taught in introductory courses solves\nthis problem in $O(n\\log n)$ time in constant dimensions (i.e., when $d=O(1)$).\nThis paper asks and answers the question of the problem's quantum time\ncomplexity. Specifically, we give an $\\tilde{O}(n^{2/3})$ algorithm in constant\ndimensions, which is optimal up to a polylogarithmic factor by the lower bound\non the quantum query complexity of element distinctness. The key to our\nalgorithm is an efficient history-independent data structure that supports\nquantum interference.\n In $\\mathrm{polylog}(n)$ dimensions, no known quantum algorithms perform\nbetter than brute force search, with a quadratic speedup provided by Grover's\nalgorithm. To give evidence that the quadratic speedup is nearly optimal, we\ninitiate the study of quantum fine-grained complexity and introduce the Quantum\nStrong Exponential Time Hypothesis (QSETH), which is based on the assumption\nthat Grover's algorithm is optimal for CNF-SAT when the clause width is large.\nWe show that the na\\\, : null, : , : [], : [], : true, : [], : , : , : } |
| {: , : 2019, : , : , : [, , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2019, : , : , : [], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [, , ], : , : null, : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [, , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [, , , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [, , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [, , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [, , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2020, : , : , : [], : , : null, : , : [], : [], : true, : [], : , : , : } |
| {: , : 2021, : , : , : [, , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2021, : , : , : [, , , , , ], : , : , : , : [], : [], : true, : [], : , : , : } |
| {: , : 2021, : , : , : [urgisser and M. Levent Do\\u{g}an and Visu Makam and Michael\n Walter and Avi Wigdersonabstract An action of a group on a vector space partitions the latter into a set of\norbits. We consider three natural and useful algorithmic \ or\n\ problems, namely, orbit equality, orbit closure intersection,\nand orbit closure containment. These capture and relate to a variety of\nproblems within mathematics, physics and computer science, optimization and\nstatistics. These orbit problems extend the more basic null cone problem, whose\nalgorithmic complexity has seen significant progress in recent years.\n In this paper, we initiate a study of these problems by focusing on the\nactions of commutative groups (namely, tori). We explain how this setting is\nmotivated from questions in algebraic complexity, and is still rich enough to\ncapture interesting combinatorial algorithmic problems. While the structural\ntheory of commutative actions is well understood, no general efficient\nalgorithms were known for the aforementioned problems. Our main results are\npolynomial time algorithms for all three problems. We also show how to\nefficiently find separating invariants for orbits, and how to compute systems\nof generating rational invariants for these actions (in contrast, for\npolynomial invariants the latter is known to be hard). Our techniques are based\non a combination of fundamental results in invariant theory, linear\nprogramming, and algorithmic lattice theory.\ndoi10.4230/lipics.ccc.2021.32arxiv_id2102.07727pdf_urlshttps://arxiv.org/pdf/2102.07727githubis_oasourcesopen-arxivtypeconferencejournal_ref36th Computational Complexity Conference (CCC 2021), 32:1--32:30\n (2021)categoriescs.DS math-ph math.AG math.MP math.RT |
| titleKinematic Control of compliant serial manipulators composed of\n dual-trianglesyearvenue_abbrCCCvenue_nameComputational Complexity ConferenceauthorsWanda Zhao (LS2NReV)Anatol Pashkevich (LS2NReV)Alexandr\n KlimchikDamien Chablat (ReVLS2N)abstract The paper focuses on the kinematics control of a compliant serial manipulator\ncomposed of a new type of dualtriangle elastic segments. Some useful\noptimization techniques were applied to solve the geometric redundancy problem,\nensure the stability of the manipulator configurations with respect to the\nexternal forces/torques applied to the endeffector. The efficiency of the\ndeveloped control algorisms is confirmed by simulation.\ndoi10.1109/icccr49711.2021.9349285arxiv_id2102.09840pdf_urlshttps://arxiv.org/pdf/2102.09840githubis_oasourcesopen-arxivtypeconferencejournal_ref2021 International Conference on Computer, Control and Robotics\n (ICCCR), Jan 2021, Shanghai, China. pp.93-97categoriescs.RO |
| titleSpatio-Temporal Data Mining for Aviation Delay Predictionyearvenue_abbrCCCvenue_nameComputational Complexity ConferenceauthorsKai ZhangYushan JiangDahai Liu and Houbing Songabstract To accommodate the unprecedented increase of commercial airlines over the\nnext ten years, the Next Generation Air Transportation System (NextGen) has\nbeen implemented in the USA that records large-scale Air Traffic Management\n(ATM) data to make air travel safer, more efficient, and more economical. A key\nrole of collaborative decision making for air traffic scheduling and airspace\nresource management is the accurate prediction of flight delay. There has been\na lot of attempts to apply data-driven methods such as machine learning to\nforecast flight delay situation using air traffic data of departures and\narrivals. However, most of them omit en-route spatial information of airlines\nand temporal correlation between serial flights which results in inaccuracy\nprediction. In this paper, we present a novel aviation delay prediction system\nbased on stacked Long Short-Term Memory (LSTM) networks for commercial flights.\nThe system learns from historical trajectories from automatic dependent\nsurveillance-broadcast (ADS-B) messages and uses the correlative geolocations\nto collect indispensable features such as climatic elements, air traffic,\nairspace, and human factors data along posterior routes. These features are\nintegrated and then are fed into our proposed regression model. The latent\nspatio-temporal patterns of data are abstracted and learned in the LSTM\narchitecture. Compared with previous schemes, our approach is demonstrated to\nbe more robust and accurate for large hub airports.\ndoi10.1109/ipccc50635.2020.9391561arxiv_id2103.11221pdf_urlshttps://arxiv.org/pdf/2103.11221githubis_oasourcesopen-arxivtypeconferencejournal_ref39th International Performance Computing and Communications\n Conference (IPCCC), IEEE, 2020, pp. 1-7categoriescs.LG cs.SY eess.SY |
| titleAge Range Estimation using MTCNN and VGG-Face Modelyearvenue_abbrCCCvenue_nameComputational Complexity ConferenceauthorsDipesh GyawaliPrashanga PokharelAshutosh ChauhanSubodh Chandra\n Shakyaabstract The Convolutional Neural Network has amazed us with its usage on several\napplications. Age range estimation using CNN is emerging due to its application\nin myriad of areas which makes it a state-of-the-art area for research and\nimprove the estimation accuracy. A deep CNN model is used for identification of\npeople's age range in our proposed work. At first, we extracted only face\nimages from image dataset using MTCNN to remove unnecessary features other than\nface from the image. Secondly, we used random crop technique for data\naugmentation to improve the model performance. We have used the concept of\ntransfer learning in our research. A pretrained face recognition model i.e\nVGG-Face is used to build our model for identification of age range whose\nperformance is evaluated on Adience Benchmark for confirming the efficacy of\nour work. The performance in test set outperformed existing state-of-the-art by\nsubstantial margins.\n", "doi": "10.1109/icccnt49239.2020.9225443", "arxiv_id": "2104.08585", "pdf_urls": ["https://arxiv.org/pdf/2104.08585"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "11th IEEE International Conference on Computing, Communication and\n Networking Technologies (ICCCNT), 2020", "categories": "cs.CV"} |
| {"title": "Security of continuous-variable quantum key distribution against\n canonical attacks", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Panagiotis Papanastasiou", "Carlo Ottaviani", "and Stefano Pirandola"], "abstract": " We investigate the performance of Gaussianmodulated coherent-state QKD\nprotocols in the presence of canonical attacks, which are collective Gaussian\nattacks resulting in Gaussian channels described by one of the possible\ncanonical forms. We present asymptotic key rates and then we extend the results\nto the finite-size regime using a recently-developed toolbox for composable\nsecurity.\n", "doi": "10.1109/icccn52240.2021.9522349", "arxiv_id": "2105.08774", "pdf_urls": ["https://arxiv.org/pdf/2105.08774"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2021 International Conference on Computer Communications and\n Networks (ICCCN), 2021, pp. 1-6", "categories": "quant-ph"} |
| {"title": "On Use of the Moore-Penrose Pseudoinverse for Evaluating the RGA of\n Non-Square Systems", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Rafal Qasim Al Yousuf and Jeffrey Uhlmann"], "abstract": " A recently-derived alternative method for computing the relative gain array\n(RGA) for singular and/or non-square systems has been proposed that provably\nguarantees unit invariance. This property is not offered by the conventional\nmethod that uses the Moore-Penrose (MP) pseudoinverse. In this paper we note\nthat the absence of the scale-invariance property by the conventional MP-RGA\ndoes not necessarily imply a practical disadvantage in real-world applications.\nIn other words, while it is true that performance of a controller should not\ndepend on the choice of units on its input and output variables, this does not\n{\\em necessarily} imply that the resulting MP-RGA measures of component\ninteraction lead to different controller-design input-output pairings. In this\npaper we consider the application of the MP-RGA to a realistic system (a Sakai\nfractional distillation system) to assess whether or not the choice of unit,\nwhich in this case relates to temperature, affects the choice of input-output\npairings determined by the resulting RGA matrix. Our results show that it does,\nthus confirming that unit-sensitivity of the MP-RGA undermines its rigorous use\nfor MIMO controller design.\n", "doi": "10.33103/uot.ijccce.21.3.8", "arxiv_id": "2106.09766", "pdf_urls": ["https://arxiv.org/pdf/2106.09766"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Iraqi Journal of Computers, Communications, Control & Systems\n Engineering (IJCCCE), Vol. 3:21, pp. 89-97, 2021", "categories": "eess.SY cs.SY"} |
| {"title": "Oblivious Median Slope Selection", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Thore Thie{\\ss}en and Jan Vahrenhold"], "abstract": " We study the median slope selection problem in the oblivious RAM model. In\nthis model memory accesses have to be independent of the data processed, i.e.,\nan adversary cannot use observed access patterns to derive additional\ninformation about the input. We show how to modify the randomized algorithm of\nMatou\\v{s}ek (1991) to obtain an oblivious version with $\\mathcal{O}(n \\log^2\nn)$ expected time for $n$ points in $\\mathbb{R}^2$. This complexity matches a\ntheoretical upper bound that can be obtained through general oblivious\ntransformation. In addition, results from a proof-of-concept implementation\nshow that our algorithm is also practically efficient.\n", "doi": null, "arxiv_id": "2107.03193", "pdf_urls": ["https://arxiv.org/pdf/2107.03193"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 33rd Canadian Conference on Computational\n Geometry (CCCG 2021), 320-331", "categories": "cs.CG cs.CR cs.DS"} |
| {"title": "Microcontroller Based Load Monitoring System", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["A N Madhavanunni", "S S Arya", "Renjith Kumar D"], "abstract": " The demand for power has increased exponentially over the last century. One\navenue through which today's energy problems can be addressed is through the\nreduction of energy usage in households. This has increased the emphasis on the\nneed for accurate and economic methods of power measurement. The goal of\nproviding such data is to optimize and reduce their power consumption. In view\nof this, the present manuscript focuses on the design and implementation of\nprecise and reliable load monitoring system using PIC microcontroller chip\n(PIC16F877A). This involves an accurate sensing of voltage, current and power\nfactor of the load. A clever utilization of in-built ADC and timers of the\nmicrocontroller reduces the design complexity of the system. The proposed\nsystem monitors the load continuously on a real time basis and displays the\nparameters such as voltage, current, power factor, active, reactive and\napparent powers in an LCD module. The use of microcontroller reduces the cost\nand makes the device compact. The proposed system has been implemented and\ntested in the laboratory for single phase loads.\ndoiarxiv_id2108.05191pdf_urlshttps://arxiv.org/pdf/2108.05191githubis_oasourcesopen-arxivtypeconferencejournal_refProceedings of International Conference on Control, Calibration\n and Testing (ICCCT '15), Feb 13-14, 2015, Coimbatore, India, 6-10", "categories": "eess.SY cs.SY eess.SP"} |
| {"title": "Enel: Context-Aware Dynamic Scaling of Distributed Dataflow Jobs using\n Graph Propagation", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Dominik Scheinert", "Houkun Zhu", "Lauritz Thamsen", "Morgan K. Geldenhuys", "Jonathan Will", "Alexander Acker", "Odej Kao"], "abstract": " Distributed dataflow systems like Spark and Flink enable the use of clusters\nfor scalable data analytics. While runtime prediction models can be used to\ninitially select appropriate cluster resources given target runtimes, the\nactual runtime performance of dataflow jobs depends on several factors and\nvaries over time. Yet, in many situations, dynamic scaling can be used to meet\nformulated runtime targets despite significant performance variance.\n This paper presents Enel, a novel dynamic scaling approach that uses message\npropagation on an attributed graph to model dataflow jobs and, thus, allows for\nderiving effective rescaling decisions. For this, Enel incorporates descriptive\nproperties that capture the respective execution context, considers statistics\nfrom individual dataflow tasks, and propagates predictions through the job\ngraph to eventually find an optimized new scale-out. Our evaluation of Enel\nwith four iterative Spark jobs shows that our approach is able to identify\neffective rescaling actions, reacting for instance to node failures, and can be\nreused across different execution contexts.\n", "doi": "10.1109/ipccc51483.2021.9679361", "arxiv_id": "2108.12211", "pdf_urls": ["https://arxiv.org/pdf/2108.12211"], "github": ["https://github.com/dos-group/enel-experiments"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IEEE IPCCC (2021) 1-8", "categories": "cs.DC cs.LG"} |
| {"title": "Network Traffic Characteristics of IoT Devices in Smart Homes", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Md Mainuddin", "Zhenhai Duan", "Yingfei Dong"], "abstract": " Understanding network traffic characteristics of IoT devices plays a critical\nrole in improving both the performance and security of IoT devices, including\nIoT device identification, classification, and anomaly detection. Although a\nnumber of existing research efforts have developed machine-learning based\nalgorithms to help address the challenges in improving the security of IoT\ndevices, none of them have provided detailed studies on the network traffic\ncharacteristics of IoT devices. In this paper we collect and analyze the\nnetwork traffic generated in a typical smart homes environment consisting of a\nset of common IoT (and non-IoT) devices. We analyze the network traffic\ncharacteristics of IoT devices from three complementary aspects: remote network\nservers and port numbers that IoT devices connect to, flow-level traffic\ncharacteristics such as flow duration, and packet-level traffic characteristics\nsuch as packet inter-arrival time. Our study provides critical insights into\nthe operational and behavioral characteristics of IoT devices, which can help\ndevelop more effective security and performance algorithms for IoT devices.\n", "doi": "10.1109/icccn52240.2021.9522168", "arxiv_id": "2109.01855", "pdf_urls": ["https://arxiv.org/pdf/2109.01855"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2021 International Conference on Computer Communications and\n Networks (ICCCN)", "categories": "cs.NI"} |
| {"title": "COVID-19 Face Mask Recognition with Advanced Face Cut Algorithm for\n Human Safety Measures", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Arkaprabha Basu", "Md Firoj Ali"], "abstract": " In the last year, the outbreak of COVID-19 has deployed computer vision and\nmachine learning algorithms in various fields to enhance human life\ninteractions. COVID-19 is a highly contaminated disease that affects mainly the\nrespiratory organs of the human body. We must wear a mask in this situation as\nthe virus can be contaminated through the air and a non-masked person can be\naffected. Our proposal deploys a computer vision and deep learning framework to\nrecognize face masks from images or videos. We have implemented a Boundary\ndependent face cut recognition algorithm that can cut the face from the image\nusing 27 landmarks and then the preprocessed image can further be sent to the\ndeep learning ResNet50 model. The experimental result shows a significant\nadvancement of 3.4 percent compared to the YOLOV3 mask recognition architecture\nin just 10 epochs.\n", "doi": "10.1109/icccnt51525.2021.9580061", "arxiv_id": "2110.04316", "pdf_urls": ["https://arxiv.org/pdf/2110.04316"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2021 12th International Conference on Computing Communication and\n Networking Technologies (ICCCNT)", "categories": "cs.CV cs.LG cs.NE"} |
| {"title": "Semantic Identifiers and DNS Names for IoT", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Simon Fernandez", "Michele Amoretti", "Fabrizio Restori", "Maciej\n Korczynski", "Andrzej Duda"], "abstract": " In this paper, we propose a scheme for representing semantic metadata of IoT\ndevices in compact identifiers and DNS names to enable simple discovery and\nsearch with standard DNS servers. Our scheme defines a binary identifier as a\nsequence of bits: a Context to use and several bits of fields corresponding to\nsemantic properties specific to the Context. The bit string is then encoded as\nbase32 characters and registered in DNS. Furthermore, we use the compact\nsemantic DNS names to offer support for search and discovery. We propose to\ntake advantage of the DNS system as the basic functionality for querying and\ndiscovery of semantic properties related to IoT devices. We have defined three\nspecific Contexts for hierarchical semantic properties as well as logical and\ngeographical locations. For this last part, we have developed two prototypes\nfor managing geo-identifiers in LoRa networks, one based on Node and the Redis\nin-memory database, the other one based on the CoreDNS server.\n", "doi": "10.1109/icccn52240.2021.9522285", "arxiv_id": "2110.11766", "pdf_urls": ["https://arxiv.org/pdf/2110.11766"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2021 International Conference on Computer Communications and\n Networks (ICCCN), 2021, pp. 1-9", "categories": "cs.NI"} |
| {"title": "The Acrobatics of BQP", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Scott Aaronson", "DeVon Ingram", "William Kretschmer"], "abstract": " One can fix the randomness used by a randomized algorithm, but there is no\nanalogous notion of fixing the quantumness used by a quantum algorithm.\nUnderscoring this fundamental difference, we show that, in the black-box\nsetting, the behavior of quantum polynomial-time ($\\mathsf{BQP}$) can be\nremarkably decoupled from that of classical complexity classes like\n$\\mathsf{NP}$. Specifically:\n -There exists an oracle relative to which\n$\\mathsf{NP^{BQP}}\\not\\subset\\mathsf{BQP^{PH}}$, resolving a 2005 problem of\nFortnow. As a corollary, there exists an oracle relative to which\n$\\mathsf{P}=\\mathsf{NP}$ but $\\mathsf{BQP}\\neq\\mathsf{QCMA}$.\n -Conversely, there exists an oracle relative to which\n$\\mathsf{BQP^{NP}}\\not\\subset\\mathsf{PH^{BQP}}$.\n -Relative to a random oracle, $\\mathsf{PP}=\\mathsf{PostBQP}$ is not contained\nin the \"$\\mathsf{QMA}$ hierarchy\"\n$\\mathsf{QMA}^{\\mathsf{QMA}^{\\mathsf{QMA}^{\\cdots}}}$.\n -Relative to a random oracle,\n$\\mathsf{\\Sigma}_{k+1}^\\mathsf{P}\\not\\subset\\mathsf{BQP}^{\\mathsf{\\Sigma}_{k}^\\mathsf{P}}$\nfor every $k$.\n -There exists an oracle relative to which $\\mathsf{BQP}=\\mathsf{P^{\\# P}}$\nand yet $\\mathsf{PH}$ is infinite.\n -There exists an oracle relative to which\n$\\mathsf{P}=\\mathsf{NP}\\neq\\mathsf{BQP}=\\mathsf{P^{\\# P}}$.\n To achieve these results, we build on the 2018 achievement by Raz and Tal of\nan oracle relative to which $\\mathsf{BQP}\\not \\subset \\mathsf{PH}$, and\nassociated results about the Forrelation problem. We also introduce new tools\nthat might be of independent interest. These include a \"quantum-aware\" version\nof the random restriction method, a concentration theorem for the block\nsensitivity of $\\mathsf{AC^0}$ circuits, and a (provable) analogue of the\nAaronson-Ambainis Conjecture for sparse oracles.\n", "doi": "10.4230/lipics.ccc.2022.20", "arxiv_id": "2111.10409", "pdf_urls": ["https://arxiv.org/pdf/2111.10409"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "37th Computational Complexity Conference (CCC 2022), Leibniz\n International Proceedings in Informatics (LIPIcs) 234, pp. 20:1-20:17 (2022)", "categories": "cs.CC quant-ph"} |
| {"title": "The KICK-OFF of 6G Research Worldwide: An Overview", "year": 2021, "venue_abbr": "CCC", "venue_name": "Computational Complexity Conference", "authors": ["Wei Jiang", "Hans Dieter Schotten"], "abstract": " The fifth-generation (5G) mobile system is now being deployed across the\nworld and the scale of 5G subscribers is growing quickly in many countries. The\nattention of academia and industry is increasingly shifting towards the sixth\ngeneration (6G) and many pioneering works are being kicked off, indicating an\nimportant milestone in the history of 6G. At this juncture, an overview of the\ncurrent state of the art of 6G research and a vision of future communications\nare of great interest. This paper thus investigates up-to-date 6G research\nprograms, ambitions, and main viewpoints of representative countries,\ninstitutions, and companies worldwide. Then, the key technologies are outlined\nand a vision on ``What 6G may look like?\" is provided. This paper aims to serve\nas an enlightening guideline for interested researchers to quickly get an\noverview when kicking off their 6G research.\n", "doi": null, "arxiv_id": "2111.10779", "pdf_urls": ["https://arxiv.org/pdf/2111.10779"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IEEE ICCC 2021", "categories": "cs.IT eess.SP math.IT"} |
| |
