教学课程资源库 更多>>

关键词： Computer science   Cybernetics   Physics   Europe   Computational modeling   Markov processes   Computer languages  

摘要： In this article, we provide an overview of the early developments of theoretical computer science research in Italy in the Sixties and early Seventies. In the same years, the community of researchers working in this domain were organizing to gain an identity among the more traditional disciplines and to obtain a recognition for the "new science" that was taking its first steps. This led in Italy to the creation of Group of Researchers in Theoretical Informatics, in parallel to the institution of European Association for Theoretical Computer Science at European level. In this article, we characterize the Italian contribution to theoretical computer science research in those early years by describing the landscape of activities developed in Italian Universities and research centers in the late sixties and early seventies, on the basis of a census run in 1971 by the newly born GRIT.

关键词： Stranded assets   Unburnable carbon   Carbon bubble   Divestment   Carbon lock-in   Energy policy   Systematic review  

摘要： This paper maps the research on environment-related stranded assets. It finds that the stranded assets field emerged due to the uptake of carbon budget concept by business and policy research and growing concerns over the knock-on effects of massive value destruction within the fossil fuel industry. The field then evolved into six research streams: unburnable carbon;the scale of stranded assets;stranded assets and financial markets;recognition of stranded assets;divestment;stranded assets and carbon lock-in effect in energy infrastructure. Key findings are as follows. First, the research into stranded assets is relatively narrow in scope;a sectoral and geographical imbalance is evident in the literature. Second, stranded assets are mostly discussed in grey literature with little connection to work in other research domains. Third, the existing literature has a strong focus on highlighting the magnitude of the stranded assets problem;however, its implications for climate-sensitive sectors have received little consideration. Fourth, the stranded assets research has mostly focused on calculating the cumulative amount of assets that may become stranded in the long term. Fifth, a disconnect between value destruction and value creation aspects of the transition to a low-carbon economy may be present. Sixth, there seems to be a dearth of empirical studies to answer many questions about the market implications of stranded assets, particularly in the energy sector. Therefore, more advanced studies are needed to develop a deeper understanding of macro-and microeconomic impacts of stranded assets which is a promising avenue for further research.

关键词： Uncertainty   Task analysis   Planning   Robot sensing systems   Computer science   Safety   Markov processes   Partially observable Markov decision processes (POMDPs) with Boolean objectives   planning   robots   safe reachability   uncertainty  

摘要： The framework of partially observable Markov decision processes (POMDPs) offers a standard approach to model uncertainty in many robot tasks. Traditionally, POMDPs are formulated with optimality objectives. In this article, we study a different formulation of POMDPs with Boolean objectives. For robotic domains that require a correctness guarantee of accomplishing tasks, Boolean objectives are natural formulations. We investigate the problem of POMDPs with a common Boolean objective: safe reachability, requiring that the robot eventually reaches a goal state with a probability above a threshold while keeping the probability of visiting unsafe states below a different threshold. Our approach builds upon the previous work that represents POMDPs with Boolean objectives using symbolic constraints. We employ a satisfiability modulo theories (SMTs) solver to efficiently search for solutions, i.e., policies or conditional plans that specify the action to take contingent on every possible event. A full policy or conditional plan is generally expensive to compute. To improve computational efficiency, we introduce the notion of partial conditional plans that cover sampled events to approximate a full conditional plan. Our approach constructs a partial conditional plan parameterized by a replanning probability. We prove that the failure rate of the constructed partial conditional plan is bounded by the replanning probability. Our approach allows users to specify an appropriate bound on the replanning probability to balance efficiency and correctness. Moreover, we update this bound properly to quickly detect whether the current partial conditional plan meets the bound and avoid unnecessary computation. In addition, to further improve the efficiency, we cache partial conditional plans for sampled belief states and reuse these cached plans if possible. We validate our approach in several robotic domains. The results show that our approach outperforms a previous policy synthesis ap

关键词： GDPR   AI   Artificial intelligence   Machine learning   Scientific research   Computer science   Commercial research  

摘要： The paper examines how the EU General Data Protection Regulation (GDPR) is applied to the development of AI products and services, drawing attention to the differences between academic and commercial research. The GDPR aims to encourage innovation by providing several exemptions from its strict rules for scientific research. Still, the GDPR defines scientific research in a broad manner, which includes academic and commercial research. However, corporations conducting commercial research might not have in place a similar level of ethical and institutional safeguards as academic researchers. Furthermore, corporate secrecy and opaque algorithms in AI research might pose barriers to oversight. The aim of this paper is to stress the limits of the GDPR research exemption and to find the proper balance between privacy and innovation. The paper argues that commercial AI research should not benefit from the GDPR research exemption unless there is a public interest and has similar safeguards to academic research, such as review by research ethics committees. Since the GDPR provides this broad exemption, it is crucial to clarify the limits and requirements of scientific research, before the application of AI drastically transforms this field.

关键词： Robot kinematics   Planning   Task analysis   Service robots   Computer science   End effectors   Synchronization   Manipulators   multi-robot systems   robot motion  

