We review the mathematical properties of the generalized entropies, based on our previous papers. This review is an extended version of our article [9]. The Tsallis entropy defined for a quantum state is uniquely deri...
We review the mathematical properties of the generalized entropies, based on our previous papers. This review is an extended version of our article [9]. The Tsallis entropy defined for a quantum state is uniquely derived from three axioms. A generalized Fannes’ inequality is shown. The maximum entropy principle in Tsallis statistics are revisited as an application of the Tsallis relative entropy defined for nonnegative matrices in the framework of matrix analysis. A variational expression for Tsallis relative entropy is derived and some related inequalities are studied. Finally, an application to qunatum information theory is discussed.
A novel Lagrangian "individual-based" isotropic continuous time exponential type swarming model with a family of attraction/repulsion function is proposed in this article. The stability of aggregating behavi...
详细信息
Extensible markup language (XML) is a sub part of the standard generalized markup language (SGML) and is a mother of wireless markup language (WML). This technology is effective for storage, searching and retrieval of...
详细信息
Extensible markup language (XML) is a sub part of the standard generalized markup language (SGML) and is a mother of wireless markup language (WML). This technology is effective for storage, searching and retrieval of data based on query. The bottleneck in the normal search engines is the lackness of proper metadata which proves to be an obstacle in the quick data retrieval. The XML has been replacing the traditional slow techniques quickly. The proposed system performs the efficient tag based online searching using simple application programming interface for XML (SAX) parser. system provides option to the user to store the entire document as an XML user-defined column. Fast search via indices is made for XML elements and this result in faster retrieval. Proposed system uses a SAX based component which uses the developed XML files for the retrieval. Component has been designed in such a way to get precise and efficient results.
The RFID system is a contactless automatic identification system that identifies tags attached on goods through radio frequency communication. This system is expected to supplant barcode systems, the contact reading t...
详细信息
The RFID system is a contactless automatic identification system that identifies tags attached on goods through radio frequency communication. This system is expected to supplant barcode systems, the contact reading technique that is most widely used at present. The RFID system can be applied in a variety of areas. Among those, Ari Juels proposed an environment to prove that a pair of tags has been scanned simultaneously. And he presented a "yoking proof" protocol for this. But the yoking-proof protocol is vulnerable to replay attack. Although modified yoking-proof protocols for alleviating this drawback have been proposed, they are not immune to replay attack, either. In this paper, we analyze problems of existing yoking-proof protocols and present a new protocol, which will make replay attack difficult, based on this analysis. We have also extend this protocol so that it can provide yoking proofs for a tag group, including a multiple number of tags.
In todaypsilas high density wireless networks, interference is considered one of the main factors limiting the capacity and increasing the new call blocking probability of a cellular system. In this paper we discuss a...
详细信息
ISBN:
(纸本)9781424434497
In todaypsilas high density wireless networks, interference is considered one of the main factors limiting the capacity and increasing the new call blocking probability of a cellular system. In this paper we discuss and analyze interference scenarios in cellular systems and we propose a novel scheme based on iterative distributed swapping scheme to reduce the interference they experience.
The latest Semantic Web developments and insights in knowledge management challenge the new era of semantic-based knowledge-management systems, where lies the new possibilities that Semantic Web affords for improved k...
详细信息
The latest Semantic Web developments and insights in knowledge management challenge the new era of semantic-based knowledge-management systems, where lies the new possibilities that Semantic Web affords for improved knowledge management. Connectivity and interoperability of knowledge management systems is the key to the vision of the future. We need a comprehensive framework that addresses main issues related to distributed Knowledge Management. Semantic Web Services (SWS) is the next major generation of the Web in which e-services and business communication become more knowledge-based. It proposes to extend the traditional Web Services technologies with its key enabling technologies of ontologies and semantics; to solve the problem of heterogeneity and interoperability of data across applications. This makes it possible to select, integrate and invocate services dynamically, which enable services to adapt themselves to changes without human intervention. The main purpose of this paper is to present the relevance of SWS technologies to KMS. Further, we discuss about the two major initiatives in SWS research. Later, we will propose ontology based semantic web services framework for KMS. Our focus is in the web service provider layer where we will introduce the three main components; knowledge manager, web service manager and ontology mapping manager.
In this article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility...
详细信息
In this article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility functions are used here for calculating the suitable path for sending data packet from source to destination selecting the proper neighborhood on the basis of radio range of the source node. The radio range is determined depending on the Proximity Index and birth rate and death rate of the neighborhood nodes of the source *** data packet is changing hops within source and destination some credit and penalty are introduced to the next and previous hops respectively. In the concluding section of the present article a measure of gain (in delay) has been introduced for comparison of the existing methods vis-a-vis that of the proposed one.
We introduce a generalized Wigner-Yanase skew information and then derive the trace inequality related to the uncertainty relation. This inequality is a non-trivial generalization of the uncertainty relation derived b...
详细信息
ISBN:
(纸本)9781424420681
We introduce a generalized Wigner-Yanase skew information and then derive the trace inequality related to the uncertainty relation. This inequality is a non-trivial generalization of the uncertainty relation derived by *** for the quantum uncertainty quantity excluding the classical mixture. And we introduce a generalized Fisher information and then derive a generalized Cramer-Rao inequality. We also give an example for our generalized Fisher information and then derive the uncertainty relation for two observables.
We present a new approach for modeling color attacks of RGB-color watermarked images. We have used a based interpolation watermarking algorithm and supposed that the attacks are simulated by a scaling of the colors fo...
详细信息
We present a new approach for modeling color attacks of RGB-color watermarked images. We have used a based interpolation watermarking algorithm and supposed that the attacks are simulated by a scaling of the colors followed by a translation. We give bounds for the extracted watermark depending on the original image, the watermark and the attack. Different attacks like LSB, embedding another watermark, Stirmark have been simulated and the quality of the extracted watermark is discussed in each case.
The QoS routing is based on the computing of each flow as regards the dynamic request, the routing computing is more frequent and the granularity of resource distribution is more smaller. Aiming at fast routing comput...
详细信息
The QoS routing is based on the computing of each flow as regards the dynamic request, the routing computing is more frequent and the granularity of resource distribution is more smaller. Aiming at fast routing computing, the method of pre-computing for parallel computing based on QoS matrices is proposed: the Pareto subset of viable path which satisfy routing constrain will be taken into account, the suitable route will be selected among the Pareto subset. In other words, the routing problem can be divided into two problem: suitable path selection unconcerned with practical routing request and route optimize concerned with practical routing request.
暂无评论