Sequence classification has attracted much interest in recent years due to its difference from the traditional classification tasks, as well as its wide applications in many fields, such as bioinformatics. As it is no...
详细信息
The broadcast time of a graph G, denoted b(G), is the minimum time necessary to complete the broadcasting in G, i.e. from one of vertices send a message to all other vertices. The Knodel graph W_(Δ,n) is a regular gr...
详细信息
ISBN:
(纸本)9781479924622
The broadcast time of a graph G, denoted b(G), is the minimum time necessary to complete the broadcasting in G, i.e. from one of vertices send a message to all other vertices. The Knodel graph W_(Δ,n) is a regular graph of an even order n and degree Δ where 2 ≤ Δ ≤ [log_2 n]. The broadcast time of the Knodel graph is known only for W_(Δ,2~Δ) and for W_(Δ-1,2~(Δ-1)). In this paper we present a tight upper and lower bounds on the broadcast time of the Knodel graph for all even n and 2 ≤ Δ ≤ [log_2 n]. We show that 2 [1/2 [n-2/2~Δ-2]] + 1 ≤ b(W_(Δ,n)) ≤ [n-2/2~Δ-2]+Δ-1.
作者：
Liu, Zhi-Qiang
Department of Computer Science and Software Engineering University of Melbourne VIC 3010 Australia School of Creative Media
City University of Hong Kong Kowloon Hong Kong
In this paper we present the Adaptive Manifold Self-Organising Map (AMSOM) for a face retrieval system. Our experimental results show that it has an excellent potential for face retrieval applications. As compared to ...
ISBN:
(纸本)9628576623
In this paper we present the Adaptive Manifold Self-Organising Map (AMSOM) for a face retrieval system. Our experimental results show that it has an excellent potential for face retrieval applications. As compared to the more traditional Sub-space Self-Organising Map, the results in many cases are better.
Although model development is an incremental and iterative process, it often prematurely convergences to a single authoritative model. On the other hand, the scientific method demands coupling of the generation of hyp...
详细信息
ISBN:
(纸本)9781510838284
Although model development is an incremental and iterative process, it often prematurely convergences to a single authoritative model. On the other hand, the scientific method demands coupling of the generation of hypotheses with their evaluation via various cognitive strategies to facilitate competition among plausible explanations. This process results in a theory, which is represented by a cluster of models that jointly produce robust solutions. The multiplicity of models is imposed not only by the complexity of systems, but also by the need to constrain abstractions to a limited number of variables. Motivated by these observations, we propose a methodological foundation that views systems science from the lens of cognitive models of scientific discovery, allowing the management of ensemble of models while supporting autonomous mediation of theory with data.
EEG based emotion recognition technology is currently an important concept in artificial intelligence, and also holds great potential in emotional health care. Nevertheless, one major limitation of the prior approache...
详细信息
This extended poster abstract presents a software visualization tool (CodeVizard) that helps researchers and managers to analyze software repository data. The tool focuses on identifying areas of risks in software dev...
详细信息
Existing software process models such as Waterfall and XP are characterised by unstated assumptions, a consequence of which is that we can not easily compare models or transfer data from one model to another. This mea...
详细信息
Peer review is an integral part of academic publication and is necessary to maintain high standards and novelty of published research. Despite its importance, peer reviewers are rarely provided incentives, leading to ...
详细信息
In urban-traffic scenarios, massive mobile terminals can provide more comprehensive and accurate environmental sensing data with various built-in sensors. Humans can also collect environmental information as task exec...
详细信息
Recently,object identification with radio frequency identification(RFID)technology is becoming increasingly *** time is a key performance metric to evaluate the RFID *** present paper analyzes the deficiencies of the ...
详细信息
Recently,object identification with radio frequency identification(RFID)technology is becoming increasingly *** time is a key performance metric to evaluate the RFID *** present paper analyzes the deficiencies of the state-of-the-arts algorithms and proposes a novel sub-frame-based algorithm with adaptive frame breaking policy to lower the tag identification time for EPC global C1 Gen2 UHF RFID *** the observation of slot statistics in a sub-frame,the reader estimates the tag quantity and efficiently calculates an optimal frame size to fit the unread *** when the expected average identification time in the calculated frame size is less than that in the previous frame size,the reader starts the new ***,the estimation of the proposed algorithm is implemented by the look-up tables,which allows dramatically reduction in the computational *** results show noticeable throughput and time efficiency improvements of the proposed solution over the existing approaches.
暂无评论