This paper introduces a hybrid communication paradigm for achieving seamless connectivity in Vehicular Ad hoc Networks (VANETs), wherein the connectivity is often affected by changes in the dynamic topology, vehicles&...
The paper gives design methods dedicated to speed control of Direct Current (DC) and Brushless Direct Current (BLDC) motors in the framework of servo systems. Two design approaches are offered for position and speed c...
详细信息
The paper gives design methods dedicated to speed control of Direct Current (DC) and Brushless Direct Current (BLDC) motors in the framework of servo systems. Two design approaches are offered for position and speed control of servo systems with inner current control loops. The PI and PID controllers in these approaches are tuned on the basis the Extended Symmetrical Optimum method and of the double parameterization of Symmetrical Optimum method. Cost-effective features are ensured by simple controller designs and easy implementations, and they are illustrated by means of a case study that includes simulation results. A two-degree-of-freedom interpretation is given. A BLDC motor application applied to mechatronic systems is presented.
Adaptive systems are critical for future space and other unmanned and intelligent systems. Verification of these systems is also critical for their use in systems with potential harm to human life or with large financ...
详细信息
We have developed a system, allowing real-time monitoring of human gestures, which can be used for the automatic recognition of behavioural correlates of psychological stress. The system is based on a low-cost camera ...
详细信息
An algorithmic framework is developed for automatic deployment of car-like robots based on Linear Temporal Logic (LTL) formulae over a set of regions of interest in the environment. The environment and the regions of ...
详细信息
This paper proposes the use of a multi-agent system (MAS) with affective agents in a recommendation system based on relational data clustering. This MAS works as a mediator between the user and the data stored in the ...
详细信息
We have investigated several characteristics of keystroke dynamics in Japanese long-text input. We performed experiments with 189 participants, classified into three groups according to the number of letters they coul...
详细信息
Let 5 be a string of length N compressed into a context-free grammar S of size n. We present two representations of S achieving O(logN) random access time, and either O(n · αk(n)) construction time and space on ...
详细信息
ISBN:
(纸本)9780898719932
Let 5 be a string of length N compressed into a context-free grammar S of size n. We present two representations of S achieving O(logN) random access time, and either O(n · αk(n)) construction time and space on the pointer machine model, or 0(n) construction time and space on the RAM. Here, αk(n) is the inverse of the kth row of Ackermann's function. Our representations also efficiently support decompression of any substring in S: we can decompress any substring of length m in the same complexity as a single random access query and additional O(m) time. Combining these results with fast algorithms for uncompressed approximate string matching leads to several efficient algorithms for approximate string matching on grammar-compressed strings without decompression. For instance, we can find all approximate occurrences of a pattern P with at most k errors in time O(n(min(|P|k,k4 + |P|) + logN) + occ), where occ is the number of occurrences of P in S. Finally, we are able to generalize our results to navigation and other operations on grammar-compressed trees. All of the above bounds significantly improve the currently best known results. To achieve these bounds, we introduce several new techniques and data structures of independent interest, including a predecessor data structure, two "biased" weighted ancestor data structures, and a compact representation of heavy-paths in grammars.
Collaborative tagging services provided by various social web sites become popular means to mark web resources for different purposes such as categorization, expression of a preference and so on. However, the tags are...
详细信息
In the last decades the explosion of Information and Communication Technologies has led to a whole new scenario concerning peoples' accessibility to new job opportunities and companies' options for employing t...
详细信息
ISBN:
(纸本)9789898425515
In the last decades the explosion of Information and Communication Technologies has led to a whole new scenario concerning peoples' accessibility to new job opportunities and companies' options for employing the right person for the right job. But, is there a way to exploit today's technological advances as well as people's web presence in order to achieve this goal? In this work we present a set of techniques that makes the whole recruitment process more effective. We have implemented a system that models the candidate's CVs in HR-XML, and ranks the candidates based on AHP (Analytic Hierarchy Process). Finally, it presents the results to the recruiter who evaluates the top candidates and takes the final decision.
暂无评论