The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Frequent itemset mining is a very important problem in data mining. Closed frequent itemsets is the condensed representation of frequent itemsets thus spend less memory, so it is much suitable for stream mining. But on the other hand, when the minimum support is much lower, the size of closed frequent itemsets turns larger, which makes the performance reduced a lot. In this paper, we introduce a threshold...
Previous work suggests that phonological neighborhood density is a key factor in shaping early lexical acquisition. Such studies have, however, have not considered how semantic neighborhoods may influence word-learning. We studied how phonological and semantic densities affect both comprehension and production of nouns from the Macarthur-Bates Communicative Development Inventory (MCDI). New measures...
This paper builds on our previous finding that early verbs are strongly related to body parts. One evidence for this relation is the strong word associations among adults between common verbs and body parts. Although many common verbs are related to body parts, the prior evidence suggests that some verbs are strongly related to highly specific body regions (e.g., fingers) and others to larger or more...
This paper models the process of applied behavior analysis (ABA) therapy of autistic children for eye contact as the learning of the categorization and preference through the interaction with a caregiver. The proposed model consists of the learning module and visual attention module. The learning module learns the visual features of higher order local autocorrelation (HLAC) that are important to discriminate...
While contemporary approaches to SIMD ray tracing typically rely on traversing packets of coherent rays through a binary data structure, we instead evaluate the alternative of traversing individual rays through a bounding volume hierarchy with a branching factor of 16. Though obviously less efficient than high-performance packet techniques for primary rays, we demonstrate that for less coherent secondary...
This paper introduces an unsupervised method to acquire the lexical semantics of action verbs. The eventual goal of the presented method is allowing a robot to acquire language under realistic conditions. The method acquires lexical semantics by forming association sets that contain general perceptual symbols associated with a certain concept as well as perceptual symbols of the utterances of the...
During the learning of speech sounds and other perceptual categories, category labels are not provided, the number of categories is unknown, and the stimuli are encountered sequentially. These constraints provide a challenge for models, but they have been recently addressed in the Online Mixture Estimation model of unsupervised vowel category learning. The model treats categories as Gaussian distributions,...
Mother-infant vocal communication is a sort of mystery of human cognitive development since they can communicate although their body structures and therefore their utterable areas are different. This paper proposes a method that aids unconscious guidance in mutual imitation for infant development based on a biasing element with two different kinds of modules. The first is based on the normal magnet...
We propose a time-efficient local data aggregation algorithm that aggregates delay-constrained data within a given time deadline in clustered wireless sensor networks. Our approach consists of two phases. First, we design a zone-based fast data aggregation tree (ZFDAT) to eliminate unnecessary packets being forwarded to many receiver nodes and avoid long detour paths until cluster-head, where cluster-head...
Body sensor networks are an interesting emerging application of wireless sensor networks to improve healthcare and the quality of life. Current research has mainly focused on single-hop networks, although some works clearly show advantages of multi-hop architectures. In this paper, we model probabilistic connectivity in such multi-hop body sensor networks. Instead of using a circular coverage area,...
In this paper, we examine different search algorithms from artificial intelligence that can be used for solving the shortest path problem. We investigate the use of three informed search algorithms and three uninformed search algorithms for intelligent travel planning based on some major cities and towns in Borneo Island. We also present an improved dijkstrapsilas algorithm for this task. We show...
Mediation and integration of data are significant challenges because the number of services on the Web, and heterogeneities in their data representation, continue to increase rapidly. To address these challenges we introduce a new measure, mediatability, which is a quantifiable and computable metric for the degree of human involvement in XML schema mediation. We present an efficient algorithm to compute...
In this paper, an energy efficient adaptive back forwarding method is proposed for spatial range query processing in ubiquitous sensor networks. In order to execute spatial range query efficiently in sensor networks, many rectangle based index methods are researched, such as SPIX method. This kind of method is efficient to transmit user queries to the queried range, but it defines the sensor nodes'...
Concept hierarchies are important for generalization in many data mining applications. Abundant algorithms have been proposed for automatic construction of concept hierarchy. A typical application of such algorithms is constructing directories for documents in information retrieval community. However, the research result can not be directly adopted for automatic construction of concept hierarchies...
With the rapid growth and extensive applications of the spatial dataset, itpsilas getting more important to solve how to find spatial knowledge automatically from spatial datasets. Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. Itpsilas difficult to discovery co-location patterns because of the huge amount of data...
The p-median problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients such that the overall cost is minimised. In this paper, PBS, a population based hybrid search algorithm for the p-median problem is introduced. The PBS algorithm uses a genetic algorithm based meta-heuristic, primarily based on cut and paste crossover operators, to generate new starting...
Wavelet packets are shown to be a possible means to limit watermark interference in multiple re-watermarking algorithms. It turns out that when demanding a certain distance among wavelet packet subband trees, a significant improvement of watermark detection correlation values may be achieved in such a scenario.
For extending the lifetime of sensor networks by improving load balancing in wireless sensor networks, the cluster-based multi-path routing protocol, CLBM, has been studied in this paper. In CLBM, theory of space and time localization has been introduced in the process of cluster head reselecting, cluster node will select the cluster head according to residual energy and the nearest distance between...
Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain each other's locationby local communications, or assume a dense network that remains connected. At...
Energy consumption of communication is a key factor of the lifetimes of wireless sensor networks. This paper presents an energy-efficient routing protocol for wireless sensor network. In the protocol, each sensor node detects the distance between the base station and itself. Then, it calculates a tier ID in according to the distance. A lower tier ID indicates a shorter distance between the base station...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.