Operating robotic space missions via time-based command sequences has become a limiting factor in the exploration, defense, and commercial sectors. Command sequencing was originally designed for comparatively simple a...
详细信息
ISBN:
(纸本)1563478935
Operating robotic space missions via time-based command sequences has become a limiting factor in the exploration, defense, and commercial sectors. Command sequencing was originally designed for comparatively simple and predictable missions, with safe-mode responses for most faults. This approach has been increasingly strained to accommodate today's more complex missions, which require advanced capabilities like autonomous fault diagnosis and response, vehicle mobility with hazard avoidance, opportunistic science observations, etc. Goal-based operation changes the fundamental basis of operations from imperative command sequences to declarative specifications of operational intent, termed goals. Execution based on explicit intent simplifies operator workload by focusing on what to do rather than how to do it. The move toward goal-based operations, which has already begun in some space missions, involves changes and opportunities in several places: operational processes and tools, human interface design, planning and scheduling, control architecture, fault protection, and verification and validation. Further, the need for future interoperation among multiple goal-based systems suggests that attention be given to areas for standardization. This overview paper defines the concept of goal-based operations, reviews a history of steps in this direction, and discusses the areas of change and opportunity through comparison with the prevalent operational paradigm of command sequencing.
Inter-satellite links have characters of time-varying, unreliability and intermittent-connecting, so that applying the multi-path routing in the low earth orbit (LEO) satellite networks can make message disorder and m...
详细信息
Inter-satellite links have characters of time-varying, unreliability and intermittent-connecting, so that applying the multi-path routing in the low earth orbit (LEO) satellite networks can make message disorder and message loss. A multi-path routing scheme integrated with network coding was proposed to solve this problem. It is proved that with the same multi-path number and path message loss rate, the scheme outperforms the traditional multi-path routing in terms of message delivery rate. Moreover, the performances of both schemes were evaluated by the extended ns-2 software in terms of message delivery rate under the conditions of different multi-path numbers, link message loss rates and redundancy factors. The result validates the theory analysis and shows that the scheme can efficiently improve the reliability and save the onboard communication resources as well as enhance the error control of multi-path routing with certain ranges of message loss.
Recommendation system is one of the most important technologies applied in e-commerce. Similarity measuring method is fundamental to collaborative filtering algorithm, and traditional methods are inefficient especiall...
详细信息
Recommendation system is one of the most important technologies applied in e-commerce. Similarity measuring method is fundamental to collaborative filtering algorithm, and traditional methods are inefficient especially when the user rating data are extremely sparse. Based on the outstanding characteristics of Cloud Model on the process of transforming a qualitative concept to a set of quantitative numerical values, a novel similarity measuring method, namely the likeness comparing method based on cloud model (LICM) is proposed in this paper. LICM compares the similarity of two users on knowledge level, which can overcome the drawback of attributes' strictly matching. This work analysis traditional methods throughly and puts forward a novel collaborative filtering algorithm, which is based on the LICM method. Experiments on typical data set show the excellent performance of the present collaborative filtering algorithm based on LICM, even with extremely sparsity of data.
As a privacy-preserving microdata publication model, K-Anonymity has some application limits, such as (1) it cannot satisfy the individual-defined k mechanism requirement, and (2) it is attached with a certain extent ...
详细信息
software's complexity refers to the difficulty to control the consistency between its implementation and design goal The unrestricted interrelationships of software components are the essential reason, which cause...
详细信息
ISBN:
(纸本)9781627486606
software's complexity refers to the difficulty to control the consistency between its implementation and design goal The unrestricted interrelationships of software components are the essential reason, which cause softwaresystems much more complicated In this paper, we propose "organizational programming", a new technique-oriented methodology, to restrict the interrelationships of software components and make system itself more understandable Organizational programming principles provide some applicable guidelines to direct software implementation: adopting role-base modeling, we distinguish the processdependent from the process-independent classes and organize them into different (sub) systems respectively;using "holonomic abstraction", we construct the overall hierarchical architecture of system, which facilitates to achieve component's shareability and reusability simultaneously Our methodology is intended to informationsystems or application systems in general and it has been applied to our software practice successfully currently.
An adaptive threshold-based Call Admission Control (CAC) scheme used in -wireless/mobile network for multi-class services is proposed. In the scheme, each class's CAC thresholds are solved through establishing a r...
详细信息
Ontologies change and evolve both on the level of schema and individuals in order to meet requirements of changing world. Changes involve adding, deleting and modifying elements in the ontology both on structural (sch...
详细信息
ISBN:
(纸本)1595934359
Ontologies change and evolve both on the level of schema and individuals in order to meet requirements of changing world. Changes involve adding, deleting and modifying elements in the ontology both on structural (schema related) and content (individuals related) levels. The changes can lead to incorrect conclusions and can cause malfunction of systems, which use ontology data. In this paper we describe a proposal of the method for automated detection of currentness of presented data, including meta-data, which are represented by an ontology. Method comes out from a detection of changes between different versions of the ontology. Besides identifying modifications in the ontology, the purpose of the method lies also in identifying equivalent elements, thanks to which we are able to track information sources over time. We describe possibilities of automated identification of changes between ontologies using heuristic methods and their realization as a software tool called OntoDiff for comparing ontologies.
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. This paper proposes two novel BCD adders called carry skip and carry...
详细信息
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multiplications and circuit architectures ar...
详细信息
Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does...
详细信息
Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does not well resolve attribute disclosures. In this paper we focus on the sensitive attribute disclosures in k-anonymity and propose an ordinal distance based sensitivity aware diversity metric. We assume the more diversity the sensitive attribute assumes in an equivalence class in a k-anonymized table, the less inference channel there is in the equivalence class
暂无评论