The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The crossed cube is an important variant of the hypercube $Q_n$, it has many properties superior to hypercube. In this paper, we studied an important property about vertex distance in $CQ_n$, that is, for any vertex $u_L \in L$, is a neighbor of in $L$, and be neighbors of in $R$, respectively, then, the distance between and is 1 or 2 or 3. According to the result,...
Based on the research and analysis of interactive text properties, the word frequency statistics and synonyms merger are imported to obtain the keywords of interactive text. The Sentence similarity is used to describe the degree of coupling between sentences. Then a novel topic partition algorithm based on average sentence similarity is proposed. The experimental results show the effectiveness of...
This article covers a problem that often arises in real life situations-the maximum flow problem. This problem is a classical combinatorial optimization problem, which arises in many engineering and scientific applications. It is also the important content of computer science and operational research. In order to reduce computational complexity, many improvement methods have been proposed. In this...
Coverage holes often exist in wireless sensor networks deployed with static nodes. In order to patch the holes and recover the network performance, an algorithm based on mobile nodes is presented, which guides the mobile nodes to the position of holes, and then get the resilient coverage. The static sensors bound a coverage hole can compute the optimum position for the mobile sensors which, after...
Recently, Tsukada et al. propose to use multi-agent epistemic logic for a taxonomy of information-hiding/disclosure properties, in particular properties used in authentication protocols. We follow their proposal and introduce a new multi-agent justification logic for protocol analysis and verification. We show our logic at work analyzing a non-repudiation protocol due to Zhou and Gollmann. Based on...
Using the ideas of game theory, L. H. Nguyen transformed two families of authentication protocols where the honest party transmitted some useless data with probability before the normal protocol run, so that even if an attacker attacks a protocol, the attacker's payoff will still be lower than when it does not. In such a way, the security of the protocol is guaranteed. However, this scheme suffers...
The problem of closest pair is a basic problem of computational geometry. This paper investigates the problem of privacy-preserving closet pair and designs a protocol. This protocol bases on Euclid-distance measure protocol and private comparison protocol. The main idea of this protocol is using the Euclid-distance measure protocol to respectively compute the distances of one party's one point and...
Visual cryptography is a cryptographic technique to achieve visual secret sharing. Shares are distributed to every participant and overlapping a number of shares can recover the original secret. The participants' cheating is discussed more in previous literatures. However, the issue of the distribution center's dishonesty exists similarly in visual cryptography. In this paper, a verifiable visual...
ID3 is the most classical algorithm generating decision tree. Greedy search strategy is applied to choose splitting attributes. Though it can insure the least testing frequency, the quick classifying speed and a decision tree with the least nodes, the shortcoming of inclining to attributes with many values still exists. However, these attributes are often not the optimal splitting attributes. Therefore,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.