摘要： Rearranging objects on a planar surface arises in a variety of robotic applications, such as product packaging. Using two arms can improve efficiency but introduces new computational challenges. This article studies the problem structure of object rearrangement using two arms in synchronous, monotone tabletop setups and develops an optimal mixed-integer model. It then describes an efficient and scalable algorithm, which first minimizes the cost of object transfers and then moves between objects. This is motivated by the fact that, asymptotically, object transfers dominate the cost of solutions. Moreover, a lazy strategy minimizes the number of motion planning calls and results in significant speedups. Theoretical arguments support the benefits of using two arms and indicate that synchronous execution, in which the two arms perform together either transfers or moves, introduces only a small overhead. Experiments support these claims and show that the scalable method can quickly compute solutions close to the optimal for the considered setup. Note to Practitioners-Monotone tabletop rearrangement challenges arise in a variety of automation scenarios, including product sorting or packing. Performing this task with two robotic manipulators introduces the overhead of coordinating them in the shared workspace, as well as an increase in the size of the underling search space. The objective of this work is to study the feasibility of such dual-arm solutions, providing both theoretical bounds, as well as a fast, and approximate solution. The approach leverages an effective algorithmic decomposition of the problem so as to take advantage of efficient motion planners and mixed-integer linear programming solvers. The proposed solution has been evaluated in settings that include delta robots as well as seven-degree-of-freedom (DOF) manipulators. Interesting extensions of this work correspond to studying the case of additional arms, nonmonotone, and general manipulation scenarios.

关键词： Computer Science   Market Research   Investment   Economics   Business  

摘要： Most times our articles teach us something about technology. Sometimes they teach us about business and society. In this article, Robert Metcalfe may give us insight that helps explain the growth of computer science.

关键词： Electron tubes   DNA   Computer science   Quantum computing   Computers   Roads   Urban areas   Data structures and algorithms   independent-set problem   molecular algorithms   molecular computing   quantum algorithms   quantum computing  

摘要： In this paper, we propose a bio-molecular algorithm with O(n(2) + m) biological operations, O(2(n)) DNA strands, O(n) tubes and the longest DNA strand, O(n), for solving the independent-set problem for any graph G with m edges and n vertices. Next, we show that a new kind of the straightforward Boolean circuit yielded from the bio-molecular solutions with m NAND gates, (m+n x(n + 1)) AND gates and ((n x (n + 1))/2) NOT gates can find the maximal independent-set(s)to the independent-set problem for any graph G with m edges and n vertices. We show that a new kind of the proposed quantum-molecular algorithm can find the maximal independent set(s) with the lower bound Omega(2(n/2)) queries and the upper bound O(2(n/2)) queries. This work offers an obvious evidence for that to solve the independent-set problem in any graph G with m edges and n vertices, bio-molecular computers are able to generate a new kind of the straightforward Boolean circuit such that by means of implementing it quantum computers can give a quadratic speed-up. This work also offers one obvious evidence that quantum computers can significantly accelerate the speed and enhance the scalability of bio-molecular computers. Next, the element distinctness problem with input of n bits is to determine whether the given 2(n) real numbers are distinct or not. The quantum lower bound of solving the element distinctness problem is Omega(2(nx(2/3))) queries in the case of a quantum walk algorithm. We further show that the proposed quantum-molecular algorithm reduces the quantum lower bound to Omega((2(n/2))/(2(1/2))) queries. Furthermore, to justify the feasibility of the proposed quantum-molecular algorithm, we successfully solve a typical independent set problem for a graph G with two vertices and one edge by carrying out experiments on the backend ibmqx4 with five quantum bits and the backend simulator with 32 quantum bits on IBM's quantum computer.

关键词： Computer Science   general   Software Engineering/Programming and Operating Systems   Operating Systems   Software Engineering   Artificial Intelligence  

摘要： In this paper, we formulate the problem of constructing an onboard switched network of minimum complexity required for real-time transmission of periodic messages, as well as propose algorithms for its solution (generating the network structure and system of virtual links). Results of the experimental evaluation of the proposed algorithms for constructing onboard AFDX networks are also presented.

关键词： Libraries   Security   Privacy   Google   Malware   Facebook   Computer science   Third-party library   privacy   in-app advertisement   security  

摘要： Today's smartphone app stores are full of apps with diverse features. Many developers use third-party libraries to reduce the development time and cost, but developers often ignore the security problems of third-party libraries. A major security problem introduced by third-party libraries is that a third-party library has the same permissions as the apps, called host-apps hereafter, that use it. According to previous research, having the same permissions as its host apps, a third-party library could have unauthorized access to user data, which poses a serious threat to app users. Therefore, how to prevent third-party libraries from abusing permissions has become an important issue. To solve this problem, this paper proposes a Dynamic Permission Control mechanism, called Dynamic Permission Controller or DPC hereafter, for app developers to prohibit third-party libraries from abusing host apps' dangerous permissions. DPC modifies the permission control mechanism of Android framework to make apps have a more flexible permission management mechanism when they are running. DPC provides new APIs which allows an app to dynamically disable a granted dangerous permission before invoking an API of a third-party library and restore the dangerous permission after completing the API. Hence, DPC protects user's privacy by blocking unauthorized access from third-party libraries. Meanwhile, without the requirement that an app developer needs to know the detail of third-party libraries, the app still can use APIs of third-party libraries safely. Experimental results show that DPC works with many popular apps downloaded from Google Play well and DPC prohibits a third-party library from having the same dangerous permissions that its host apps have. Hence, unlike previous solutions, DPC does not have compatibility problems. The overhead introduced by DPC on an emulator and Nexus 7 are 1.8 and 0.3 percent respectively.

关键词： Geographical Information Systems/Cartography   Data Structures and Information Theory   Computer Science   general   Information Storage and Retrieval   Multimedia Information Systems