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.
Dynamic adaptive streaming over HTTP (DASH) requires a video server to transcode each original video object to all the possible bit-rate versions, resulting in high CPU power consumption. To address this, we propose a new scheme that balances quality-of-experience (QoE) against transcoding energy. We start by introducing the concept of transcoding gain to express QoE achieved as a result of transcoding...
We study efficient computation of Minimax distances measures, which enable to capture the correct structures via taking the transitive relations into account. We analyze in detail two settings, the dense graphs and the sparse graphs. In particular, we show that an adapted variant of the Kruskal’s algorithm is the most efficient approach for computing pairwise Minimax distances. However, for dense...
In the communication problem UR (universal relation), Alice and Bob respectively receive x, y ∊{0,1\}^n with the promise that x≠ y. The last player to receive a message must output an index i such that x_i≠ y_i. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly \Theta(\min\{n,\log(1/δ)\log^2(\frac...
The increase in the size of the data used in natural language processing activities brings with it time and space constraints. Thus, it is important to both store and access data efficiently. This study includes experiments for storing the term-document index, which will be used in a natural language processing project, effectively in memory. For this purpose, the indexed data is compressed using...
Some rheumatoid arthritis patients are not clinical response to Rituximab treatment, so the identification of candidate genes for Rituximab response is very important which might contribute to improve the response chance. This paper identifies the candidate genes in a module view, which is more robust and biologically meaningful compared to the conventional gene differentially expressed analysis....
This paper address the problem of scheduling a set of jobs with non-zero ready times and incompatible job families on a set of identical parallel batch machines so as to minimize the total weighted tardiness. In this problem, each machine can process several jobs of a same family simultaneously as a batch as long as the machine capacity is not exceeded. Jobs of a family has the same processing time...
In this paper, we examine a joint user pairing and dynamic power allocation (JUPDPA) design to maximize the energy efficiency (EE) in the multicell multiple-input multiple-output (MIMO) — non-orthogonal multiple access (NOMA) downlink system. A novel JUPDPA scheme is proposed based on median and the euclidean norm of the channel vectors. In addition, base station dynamically allocates the transmission...
Based on the analysis and summary of the features of existing STL (Stereolithography) model slicing algorithms, the STL model slicing algorithm that based on dynamic adjacent edge is proposed. According to the Z-max and Z-min of the Z-coordinate projection in the slice direction and the thickness of the every layer, achieving slicing the whole STL model, and the topological relation of the adjacent...
Dividing a dataset into disjoint groups of homogeneous structure, known as data clustering, constitutes an important problem of data analysis. It can be solved with broad range of methods employing statistical approaches or heuristic procedures. The latter often include mechanisms known from nature as they are known to serve as useful components of effective optimizers. The paper investigates the...
Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work,...
In this paper, we present two methods which find optimal bass guitar fingerings. Generally, bass guitar scores contain tablatures but have no fingering. Therefore, a bass guitar player has to find the optimal fingering to perform a piece of music. This task is not easy and sometimes the bass guitar player must try out a variety of different fingerings. Both of these methods are based on dynamic programming...
We are interested in an easy combinatorial optimization problem having several applications in the real world, namely the matrix chain product problem that may be solved by a well known dynamic programming algorithm (DPA). Our contribution is two-fold. It first consists in the design of an approach based on the DPA for the determination of multiple optimal solutions i.e. optimal parenthesizations...
This research considering one working partition of order picking system as the research object, studies order batching problem and builds order batching model of fixed maximum order number. To solve the order batching model, the storage location similarity coefficient is token as clustering index, at the same time clustering algorithm is designed. This paper explores the application analysis of the...
In this paper, A solution is proposed for the multi-robot task assignment in obstacle environment, which combines the A∗ algorithm with the genetic algorithm. Our main work are twofold:(a) Path planning method based on A∗ algorithm to search an optimal path between any robot and any target or any two targets; and (b) task assignment method based on the genetic algorithm for the assignment of robots...
Video sequences contain rich dynamic patterns, such as dynamic texture patterns that exhibit stationarity in the temporal domain, and action patterns that are non-stationary in either spatial or temporal domain. We show that a spatial-temporal generative ConvNet can be used to model and synthesize dynamic patterns. The model defines a probability distribution on the video sequence, and the log probability...
Documents encrypted on the cloud servers can improve security, it also brings about a challenging question for secure query. We use the vector space model (VSM) to obtain the similarity of the documents. In this paper, we use a secure method to support multi-keyword parallel query, which the improved multi-tree [1] can storage the vector value and query similar to the linear. The advantage of using...
Hydrocracking process is a complex long-running industrial process. The change of inlet conditions will result in fluctuation of operating parameters and change of running state. It is necessary to classify the inlet conditions to detect the change of raw materials timely, so that the subsequent global operation conditions can be analyzed. However, sampling analysis of the quality indexes of raw oil...
This study intends to evaluate the rear-end collision risk under fog conditions considering reduced visibility by introducing a new algorithm. Based on the proposed algorithm, the minimum stopping distance of the leading and following vehicles can be calculated with traffic and weather data and compared. According to the relationship between clearance distance between the two consecutive vehicles...
The experimental characterization of an autofocus algorithm using a liquid lens objective is presented. The objective embeds an electro-wetting based lens whose focal length is voltage controlled. Two sharpness indexes are used to measure the image focus condition in the algorithm allowing a very robust and accurate setting of the focus. The algorithm has been characterized using target images differing...
In this article, the survivable routing problem on elastic optical networks (EONs) for single link-failure is studied. The failure-independent path-protecting p-cycles (FIPP p-cycles) protection scheme is used for request protection. Two heuristic algorithms are proposed to solve this problem.
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.