Electroencephalography (EEG) is an electrophysiological monitoring method to record electrical activity of the brain using different electrodes, which are considered as the EEG channels that are placed on scalp. In th...
详细信息
ISBN:
(纸本)9783319942681;9783319942674
Electroencephalography (EEG) is an electrophysiological monitoring method to record electrical activity of the brain using different electrodes, which are considered as the EEG channels that are placed on scalp. In this paper, we propose an effective information processing approach to explore the association among EEG channels under different circumstances. Particularly, we design four different experimental scenarios and record the EEG signals under motions of eye-opening and body-movement. With sequences of data collected in time order, we first compute the mutual conditional entropy to measure the association between two electrodes. Using the hierarchical clustering tree and data mechanics algorithm, we could effectively identify the association between particular EEG channels under certain motion scenarios. We also implement the weighted random forest to further classify the classes (experimental scenarios) of the EEG time series. Our evaluation results show that we could successfully classify the particular motions with given EEG data series.
We propose a novel classifier for a Recommender System which is based on a Kansei Model in this paper. We called this Recommender System as Kansei Recommender System (hereafter, we denoted as KRS algorithm). The purpo...
详细信息
ISBN:
(纸本)9781538672419
We propose a novel classifier for a Recommender System which is based on a Kansei Model in this paper. We called this Recommender System as Kansei Recommender System (hereafter, we denoted as KRS algorithm). The purpose of building KRS algorithm is to reduce the time of training data from database and give more precise recommender items for consumers by considering their Kansei (a Japanese word which means the consumers' psychological feeling). To build a novel classifier, we divide the KRS algorithm into two parts of algorithms: (1) algorithm 1 is proposed to extract Kansei factors (score 1) and evaluation factors (score 2) from consumers' shopping items. (2) algorithm 2 is proposed to give a training dataset that is to fit the scored value of Kansei model. Combining two algorithms, we get a novel classifier for a KRS algorithm. We give an architecture of KRS algorithm based on the database of on-line shopping market in the end of this paper.
The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at pres...
详细信息
ISBN:
(纸本)9780769548937
The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at presentation.
This paper is an example of the acquisition of multidimensional data of Rice leaf. The authors shortly introduces their experiment program, measuring tools, and then design and implement an algorithm for processing me...
详细信息
ISBN:
(纸本)9781509048656
This paper is an example of the acquisition of multidimensional data of Rice leaf. The authors shortly introduces their experiment program, measuring tools, and then design and implement an algorithm for processing measurement errors based on Dixon's Q-Test. The paper provides an easy and effective instrument for reducing errors in our future data measure.
Which technologies and algorithmic design are suitable for both the control strategy and the communication protocol to ensure robustness within a robotic swarm? The aim of this study is to answer this question. The st...
详细信息
Which technologies and algorithmic design are suitable for both the control strategy and the communication protocol to ensure robustness within a robotic swarm? The aim of this study is to answer this question. The study is performed by obtaining an understanding of the field of swarm robotics and proposing a robotic swarm system with robustness in mind. The robotic swarm system contains possible solutions for the con- trol strategy, the communication protocol, hardware design and an in-room localization method. The innovative part of this swarm system is the idea of joining communication and control in a cooperative manner, based on previous studies on different robotic swarms. The communication protocol was designed to establish a mesh topology using the Thread protocol, MQTT-SN and ROMANOs. ROMANOs is a new application overlay protocol based on ROMANO, and is first introduced in this project. The control strategy introduces a potential-field based PID-controller, designed for its efficiency and practical approach. The cooperation between communication and control is the fact that the estimation of signal strength values will directly affect the potential fields of the control strategy. The control strategy will then initiate control actions to maintain the communication network. The hardware design platform consists of two printed circuit boards that houses all neces- sary electronics to realize the swarm algorithm, and a 3D-printed cylindrical chassis. The in-room localization method is based on ranging measurements from laser sensors, signal strength estimates and heading computations based on magnetometer data. A listening device consisting of a Node. JS MQTT module is created in order to acquire performance data from the swarm which is stored in an SQL database and further analysed in MATLAB. The proposed swarm application yields a mostly favorable, but mixed result. The joint control- and communication algorithm is successful in finding a local minima within
This diploma thesis maps pupils understanding about a functional principle of using commands along with testing conditions (IF, IF - THEN, REPEAT - UNTIL, etc.) when creating algorithms. The main aim of the thesis is ...
详细信息
This diploma thesis maps pupils understanding about a functional principle of using commands along with testing conditions (IF, IF - THEN, REPEAT - UNTIL, etc.) when creating algorithms. The main aim of the thesis is to design and implement a set of lessons and a teaching approach based on a theory about learning of algorithmic concepts at primary education for pupils (aged in 9-11) with the intention of verifying a functionality of designed teaching procedures and their possible impacts on pupils understanding. Data was collected through continuous monitoring of pupils behavioural characteristics, progress and solution of chosen tasks, video recordings of task solving within the suggested unplugged activities, using a virtual tool *** for monitoring of a pupils progress, audio recordings of interview with pupils, and photographs capturing a creation of own blocks of commands set up by a transcription from pupils mother language into a machine language (programming language) have all been used for a verification process of the designed teaching approach. By combining the acquired data sets, adjustments of these procedures have been made in order to eliminate the most frequent problems that pupils have encountered during teaching. The case study findings revealed that it is important for...
Computational algorithms can be described in many methods and implemented in many languages. Here we present an approach using storytelling methods of computer game design in modeling some finite-state machine algorit...
详细信息
Computational algorithms can be described in many methods and implemented in many languages. Here we present an approach using storytelling methods of computer game design in modeling some finite-state machine algorithms and applications requiring user interaction. An open source software Twine is used for the task. Interactive nonlinear stories created with Twine are applications that can be executed in a web browser. Storytelling approach provides an easy-to-understand view on computational algorithms allowing communication with people with no computer science education. It also allows rapid prototyping and testing in mixed background work teams. (C) 2018 The Authors. Published by Elsevier B.V.
Flowchart brings the advantage of efficiency into the program design. designers can achieve clearer structure refer to flowchart. It's a powerful method in the process of program design. However, the traditional f...
详细信息
ISBN:
(纸本)9781450353526
Flowchart brings the advantage of efficiency into the program design. designers can achieve clearer structure refer to flowchart. It's a powerful method in the process of program design. However, the traditional flowchart is only designed on single site. It leads to the low efficiency and less diversity. Based on these problems, this paper aims at using collaborative algorithm to complete the distributed flowchart design. The paper mainly solves the problems of the operation conflicts which come from different sites, and analyzes the typical consistency maintenance algorithm, constructs the flowchart model, analyzes the flowchart operations, devises the conflict resolution strategy and describes the consistency maintenance work flow. At last, a correctness proof is also given to validate the whole strategy.
In geographic routing, position updates and load distribution are crucial to achieve a good performance. There is a concern with load distribution when it comes to dense network where there are large number of connect...
详细信息
In geographic routing, position updates and load distribution are crucial to achieve a good performance. There is a concern with load distribution when it comes to dense network where there are large number of connections and huge traffic. Load balanced, Adaptive Position Update (LAPU) routing protocol solves the problem of load distribution among paths in a network with reduced position updates occurring adaptively and next hop decisions based on node's congestion status in geographic routing. In our proposed work, to achieve load balancing, a node selects two best nodes available to the destination based on node mobility and queue length and it divides the load among them, i.e., it transfers the packets in both paths. Parameters such as end-to-end delay of packet transmission, energy consumption, throughput, and routing overhead are considered to compare the performance of the proposed work.
Information-centric networking (ICN) is a popular research topic. At its heart is the concept of in-network caching. Various algorithms have been proposed for optimizing ICN caching, many of which rely on collaborativ...
详细信息
Information-centric networking (ICN) is a popular research topic. At its heart is the concept of in-network caching. Various algorithms have been proposed for optimizing ICN caching, many of which rely on collaborative principles, i.e. multiple caches interacting to decide what to store. Past work has assumed altruistic nodes that will sacrifice their own performance for the global optimum. We argue that this assumption is insufficient and oversimplifies the reality. We address this problem by modeling the in-network caching problem as a Nash bargaining game. We develop optimal and heuristic caching solutions that consider both performance and fairness. We argue that only algorithms that are fair to all parties involved in caching will encourage engagement and cooperation. Through extensive simulations, we show our heuristic solution, FairCache, ensures that all collaborative caches achieve performance gains without undermining the performance of others.
暂无评论