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.
This paper solves the problem of computing the best grasp in a discrete point set based on a popular grasp quality measure, namely the largest origin-centered ball contained in the grasp wrench set. So far, the solution to this problem is very limited. Noticing that the quality measure for a grasp is equal to the minimum value of the support function of its grasp wrench set over all directions and...
Due to the large number of requirements for city express services in recent years, the current city express system is found to be unsatisfactory for both the service providers and customers. In this paper, we are the first to systematically study the large-scale dynamic city express problem. We aim to increase both the effectiveness and the efficiency of the scheduling algorithm. The challenges of...
We propose an improved ant colony algorithm for dynamic traffic grooming (IACA-DTG) in asynchronous optical packets switching networks, by using of the ratio of available wavelengths and path chosen length each iteration and the dynamic information updated on the available instant wavelengths in full network, which can implement traffic grooming under shorter path and less iterations. The algorithm...
The static output feedback control problem is investigated in this paper for continuous descriptor systems. New necessary and sufficient conditions are established to ensure the admissibility of the continuous descriptor systems. Then, based on the new necessary and sufficient conditions, sufficient conditions are derived for admissibility of the closed-loop systems. The desired static output feedback...
In VoIP over WLAN (known as VoWLAN) transmission, one of the main problems is that the supported voice channel capacity is relatively low. As an improvement to IEEE 802.11 MAC layer Carrier Sense Multi-Access/Collision Avoidance (CSMA/CA) algorithm, this paper presents Prediction/Collision Avoidance (P/CA) mechanism based on service attribute and cross-layer control. Under this mechanism, there is...
By reviewing the original INIQGA algorithm, an improved algorithm (IINIQGA) is put forward by revising the lookup table. In addition, By introducing the variable angle-distance rotation method into the update Q(t) procedure, a novel quantum-inspired evolutionary algorithm, QEA-VAR, was proposed. Compared with previous algorithms, our update Q(t) procedure is more simple and feasible. Finally, the...
We study the circular packing problem (CPP) which consists of packing a set of circles of known radii into a larger containing circle without overlapping. The objective is to determine the smallest radius of the containing circle and the coordinates of the center of every packed circle. To solve CPP, we propose a heuristic simulated annealing (HSA) algorithm that incorporates heuristic neighborhood...
In this paper, we study the circles packing problem which consists of packing a set of equal or unequal circles of known radii into a larger containing circle without overlapping. The energy landscape paving (ELP) method is a class of heuristic global optimization algorithm. By combining the ELP method with the gradient descent (GD) procedure, an improved energy landscape paving (ELP+) algorithm for...
Based on the distance algorithm by Gilbert et al., this paper presents a numerical algorithm for computing the intersection of the boundary of a compact convex set with a ray emanating from an interior point of the set, which is known as the ray-shooting problem. Affinely independent points on the boundary of the convex set are also determined such that the intersection point can be written as their...
In this paper, a novel teaching system for programming, data structure as well as algorithm design is proposed in which a self-studying platform with real-time online judging system is presented. Through the platform, the traditional teaching mode is improved so that the students will have more opportunities to practice their programming skill making them knowing as well as mastering the programming...
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative combinations of points of a given set. If the given set is finite, the algorithm converges in a finite number of iterations. The iterative computation speeds up with the help of the derived recursive formulas and effective...
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.