778 results found.
Year: 2014, Volume: 14, Number: 1
... , WAPTT research is a dynamic approach in the identification of web uses an efficient algorithm for page similarity detection. The applications vulnerabilities, i.e. our primary goal ... we decided to use both vulnerable to attack in question (Figure 5). algorithms for similarity detection. This applies to all SQLI types, except for special ...
Terms matched: 2 - Score: 55 - 600k
Year: 2014, Volume: 14, Number: 1
... CANaerospace messages. Data frame length nD was chosen as an 11 bit identifier. When the identifier is 11 bits, there can be 211 messages, III. ALGORITHM FOR CYCLE MATRIX DESIGN which is 2048. This amount of messages is more than The first step for proposing a Cycle Matrix is to know the sufficient for ...
Terms matched: 1 - Score: 10 - 804k
Year: 2014, Volume: 14, Number: 1
... interest in the research community [10]. consumption of these devices. Wake-on-a-Schedule algorithm is proposed reducing the energy consumption of devices placed in IEEE 802.11 implemented a ... that our algorithm can save up to 60% performance. The other papers proposed algorithms that of energy consumption on the client side. additionally minimize the energy consumption ...
Terms matched: 2 - Score: 42 - 652k
Year: 2014, Volume: 14, Number: 1
... of such changing factors. TABLE III. THE RECOGNITION RESULT OF SPIDER AND COMPARISON ALGORITHM IN FERET DATABASE Method fb fc dupI dupII SPIDER (un-weighted) 0.96 0.85 ... International Journal of Innovative Computing, Information and database and evaluation procedure for face recognition algorithms," Control, vol.5, no.3, pp. 641-651, 2009. ...
Terms matched: 2 - Score: 8 - 886k
Year: 2014, Volume: 14, Number: 1
... Volume 14, Number 1, 2014 Fast Decision Tree Algorithm Vasile PURDILÄ‚, Åžtefan-Gheorghe PENTIUC Stefan cel Mare University ... process large amounts of data using the well-known decision-tree learning algorithms. Building a decision tree as fast as possible ... bit arise, both on the human and on the algorithmic side." operations: One may ask the ...
Terms matched: 3 - Score: 131 - 593k
Year: 2014, Volume: 14, Number: 1
... path from one vertex v1 to a vertex vn is a sequence of graph search algorithm like Dijkstra or A* to find a solution vertices starting with v1 and ... describe (say what is) or specify (say what should be) the algorithms have been applied to planning queries formulated behavior of a time-varying system, and ...
Terms matched: 2 - Score: 95 - 717k
Year: 2014, Volume: 14, Number: 1
... Finally, this procedure is continuously performed The following sections describe the approach, the built until the whole space for selected positions is covered. After measurement station, algorithms, result illustrations, and the final position is reached, the whole procedure starts conclusions. again. The current design required just less than 20 minutes for ...
Terms matched: 1 - Score: 6 - 884k
Year: 2014, Volume: 14, Number: 1
... [1-7]. (1) The basic systolic algorithm for computing C (1)= (cij ... SYSTOLIC performance of the proposed solution, we have introduced ALGORITHMS quantitative and qualitative performance criteria. For the ULSA ... required by those architectures, with aim to achieve high Algorithm_1 processing rate, is not taken into account. ...
Terms matched: 7 - Score: 251 - 735k
Year: 2014, Volume: 14, Number: 1
... Index Terms — eddy current, inverse problem, finite element The stochastic identification in eddy current problems method, Monte Carlo method. using finite element procedures, optimization algorithms and sensitivity analysis has not been discussed in the literature. I. INTRODUCTION The analysis of electromagnetic field problems such as II. STEED-STATE CURRENT PROBLEM eddy current ...
Terms matched: 1 - Score: 7 - 592k
Year: 2014, Volume: 14, Number: 1
... considered recency direct-mapped organizations are used. However, hardware implementation of the random replacement algorithm is and frequency of referenced. more complex compared with that of the pseudo-random ... . involves examining a long history of references without increasing space or time requirements. Algorithms based on II. RELATED RESEARCH NNs use learning capabilities to recognize patterns and ...
Terms matched: 2 - Score: 53 - 707k