Search results

This study aims to realize efficient, fast and safe robot search task, the belief criteria decision-making approach is proposed to solve the object search task with an uncertain location.

The study formulates the robot search task as a partially observable Markov decision process, uses the semantic information to evaluate the belief state and designs the belief criteria decision-making approach. A cost function considering a trade-off among belief state, path length and movement effort is modelled to select the next best location in path planning.

The semantic information is successfully modelled and propagated, which can represent the belief of finding object. The belief criteria decision-making (BCDM) approach is evaluated in both Gazebo simulation platform and physical experiments. Compared to greedy, uniform and random methods, the performance index of path length and execution time is superior by BCDM approach.

The prior knowledge of robot working environment, especially semantic information, can be used for path planning to achieve efficient task execution in path length and execution time. The modelling and updating of environment information can lead a promising research topic to realize a more intelligent decision-making method for object search task.

The purpose of this paper is to share the process, findings and conclusions from one library’s iterative usability study of its website design to inform other libraries as they perform their own assessments.

A task-completion usability study was conducted with eight undergraduate students across two iterations: the first gauged the usability of a redesigned library website and the second gauged the effectiveness of the first iteration’s findings.

We found that users performed better when the site provided multiple access points to the same information, displayed a prominent chat feature, limited the amount of text on a given page and avoided library jargon. Not only was the second round of testing important for confirming that first-round recommendations were effective but also it proved useful in catching a problem with the site that was unintentionally created during the time between tests.

No demographic data were collected during the study, thus hindering our ability to analyze our users through these data points.

This study demonstrates the value of iterative usability testing, especially when untested changes made between site versions may produce usability issues.

The purpose of this paper is to study the following two issues regarding blockchain crowdsourcing. First, to design smart contracts with lower consumption to meet the needs of blockchain crowdsourcing services and also need to design better interaction modes to further reduce the cost of blockchain crowdsourcing services. Second, to design an effective privacy protection mechanism to protect user privacy while still providing high-quality crowdsourcing services for location-sensitive multiskilled mobile space crowdsourcing scenarios and blockchain exposure issues.

This paper proposes a blockchain-based privacy-preserving crowdsourcing model for multiskill mobile spaces. The model in this paper uses the zero-knowledge proof method to make the requester believe that the user is within a certain location without the user providing specific location information, thereby protecting the user’s location information and other privacy. In addition, through off-chain calculation and on-chain verification methods, gas consumption is also optimized.

This study deployed the model on Ethereum for testing. This study found that the privacy protection is feasible and the gas optimization is obvious.

This study designed a mobile space crowdsourcing based on a zero-knowledge proof privacy protection mechanism and optimized gas consumption.

In a virtual interconnected digital space, the metaverse encompasses various virtual environments where people can interact, including engaging in business activities. Machine learning (ML) is a strategic technology that enables digital transformation to the metaverse, and it is becoming a more prevalent driver of business performance and reporting on performance. However, ML has limitations, and using the technology in business processes, such as accounting, poses a technology governance failure risk. To address this risk, decision makers and those tasked to govern these technologies must understand where the technology fits into the business process and consider its limitations to enable a governed transition to the metaverse. Using selected accounting processes, this study aims to describe the limitations that ML techniques pose to ensure the quality of financial information.

A grounded theory literature review method, consisting of five iterative stages, was used to identify the accounting tasks that ML could perform in the respective accounting processes, describe the ML techniques that could be applied to each accounting task and identify the limitations associated with the individual techniques.

This study finds that limitations such as data availability and training time may impact the quality of the financial information and that ML techniques and their limitations must be clearly understood when developing and implementing technology governance measures.

The study contributes to the growing literature on enterprise information and technology management and governance. In this study, the authors integrated current ML knowledge into an accounting context. As accounting is a pervasive aspect of business, the insights from this study will benefit decision makers and those tasked to govern these technologies to understand how some processes are more likely to be affected by certain limitations and how this may impact the accounting objectives. It will also benefit those users hoping to exploit the advantages of ML in their accounting processes while understanding the specific technology limitations on an accounting task level.

Compared with traditional methods relying on manual teaching or system modeling, data-driven learning methods, such as deep reinforcement learning and imitation learning, show more promising potential to cope with the challenges brought by increasingly complex tasks and environments, which have become the hot research topic in the field of robot skill learning. However, the contradiction between the difficulty of collecting robot–environment interaction data and the low data efficiency causes all these methods to face a serious data dilemma, which has become one of the key issues restricting their development. Therefore, this paper aims to comprehensively sort out and analyze the cause and solutions for the data dilemma in robot skill learning.

