The problems existing in the binary logic system and the advantages of multiple-valued logic (MVL) are introduced. A literal circuit with three-track-output structure is created based on resonant tunneling diodes (RTD...The problems existing in the binary logic system and the advantages of multiple-valued logic (MVL) are introduced. A literal circuit with three-track-output structure is created based on resonant tunneling diodes (RTDs) and it has the most basic memory function. A ternary RTD D flip-flop with pre-set and pre-reset functions is also designed, the key module of which is the RTD literal circuit. Two types of output structure of the ternary RTD D flip-flop are optional: one is three-track and the other is single-track; these two structures can be transformed conveniently by merely adding tri-valued RTD NAND, NOR, and inverter units after the three-track output. The design is verified by simulation. Ternary flip-flop consists of an RTD literal circuit and it not only is easy to understand and implement but also provides a solution for the algebraic interface between the multiple-valued logic and the binary logic. The method can also be used for design of other types of multiple-valued RTD flip-flop circuits.展开更多
Recently, crowdsourcing platforms have attracted a number of citizens to perform a variety of location- specific tasks. However, most existing approaches consider the arrangement of a set of tasks for a set of crowd w...Recently, crowdsourcing platforms have attracted a number of citizens to perform a variety of location- specific tasks. However, most existing approaches consider the arrangement of a set of tasks for a set of crowd workers, while few consider crowd workers arriving in a dynamic manner. Therefore, how to arrange suitable location-specific tasks to a set of crowd workers such that the crowd workers obtain maximum satisfaction when arriving sequentially represents a challenge. To address the limitation of existing approaches, we first identify a more general and useful model that considers not only the arrangement of a set of tasks to a set of crowd workers, but also all the dynamic arrivals of all crowd workers. Then, we present an effective crowd-task model which is applied to offiine and online settings, respectively. To solve the problem in an offiine setting, we first observe the characteristics of task planning （CTP） and devise a CTP algorithm to solve the problem. We also propose an effective greedy method and integrated simulated annealing （ISA） techniques to improve the algorithm performance. To solve the problem in an online setting, we develop a greedy algorithm for task planning. Finally, we verify the effectiveness and efficiency of the proposed solutions through extensive experiments using real and synthetic datasets.展开更多
The ubiquitous deployment of GPS-equipped devices and mobile networks has spurred the popularity of spatial crowdsourcing. Many spatial crowdsourcing tasks require crowd workers to collect data from different location...The ubiquitous deployment of GPS-equipped devices and mobile networks has spurred the popularity of spatial crowdsourcing. Many spatial crowdsourcing tasks require crowd workers to collect data from different locations. Since workers tend to select locations nearby or align to their routines, data collected by workers are usually unevenly distributed across the region. To encourage workers to choose remote locations so as to avoid imbalanced data collection, we investigate the incentive mechanisms in spatial crowdsourcing. We propose a price adjustment function and two algorithms, namely DFBA (Dynamic Fixed Budget Allocation) and DABA (Dynamic Adjusted Budget Allocation), which utilize price leverage to mitigate the imbalanced data collection problem. Extensive evaluations on both synthetic and real-world datasets demonstrate that the proposed incentive mechanisms are able to effectively balance the popularity of different locations.展开更多
文摘The problems existing in the binary logic system and the advantages of multiple-valued logic (MVL) are introduced. A literal circuit with three-track-output structure is created based on resonant tunneling diodes (RTDs) and it has the most basic memory function. A ternary RTD D flip-flop with pre-set and pre-reset functions is also designed, the key module of which is the RTD literal circuit. Two types of output structure of the ternary RTD D flip-flop are optional: one is three-track and the other is single-track; these two structures can be transformed conveniently by merely adding tri-valued RTD NAND, NOR, and inverter units after the three-track output. The design is verified by simulation. Ternary flip-flop consists of an RTD literal circuit and it not only is easy to understand and implement but also provides a solution for the algebraic interface between the multiple-valued logic and the binary logic. The method can also be used for design of other types of multiple-valued RTD flip-flop circuits.
基金supported by the National High-Tech R&D Program(863) of China(No.2014AA015203)
文摘Recently, crowdsourcing platforms have attracted a number of citizens to perform a variety of location- specific tasks. However, most existing approaches consider the arrangement of a set of tasks for a set of crowd workers, while few consider crowd workers arriving in a dynamic manner. Therefore, how to arrange suitable location-specific tasks to a set of crowd workers such that the crowd workers obtain maximum satisfaction when arriving sequentially represents a challenge. To address the limitation of existing approaches, we first identify a more general and useful model that considers not only the arrangement of a set of tasks to a set of crowd workers, but also all the dynamic arrivals of all crowd workers. Then, we present an effective crowd-task model which is applied to offiine and online settings, respectively. To solve the problem in an offiine setting, we first observe the characteristics of task planning （CTP） and devise a CTP algorithm to solve the problem. We also propose an effective greedy method and integrated simulated annealing （ISA） techniques to improve the algorithm performance. To solve the problem in an online setting, we develop a greedy algorithm for task planning. Finally, we verify the effectiveness and efficiency of the proposed solutions through extensive experiments using real and synthetic datasets.
文摘The ubiquitous deployment of GPS-equipped devices and mobile networks has spurred the popularity of spatial crowdsourcing. Many spatial crowdsourcing tasks require crowd workers to collect data from different locations. Since workers tend to select locations nearby or align to their routines, data collected by workers are usually unevenly distributed across the region. To encourage workers to choose remote locations so as to avoid imbalanced data collection, we investigate the incentive mechanisms in spatial crowdsourcing. We propose a price adjustment function and two algorithms, namely DFBA (Dynamic Fixed Budget Allocation) and DABA (Dynamic Adjusted Budget Allocation), which utilize price leverage to mitigate the imbalanced data collection problem. Extensive evaluations on both synthetic and real-world datasets demonstrate that the proposed incentive mechanisms are able to effectively balance the popularity of different locations.
