177,031 research outputs found
Quantum circuit compilation by genetic algorithm for quantum approximate optimization algorithm applied to MaxCut problem
No full textThis research has been supported by the Spanish Government under research projects TIN2016-79190-R and PID2019-106263RB-I00/AEI/10.13039/501100011033, and by the Principality of Asturias under grant FC-GRUPIN-IDI/2018/000176. A. Oddi and R. Rasconi were supported by the ESA Contract No. 4000112300/14/D/MRP “Mars Express Data Planning Tool MEXAR2 Maintenance”
New coding scheme to compile circuits for quantum approximate optimization algorithm by genetic evolution
No full textThis research has been supported by the Spanish Government, AEI under research project PID2019-106263RB-I00 . A. Oddi and R. Rasconi were supported by the PNRR MUR project PE0000013-FAIR and ESA, France Contract No. 4000112300/14/D/MRP “Mars Express Data Planning Tool MEXAR2 Maintenance”
"Robotically rich" environments for supporting elderly people at home: The RoboCare experience
No full textThe aim of the ROBOCARE project is to develop an intelligent domestic environment which allows elderly people to lead an independent lifestyle in their own homes. This paper describes a testbed environment which simulates the home of an elderly person whose daily routines need to be monitored by human caregivers such as physicians or family members. We focus on the issue of how to enhance the robotic, sensory and supervising components of the system in order to achieve an environment which is at the same time pro-active and non-invasive
An ASP-based Approach to UAM Strategic Deconfliction: preliminary results
No full textUrban Air Mobility (UAM) promises to revolutionize transportation in metropolitan areas by introducing “air taxis” for passenger and cargo transport. However, the envisioned dense operations of UAM vehicles in lowaltitude airspace pose unprecedented challenges for air traffic management (ATM). The Strategic Deconfliction (SD) problem in UAM is about designing the pre-flight “air traffic plan” for potentially hundreds or thousands of simultaneous urban flights, allocating routes, times, and resources in a way that guarantees separation and operational feasibility before any aircraft even leaves the ground. This short paper presents an approach based on Answer Set Programming (ASP) to solve the SD problem in UAM and reports preliminary results on a use case. In particular, the modelling choices will be described with regard to the air network topology, the fleet of drones to be scheduled and the SD proble
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Constraint-based Scheduling for Closed-loop Production Control in RMSs
No full textReconfigurable manufacturing systems (RMS) are conceived to operate in dynamic production contexts often characterized by fluctuations in demand, discovery or invention of new technologies, changes in part geometry, variances in raw material requirements. With specific focus on the RMS production aspects, the scheduling problem implies the capability of developing plans that can be easily and efficiently adjusted and regenerated once a production or system change occurs. The authors present a constraint-based online scheduling controller for RMS whose main advantage is its capability of dynamically interpreting and adapting to production anomalies or system misbehavior by regenerating on-line a new schedule. The performance of the controller has been tested by running a set of closed-loop experiments based on a real-world industrial case study. Results demonstrate that automatically synthesizing plans and recovery actions positively contribute to ensure a higher production rate
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Quantum Circuit Compilation for the Graph Coloring Problem
No full textIn this work we investigate the performance of greedy randomised search (GRS) techniques to the problem of compiling quantum circuits that solve instances of the Graph Coloring problem. Quantum computing uses quantum gates that manipulate multi-valued bits (qubits). A quantum circuit is composed of a number of qubits and a series of quantum gates that operate on those qubits, and whose execution realises a specific quantum algorithm. Current quantum computing technologies limit the qubit interaction distance allowing the execution of gates between adjacent qubits only. This has opened the way to the exploration of possible techniques aimed at guaranteeing nearest-neighbor (NN) compliance in any quantum circuit through the addition of a number of so-called swap gates between adjacent qubits. In addition, technological limitations (decoherence effect) impose that the overall duration (i.e., depth) of the quantum circuit realization be minimized. One core contribution of the paper is the application of an upgraded version of the greedy randomized search (GRS) technique originally introduced in the literature that synthesises NN-compliant quantum circuits realizations, starting from a set of benchmark instances of different size belonging to the Quantum Approximate Optimization Algorithm (QAOA) class tailored for the Graph Coloring problem. We propose a comparison between the presented method and the SABRE compiler, one of the best-performing compilation procedures present in Qiskit, an open-source SDK for quantum development, both from the CPU efficiency and from the solution quality standpoint
- …
