This paper describes a swarm control algorithm based on distributed pheromone maps to effectively track a moving fire front. The algorithm uses a single heuristic to maintain persistent surveillance to detect new fire...
详细信息
ISBN:
(纸本)9781479904532
This paper describes a swarm control algorithm based on distributed pheromone maps to effectively track a moving fire front. The algorithm uses a single heuristic to maintain persistent surveillance to detect new fires, while concurrently allowing for tracking of known fires. Control of the swarm is fully distributed and self-contained; requiring no external communication infrastructure and being resilient to individual hardware failures.
This article examines a new lightweight, slim, high energy efficient, light-transmitting, self-supporting envelope system, providing for seamless, free-form designs for use in architectural projects. The system exploi...
详细信息
IoT (Internet of Things) bridges the physical world and information space. IoT services are environment sensitive and event-driven. The new IoT service architecture should adapt to these features. This paper analyses ...
详细信息
IoT (Internet of Things) bridges the physical world and information space. IoT services are environment sensitive and event-driven. The new IoT service architecture should adapt to these features. This paper analyses IoT sensing service characteristics and proposes the future services architecture. It is focused on the middleware architecture and the interface presentation technology. In the middleware layer, the traditional SOA architecture is insufficient in the real-time response and parallel process of services execution, this paper proposes that the new sensing service system based on EDSOA (Event Driven SOA) architecture to support real-time, event-driven, and active service execution. At presentation layer, this paper presents the new IoT browser features including using augmented reality technology to input and output, and realize the superposition presentation of the physical world and abstract information. Through a use case and proof-of-concept implementation-road manhole covers monitoring system - we verify the feasibility of the proposed ideas and frameworks.
In this article, we investigate word sense distributions in noun compounds (NCs). Our primary goal is to disambiguate the word sense of component words in NCs, based on investigation of "semantic collocation"...
详细信息
This paper presents a tool that addresses self-management expression of pain, through an Android application based on multimodal and 3D. Our pilot evaluation highlighted a positive attitude towards the usability of Pa...
详细信息
The research team has leveraged the research conducted in recent Natural Language Processing studies and designed a computerized marking mechanism for marking students' short-answers based on the semantic meaning ...
详细信息
ISBN:
(纸本)9781479903733
The research team has leveraged the research conducted in recent Natural Language Processing studies and designed a computerized marking mechanism for marking students' short-answers based on the semantic meaning of those answers. An open access Auto marking web service has been developed to provide short-answer marking service for everyone. Auto marking service is also a self-sustainable complete online exam system which schools and teachers can use it to create their own item bank and tests, to manual and to auto mark students' answer sheets, and to review the results from various perspectives such as test, item, and individual student.
This article present new algorithm for clustering data in the presence of obstacles. In real world, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the ...
详细信息
ISBN:
(纸本)9789898565389
This article present new algorithm for clustering data in the presence of obstacles. In real world, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the result of clustering significantly. In this paper, we study the problem of clustering in the presence of obstacles to solve location of public service facilities. Each facility must serve minimum pre-specified level of demand. The objective is to minimize the distance travelled by users to reach the facilities this means also to maximize the accessibility to facilities. To achieve this objective we developed CKB-WSP algorithm (Clustering using Knowledge-Based systems and Weighted Short Path). This algorithm is Density-based clustering algorithm using Dijkstra algorithm to calculate obstructed short path distance where the clustering distance represents a weighted shortest path. The weights are associated with intersection node and represent the population number. Each type of social facility(schools, fire stations, hospitals, mosque, church) own many constraints such as surface area and number of people to be served, maximum distance, available location to locate these services. All these constraints is stored in the Knowledge-Based system. Comparisons with other clustering methods are presented showing the advantages of the CKB-WSP algorithm introduced in this paper.
Personalized recommendation has become a pivotal aspect of online marketing and e-commerce as a means of overcoming the information overload problem. There are several recommendation techniques but collaborative recom...
详细信息
The modular treewidth of a graph is its treewidth after the contraction of modules. Modular treewidth properly generalizes treewidth and is itself properly generalized by clique-width. We show that the number of satis...
详细信息
ISBN:
(纸本)9783939897507
The modular treewidth of a graph is its treewidth after the contraction of modules. Modular treewidth properly generalizes treewidth and is itself properly generalized by clique-width. We show that the number of satisfying assignments of a CNF formula whose incidence graph has bounded modular treewidth can be computed in polynomial time. This provides new tractable classes of formulas for which #SAT is polynomial. In particular, our result generalizes known results for the treewidth of incidence graphs and is incomparable with known results for cliquewidth (or rank-width) of signed incidence graphs. The contraction of modules is an effective data reduction procedure. Our algorithm is the first one to harness this technique for #SAT. The order of the polynomial time bound of our algorithm depends on the modular treewidth. We show that this dependency cannot be avoided subject to an assumption from Parameterized Complexity.
Current StarCraft bots are not very flexible in their strategy choice, most of them just follow a manually optimized one, usually a rush. We suggest a method of augmenting existing bots via Fuzzy Control in order to m...
详细信息
暂无评论