Computation Of Information Content Research Articles

Configuration optimization of product-service system design requirements based on hesitant information axiom

Product-service system (PSS) has attracted attention of manufacturers to shift from product-providing to solution-providing, which is a marketable set of products and services. The existing researches emphasize the fulfillment of individualized customer requirements through different PSS configurations. The PSS planning phase is of high importance in generating conceptual schemes, which translates customer requirements (CRs) to design requirements (DRs). In this paper, a systematic decision-making approach based on QFD is put forward aiming to configure the PSS design requirements (DRs). To address the uncertainty and hesitancy in QFD modeling, a hesitant fuzzy linguistic term sets (HFLTSs) is applied to elicit the experts’ linguistic preferences in evaluating the importance of CRs and the relationships between CRs and DRs. To dealing with the group decision-making problems concerning the HFLTSs, the min-upper operator and the max-lower operator assemble the experts’ evaluation results into a linguistic interval, and then the numerical results can be obtained by using the 2-tuple linguistic representation model and the interval preference degree computation. A non-linear 0-1 programming model is proposed to select the target DRs’ specifications for maximizing customer satisfaction under cost constraint. In order to objectively determine the satisfaction degree of each optional specification of DR, the information axiom is introduced to construct the objective function via information content computation. To deal with the qualitative DRs, HFLTSs and information axiom are combined and hesitant information axiom (HIA) is proposed. Finally, a DRs optimization model is established using HIA and the imprecision method. A case study is carried out to demonstrate the effectiveness of the optimal PSS planning approach developed.

An efficient path computing model for measuring semantic similarity using edge and density

The shortest path between two concepts in a taxonomic ontology is commonly used to represent the semantic distance between concepts in edge-based semantic similarity measures. In the past, edge counting, which is simple and intuitive and has low computational complexity, was considered the default method for path computation. However, a large lexical taxonomy, such as WordNet, has irregular link densities between concepts due to its broad domain, but edge counting-based path computation is powerless for this non-uniformity problem. In this paper, we advocate that the path computation can be separated from edge-based similarity measures and can form various general computing models. Therefore, to solve the problem of the non-uniformity of concept density in a large taxonomic ontology, we propose a new path computing model based on the compensation of local area density of concepts, which is equal to the number of direct hyponyms of the subsumers for concepts in the shortest path. This path model considers the local area density of concepts as an extension of the edge counting-based path according to the information theory. This model is a general path computing model and can be applied in various edge-based similarity approaches. The experimental results show that the proposed path model improves the average optimal correlation between edge-based measures and human judgments on the Miller and Charles benchmark for WordNet from less than 0.79 to more than 0.86, on the Pedersenet al. benchmark (average of both Physician and Coder) for SNOMED-CT from less than 0.75 to more than 0.82, and it has a large advantage in efficiency compared with information content computation in a dynamic ontology, thereby successfully improving the edge-based similarity measure as an excellent method with high performance and high efficiency.

Entropy as a Measure of Style: The Influence of Sample Length

We can imagine the act of musical composition as the selection of elements from several musical parameters. For example, the composer may choose more tonic than dominant harmonies, more quarter notes than half notes, and create a preponderance of conjunct rather than disjunct motions. These choices will bring about distributional characteristics that may belong to a style. Once made, these choices are, at any rate, identifiable characteristics of the music itself. Elements in musical parameters are not unlike characters in common speech alphabets. Communicative structures of substantial size are the end result of a complex series of choices that are selections from alphabetic pools in the case of written literature and, in the case of music, from the pools of elements in the several parameters that together comprise musical expression. The study of the selection and distribution of alphabetic characters is the domain of information theory. More than twenty years ago, Youngblood proposed that the computation of information content, the entropy of information theory, could serve as a method to identify musical style.' The entropy of information theory is a calculation of the freedom with which available alphabetic materials are used. Stated conversely, it