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.
Despite the increased agricultural fields and food production, advances in agricultural technology and know-how have also caused significant environmental change in many regions. Monitoring irrigated lands and updating information about the use of each agricultural parcel is very valuable for a variety of agricultural-related agencies for research purposes. Additionally, many applications such as...
Quadratic assignment problems one of combinatorial optimization problems that pays to number of facilities to number of places. The objective is to minimize the cost. QAP is one of the degree of complexity of hard problems deterministic algorithms are able to solve smaller sample problem. Fast local search used to solve qap. but despite the wider space exploration. There are not certain views for...
This paper proposes a method for speeding up the estimation of the absolute value of largest eigenvalue of an asymmetric tridiagonal matrix based on Power method. An error analysis shows that the proposed method provide errors no greater than the usual Power method. The proposed method involves the computation of the tridiagonal matrix square under analysis, which is performed through a proposed fast...
This paper presents the analysis of various regression based machine learning algorithms for image-based plant phenotyping application and proposes a technique for plant phenotyping. Capability to predict age/development stage of a plant is one of the important factors for plant phenotyping and for analysis of in-situ crops. With the developed technique, these algorithms can predict age of an Arabidopsis...
Field polynomial division can be found in applications such as error detection and data encoding for digital communication systems. In addition, it implements the extended Euclidean algorithm (EEA), which can be used as the field inversion building block of elliptic curve cryptosystem. The unpredictability of the iterative algorithm of polynomial division in the EEA-Based field inversion results in...
In this paper, a novel algorithm is developed for the design of minimum-phase FIR filters with sparse impulse responses. Traditional minimum-phase FIR filter design approaches are based on autocorrelation sequences of impulse responses and design problems are formulated as a semidefinite program. To achieve sparse designs, l1 norm of filter coefficients is incorporated in the objective function as...
SkillsRec recommender (Skills based Recommender) is a novel Latent Semantic Analysis model driven recommendation system for online Personal Learning Environments that develops skill-similarity based user-user recommendations through semantically analyzing teacher-competencies and learner-interests. The recommender provides a solution to the inherent, massive and exponentially increasing information-overload...
For a large sum of data collected and stored continually, it is more and more necessary to mine association rules from database, and the Apriori algorithm of association rules mining is the most classical algorithm of database mining and is widely used. However, Apriori algorithm has some disadvantages such as low efficiency of candidate item sets and scanning data frequently. Support and confidence...
We derive a new computational algorithm for Barrett technique for modular polynomial multiplication, termed BA-P. Residue arithmetic is applied to BA-P to obtain a new Barrett algorithm for modular polynomial multiplication (BA-MPM). The work is focused on an algorithm that carries out computation using modular arithmetic without conversion to large degree polynomials. There are several parts to this...
Quantum computing is rapidly evolving especially after the discovery of several efficient quantum algorithms solving intractable classical problems such as Shor's factoring algorithm. However the realization of a large-scale physical quantum computer is very challenging and the number of qubits that are currently under development is still very low, namely less than 15. In the absence of large size...
A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for arithmetic using existing hand coded methods. Motivated by recent advances in reversible logic synthesis, we synthesize arithmetic circuits using classical design automation flows and tools. The combination of classical and...
Recently, due to the popularity of Web 2.0, considerable attention has been paid to the opinion leader discovery in social network. By identifying the opinion leaders, companies or governments can manipulate the selling or guiding public opinion, respectively. Additionally, detecting the influential comments is able to understand the source and trend of public opinion formation. However, mining opinion...
Most of the research on dictionary learning has focused on developing algorithms under the assumption that data is available at a centralized location. But often the data is not available at a centralized location due to practical constraints like data aggregation costs, privacy concerns, etc. Using centralized dictionary learning algorithms may not be the optimal choice in such settings. This motivates...
This paper presents an efficient algebraic fault analysis on all four modes of SHA-3 under relaxed fault models. This is the first work to apply algebraic techniques on fault analysis of SHA-3. Results show that algebraic fault analysis on SHA-3 is very efficient and effective due to the clear algebraic properties of Keccak operations. Comparing with previous work on differential fault analysis of...
A new direct method for solving general systems of linear algebraic equations originated by the author is applied to the repealed solution of a given system when changes of some rows occur in the system matrix. Such repeated computations are needed in numerous practical problems, e.g. in various imaging devices (electromagnetic, acoustic, etc.) or in linear optimization. The solution method is based...
This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on high-performance computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications in recognition, mining and...
In order to answer effectively on behalf of humans in a DeepQA environment, such as the American quiz show Jeopardy (http://www.jeopardy.com), the computer is required to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. Many existing spatial reasoners share a common limitation in that they do not contain conversion rules between the directional...
In software development process, developers often seek solutions to the technical problems they encounter by searching relevant questions on Q&A sites. When developers fail to find solutions on Q&A sites in their native language (e.g., Chinese), they could translate their query and search on the Q&A sites in another language (e.g., English). However, developers who are non-native English...
Today's rapid advances in the physical implementation of quantum computers demand for scalable synthesis methods in order to map practical logic designs to quantum architectures. We present a synthesis algorithm for quantum computing based on k-LUT networks, which can be derived from Verilog netlists using state-of-the-art and of-the-shelf mapping algorithms. We demonstrate the effectiveness of our...
Extreme machine learning and its variants have shown good generalization performance and high leaning speed in many applications through its fast convergence. Despite the parallel and distributed ELM on MapReduce framework able to handle very large scale dataset for bigdata applications, the process of coping up with the rapidly updating data is a challenging one. Among the unified algorithms, the...
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.