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.
In this paper, we propose an efficient terrain meshing method based on discrete point cloud, which is based on the existing meshing method of 3D reconstruction. Our meshing method uses the DTM (Delaunay Triangle Mesh) as a criterion to establish vertex constraints and evaluation functions. We start from a seed triangle and use the growing method to extend the outer-edge of each triangle until all...
The Open University of Israel offers a program of study for Computer Science graduates towards a high school Teaching Certificate in Computer Science. The program is unique in that it enables studying towards the certificate in a distance learning environment and therefore can be pursued by people who wish to combine further education with careers and personal responsibilities. In this paper we describe...
Program invariant is formal description of properties that should hold at certain program location in every valid execution. It is very useful for program analysis and verification. In this paper, we introduce an abstraction interpretation approach for generating program invariant efficiently and precisely. A polynomial interval domain is proposed for representing abstract state and precise loop effect...
Most pedestrian detection algorithms only provide the object region instead of the actual body segmentation in video. For reducing the large number of redundant information and extracting a clear contour and texture feature of an up-right person, a superpixel segmentation algorithm with region correlation saliency analysis is proposed from coarse to fine cutting without any prior information. This...
Sweeps is a well-known localization algorithm based on the consistent connection constraints in WSN, and utilizes the concept of finite localization to relax the constraint conditions from trilateration to bilateration. In this paper, we deeply analyze the finite localization in various localization environments, and uniquely localize the finitely localized node without flip ambiguities using iterative...
This paper proposes an algorithm that is particularly concerned with generating all possible distinct spanning trees that are based on breadth-first-search directed graph traversal. The generated trees span all edges and vertices of the original directed graph. The algorithm starts by generating an initial tree, and then generates the rest of the trees using elementary transformations. It runs in...
Image matting techniques are a key step of image processing or video editing, which is widely used nowadays. So, it has a highly demanding on processing speed. Since it usually takes a long time to process images using existing image matting algorithms, especially in high-resolution images or videos, this paper proposes a state-of-art image matting speed-up method to solve the slow-processing problem...
Name ambiguity arises when one retrieves publications written by distinct author entities who share the same name. During the past decades, a myriad of supervised and unsupervised methods have been proposed to resolve the ambiguity of author names and boost retrieval performance for digital libraries and other similar websites such as Citeseer1 and WanFang2. However, most of them either need large...
Radio Frequency Identification (RFID) technology is a contactless automatic identification technology. With the wide application of this technology in many fields, anti-collision algorithm to solve the problem of multi-tag identification becomes more and more important. The current RFID anti-collision algorithm is mainly divided into two categories: ALOHA based algorithm and tree based algorithm....
Texture synthesis is the hot research topic in the field of computer vision, computer graphics and image processing. Sample-based texture synthesis method has been proposed and becomes a new texture tiling technique with the development of the texture mapping and procedural texture synthesis. Image Quilting stitching algorithm is an ideal algorithm for the texture stitching. In this article, by using...
Bent function is an important nonlinear function in design of stream cipher and S-box. More than eight variables Bent functions can only be generated by construction, up to now, most of these functions are still not found. In this paper, the Bent function search algorithm based on truth table is presented via analyzing the value distribution and run length property of the Bent function. Compared with...
While there is a large amount of text data on the Internet, people need to organize the text data with experienced category. However, the flat structure of categories could not satisfy the modern information management. To solve this problem, we propose a hierarchical classification process with a strategy, called candidates, used to relieve the blocking problems. Besides, we establish the description...
S. Lee, D. Choi and Y. Choi proposed an improved countermeasure algorithm of RSA cryptosystem with Chinese Remainder Theorem to prevent fault attack. In this paper, we introduce new fault attacks on their countermeasure algorithm. Our analysis shows that the attacker can obtain an erroneous signature by injecting some faults during the RSA signing computation. Thus the attacker can recover the RSA...
Unconstrained binary quadratic programming problem (UBQP) is a well-known NP hard problem that consists in maximizing a quadratic 0-1 function. It is considered as a unified model for a variety of combinatorial optimization problems. Recently, a multi-objective extension of UBQP is defined and a set of benchmark instances is proposed. This paper proposes a decomposition-based multi-objective tabu...
A general method for the reliability evaluation of multistate networks is using minimal path vectors (d-MPs for short). Most reported works on generating d-MPs are based on minimal paths (MPs for short). Currently, all reported MP-based algorithms generate duplicated d-MPs during the search process and additional recursive comparison is required to remove those duplications. However, the number of...
In most differential evolution (DE) algorithms, little work for the design of the mutation operator is directly relevant to the information of fitness landscape of the problem being solved. As the previous studies show, different mutation strategies are suitable for different problems with different fitness landscapes, and the performance of the mutation strategy is tightly linked to the fitness landscape...
This paper proposes a dynamic decision-making algorithm that controls power allocation for minimizing time-average energy expenditure in millimeter-wave (mmWave) modular antenna array (MAA) networking platforms. In the reference networking system, multiple MAA modules exist and each MAA module consists of multiple elements; and the proposed algorithm dynamically allocates powers to the elements in...
This paper is based on the previous research that selects the proper surrogate nodes for fast recovery mechanism in industrial IoT (Internet of Things) Environment which uses a variety of sensors to collect the data and exchange the collected data in real-time for creating added value. We are going to suggest the way that how to decide the number of surrogate node automatically in different deployed...
A k-ary n-tuple necklace is an equivalence class of k-ary strings under rotation. The classical idea is to treat them as characters. As the numbers being treated as characters can always being treated as numbers, like we treat char and int as the same type of variables in computer science, we present a new arithmetic algorithm using the decomposition of the ring Z/(kn – 1) on generating necklaces...
With the development of web service technology, identifying and discovering the users with similar preferences have an important significance to service selection and service optimization in the service environment. In order to divide the users into groups based on their preference similarity in the process of service selection, a combination-based clustering algorithm, named AAK, is presented in...
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.