First, this review analyzes the causes of the data dilemma based on the classification and comparison of data-driven methods for robot skill learning; Then, the existing methods used to solve the data dilemma are introduced in detail. Finally, this review discusses the remaining open challenges and promising research topics for solving the data dilemma in the future.

This review shows that simulation–reality combination, state representation learning and knowledge sharing are crucial for overcoming the data dilemma of robot skill learning.

To the best of the authors’ knowledge, there are no surveys that systematically and comprehensively sort out and analyze the data dilemma in robot skill learning in the existing literature. It is hoped that this review can be helpful to better address the data dilemma in robot skill learning in the future.

This paper aims to explore the optimization process involved in the aircraft maintenance allocation and packing problem. The aircraft industry misses a part of the optimization potential while developing maintenance plans. This research provides the modeling foundation for the missing part considering the failure behavior of components, costs involved with all maintenance tasks and opportunity costs.

The study models the cost-effectiveness of support against the availability to come up with an optimization problem. The mathematical problem was solved with an exact algorithm. Experiments were performed with real field and synthetically generated data, to validate the correctness of the model and its potential to provide more accurate and better engineered maintenance plans.

The solution procedure provided excellent results by enhancing the overall arrangement of the tasks, resulting in higher availability rates and a substantial decrease in total maintenance costs. In terms of situational awareness, it provides the user with the flexibility to better manage resource constraints while still achieving optimal results.

This is an innovative research providing a state-of-the-art mathematical model and an algorithm for efficiently solving a task allocation and packing problem by incorporating components’ due flight time, failure probability, task relationships, smart allocation of common preparation tasks, operational profile and resource limitations.

To describe lessons learned about the process of designing effective tasks for digital library user tests.

Illustrated examples are drawn from eight separate user tests run over the course of three years during development of Variations2, the Indiana University digital music library.

Four major considerations for effective task design are described and illustrated. Areas explored include iterative task development, design of authentic activities, recruitment of authentic users and how to deal with unrealistic testing scenarios.

Lessons learned in task design are matched with examples that illustrate how to balance real‐world constraints with ideal testing conditions to gather useful results.

User tests that consider a balance between real‐world constraints and ideal conditions are more apt to provide useful design ideas for complex systems such as digital libraries. Practitioners may use these guidelines to develop and run their own effective user tests.

This paper aims to innovatively propose to improve the efficiency of satellite observation and avoid the waste of satellite resources, a genetic algorithm with entropy operator (GAE) of synthetic aperture radar (SAR) satellites’ task planning algorithm.

The GAE abbreviated as GAE introduces the entropy value of each orbit task into the fitness calculation of the genetic algorithm, which makes the orbit with higher entropy value more likely to be selected and participate in the remaining process of the genetic algorithm.

The simulation result shows that in a condition of the same calculate ability, 85% of the orbital revisit time is unchanged or decreased and 30% is significantly reduced by using the GAE compared with traditional task planning genetic algorithm, which indicates that the GAE can improve the efficiency of satellites’ task planning.

The GAE is an optimization of the traditional genetic algorithm. It combines entropy in thermodynamics with task planning problems. The algorithm considers the whole lifecycle of task planning and gets the desired results. It can greatly improve the efficiency of task planning in observation satellites and shorten the entire task execution time. Then, using the GAE to complete SAR satellites’ task planning is of great significance in reducing satellite operating costs and emergency rescue, which brings certain economic and social benefits.

Technology can influence the nature of work performed by information systems and information technology professionals. This study aims to identify technologies and tasks performed by information systems and information technology professionals in a range of business organisations in Singapore. The study examines what technologies will become increasingly important in the business organizations as advances in information technology affect the work performed by information systems professionals. A list of information systems tasks and relationships between the tasks and technologies will be examined. The role of information systems and information technology professionals in relation to the tasks performed will also be discussed.

Proposes an object‐oriented role‐based access control (ORBAC) model to efficiently represent the real world. Though ORBAC is a good model, administration of ORBAC, including creating and maintaining an access control security policy, still remains a challenging problem. Presents a practical method that can be employed in an enterprise environment to manage security policies using eXtensible Markup Language (XML). Based on ORBAC security policy expressed in XML, a role assignment algorithm is presented. The computation complexity of the algorithms is O(N) where n is the number of position roles in a user’s assigned position role scope.