test / output.json
l6o's picture
Upload output.json
f6f6ed5 verified
Raw History Blame Contribute Delete
155 kB
[
{
"abstract": "This article introduces a named entity matching model that makes use of both semantic and phonetic evidence. The matching of semantic and phonetic information is captured by a unified framework via a bipartite graph model. By considering various technical challenges of the problem, including order insensitivity and partial matching, this approach is less rigid than existing approaches and highly robust. One major component is a phonetic matching model which exploits similarity at the phoneme level. Two learning algorithms for learning the similarity information of basic phonemic matching units based on training examples are investigated. By applying the proposed named entity matching model, a mining system is developed for discovering new named entity translations from daily Web news. The system is able to discover new name translations that cannot be found in the existing bilingual dictionary.",
"method": "The matching of semantic and phonetic information is captured by a unified framework via a bipartite graph model. By considering various technical challenges of the problem, including order insensitivity and partial matching, this approach is less rigid than existing approaches and highly robust. One major component is a phonetic matching model which exploits similarity at the phoneme level. Two learning algorithms for learning the similarity information of basic phonemic matching units based on training examples are investigated. By applying the proposed named entity matching model, a mining system is developed for discovering new named entity translations from daily Web news."
},
{
"abstract": "We present a method for creating a comparable text corpus from two document collections in different languages. The collections can be very different in origin. In this study, we build a comparable corpus from articles by a Swedish news agency and a U.S. newspaper. The keys with best resolution power were extracted from the documents of one collection, the source collection, by using the relative average term frequency (RATF) value. The keys were translated into the language of the other collection, the target collection, with a dictionary-based query translation program. The translated queries were run against the target collection and an alignment pair was made if the retrieved documents matched given date and similarity score criteria. The resulting comparable collection was used as a similarity thesaurus to translate queries along with a dictionary-based translator. The combined approaches outperformed translation schemes where dictionary-based translation or corpus translation was used alone.",
"method": "The collections can be very different in origin. In this study, we build a comparable corpus from articles by a Swedish news agency and a U.S. newspaper. The keys with best resolution power were extracted from the documents of one collection, the source collection, by using the relative average term frequency (RATF) value. The keys were translated into the language of the other collection, the target collection, with a dictionary-based query translation program. The translated queries were run against the target collection and an alignment pair was made if the retrieved documents matched given date and similarity score criteria. The resulting comparable collection was used as a similarity thesaurus to translate queries along with a dictionary-based translator."
},
{
"abstract": "Web search engines typically provide search results without considering user interests or context. We propose a personalized search approach that can easily extend a conventional search engine on the client side. Our mapping framework automatically maps a set of known user interests onto a group of categories in the Open Directory Project (ODP) and takes advantage of manually edited data available in ODP for training text classifiers that correspond to, and therefore categorize and personalize search results according to user interests. In two sets of controlled experiments, we compare our personalized categorization system (PCAT) with a list interface system (LIST) that mimics a typical search engine and with a nonpersonalized categorization system (CAT). In both experiments, we analyze system performances on the basis of the type of task and query length. We find that PCAT is preferable to LIST for information gathering types of tasks and for searches with short queries, and PCAT outperforms CAT in both information gathering and finding types of tasks, and for searches associated with free-form queries. From the subjects' answers to a questionnaire, we find that PCAT is perceived as a system that can find relevant Web pages quicker and easier than LIST and CAT.",
"method": "Our mapping framework automatically maps a set of known user interests onto a group of categories in the Open Directory Project (ODP) and takes advantage of manually edited data available in ODP for training text classifiers that correspond to, and therefore categorize and personalize search results according to user interests. In two sets of controlled experiments, we compare our personalized categorization system (PCAT) with a list interface system (LIST) that mimics a typical search engine and with a nonpersonalized categorization system (CAT). In both experiments, we analyze system performances on the basis of the type of task and query length."
},
{
"abstract": "The aim of this article is to produce an alternative view of the adaptive hypermedia (AH) domain from a contextually-aware open hypermedia (OH) perspective. We believe that a wide range of AH techniques can be supported with a small number of OH structures, which can be combined together to create more complex effects, possibly simplifying the development of new AH systems. In this work we reexamine Brusilovsky's taxonomy of AH techniques from a structural OH perspective. We also show that it is possible to identify and model common structures across the taxonomy of adaptive techniques. An agent-based adaptive hypermedia system called HA^3L is presented, which uses these OH structures to provide a straightforward implementation of a variety of adaptive hypermedia techniques. This enables us to reflect on the structural equivalence of many of the techniques, demonstrates the advantages of the OH approach, and can inform the design of future adaptive hypermedia systems.",
"method": "In this work we reexamine Brusilovsky's taxonomy of AH techniques from a structural OH perspective. We also show that it is possible to identify and model common structures across the taxonomy of adaptive techniques. An agent-based adaptive hypermedia system called HA^3L is presented, which uses these OH structures to provide a straightforward implementation of a variety of adaptive hypermedia techniques."
},
{
"abstract": "The rapid advancement of Internet technologies enables more and more educational institutes, companies, and government agencies to provide services, namely online services, through web portals. With hundreds of online services provided through a web portal, it is critical to design web portals, namely service portals, through which online services can be easily accessed by their consumers. This article addresses this critical issue from the perspective of service selection, that is, how to select a small number of service-links (i.e., hyperlinks pointing to online services) to be featured in the homepage of a service portal such that users can be directed to find the online services they seek most effectively. We propose a mathematically formulated metric to measure the effectiveness of the selected service-links in directing users to locate their desired online services and formally define the service selection problem. A solution method, ServiceFinder, is then proposed. Using real-world data obtained from the Utah State Government service portal, we show that ServiceFinder outperforms both the current practice of service selection and previous algorithms for adaptive website design. We also show that the performance of ServiceFinder is close to that of the optimal solution resulting from exhaustive search.",
"method": "We propose a mathematically formulated metric to measure the effectiveness of the selected service-links in directing users to locate their desired online services and formally define the service selection problem. A solution method, ServiceFinder, is then proposed."
},
{
"abstract": "Stemmers attempt to reduce a word to its stem or root form and are used widely in information retrieval tasks to increase the recall rate. Most popular stemmers encode a large number of language-specific rules built over a length of time. Such stemmers with comprehensive rules are available only for a few languages. In the absence of extensive linguistic resources for certain languages, statistical language processing tools have been successfully used to improve the performance of IR systems. In this article, we describe a clustering-based approach to discover equivalence classes of root words and their morphological variants. A set of string distance measures are defined, and the lexicon for a given text collection is clustered using the distance measures to identify these equivalence classes. The proposed approach is compared with Porter's and Lovin's stemmers on the AP and WSJ subcollections of the Tipster dataset using 200 queries. Its performance is comparable to that of Porter's and Lovin's stemmers, both in terms of average precision and the total number of relevant documents retrieved. The proposed stemming algorithm also provides consistent improvements in retrieval performance for French and Bengali, which are currently resource-poor.",
"method": "A set of string distance measures are defined, and the lexicon for a given text collection is clustered using the distance measures to identify these equivalence classes. The proposed approach is compared with Porter's and Lovin's stemmers on the AP and WSJ subcollections of the Tipster dataset using 200 queries."
},
{
"abstract": "The increasing diffusion of XML languages for the encoding of domain-specific multimedia information raises the need for new information retrieval models that can fully exploit structural information. An XML language specifically designed for music like MX allows queries to be made directly on the thematic material. The main advantage of such a system is that it can handle symbolic, notational, and audio objects at the same time through a multilayered structure. On the model side, common music information retrieval methods do not take into account the inner structure of melodic themes and the metric relationships between notes. In this article we deal with two main topics: a novel architecture based on a new XML language for music and a new model of melodic themes based on graph theory. This model takes advantage of particular graph invariants that can be linked to melodic themes as metadata in order to characterize all their possible modifications through specific transformations and that can be exploited in filtering algorithms. We provide a similarity function and show through an evaluation stage how it improves existing methods, particularly in the case of same-structured themes.",
"method": "This model takes advantage of particular graph invariants that can be linked to melodic themes as metadata in order to characterize all their possible modifications through specific transformations and that can be exploited in filtering algorithms."
},
{
"abstract": "Consider a website containing a collection of webpages with data such as in Yahoo or the Open Directory project. Each page is associated with a weight representing the frequency with which that page is accessed by users. In the tree hierarchy representation, accessing each page requires the user to travel along the path leading to it from the root. By enhancing the index tree with additional edges (hotlinks) one may reduce the access cost of the system. In other words, the hotlinks reduce the expected number of steps needed to reach a leaf page from the tree root, assuming that the user knows which hotlinks to take. The hotlink enhancement problem involves finding a set of hotlinks minimizing this cost. This article proposes the first exact algorithm for the hotlink enhancement problem. This algorithm runs in polynomial time for trees with logarithmic depth. Experiments conducted with real data show that significant improvement in the expected number of accesses per search can be achieved in websites using this algorithm. These experiments also suggest that the simple and much faster heuristic proposed previously by Czyzowicz et al. [2003] creates hotlinks that are nearly optimal in the time savings they provide to the user. The version of the hotlink enhancement problem in which the weight distribution on the leaves is unknown is discussed as well. We present a polynomial-time algorithm that is optimal for any tree for any depth.",
"method": "This algorithm runs in polynomial time for trees with logarithmic depth."
},
{
"abstract": "In information retrieval research, comparing retrieval approaches requires test collections consisting of documents, user requests and relevance assessments. Obtaining relevance assessments that are as sound and complete as possible is crucial for the comparison of retrieval approaches. In XML retrieval, the problem of obtaining sound and complete relevance assessments is further complicated by the structural relationships between retrieval results. A major difference between XML retrieval and flat document retrieval is that the relevance of elements (the retrievable units) is not independent of that of related elements. This has major consequences for the gathering of relevance assessments. This article describes investigations into the creation of sound and complete relevance assessments for the evaluation of content-oriented XML retrieval as carried out at INEX, the evaluation campaign for XML retrieval. The campaign, now in its seventh year, has had three substantially different approaches to gather assessments and has finally settled on a highlighting method for marking relevant passages within documents�𤫟ven though the objective is to collect assessments at element level. The different methods of gathering assessments at INEX are discussed and contrasted. The highlighting method is shown to be the most reliable of the methods.",
"method": "The different methods of gathering assessments at INEX are discussed and contrasted."
},
{
"abstract": "Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.",
"method": "The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset."
},
{
"abstract": "Psychiatric query document retrieval can assist individuals to locate query documents relevant to their depression-related problems efficiently and effectively. By referring to relevant documents, individuals can understand how to alleviate their depression-related symptoms according to recommendations from health professionals. This work presents an extended probabilistic Hyperspace Analog to Language (epHAL) model to achieve this aim. The epHAL incorporates the close temporal associations between words in query documents to represent word cooccurrence relationships in a high-dimensional context space. The information flow mechanism further combines the query words in the epHAL space to infer related words for effective information retrieval. The language model perplexity is considered as the criterion for model optimization. Finally, the epHAL is adopted for psychiatric query document retrieval, and indicates its superiority in information retrieval over traditional approaches.",
"method": "The epHAL incorporates the close temporal associations between words in query documents to represent word cooccurrence relationships in a high-dimensional context space. The information flow mechanism further combines the query words in the epHAL space to infer related words for effective information retrieval. The language model perplexity is considered as the criterion for model optimization. Finally, the epHAL is adopted for psychiatric query document retrieval, and indicates its superiority in information retrieval over traditional approaches."
},
{
"abstract": "This work explores the hypothesis that interactions between a trained human search intermediary and an information seeker can inform the design of interactive IR systems. We discuss results from a controlled Wizard-of-Oz case study, set in the context of the TREC 2005 HARD track evaluation, in which a trained intermediary executed an integrated search and interaction strategy based on conceptual facet analysis and informed by need negotiation techniques common in reference interviews. Having a human �𦤹n the loop�� yielded large improvements over fully automated systems as measured by standard ranked-retrieval metrics, demonstrating the value of mediated search. We present a detailed analysis of the intermediary's actions to gain a deeper understanding of what worked and why. One contribution is a taxonomy of clarification types informed both by empirical results and existing theories in library and information science. We discuss how these findings can guide the development of future systems. Overall, this work illustrates how studying human information-seeking processes can lead to better information retrieval applications.",
"method": "We discuss results from a controlled Wizard-of-Oz case study, set in the context of the TREC 2005 HARD track evaluation, in which a trained intermediary executed an integrated search and interaction strategy based on conceptual facet analysis and informed by need negotiation techniques common in reference interviews. Having a human �𦤹n the loop�� yielded large improvements over fully automated systems as measured by standard ranked-retrieval metrics, demonstrating the value of mediated search. We present a detailed analysis of the intermediary's actions to gain a deeper understanding of what worked and why."
},
{
"abstract": "A novel probabilistic retrieval model is presented. It forms a basis to interpret the TF-IDF term weights as making relevance decisions. It simulates the local relevance decision-making for every location of a document, and combines all of these �𦧺ocal�� relevance decisions as the �筂ocument-wide�� relevance decision for the document. The significance ofinterpreting TF-IDF in this way is the potential to: (1) establish a unifying perspective about information retrieval as relevance decision-making; and (2) develop advanced TF-IDF-related term weights for future elaborate retrieval models. Our novel retrieval model is simplified to a basic ranking formula that directly corresponds to the TF-IDF term weights. In general, we show that the term-frequency factor of the ranking formula can be rendered into different term-frequency factors of existing retrieval systems. In the basic ranking formula, the remaining quantity - log p(r|t ��� d) is interpreted as the probability of randomly picking a nonrelevant usage (denoted by r) of term t. Mathematically, we show that this quantity can be approximated by the inverse document-frequency (IDF). Empirically, we show that this quantity is related to IDF, using four reference TREC ad hoc retrieval data collections.",
"method": "It forms a basis to interpret the TF-IDF term weights as making relevance decisions. It simulates the local relevance decision-making for every location of a document, and combines all of these �𦧺ocal�� relevance decisions as the �筂ocument-wide�� relevance decision for the document. The significance ofinterpreting TF-IDF in this way is the potential to: (1) establish a unifying perspective about information retrieval as relevance decision-making; and (2) develop advanced TF-IDF-related term weights for future elaborate retrieval models. Our novel retrieval model is simplified to a basic ranking formula that directly corresponds to the TF-IDF term weights."
},
{
"abstract": "Information retrieval (IR) models based on vector spaces have been investigated for a long time. Nevertheless, they have recently attracted much research interest. In parallel, context has been rediscovered as a crucial issue in information retrieval. This article presents a principled approach to modeling context and its role in ranking information objects using vector spaces. First, the article outlines how a basis of a vector space naturally represents context, both its properties and factors. Second, a ranking function computes the probability of context in the objects represented in a vector space, namely, the probability that a contextual factor has affected the preparation of an object.",
"method": "First, the article outlines how a basis of a vector space naturally represents context, both its properties and factors. Second, a ranking function computes the probability of context in the objects represented in a vector space, namely, the probability that a contextual factor has affected the preparation of an object."
},
{
"abstract": "We propose a unique cluster-based retrieval (CBR) strategy using a new cluster-skipping inverted file for improving query processing efficiency. The new inverted file incorporates cluster membership and centroid information along with the usual document information into a single structure. In our incremental-CBR strategy, during query evaluation, both best(-matching) clusters and the best(-matching) documents of such clusters are computed together with a single posting-list access per query term. As we switch from term to term, the best clusters are recomputed and can dynamically change. During query-document matching, only relevant portions of the posting lists corresponding to the best clusters are considered and the rest are skipped. The proposed approach is essentially tailored for environments where inverted files are compressed, and provides substantial efficiency improvement while yielding comparable, or sometimes better, effectiveness figures. Our experiments with various collections show that the incremental-CBR strategy using a compressed cluster-skipping inverted file significantly improves CPU time efficiency, regardless of query length. The new compressed inverted file imposes an acceptable storage overhead in comparison to a typical inverted file. We also show that our approach scales well with the collection size.",
"method": "The new inverted file incorporates cluster membership and centroid information along with the usual document information into a single structure. In our incremental-CBR strategy, during query evaluation, both best(-matching) clusters and the best(-matching) documents of such clusters are computed together with a single posting-list access per query term. As we switch from term to term, the best clusters are recomputed and can dynamically change. During query-document matching, only relevant portions of the posting lists corresponding to the best clusters are considered and the rest are skipped. The proposed approach is essentially tailored for environments where inverted files are compressed, and provides substantial efficiency improvement while yielding comparable, or sometimes better, effectiveness figures."
},
{
"abstract": "Although the seminal proposal to introduce language modeling in information retrieval was based on a multivariate Bernoulli model, the predominant modeling approach is now centered on multinomial models. Language modeling for retrieval based on multivariate Bernoulli distributions is seen inefficient and believed less effective than the multinomial model. In this article, we examine the multivariate Bernoulli model with respect to its successor and examine its role in future retrieval systems. In the context of Bayesian learning, these two modeling approaches are described, contrasted, and compared both theoretically and computationally. We show that the query likelihood following a multivariate Bernoulli distribution introduces interesting retrieval features which may be useful for specific retrieval tasks such as sentence retrieval. Then, we address the efficiency aspect and show that algorithms can be designed to perform retrieval efficiently for multivariate Bernoulli models, before performing an empirical comparison to study the behaviorial aspects of the models. A series of comparisons is then conducted on a number of test collections and retrieval tasks to determine the empirical and practical differences between the different models. Our results indicate that for sentence retrieval the multivariate Bernoulli model can significantly outperform the multinomial model. However, for the other tasks the multinomial model provides consistently better performance (and in most cases significantly so). An analysis of the various retrieval characteristics reveals that the multivariate Bernoulli model tends to promote long documents whose nonquery terms are informative. While this is detrimental to the task of document retrieval (documents tend to contain considerable nonquery content), it is valuable for other tasks such as sentence retrieval, where the retrieved elements are very short and focused.",
"method": "In the context of Bayesian learning, these two modeling approaches are described, contrasted, and compared both theoretically and computationally. A series of comparisons is then conducted on a number of test collections and retrieval tasks to determine the empirical and practical differences between the different models."
},
{
"abstract": "Boosting is a meta-learning algorithm which takes as input a set of classifiers and combines these classifiers to obtain a better classifier. We consider the combinatorial problem of efficiently and optimally boosting a pair of classifiers by reducing this problem to that of constructing the optimal linear separator for two sets of points in two dimensions. Specifically, let each point x ��� R^2 be assigned a weight W(x)>0, where the weighting function can be an arbitrary positive function. We give efficient (low-order polynomial time) algorithms for constructing an optimal linear \"separator\" lscr defined as follows. Let Q be the set of points misclassified by lscr. Then, the weight of Q, defined as the sum of the weights of the points in Q, is minimized. If W(z)=1 for all points, then the resulting separator minimizes (exactly) the misclassification error. Without an increase in computational complexity, our algorithm can be extended to output the leave-one-out error, an unbiased estimate of the expected performance of the resulting boosted classifier.",
"method": "Specifically, let each point x ��� R^2 be assigned a weight W(x)>0, where the weighting function can be an arbitrary positive function. We give efficient (low-order polynomial time) algorithms for constructing an optimal linear \"separator\" lscr defined as follows. Let Q be the set of points misclassified by lscr. Then, the weight of Q, defined as the sum of the weights of the points in Q, is minimized. If W(z)=1 for all points, then the resulting separator minimizes (exactly) the misclassification error."
},
{
"abstract": "Temporal sequence learning is one of the most critical components for human intelligence. In this paper, a novel hierarchical structure for complex temporal sequence learning is proposed. Hierarchical organization, a prediction mechanism, and one-shot learning characterize the model. In the lowest level of the hierarchy, we use a modified Hebbian learning mechanism for pattern recognition. Our model employs both active 0 and active 1 sensory inputs. A winner-take-all (WTA) mechanism is used to select active neurons that become the input for sequence learning at higher hierarchical levels. Prediction is an essential element of our temporal sequence learning model. By correct prediction, the machine indicates it knows the current sequence and does not require additional learning. When the prediction is incorrect, one-shot learning is executed and the machine learns the new input sequence as soon as the sequence is completed. A four-level hierarchical structure that isolates letters, words, sentences, and strophes is used in this paper to illustrate the model.",
"method": "Hierarchical organization, a prediction mechanism, and one-shot learning characterize the model. In the lowest level of the hierarchy, we use a modified Hebbian learning mechanism for pattern recognition. Our model employs both active 0 and active 1 sensory inputs. A winner-take-all (WTA) mechanism is used to select active neurons that become the input for sequence learning at higher hierarchical levels. Prediction is an essential element of our temporal sequence learning model. By correct prediction, the machine indicates it knows the current sequence and does not require additional learning. When the prediction is incorrect, one-shot learning is executed and the machine learns the new input sequence as soon as the sequence is completed. A four-level hierarchical structure that isolates letters, words, sentences, and strophes is used in this paper to illustrate the model."
},
{
"abstract": "In this paper, the problem of robust output tracking control for a class of time-delay nonlinear systems is considered. The systems are in the form of triangular structure with unmodeled dynamics. First, we construct an observer whose gain matrix is scheduled via linear matrix inequality approach. For the case that the information of uncertainties bounds is not completely available, we design an observer-based neural network (NN) controller by employing the backstepping method. The resulting closed-loop system is ensured to be stable in the sense of semiglobal boundedness with the help of changing supplying function idea. The observer and the controller designed are both independent of the time delays. Finally, numerical simulations are conducted to verify the effectiveness of the main theoretic results obtained.",
"method": "The systems are in the form of triangular structure with unmodeled dynamics. First, we construct an observer whose gain matrix is scheduled via linear matrix inequality approach. For the case that the information of uncertainties bounds is not completely available, we design an observer-based neural network (NN) controller by employing the backstepping method. The resulting closed-loop system is ensured to be stable in the sense of semiglobal boundedness with the help of changing supplying function idea. The observer and the controller designed are both independent of the time delays. Finally, numerical simulations are conducted to verify the effectiveness of the main theoretic results obtained."
},
{
"abstract": "Land vehicles rely mainly on global positioning system (GPS) to provide their position with consistent accuracy. However, GPS receivers may encounter frequent GPS outages within urban areas where satellite signals are blocked. In order to overcome this problem, GPS is usually combined with inertial sensors mounted inside the vehicle to obtain a reliable navigation solution, especially during GPS outages. This letter proposes a data fusion technique based on radial basis function neural network (RBFNN) that integrates GPS with inertial sensors in real time. A field test data was used to examine the performance of the proposed data fusion module and the results discuss the merits and the limitations of the proposed technique.",
"method": "A field test data was used to examine the performance of the proposed data fusion module and the results discuss the merits and the limitations of the proposed technique."
},
{
"abstract": "A novel learning algorithm for semisupervised classification is proposed. The proposed method first constructs a support function that estimates a support of a data distribution using both labeled and unlabeled data. Then, it partitions a whole data space into a small number of disjoint regions with the aid of a dynamical system. Finally, it labels the decomposed regions utilizing the labeled data and the cluster structure described by the constructed support function. Simulation results show the effectiveness of the proposed method to label out-of-sample unlabeled test data as well as in-sample unlabeled data.",
"method": "The proposed method first constructs a support function that estimates a support of a data distribution using both labeled and unlabeled data. Then, it partitions a whole data space into a small number of disjoint regions with the aid of a dynamical system. Finally, it labels the decomposed regions utilizing the labeled data and the cluster structure described by the constructed support function."
},
{
"abstract": "Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a problem of increasingly major concern in data analysis. This paper presents data-driven high-dimensional scaling (DD-HDS), a nonlinear mapping method that follows the line of multidimensional scaling (MDS) approach, based on the preservation of distances between pairs of data. It improves the performance of existing competitors with respect to the representation of high-dimensional data, in two ways. It introduces (1) a specific weighting of distances between data taking into account the concentration of measure phenomenon and (2) a symmetric handling of short distances in the original and output spaces, avoiding false neighbor representations while still allowing some necessary tears in the original distribution. More precisely, the weighting is set according to the effective distribution of distances in the data set, with the exception of a single user-defined parameter setting the tradeoff between local neighborhood preservation and global mapping. The optimization of the stress criterion designed for the mapping is realized by ldquoforce-directed placementrdquo (FDP). The mappings of low- and high-dimensional data sets are presented as illustrations of the features and advantages of the proposed algorithm. The weighting function specific to high-dimensional data and the symmetric handling of short distances can be easily incorporated in most distance preservation-based nonlinear dimensionality reduction methods.",
"method": "The optimization of the stress criterion designed for the mapping is realized by ldquoforce-directed placementrdquo (FDP). The mappings of low- and high-dimensional data sets are presented as illustrations of the features and advantages of the proposed algorithm."
},
{
"abstract": "A Bayesian Gaussian process (GP) modeling approach has recently been introduced to model-based control strategies. The estimate of the variance of the predicted output is the most useful advantage of GPs in comparison to neural networks (NNs) and fuzzy models. However, the GP model is computationally demanding and nontransparent. To reduce the computation load and increase transparency, a local linear GP model network is proposed in this paper. The proposed methodology combines the local model network principle with the GP prior approach. A novel algorithm for structure determination and optimization is introduced, which is widely applicable to the training of local model networks. The modeling procedure of the local linear GP (LGP) model network is demonstrated on an example of a nonlinear laboratory scale process rig.",
"method": "The proposed methodology combines the local model network principle with the GP prior approach. The modeling procedure of the local linear GP (LGP) model network is demonstrated on an example of a nonlinear laboratory scale process rig."
},
{
"abstract": "In this paper, we analyze the sensitivity of a split-complex multilayer perceptron (split-CMLP) due to the errors of the inputs and the connection weights between neurons. For simplicity, all the inputs and weights studied here are independent and identically distributed (i.i.d.). To develop an algorithm to estimate the sensitivity of the entire split-CMLP, we compute statistically the sensitivity by using the central limit theorem (CLT). The results show that the sensitivity is affected by the number of the layers and the number of the neurons adopted in each layer. We derive a theoretical estimation of the sensitivity. Several numerical results of the sensitivity for the split-CMLP are presented, and they match the theoretical ones. The agreement between the theoretical results and experimental results match verifies the feasibility of the proposed algorithm. Thus, we not only analyze the sensitivity of the split-CMLP due to the errors of the i.i.d. inputs and weights, but also develop an efficient algorithm to estimate the sensitivity.",
"method": "For simplicity, all the inputs and weights studied here are independent and identically distributed (i.i.d.). To develop an algorithm to estimate the sensitivity of the entire split-CMLP, we compute statistically the sensitivity by using the central limit theorem (CLT)."
},
{
"abstract": "The generalization error bounds found by current error models using the number of effective parameters of a classifier and the number of training samples are usually very loose. These bounds are intended for the entire input space. However, support vector machine (SVM), radial basis function neural network (RBFNN), and multilayer perceptron neural network (MLPNN) are local learning machines for solving problems and treat unseen samples near the training samples to be more important. In this paper, we propose a localized generalization error model which bounds from above the generalization error within a neighborhood of the training samples using stochastic sensitivity measure. It is then used to develop an architecture selection technique for a classifier with maximal coverage of unseen samples by specifying a generalization error threshold. Experiments using 17 University of California at Irvine (UCI) data sets show that, in comparison with cross validation (CV), sequential learning, and two other ad hoc methods, our technique consistently yields the best testing classification accuracy with fewer hidden neurons and less training time.",
"method": "It is then used to develop an architecture selection technique for a classifier with maximal coverage of unseen samples by specifying a generalization error threshold."
},
{
"abstract": "A modified probabilistic neural network (PNN) for brain tissue segmentation with magnetic resonance imaging (MRI) is proposed. In this approach, covariance matrices are used to replace the singular smoothing factor in the PNN's kernel function, and weighting factors are added in the pattern of summation layer. This weighted probabilistic neural network (WPNN) classifier can account for partial volume effects, which exist commonly in MRI, not only in the final result stage, but also in the modeling process. It adopts the self-organizing map (SOM) neural network to overly segment the input MR image, and yield reference vectors necessary for probabilistic density function (pdf) estimation. A supervised \"soft\" labeling mechanism based on Bayesian rule is developed, so that weighting factors can be generated along with corresponding SOM reference vectors. Tissue classification results from various algorithms are compared, and the effectiveness and robustness of the proposed approach are demonstrated.",
"method": "In this approach, covariance matrices are used to replace the singular smoothing factor in the PNN's kernel function, and weighting factors are added in the pattern of summation layer. This weighted probabilistic neural network (WPNN) classifier can account for partial volume effects, which exist commonly in MRI, not only in the final result stage, but also in the modeling process. It adopts the self-organizing map (SOM) neural network to overly segment the input MR image, and yield reference vectors necessary for probabilistic density function (pdf) estimation. A supervised \"soft\" labeling mechanism based on Bayesian rule is developed, so that weighting factors can be generated along with corresponding SOM reference vectors."
},
{
"abstract": "This paper presents a distributed expectation-maximization (EM) algorithm over sensor networks. In the E-step of this algorithm, each sensor node independently calculates local sufficient statistics by using local observations. A consensus filter is used to diffuse local sufficient statistics to neighbors and estimate global sufficient statistics in each node. By using this consensus filter, each node can gradually diffuse its local information over the entire network and asymptotically the estimate of global sufficient statistics is obtained. In the M-step of this algorithm, each sensor node uses the estimated global sufficient statistics to update model parameters of the Gaussian mixtures, which can maximize the log-likelihood in the same way as in the standard EM algorithm. Because the consensus filter only requires that each node communicate with its neighbors, the distributed EM algorithm is scalable and robust. It is also shown that the distributed EM algorithm is a stochastic approximation to the standard EM algorithm. Thus, it converges to a local maximum of the log-likelihood. Several simulations of sensor networks are given to verify the proposed algorithm.",
"method": "In the E-step of this algorithm, each sensor node independently calculates local sufficient statistics by using local observations. A consensus filter is used to diffuse local sufficient statistics to neighbors and estimate global sufficient statistics in each node. By using this consensus filter, each node can gradually diffuse its local information over the entire network and asymptotically the estimate of global sufficient statistics is obtained. In the M-step of this algorithm, each sensor node uses the estimated global sufficient statistics to update model parameters of the Gaussian mixtures, which can maximize the log-likelihood in the same way as in the standard EM algorithm."
},
{
"abstract": "In this paper, we argue that for a C-class classification problem, C 2-class classifiers, each of which discriminating one class from the other classes and having a characteristic input feature subset, should in general outperform, or at least match the performance of, a C-class classifier with one single input feature subset. For each class, we select a desirable feature subset, which leads to the lowest classification error rate for this class using a classifier for a given feature subset search algorithm. To fairly compare all models, we propose a weight method for the class-dependent classifier, i.e., assigning a weight to each model's output before the comparison is carried out. The method's performance is evaluated on two artificial data sets and several real-world benchmark data sets, with the support vector machine (SVM) as the classifier, and with the RELIEF, class separability, and minimal-redundancy�𢘫aximal-relevancy (mRMR) as attribute importance measures. Our results indicate that the class-dependent feature subsets found by our approach can effectively remove irrelevant or redundant features, while maintaining or improving (sometimes substantially ) the classification accuracy, in comparison with other feature selection methods.",
"method": "For each class, we select a desirable feature subset, which leads to the lowest classification error rate for this class using a classifier for a given feature subset search algorithm. To fairly compare all models, we propose a weight method for the class-dependent classifier, i.e., assigning a weight to each model's output before the comparison is carried out. The method's performance is evaluated on two artificial data sets and several real-world benchmark data sets, with the support vector machine (SVM) as the classifier, and with the RELIEF, class separability, and minimal-redundancy�𢘫aximal-relevancy (mRMR) as attribute importance measures."
},
{
"abstract": "In this paper, we propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange support vectors among a strongly connected network (SCN) so that multiple servers may work concurrently on distributed data set with limited communication cost and fast training speed. The percentage of servers that can work in parallel and the communication overhead may be adjusted through network configuration. The proposed algorithm further speeds up through online implementation and synchronization. We prove that the global optimal classifier can be achieved iteratively over an SCN. Experiments on a real-world data set show that the computing time scales well with the size of the training data for most networks. Numerical results show that a randomly generated SCN may achieve better performance than the state of the art method, cascade SVM, in terms of total training time.",
"method": "The basic idea is to exchange support vectors among a strongly connected network (SCN) so that multiple servers may work concurrently on distributed data set with limited communication cost and fast training speed. The percentage of servers that can work in parallel and the communication overhead may be adjusted through network configuration. The proposed algorithm further speeds up through online implementation and synchronization. We prove that the global optimal classifier can be achieved iteratively over an SCN."
},
{
"abstract": "In this paper, a chip that performs real-time image convolutions with programmable kernels of arbitrary shape is presented. The chip is a first experimental prototype of reduced size to validate the implemented circuits and system level techniques. The convolution processing is based on the address-event-representation (AER) technique, which is a spike-based biologically inspired image and video representation technique that favors communication bandwidth for pixels with more information. As a first test prototype, a pixel array of 16��16 has been implemented with programmable kernel size of up to 16��16. The chip has been fabricated in a standard 0.35 mum complimentary metal-oxide-semiconductor (CMOS) process. The technique also allows to process larger size images by assembling 2D arrays of such chips. Pixel operation exploits low-power mixed analog-digital circuit techniques. Because of the low currents involved (down to nanoamperes or even picoamperes), an important amount of pixel area is devoted to mismatch calibration. The rest of the chip uses digital circuit techniques, both synchronous and asynchronous. The fabricated chip has been thoroughly tested, both at the pixel level and at the system level. Specific computer interfaces have been developed for generating AER streams from conventional computers and feeding them as inputs to the convolution chip, and for grabbing AER streams coming out of the convolution chip and storing and analyzing them on computers. Extensive experimental results are provided. At the end of this paper, we provide discussions and results on scaling up the approach for larger pixel arrays and multilayer cortical AER systems.",
"method": "The chip is a first experimental prototype of reduced size to validate the implemented circuits and system level techniques. The convolution processing is based on the address-event-representation (AER) technique, which is a spike-based biologically inspired image and video representation technique that favors communication bandwidth for pixels with more information. As a first test prototype, a pixel array of 16��16 has been implemented with programmable kernel size of up to 16��16. The chip has been fabricated in a standard 0.35 mum complimentary metal-oxide-semiconductor (CMOS) process. The technique also allows to process larger size images by assembling 2D arrays of such chips. Pixel operation exploits low-power mixed analog-digital circuit techniques. Because of the low currents involved (down to nanoamperes or even picoamperes), an important amount of pixel area is devoted to mismatch calibration. The rest of the chip uses digital circuit techniques, both synchronous and asynchronous. The fabricated chip has been thoroughly tested, both at the pixel level and at the system level. Specific computer interfaces have been developed for generating AER streams from conventional computers and feeding them as inputs to the convolution chip, and for grabbing AER streams coming out of the convolution chip and storing and analyzing them on computers."
},
{
"abstract": "This paper introduces a multilinear principal component analysis (MPCA) framework for tensor object feature extraction. Objects of interest in many computer vision and pattern recognition applications, such as 2D/3D images and video sequences are naturally described as tensors or multilinear arrays. The proposed framework performs feature extraction by determining a multilinear projection that captures most of the original tensorial input variation. The solution is iterative in nature and it proceeds by decomposing the original problem to a series of multiple projection subproblems. As part of this work, methods for subspace dimensionality determination are proposed and analyzed. It is shown that the MPCA framework discussed in this work supplants existing heterogeneous solutions such as the classical principal component analysis (PCA) and its 2D variant (2D PCA). Finally, a tensor object recognition system is proposed with the introduction of a discriminative tensor feature selection mechanism and a novel classification strategy, and applied to the problem of gait recognition. Results presented here indicate MPCA's utility as a feature extraction tool. It is shown that even without a fully optimized design, an MPCA-based gait recognition module achieves highly competitive performance and compares favorably to the state-of-the-art gait recognizers.",
"method": "Objects of interest in many computer vision and pattern recognition applications, such as 2D/3D images and video sequences are naturally described as tensors or multilinear arrays. The proposed framework performs feature extraction by determining a multilinear projection that captures most of the original tensorial input variation. The solution is iterative in nature and it proceeds by decomposing the original problem to a series of multiple projection subproblems. As part of this work, methods for subspace dimensionality determination are proposed and analyzed. Finally, a tensor object recognition system is proposed with the introduction of a discriminative tensor feature selection mechanism and a novel classification strategy, and applied to the problem of gait recognition."
},
{
"abstract": "The success of linear discriminant analysis (LDA) is due in part to the simplicity of its formulation, which reduces to a simultaneous diagonalization of two symmetric matrices A and B. However, a fundamental drawback of this approach is that it cannot be efficiently applied wherever the matrix A is singular or when some of the smallest variances in A are due to noise. In this paper, we present a factorization of A^-1 B and a correlation-based criterion that can be readily employed to solve these problems. We provide detailed derivations for the linear and nonlinear classification problems. The usefulness of the proposed approach is demonstrated thoroughly using a large variety of databases.",
"method": "We provide detailed derivations for the linear and nonlinear classification problems."
},
{
"abstract": "The distance metric is the corner stone of nearest neighbor (NN)-based methods, and therefore, of nearest prototype (NP) algorithms. That is because they classify depending on the similarity of the data. When the data is characterized by a set of features which may contribute to the classification task in different levels, feature weighting or selection is required, sometimes in a local sense. However, local weighting is typically restricted to NN approaches. In this paper, we introduce local feature weighting (LFW) in NP classification. LFW provides each prototype its own weight vector, opposite to typical global weighting methods found in the NP literature, where all the prototypes share the same one. Providing each prototype its own weight vector has a novel effect in the borders of the Voronoi regions generated: They become nonlinear. We have integrated LFW with a previously developed evolutionary nearest prototype classifier (ENPC). The experiments performed both in artificial and real data sets demonstrate that the resulting algorithm that we call LFW in nearest prototype classification (LFW-NPC) avoids overfitting on training data in domains where the features may have different contribution to the classification task in different areas of the feature space. This generalization capability is also reflected in automatically obtaining an accurate and reduced set of prototypes.",
"method": "LFW provides each prototype its own weight vector, opposite to typical global weighting methods found in the NP literature, where all the prototypes share the same one. Providing each prototype its own weight vector has a novel effect in the borders of the Voronoi regions generated: They become nonlinear. We have integrated LFW with a previously developed evolutionary nearest prototype classifier (ENPC)."
},
{
"abstract": "Web engineering is a new research line in software engineering that covers the definition of processes, techniques, and models suitable for Web environments in order to guarantee the quality of results. The research community is working in this area and, as a very recent line, they are assuming the Model-Driven paradigm to support and solve some classic problems detected in Web developments. However, there is a lack in Web requirements treatment. This paper presents a general vision of Navigational Development Techniques (NDT), which is an approach to deal with requirements in Web systems. It is based on conclusions obtained in several comparative studies and it tries to fill some gaps detected by the research community. This paper presents its scope, its most important contributions, and offers a global vision of its associated tool: NDT-Tool. Furthermore, it analyzes how Web Engineering can be applied in the enterprise environment. NDT is being applied in real projects and has been adopted by several companies as a requirements methodology. The approach offers a Web requirements solution based on a Model-Driven paradigm that follows the most accepted tendencies by Web engineering.",
"method": "It is based on conclusions obtained in several comparative studies and it tries to fill some gaps detected by the research community. This paper presents its scope, its most important contributions, and offers a global vision of its associated tool: NDT-Tool. Furthermore, it analyzes how Web Engineering can be applied in the enterprise environment."
},
{
"abstract": "An accurate prediction of the number of defects in a software product during system testing contributes not only to the management of the system testing process but also to the estimation of the product's required maintenance. Here, a new approach, called Estimation of Defects based on Defect Decay Model (ED^3M) is presented that computes an estimate of the total number of defects in an ongoing testing process. ED^3M is based on estimation theory. Unlike many existing approaches the technique presented here does not depend on historical data from previous projects or any assumptions about the requirements and/or testers' productivity. It is a completely automated approach that relies only on the data collected during an ongoing testing process. This is a key advantage of the ED^3M approach, as it makes it widely applicable in different testing environments. Here, the ED^3M approach has been evaluated using five data sets from large industrial projects and two data sets from the literature. In addition, a performance analysis has been conducted using simulated data sets to explore its behavior using different models for the input data. The results are very promising; they indicate the ED^3M approach provides accurate estimates with as fast or better convergence time in comparison to well-known alternative techniques, while only using defect data as the input.",
"method": "ED^3M is based on estimation theory. Unlike many existing approaches the technique presented here does not depend on historical data from previous projects or any assumptions about the requirements and/or testers' productivity. It is a completely automated approach that relies only on the data collected during an ongoing testing process. This is a key advantage of the ED^3M approach, as it makes it widely applicable in different testing environments. Here, the ED^3M approach has been evaluated using five data sets from large industrial projects and two data sets from the literature. In addition, a performance analysis has been conducted using simulated data sets to explore its behavior using different models for the input data."
},
{
"abstract": "To update a performance model, its parameter values must be updated, and in some applications (such as autonomic systems) tracked continuously over time. Direct measurement of many parameters during system operation requires instrumentation which is impractical. Kalman filter estimators can track such parameters using other data such as response times and utilizations, which are readily observable. This paper adapts Kalman filter estimators for performance model parameters, evaluates the approximations which must be made, and develops a systematic approach to setting up an estimator. The estimator converges under easily verified conditions. Different queueing-based models are considered here, and the extension for state-based models (such as stochastic Petri nets) is straightforward.",
"method": "This paper adapts Kalman filter estimators for performance model parameters, evaluates the approximations which must be made, and develops a systematic approach to setting up an estimator."
},
{
"abstract": "The Unified Modeling Language (UML) is the de facto standard for object-oriented software analysis and design modeling. However, few empirical studies exist that investigate the costs and evaluate the benefits of using UML in realistic contexts. Such studies are needed so that the software industry can make informed decisions regarding the extent to which they should adopt UML in their development practices. This is the first controlled experiment that investigates the costs of maintaining and the benefits of using UML documentation during the maintenance and evolution of a real, non-trivial system, using professional developers as subjects, working with a state-of-the-art UML tool during an extended period of time. The subjects in the control group had no UML documentation. In this experiment, the subjects in the UML group had on average a practically and statistically significant 54% increase in the functional correctness of changes (p=0.03), and an insignificant 7% overall improvement in design quality (p=0.22) - though a much larger improvement was observed on the first change task (56%) - at the expense of an insignificant 14% increase in development time caused by the overhead of updating the UML documentation (p=0.35).",
"method": "The subjects in the control group had no UML documentation."
},
{
"abstract": "Current text based Software Configuration Management (SCM) systems have trouble with refactorings. Refactorings result in global changes which lead to merge conflicts. A refactoring-aware SCM system reduces merge conflicts. This paper describes MolhadoRef, a refactoring-aware SCM system and the merge algorithm at its core. MolhadoRef records change operations (refactorings and edits) used to produce one version, and replays them when merging versions. Since refactorings are change operations with well defined semantics, MolhadoRef treats them intelligently. A case study and a controlled experiment show that MolhadoRef automatically solves more merge conflicts than CVS while resulting in fewer merge errors.",
"method": "MolhadoRef records change operations (refactorings and edits) used to produce one version, and replays them when merging versions. Since refactorings are change operations with well defined semantics, MolhadoRef treats them intelligently."
},
{
"abstract": "Pair programming involves two developers simultaneously collaborating with each other on the same programming task to design and code a solution. Algorithm design and its implementation are normally interwoven in that implementation often provides feedback to enhance the design. Previous controlled pair programming experiments did not explore the efficacy of pairs versus individuals in program design-related tasks separately from coding. Variations in programmer skills in a particular language or an integrated development environment and the understanding of programming instructions can mask the skill of subjects in program design-related tasks. Programming aptitude tests (PATs) have been shown to correlate with programming performance. PATs do not require understanding of programming instructions and do not require a skill in any specific computer language. Two controlled experiments were conducted, with full-time professional programmers being the subjects who worked on increasingly complex programming aptitude tasks related to problem solving and algorithmic design. In both experiments, pairs significantly outperformed individuals, providing evidence of the value of pairs in program design-related tasks.",
"method": "Two controlled experiments were conducted, with full-time professional programmers being the subjects who worked on increasingly complex programming aptitude tasks related to problem solving and algorithmic design."
},
{
"abstract": "In order to characterize and improve software architecture visualization practice, the paper derives and constructs a qualitative framework, with seven key areas and 31 features, for the assessment of software architecture visualization tools. The framework is derived by the application of the Goal Question Metric paradigm to information obtained from a literature survey and addresses a number of stakeholder issues. The evaluation is performed from multiple stakeholder perspectives and in various architectural contexts. Stakeholders can apply the framework to determine if a particular software architecture visualization tool is appropriate to a given task. The framework is applied in the evaluation of a collection of six software architecture visualization tools. The framework may also be used as a design template for a comprehensive software architecture visualization tool.",
"method": "The framework is derived by the application of the Goal Question Metric paradigm to information obtained from a literature survey and addresses a number of stakeholder issues. The evaluation is performed from multiple stakeholder perspectives and in various architectural contexts. Stakeholders can apply the framework to determine if a particular software architecture visualization tool is appropriate to a given task."
},
{
"abstract": "An international survey on risk management in software development with off-the-shelf (OTS) components is reported upon and discussed. The survey investigated actual risk-management activities and their correlations with the occurrences of typical risks in OTS component-based development. Data from 133 software projects in Norway, Italy, and Germany were collected using a stratified random sample of IT companies. The results show that OTS components normally do not contribute negatively to the quality of the software system as a whole, as is commonly expected. However, issues such as the underestimation of integration effort and inefficient debugging remain problematic and require further investigation. The results also illustrate several promising effective risk-reduction activities, e.g., putting more effort into learning relevant OTS components, integrating unfamiliar components first, thoroughly evaluating the quality of candidate OTS components, and regularly monitoring the support capability of OTS providers. Five hypotheses are proposed regarding these risk-reduction activities. The results also indicate that several other factors, such as project, cultural, and human-social factors, have to be investigated to thoroughly deal with the possible risks of OTS-based projects.",
"method": "The survey investigated actual risk-management activities and their correlations with the occurrences of typical risks in OTS component-based development. Data from 133 software projects in Norway, Italy, and Germany were collected using a stratified random sample of IT companies."
},
{
"abstract": "Fast and accurate failure detection is becoming essential in managing large-scale Internet services. This paper proposes a novel detection approach based on the subspace mapping between the system inputs and internal measurements. By exploring these contextual dependencies, our detector can initiate repair actions accurately, increasing the availability of the system. Although a classical statistical method, the canonical correlation analysis (CCA), is presented in the paper to achieve subspace mapping, we also propose a more advanced technique, the principal canonical correlation analysis (PCCA), to improve the performance of the CCA-based detector. PCCA extracts a principal subspace from internal measurements that is not only highly correlated with the inputs but also a significant representative of the original measurements. Experimental results on a Java 2 platform, enterprise edition (J2EE)- based Web application demonstrate that such property of PCCA is especially beneficial to failure detection tasks.",
"method": "By exploring these contextual dependencies, our detector can initiate repair actions accurately, increasing the availability of the system. Although a classical statistical method, the canonical correlation analysis (CCA), is presented in the paper to achieve subspace mapping, we also propose a more advanced technique, the principal canonical correlation analysis (PCCA), to improve the performance of the CCA-based detector. PCCA extracts a principal subspace from internal measurements that is not only highly correlated with the inputs but also a significant representative of the original measurements."
},
{
"abstract": "In applications of multiple data streams such as stock market trading and sensor network data analysis, the clusters of streams change at different times because of data evolution. The information about evolving cluster is valuable to support corresponding online decisions. In this paper, we present a framework for clustering over multiple evolving streams by correlations and events, which, abbreviated as COMET-CORE, monitors the distribution of clusters over multiple data streams based on their correlation. Instead of directly clustering the multiple data streams periodically, COMET-CORE applies efficient cluster split and merge processes only when significant cluster evolution happens. Accordingly, we devise an event detection mechanism to signal the cluster adjustments. The coming streams are smoothed as sequences of end points by employing piecewise linear approximation. At the time when end points are generated, weighted correlations between streams are updated. End points are good indicators of significant change in streams, and this is a main cause of a cluster evolution event. When an event occurs, through split and merge operations we can report the latest clustering results. As shown in our experimental studies, COMET-CORE can be performed effectively with good clustering quality.",
"method": "Instead of directly clustering the multiple data streams periodically, COMET-CORE applies efficient cluster split and merge processes only when significant cluster evolution happens. Accordingly, we devise an event detection mechanism to signal the cluster adjustments. The coming streams are smoothed as sequences of end points by employing piecewise linear approximation. At the time when end points are generated, weighted correlations between streams are updated. End points are good indicators of significant change in streams, and this is a main cause of a cluster evolution event. When an event occurs, through split and merge operations we can report the latest clustering results."
},
{
"abstract": "Due to the resource limitation in the data stream environments, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential ability of a Data Stream Management System (DSMS). In the literature, recent research has been elaborated upon minimizing the local error metric of an individual stream. However, many emergent applications, such as stock marketing and sensor detection, also call for the need of recording multiple streams in a commercial DSMS. As shown in our thorough analysis and experimental studies, minimizing global error in multiple-stream environments leads to good reliability for DSMS to answer the queries; in contrast, only minimizing local error may lead to significant loss of query accuracy. As such, we first study in this paper the problem of maintaining the wavelet coefficients of multiple streams within collective memory so that the predetermined global error metric is minimized. Moreover, we also examine a promising application in the multistream environment, i.e., the queries for top-k range sum. We resolve the problem of efficient top-k query processing with minimized global error by developing a general framework. For the purposes of maintaining the wavelet coefficients and processing top-k queries, several well-designed algorithms are utilized to optimize the performance of each primary component of this general framework. We also evaluate the proposed algorithms empirically on real and simulated data streams and show that our framework can process top-k queries accurately and efficiently.",
"method": "As such, we first study in this paper the problem of maintaining the wavelet coefficients of multiple streams within collective memory so that the predetermined global error metric is minimized. Moreover, we also examine a promising application in the multistream environment, i.e., the queries for top-k range sum. We resolve the problem of efficient top-k query processing with minimized global error by developing a general framework. For the purposes of maintaining the wavelet coefficients and processing top-k queries, several well-designed algorithms are utilized to optimize the performance of each primary component of this general framework. We also evaluate the proposed algorithms empirically on real and simulated data streams and show that our framework can process top-k queries accurately and efficiently."
},
{
"abstract": "Although Bayesian Nets (BNs) are increasingly being used to solve real world risk problems, their use is still constrained by the difficulty of constructing the node probability tables (NPTs). A key challenge is to construct relevant NPTs using the minimal amount of expert elicitation, recognising that it is rarely cost-effective to elicit complete sets of probability values. We describe a simple approach to defining NPTs for a large class of commonly occurring nodes (called ranked nodes). The approach is based on the doubly truncated Normal distribution with a central tendency that is invariably a type of weighted function of the parent nodes. In extensive real-world case studies we have found that this approach is sufficient for generating the NPTs of a very large class of nodes. We describe one such case study for validation purposes. The approach has been fully automated in a commercial tool, called AgenaRisk, and is thus accessible to all types of domain experts. We believe this work represents a useful contribution to BN research and technology since its application makes the difference between being able to build realistic BN models and not.",
"method": "The approach is based on the doubly truncated Normal distribution with a central tendency that is invariably a type of weighted function of the parent nodes."
},
{
"abstract": "Web site success is significantly associated with navigability, an important attribute of usability that denotes the ease with which users find desired information as they move through a Web site. Navigable Web sites allow users to form a mental model of the type and location of information in the Web site and an expectation of where and to what a particular hyperlink will lead. Existing navigability measures are based mainly on the static hyperlink structure of a Web site. Such measures, however, have two main drawbacks: 1) the effect on navigability of a hyperlink structure cannot be well characterized and 2) the effect on navigability of the navigation aids (such as the \"Back\" button provided by a browser) is ignored. In this paper, we abstract a dynamic Web surfing behavior as a Markov model which synthesizes typical surfing actions. Based on this model, we propose a novel navigability measure MNav. The experimental results show that MNav can be efficiently computed and it provides an effective and useful measurement of Web site navigability.",
"method": "Based on this model, we propose a novel navigability measure MNav."
},
{
"abstract": "As a fine-grained defect detection technique, unit testing introduces a strong dependency on the structure of the code. Accordingly, test coevolution forms an additional burden on the software developer which can be tempered by writing tests in a manner that makes them easier to change. Fortunately, we are able to concretely express what a good test is by exploiting the specific principles underlying unit testing. Analogous to the concept of code smells, violations of these principles are termed test smells. In this paper, we clarify the structural deficiencies encapsulated in test smells by formalizing core test concepts and their characteristics. To support the detection of two such test smells, General Fixture and Eager Test, we propose a set of metrics defined in terms of unit test concepts. We compare their detection effectiveness using manual inspection and through a comparison with human reviewing. Although the latter is the traditional means for test quality assurance, our results indicate it is not a reliable means for test smell detection. This work thus stresses the need for a more reliable detection mechanism and provides an initial contribution through the validation of test smell metrics.",
"method": "To support the detection of two such test smells, General Fixture and Eager Test, we propose a set of metrics defined in terms of unit test concepts. We compare their detection effectiveness using manual inspection and through a comparison with human reviewing."
},
{
"abstract": "Software engineers increasingly emphasize agility and flexibility in their designs and development approaches. They increasingly use distributed development teams, rely on component assembly and deployment rather than green field code writing, rapidly evolve the system through incremental development and frequent updating, and use flexible product designs supporting extensive end-user customization. While agility and flexibility have many benefits, they also create an enormous number of potential system configurations built from rapidly changing component implementations. Since today's quality assurance (QA) techniques do not scale to handle highly configurable systems, we are developing and validating novel software QA processes and tools that leverage the extensive computing resources of user and developer communities in a distributed, continuous manner to improve software quality significantly. This paper provides several contributions to the study of distributed, continuous QA (DCQA). First, it shows the structure and functionality of Skoll, which is an environment that defines a generic around-the-world, around-the-clock QA process and several sophisticated tools that support this process. Second, it describes several novel QA processes built using the Skoll environment. Third, it presents two studies using Skoll: one involving user testing of the Mozilla browser and another involving continuous build, integration, and testing of the ACE+TAO communication software package. The results of our studies suggest that the Skoll environment can manage and control distributed continuous QA processes more effectively than conventional QA processes. For example, our DCQA processes rapidly identified problems that had taken the ACE+TAO developers much longer to find and several of which they had not found. Moreover, the automatic analysis of QA results provided developers information that enabled them to quickly find the root causes of problems.",
"method": "First, it shows the structure and functionality of Skoll, which is an environment that defines a generic around-the-world, around-the-clock QA process and several sophisticated tools that support this process. Second, it describes several novel QA processes built using the Skoll environment. Third, it presents two studies using Skoll: one involving user testing of the Mozilla browser and another involving continuous build, integration, and testing of the ACE+TAO communication software package."
},
{
"abstract": "Modern programs make extensive use of reusable software libraries. For example, we found that 17 percent to 30 percent of the classes in a number of large Java applications use the container classes from the java.util package. Given this extensive code reuse in Java programs, it is important for the reusable interfaces to have clear and unambiguous documentation. Unfortunately, most documentation is expressed in English and, therefore, does not always satisfy these requirements. Worse yet, there is no way of checking that the documentation is consistent with the associated code. Formal specifications present an alternative that does not suffer from these problems; however, formal specifications are notoriously hard to write. To alleviate this difficulty, we have implemented a tool that automatically derives documentation in the form of formal specifications. Our tool probes Java classes by invoking them on dynamically generated tests and captures the information observed during their execution as algebraic axioms. Although the tool is not complete or correct from a formal perspective, we demonstrate that it discovers many useful axioms when applied to container classes. These axioms then form an initial formal documentation of the class they describe.",
"method": "Our tool probes Java classes by invoking them on dynamically generated tests and captures the information observed during their execution as algebraic axioms."
},
{
"abstract": "Security defects in software cost millions of dollars to firms in terms of downtime, disruptions, and confidentiality breaches. However, the economic implications of these defects for software vendors are not well understood. Lack of legal liability and the presence of switching costs and network externalities may protect software vendors from incurring significant costs in the event of a vulnerability announcement, unlike such industries as auto and pharmaceuticals, which have been known to suffer significant loss in market value in the event of a defect announcement. Although research in software economics has studied firms' incentives to improve overall quality, there have not been any studies which show that software vendors have an incentive to invest in building more secure software. The objectives of this paper are twofold. 1) We examine how a software vendor's market value changes when a vulnerability is announced. 2) We examine how firm and vulnerability characteristics mediate the change in the market value of a vendor. We collect data from leading national newspapers and industry sources, such as the Computer Emergency Response Team (CERT), by searching for reports on published software vulnerabilities. We show that vulnerability announcements lead to a negative and significant change in a software vendor's market value. In our sample, on average, a vendor loses around 0.6 percent value in stock price when a vulnerability is reported. We find that a software vendor loses more market share if the market is competitive or if the vendor is small. To provide further insight, we use the information content of the disclosure announcement to classify vulnerabilities into various types. We find that the change in stock price is more negative if the vendor fails to provide a patch at the time of disclosure. Also, more severe flaws have a significantly greater impact. Our analysis provides many interesting implications for software vendors as well as policy makers.",
"method": "We collect data from leading national newspapers and industry sources, such as the Computer Emergency Response Team (CERT), by searching for reports on published software vulnerabilities. To provide further insight, we use the information content of the disclosure announcement to classify vulnerabilities into various types."
},
{
"abstract": "In this paper, we describe a methodology integrating verification and conformance testing. A specification of a system - an extended input-output automaton, which may be infinite-state - and a set of safety properties (\"nothing bad ever happens\") and possibility properties (\"something good may happen\") are assumed. The properties are first tentatively verified on the specification using automatic techniques based on approximated state-space exploration, which are sound, but, as a price to pay for automation, are not complete for the given class of properties. Because of this incompleteness and of state-space explosion, the verification may not succeed in proving or disproving the properties. However, even if verification did not succeed, the testing phase can proceed and provide useful information about the implementation. Test cases are automatically and symbolically generated from the specification and the properties and are executed on a black-box implementation of the system. The test execution may detect violations of conformance between implementation and specification; in addition, it may detect violation/satisfaction of the properties by the implementation and by the specification. In this sense, testing completes verification. The approach is illustrated on simple examples and on a bounded retransmission protocol.",
"method": "A specification of a system - an extended input-output automaton, which may be infinite-state - and a set of safety properties (\"nothing bad ever happens\") and possibility properties (\"something good may happen\") are assumed. The properties are first tentatively verified on the specification using automatic techniques based on approximated state-space exploration, which are sound, but, as a price to pay for automation, are not complete for the given class of properties. Because of this incompleteness and of state-space explosion, the verification may not succeed in proving or disproving the properties."
},
{
"abstract": "In recent years, data broadcasting has become a promising technique to design a mobile information system with power conservation, high scalability, and high bandwidth utilization. In many applications, the query issued by a mobile client corresponds to multiple items that should be accessed in a sequential order. In this paper, we study the scheduling approach in such a sequential data broadcasting environment. Explicitly, we propose a general framework referred to as MULS (standing for MUlti-Level Service) for an information system. There are two primary stages in MULS: online scheduling (OLS) and optimization procedure In the first stage, we propose an OLS algorithm to allocate the data items into multiple channels. As for the second stage, we devise an optimization procedure, called Sampling with Controlled Iteration (SCI), to enhance the quality of broadcast programs generated by algorithm OLS. Procedure SCI is able to strike a compromise between effectiveness and efficiency by tuning the control parameters. According to the experimental results, we show that algorithm OLS with procedure SCI outperforms the approaches in prior works prominently in both effectiveness (that is, the average access time of mobile users) and efficiency (that is, the complexity of the scheduling algorithm). Therefore, by cooperating algorithm OLS with procedure SCI, the proposed MULS framework is able to generate broadcast programs with the flexibility of providing different service qualities under different requirements of effectiveness and efficiency: in the dynamic environment in which the access patterns and information contents change rapidly, the parameters used in SCI will perform OLS with satisfactory service quality. As for the static environment in which the query profile and the database are updated infrequently, larger values of parameters are helpful to generate an optimized broadcast program, indicating the advantageous feature of MULS.",
"method": "There are two primary stages in MULS: online scheduling (OLS) and optimization procedure In the first stage, we propose an OLS algorithm to allocate the data items into multiple channels. As for the second stage, we devise an optimization procedure, called Sampling with Controlled Iteration (SCI), to enhance the quality of broadcast programs generated by algorithm OLS. Procedure SCI is able to strike a compromise between effectiveness and efficiency by tuning the control parameters."
},
{
"abstract": "The ability to transfer knowledge learned in one environment in order to improve performance in a different environment is one of the hallmarks of human intelligence. Insights into human transfer learning help us to design computer-based agents that can better adapt to new environments without the need for substantial reprogramming. In this paper, we study the transfer of knowledge by humans playing various scenarios in a graphically realistic urban setting that are specifically designed to test various levels of transfer. We determine the amount and type of transfer that is being performed based on the performance of trained and untrained human players. In addition, we use a graph-based relational learning algorithm to extract patterns from player graphs. These analyses reveal that indeed humans are transferring knowledge from on 3 set of games to another and the amount and type of transfer varies according to player experience and scenario complexity. The results of this analysis help us understand the nature of human transfer in such environments and shed light on how we might endow computer-based agents with similar capabilities. The game simulator and human data collection also represent a significant testbed in which other Al capabilities can be tested and compared to human performance.",
"method": "We determine the amount and type of transfer that is being performed based on the performance of trained and untrained human players. In addition, we use a graph-based relational learning algorithm to extract patterns from player graphs."
},
{
"abstract": "Queries posed to database systems often involve universal quantification. Such queries are typically expensive to evaluate. Although they can be handled by basic access methods, for selection, grouping, and so forth, new access methods specifically tailored to evaluate universal quantification can greatly decrease the computational cost. In this paper, we study the efficient evaluation of universal quantification in an XML database. Specifically, we develop a small taxonomy of universal quantification types and define a family of algorithms suitable for handling each. We experimentally demonstrate the performance benefits of the new family of algorithms.",
"method": "Specifically, we develop a small taxonomy of universal quantification types and define a family of algorithms suitable for handling each."
},
{
"abstract": "We address wildcard search in structured peer-to-peer (P2P) networks, which, to our knowledge, has not yet been explored in the literature. We begin by presenting an approach based on some well-known techniques in information retrieval (IR) and discuss why it is not appropriate in a distributed environment. We then present a simple and novel technique to index objects for wildcard search in a fully decentralized manner, along with some search strategies to retrieve objects. Our index scheme, as opposed to a traditional IR approach, can achieve quite balanced loads, avoid hop spots and single point of failure, reduce storage and maintenance costs, and offer some ranking mechanisms for matching objects. We use the compact disc (CD) records collected in FreeDB (http://freedb.org) as the experimental data set to evaluate our scheme. The results confirm that our index scheme is very effective in balancing the load. Moreover, search efficiency depends on the information given in a query: the more the information, he higher the performance.",
"method": "We begin by presenting an approach based on some well-known techniques in information retrieval (IR) and discuss why it is not appropriate in a distributed environment. We then present a simple and novel technique to index objects for wildcard search in a fully decentralized manner, along with some search strategies to retrieve objects. We use the compact disc (CD) records collected in FreeDB (http://freedb.org) as the experimental data set to evaluate our scheme."
},
{
"abstract": "There are numerous applications where there is uncertainty over space and time. Examples of such uncertainty arise in vehicle tracking systems where we are not always sure where a vehicle is now (or may be in the future), and cell and satellite phone applications where we are not sure exactly where a phone may be, and so on. In this paper, we propose the concept of a Spatial Probabilistic Temporal (SPOT) database that contains statements of the form \"Object O is in spatial region R at some time / with some probability in the interval [L, U]\". We define the syntax and a declarative semantics for SPOT databases based on a mix of logic and linear programming, as well as query algebra. We show alternative implementations of some of these query algebra operators when the SPOT database has a disjoint/less property. Though the declarative semantics of SPOT databases is rooted in linear programming, we have found very efficient algorithms that do not use linear programming methods. We report on experiments we have conducted that show that the system scales to large numbers of SPOT atoms, as well as to fairly fine temporal and spatial granularity.",
"method": "We define the syntax and a declarative semantics for SPOT databases based on a mix of logic and linear programming, as well as query algebra. We show alternative implementations of some of these query algebra operators when the SPOT database has a disjoint/less property."
},
{
"abstract": "Data cubes have become important components in most data warehouse systems and decision support systems. In such systems, users usually pose very complex queries to the online analytical processing (OLAP) system, and systems usually have to deal with a huge amount of data because of the large dimensionality of the sets; thus, approximating query processing has emerged as a viable solution. Specifically, the applications of cube streams handle multidimensional data sets in a continuous manner in contrast to the traditional cube approximation. Such an application collects data events for cube streams online, generates snapshots with limited resources, and keeps the approximated information in a synopsis memory for further analysis. Compared to the OLAP applications, applications of cube streams are subject to many more resource constraints on both the processing time and the memory and cannot be dealt with by existing methods due to the limited resources. In this paper, we propose the DAWA algorithm, which is a hybrid algorithm of discrete cosine transform (DCT) for data and the discrete wavelet transform (DWT), to approximate cube streams. Our algorithm combines the advantages of the high compression rate of DWT and the low memory cost of DCT. Consequently, DAWA requires much smaller working buffer and outperforms both DWT-based and DCT-based methods in execution efficiency. Also, it is shown that DAWA provides a good solution for an approximate query processing of cube streams with a small working buffer and a short execution time. The optimality of the DAWA algorithm is theoretically proved and empirically demonstrated by our experiments.",
"method": "Our algorithm combines the advantages of the high compression rate of DWT and the low memory cost of DCT."
},
{
"abstract": "Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues related to the similarity search, namely, the design of a distance function to measure the similarity and improving the search efficiency. Many distance functions have been proposed, which attempt to closely mimic human recognition. Unfortunately, some of these well-designed distance functions do not follow the triangle inequality and are therefore nonmetric. As a consequence, efficient retrieval by using these nonmetric distance functions becomes more challenging, since most existing index structures assume that the indexed distance functions are metric. In this paper, we address this challenging problem by proposing an efficient method, that is, local constant embedding (LCE), which divides the data set into disjoint groups so that the triangle inequality holds within each group by constant shifting. Furthermore, we design a pivot selection approach for the converted metric distance and create an index structure to speed up the retrieval efficiency. Moreover, we also propose a novel method to answer approximate similarity search in the nonmetric space with a guaranteed query accuracy. Extensive experiments show that our method works well on various nonmetric distance functions and improves the retrieval efficiency by an order of magnitude compared to the linear scan and existing retrieval approaches with no false dismissals.",
"method": "In this paper, we address this challenging problem by proposing an efficient method, that is, local constant embedding (LCE), which divides the data set into disjoint groups so that the triangle inequality holds within each group by constant shifting. Furthermore, we design a pivot selection approach for the converted metric distance and create an index structure to speed up the retrieval efficiency. Moreover, we also propose a novel method to answer approximate similarity search in the nonmetric space with a guaranteed query accuracy."
},
{
"abstract": "Relevance feedback (RF) is an iterative process, which refines the retrievals by utilizing the user's feedback on previously retrieved results. Traditional RF techniques solely use the short-term learning experience and do not exploit the knowledge created during cross sessions with multiple users. In this paper, we propose a novel RF framework, which facilitates the combination of short-term and long-term learning processes by integrating the traditional methods with a new technique called the virtual feature. The feedback history with all the users is digested by the system and is represented in a very efficient form as a virtual feature of the images. As such, the dissimilarity measure can dynamically be adapted, depending on the estimate of the semantic relevance derived from the virtual features. In addition, with a dynamic database, the user's subject concepts may transit from one to another. By monitoring the changes in retrieval performance, the proposed system can automatically adapt the concepts according to the new subject concepts. The experiments are conducted on a real image database. The results manifest that the proposed framework outperforms the traditional within-session and log-based long-term RF techniques.",
"method": "The feedback history with all the users is digested by the system and is represented in a very efficient form as a virtual feature of the images. As such, the dissimilarity measure can dynamically be adapted, depending on the estimate of the semantic relevance derived from the virtual features. In addition, with a dynamic database, the user's subject concepts may transit from one to another. By monitoring the changes in retrieval performance, the proposed system can automatically adapt the concepts according to the new subject concepts. The experiments are conducted on a real image database."
},
{
"abstract": "The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. In this paper, we propose a Lagrangian method for the problem. The original problem space is transformed to another simpler one by introducing Lagrange multipliers, which relax the constraints of the multicampaign assignment problem. When the Lagrangian vector is supplied, we can compute the optimal solution under this new environment in O(NK^2) time, where N and K are the numbers of customers and campaigns, respectively. This is a linear-time method when the number of campaigns is constant. However, it is not easy to find a Lagrangian vector in exact accord with the given problem constraints. We thus combine the Lagrangian method with a genetic algorithm to find good near-feasible solutions. We verify the effectiveness of our evolutionary Lagrangian approach in both theoretical and experimental viewpoints. The suggested Lagrangian approach is practically attractive for large-scale real-world problems.",
"method": "The original problem space is transformed to another simpler one by introducing Lagrange multipliers, which relax the constraints of the multicampaign assignment problem. When the Lagrangian vector is supplied, we can compute the optimal solution under this new environment in O(NK^2) time, where N and K are the numbers of customers and campaigns, respectively. This is a linear-time method when the number of campaigns is constant. However, it is not easy to find a Lagrangian vector in exact accord with the given problem constraints. We thus combine the Lagrangian method with a genetic algorithm to find good near-feasible solutions. We verify the effectiveness of our evolutionary Lagrangian approach in both theoretical and experimental viewpoints."
},
{
"abstract": "Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their \"goodness\" with respect to the query. Thus, the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results, especially for long or uncorrelated (multitopic) queries (in which individual keywords rarely occur together in the same document), where a single page is unlikely to satisfy the user's information need. We propose a technique that, given a keyword query, on the fly generates new pages, called composed pages, which contain all query keywords. The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages and retaining links to the original Web pages. To rank the composed pages, we consider both the hyperlink structure of the original pages and the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages. The quality of our method is compared to current approaches by using user surveys. Finally, we also show how our techniques can be used to perform query-specific summarization of Web pages.",
"method": "The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages and retaining links to the original Web pages. To rank the composed pages, we consider both the hyperlink structure of the original pages and the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages."
},
{
"abstract": "While the dominant approach to persistent storage in practice is to use a relational DBMS, there are some specialist applications that rely on object stores. The performance of these applications depends on the efficiency of the object store's concurrency control mechanism. Today's predominant concurrency control mechanism is strict two-phase object locking. In the 1980s, an interesting alternative was developed: commutativity-based semantic locking. In theory, it can outperform traditional locking schemes in certain scenarios with appropriate commutativity potential. In this paper, we study the real-world performance of different locking strategies in a particular industrial application from the telecommunications sector. We compare object-based locking and commutativity-based semantic locking. We found that, in this application, semantic locking performs equally to, but no better than, object locking in reasonable mixes of real-world transactions, and that it only outperforms in a deliberately contrived mix.",
"method": "We compare object-based locking and commutativity-based semantic locking."
},
{
"abstract": "Similarity search for 3D structure data sets is fundamental to many database applications such as molecular biology, image registration, and computer-aided design. Identifying the common 3D subtructures between two objects is an important research problem. However, it is well known that computing structural similarity is very expensive due to the high exponential time complexity of structure similarity measures. As the structure databases keep growing rapidly, real-time search from large-structure databases becomes problematic. In this paper, we present a novel statistical model, that is, the multiresolution Localized Co-Occurrence Model (LCM), to approximately measure the similarity between the two point-based 3D structures in linear time complexity for fast retrieval. LCM could capture both distribution characteristics and spatial structure of 3D data by localizing the point co-occurrence relationship within a predefined neighborhood system. As a step further, a novel structure query processing method called the incremental and Bounded search (iBound) is also proposed to speed up the search process. IBound avoids a large amount of expensive computation at higher resolution LCMs. By superposing two LCMs, their largest common substructure can also be found quickly. Finally, our experiment results prove the effectiveness and efficiency of our methods.",
"method": "LCM could capture both distribution characteristics and spatial structure of 3D data by localizing the point co-occurrence relationship within a predefined neighborhood system. As a step further, a novel structure query processing method called the incremental and Bounded search (iBound) is also proposed to speed up the search process. IBound avoids a large amount of expensive computation at higher resolution LCMs. By superposing two LCMs, their largest common substructure can also be found quickly."
},
{
"abstract": "Automated Web service discovery requires Web service capability specifications of a high precision. Semantic-based approaches are inherently more precise than conventional keyword-based approaches. This paper proposes to build capability specifications of Web services based on an environment ontology, the main concepts of which are the environment entities in a particular application domain and their interactions. For each environment entity, there is a tree-like hierarchical state machine modeling the effects that are to be achieved by the Web services on this environment entity. The proposed approach is based on the assumption that the Web service capability specifications, built on the effects of the Web services on the environment entities, are more accessible and observable. Algorithms for constructing the domain environment ontology and the matchmaking between the Web service capability specifications are presented to show how Web service discovery is supported. An example on travel service is given to illustrate this proposed approach.",
"method": "For each environment entity, there is a tree-like hierarchical state machine modeling the effects that are to be achieved by the Web services on this environment entity. The proposed approach is based on the assumption that the Web service capability specifications, built on the effects of the Web services on the environment entities, are more accessible and observable. Algorithms for constructing the domain environment ontology and the matchmaking between the Web service capability specifications are presented to show how Web service discovery is supported. An example on travel service is given to illustrate this proposed approach."
},
{
"abstract": "The inner product measures how closely two feature vectors are related. It is an important primitive for many popular data mining tasks, for example, clustering, classification, correlation computation, and decision tree construction. If the entire data set is available at a single site, then computing the inner product matrix and identifying the top (in terms of magnitude) entries is trivial. However, in many real-world scenarios, data is distributed across many locations and transmitting the data to a central server would be quite communication intensive and not scalable. This paper presents an approximate local algorithm for identifying top-l, inner products among pairs of feature vectors in a large asynchronous distributed environment such as a peer-to-peer (P2P) network. We develop a probabilistic algorithm for this purpose using order statistics and the Hoeffding bound. We present experimental results to show the effectiveness and scalability of the algorithm. Finally, we demonstrate an application of this technique for interest-based community formation in a P2P environment.",
"method": "We develop a probabilistic algorithm for this purpose using order statistics and the Hoeffding bound."
},
{
"abstract": "Electrochemical discharge machining (ECDM) is demonstrated to be a potential process for 3D microstructuring of Pyrex glass. However, the key to widening ECDM micromilling applications lies in how to improve the machining accuracy. To improve the machining quality of the ECDM micromilling process, microgroove machining experiments were conducted in this study. Three factors affecting ECDM micromilling performance�䕑ulse voltage, tool rotational rate and travel rate of tool�癳ere taken up as machining parameters to investigate their influences on machining performance. The results indicate that optimum combinations of both pulse voltage and tool rotational rate will realize better machining accuracy. The feasibility of three-dimensional microstructure machining was demonstrated by layer-by-layer ECDM micromilling machining. Complex structures were made to demonstrate the great potential for the 3D microstructuring of Pyrex glass of the ECDM micromilling process.",
"method": "Three factors affecting ECDM micromilling performance�䕑ulse voltage, tool rotational rate and travel rate of tool�癳ere taken up as machining parameters to investigate their influences on machining performance."
},
{
"abstract": "Passive mixers rely on the channel geometry to mix fluids. However, many previously reported designs either work efficiently only at moderate to high Reynolds numbers (Re), or require a complex 3D channel geometry that is often difficult to fabricate. In this paper, we report design, simulation, fabrication and characterization of a planar passive microfluidic mixer capable of mixing at low Reynolds numbers. The design incorporates diamond-shaped obstructions within the microchannel to break-up and recombine the flow. Simulation and experimental results of the developed micromixer show excellent mixing performance over a wide range of flow conditions (numerically: 0.01 < Re < 100, experimentally: 0.02 < Re < 10). The micromixer is also characterized by low pressure drop, an important characteristic for integration into complex, cascading microfluidic systems. Due to the simple planar structure of the micromixer, it can be easily realized and integrated with on-chip microfluidic systems, such as micro total analysis systems (弮TAS) or lab on a chip (LOC).",
"method": "The design incorporates diamond-shaped obstructions within the microchannel to break-up and recombine the flow."
},
{
"abstract": "Self-assembling perforated microplates modeled and fabricated on silicon wafers by means of surface micromachining are presented. The structures consist of a single Cr/Au metal layer and are set into position by the residual tensile in-plane stress of the material; the geometry is designed to obtain a lifted microplate coplanar to the surface of the wafer. The structures are modeled both analytically and by finite element simulation to correlate the displacement with the strain of the structural material. Samples are fabricated using IC technology on standard 4-inch silicon wafers by surface micromachining; a photoresist is used as a sacrificial layer and electroplated gold is used as a structural layer on a chromium-gold PVD seedlayer. The fabricated structures exhibit a vertical displacement of 38 繕m. The resulting estimated strain is 0.001 66, which corresponds to a tensile stress of 173 MPa and is consistent with thermal residual strain.",
"method": "The structures consist of a single Cr/Au metal layer and are set into position by the residual tensile in-plane stress of the material; the geometry is designed to obtain a lifted microplate coplanar to the surface of the wafer. The structures are modeled both analytically and by finite element simulation to correlate the displacement with the strain of the structural material. Samples are fabricated using IC technology on standard 4-inch silicon wafers by surface micromachining; a photoresist is used as a sacrificial layer and electroplated gold is used as a structural layer on a chromium-gold PVD seedlayer."
},
{
"abstract": "Multifaceted porous materials were prepared through careful design of star polymer functionality and properties. Functionalized core crosslinked star (CCS) polymers with a low glass transition temperature (Tg) based on poly(methyl acrylate) were prepared having a multitude of hydroxyl groups at the chain ends. Modification of these chain ends with 9-anthracene carbonyl chloride introduces the ability to reversibly photocrosslink these systems after the star polymers were self-assembled by the breath figure technique to create porous, micro-structured films. The properties of the low Tg CCS polymer allow for the formation of porous films on non-planar substrates without cracking and photo-crosslinking allows the creation of stabilized honeycomb films while also permitting a secondary level of patterning on the film, using photo-lithographic techniques. These multifaceted porous polymer films represent a new generation of well-defined, 3D microstructures.",
"method": "Functionalized core crosslinked star (CCS) polymers with a low glass transition temperature (Tg) based on poly(methyl acrylate) were prepared having a multitude of hydroxyl groups at the chain ends. Modification of these chain ends with 9-anthracene carbonyl chloride introduces the ability to reversibly photocrosslink these systems after the star polymers were self-assembled by the breath figure technique to create porous, micro-structured films."
},
{
"abstract": "We simulate the assembly dynamics of icosahedral capsids from subunits that interconvert between different conformations (or quasi-equivalent states). The simulations identify mechanisms by which subunits form empty capsids with only one morphology but adaptively assemble into different icosahedral morphologies around nanoparticle cargoes with varying sizes, as seen in recent experiments with brome mosaic virus (BMV) capsid proteins. Adaptive cargo encapsidation requires moderate cargo-subunit interaction strengths; stronger interactions frustrate assembly by stabilizing intermediates with incommensurate curvature. We compare simulation results to experiments with cowpea chlorotic mottle virus empty capsids and BMV capsids assembled on functionalized nanoparticles and suggest new cargo encapsidation experiments. Finally, we find that both empty and templated capsids maintain the precise spatial ordering of subunit conformations seen in the crystal structure /b>even if interactions that preserve this arrangement are favored by as little as the thermal energy, consistent with experimental observations that different subunit conformations are highly similar.",
"method": "The simulations identify mechanisms by which subunits form empty capsids with only one morphology but adaptively assemble into different icosahedral morphologies around nanoparticle cargoes with varying sizes, as seen in recent experiments with brome mosaic virus (BMV) capsid proteins. Adaptive cargo encapsidation requires moderate cargo-subunit interaction strengths; stronger interactions frustrate assembly by stabilizing intermediates with incommensurate curvature. We compare simulation results to experiments with cowpea chlorotic mottle virus empty capsids and BMV capsids assembled on functionalized nanoparticles and suggest new cargo encapsidation experiments."
},
{
"abstract": "We report the results from a computational study of the self-assembly of amphiphilic ditethered nanospheres using molecular simulation. As a function of the interaction strength and directionality of the tether-tether interactions, we predict the formation of four highly ordered phases not previously reported for nanoparticle systems. We find a double diamond structure comprised of a zinc blende (binary diamond) arrangement of spherical micelles with a complementary diamond network of nanoparticles (ZnS/D), a phase of alternating spherical micelles in a NaCl structure with a complementary simple cubic network of nanoparticles to form an overall crystal structure identical to that of AlCu2Mn (NaCl/SC), an alternating tetragonal ordered cylinder phase with a tetragonal mesh of nanoparticles described by the [8,8,4] Archimedean tiling (TC/T), and an alternating diamond phase in which both diamond networks are formed by the tethers (AD) within a nanoparticle matrix. We compare these structures with those observed in linear and star triblock copolymer systems.",
"method": "As a function of the interaction strength and directionality of the tether-tether interactions, we predict the formation of four highly ordered phases not previously reported for nanoparticle systems."
},
{
"abstract": "A technique to measure a terahertz wave generated by spectrum tailored Fabry�𡦖矇rot lasers (FP) is assessed. A dc-biased and 25 簞C temperature controlled FP is probed by a continuous wave signal, tuned at 20 nm away from its lasing modes. With a 0.02 nm resolution optical spectrum analyzer (OSA), the terahertz generated signal frequency is measured from the interval between the probe and its side-band modulations. The terahertz waves emitted by these FPs are measured at 370簣5 GHz and at 1.157簣0.005 THz, respectively, within a precision set by our OSA. The origin of the terahertz wave is due to passive mode-locked through intracavity four-wave-mixing processes.",
"method": "A dc-biased and 25 簞C temperature controlled FP is probed by a continuous wave signal, tuned at 20 nm away from its lasing modes. With a 0.02 nm resolution optical spectrum analyzer (OSA), the terahertz generated signal frequency is measured from the interval between the probe and its side-band modulations."
},
{
"abstract": "This letter demonstrates the ability to induce laterally grown, large-aspect crystals via pulsed, melt-mediated laser crystallization in NiTi thin films. Sputter-deposited 200 nm NiTi films were pulse irradiated utilizing a homogenized 308 nm excimer beam over a series of varying incident laser energy densities. Solidification occurred via two distinct pathways: nucleation and growth occurred away from the boundary of irradiation, while lateral growth of unmelted seeds into the undercooled melt developed at the boundary of irradiation. The potential for exploiting this technique to produce rolling direction texture for anisotropic properties is also discussed.",
"method": "Sputter-deposited 200 nm NiTi films were pulse irradiated utilizing a homogenized 308 nm excimer beam over a series of varying incident laser energy densities. Solidification occurred via two distinct pathways: nucleation and growth occurred away from the boundary of irradiation, while lateral growth of unmelted seeds into the undercooled melt developed at the boundary of irradiation."
},
{
"abstract": "Single crystal Ni/Co(111) superlattices have been grown by molecular beam epitaxy. The Ni thickness is 3 ML whereas the Co thickness varies from 0.2 to 4 ML. The superlattices were studied using magnetometry and ferromagnetic resonance spectroscopy and they all exhibit strong perpendicular to the plane magnetic anisotropy. The maximum magnetocrystalline anisotropy is obtained for one cobalt monolayer. Kerr microscopy measurements show the variation of domain pattern as the Co layer thickness changes.",
"method": "Single crystal Ni/Co(111) superlattices have been grown by molecular beam epitaxy. The superlattices were studied using magnetometry and ferromagnetic resonance spectroscopy and they all exhibit strong perpendicular to the plane magnetic anisotropy."
},
{
"abstract": "Thermoelectric measurements were performed on p-type InAs thin films grown by metalorganic vapor phase epitaxy. The measured Seebeck coefficient displayed an anomalous temperature dependence due to the existence of a highly conductive surface inversion layer. The effect of a degenerate conduction layer has been incorporated into our analysis and revealed that the sign-reversal temperature of the Seebeck coefficient remained unaffected by the surface layer. This finding consequently facilitated the direct determination of the acceptor density of lightly doped thin film InAs.",
"method": "The effect of a degenerate conduction layer has been incorporated into our analysis and revealed that the sign-reversal temperature of the Seebeck coefficient remained unaffected by the surface layer."
},
{
"abstract": "This letter introduces and analyzes a new distributed dynamic subchannel allocation algorithm for multiple access networks. The proposed algorithm is based on general order selection, and exhibits low complexity and low processing delay. The exact and asymptotic closed-form expressions for the average error probability are derived, and it is shown that there is a significant system performance advantage over the conventional uniform allocation approach. Numerical studies also show that the performance of our new algorithm can be close to that of the highly complex optimal search method.",
"method": "The proposed algorithm is based on general order selection, and exhibits low complexity and low processing delay."
},
{
"abstract": "This paper examines the probability of connectivity of ad hoc wireless networks in which nodes are uniformly distributed on the circumference of a circle. We derive the exact probability that the network is composed of at most C clusters. The probability of connectivity is obtained by considering the case of C equal to unity. We also consider the distribution of nodes over a circular disk. The probability of connectivity for this case is found by fitting a log-logistic function using Minimum Mean Square Error (MMSE) criterion.",
"method": "We derive the exact probability that the network is composed of at most C clusters. The probability of connectivity is obtained by considering the case of C equal to unity. We also consider the distribution of nodes over a circular disk. The probability of connectivity for this case is found by fitting a log-logistic function using Minimum Mean Square Error (MMSE) criterion."
},
{
"abstract": "In this paper we consider an antenna system, that consists of one active and one parasitic antenna element. Different antenna patterns may be created by loading the parasitic element with appropriate reactive impedances on each symbol period. We demonstrate the performance of a communication link that uses the proposed antenna system at the transmitter and two omnidirectional antennas at the receiver. The Arimoto-Blahut algorithm is used to find the capacity achieving distribution on the channel symbols. The capacity of the antenna system is compared to the capacity obtained by a single transmitter antenna.",
"method": "Different antenna patterns may be created by loading the parasitic element with appropriate reactive impedances on each symbol period. We demonstrate the performance of a communication link that uses the proposed antenna system at the transmitter and two omnidirectional antennas at the receiver. The Arimoto-Blahut algorithm is used to find the capacity achieving distribution on the channel symbols. The capacity of the antenna system is compared to the capacity obtained by a single transmitter antenna."
},
{
"abstract": "In this paper, we propose a concept of relaying named symetric relaying strategy for two relay network. In our strategy, we have two relays in the network and both relays can completely decode the message transmitted by the other relay. The proposed rate is shown to subsume the previously proposed rate for feed-forward relay network based on decode-and-forward.",
"method": "In our strategy, we have two relays in the network and both relays can completely decode the message transmitted by the other relay."
},
{
"abstract": "A distributed reservation protocol tailored for cellular wireless networks is presented that facilitates contention free inter-cellular slot allocation and reservation. While reserved slots are protected from inter-cell interference by a busy burst enabled reservation protocol, collisions due to simultaneously accessed unreserved slots by neighboring cells are mitigated by means of resource partitioning patterns. Shifting these partitioning patterns over time allows each cell to successively probe all slots. This ensures that full frequency reuse is maintained, in the way that all cells may utilize the entire frequency band. In effect a contention free inter-cellular slot allocation policy is established that in a distributed manner dynamically controls the spatial reuse, in terms of concurrently accessed radio resources by neighboring cells.",
"method": "While reserved slots are protected from inter-cell interference by a busy burst enabled reservation protocol, collisions due to simultaneously accessed unreserved slots by neighboring cells are mitigated by means of resource partitioning patterns. Shifting these partitioning patterns over time allows each cell to successively probe all slots. This ensures that full frequency reuse is maintained, in the way that all cells may utilize the entire frequency band."
},
{
"abstract": "Demodulator statistics are used in a binary direct sequence spread-spectrum receiver to improve the performance of a well-known signal-to-noise ratio (SNR) estimate for ratios of the binary symbol energy to one-sided noise density that are below approximately 7 dB. The new estimate requires no pilot symbols, training sequences, data symbol decisions, or channel measurements, and it can be obtained prior to decoding.",
"method": "Demodulator statistics are used in a binary direct sequence spread-spectrum receiver to improve the performance of a well-known signal-to-noise ratio (SNR) estimate for ratios of the binary symbol energy to one-sided noise density that are below approximately 7 dB."
},
{
"abstract": "Loose coupling between 3G and WLAN ensures flexibility and openness. However, providing an ubiquitousmobile voice service in a loosely coupled 3G/WLAN network requires both packet-level and call-level quality of service (QoS) guarantees using soft vertical handoff (SVHO) and call admission control (CAC). In this paper, we evaluate the impact of both SVHO and WLAN mobility on call blocking and dropping probabilities rederived for the integrated network. For this purpose, we propose a new multi-region mobility model that accurately estimate these probabilities under a resource-efficient dynamicthreshold SVHO compared to a standard static-threshold SVHO. Results show us that the resource-efficient SVHO blocks and drops much less voice calls than the static one when very low mean and high variability of multi-mode mobile station velocities are noticed. Therefore, resource-efficient SVHO implementations are highly recommended in these mobility environments.",
"method": "For this purpose, we propose a new multi-region mobility model that accurately estimate these probabilities under a resource-efficient dynamicthreshold SVHO compared to a standard static-threshold SVHO."
},
{
"abstract": "We investigate the performance of linear receivers in a cooperative system which consists of a source, a decodeand-forward (DF) relay and a destination that are all multiantenna nodes. The relay uses zero-forcing (ZF) equalization whereas the destination employs maximum ratio combining (MRC) as well as ZF techniques. Considering that perfect channel state information is available at the relay and destination, and the fading is Rayleigh, we derive a closed-form approximate expression for the outage probability of the post-receiver signal-to-noise ratio (SNR) of each data stream at the destination and analyze the diversity order. The validity of the outage probability expression is confirmed with the numerical results.",
"method": "The relay uses zero-forcing (ZF) equalization whereas the destination employs maximum ratio combining (MRC) as well as ZF techniques. Considering that perfect channel state information is available at the relay and destination, and the fading is Rayleigh, we derive a closed-form approximate expression for the outage probability of the post-receiver signal-to-noise ratio (SNR) of each data stream at the destination and analyze the diversity order."
},
{
"abstract": "DC and high-frequency device characteristics of In0.7Ga0.3As and InSb quantum-well field-effect transistors (QWFETs) are measured and benchmarked against state-of-the-art strained silicon (Si) nMOSFET devices, all measured on the same test bench. Saturation current (Ion) gain of 20% is observed in the In0.7Ga0.3As QWFET over the strained Si nMOSFET at (Vg ��� Vt) = 0.3 V, Vds = 0.5 V, and matched Ioff, despite higher external resistance and large gate-to-channel thickness. To understand the gain in Ion, the effective carrier velocities (彖eff) near the source-end are extracted and it is observed that at constant (Vg ��� Vt) = 0.3 V and Vds = 0.5 V, the 彖eff of In0.7Ga0.3As and InSb QWFETs are 4��5�� higher than that of strained silicon (Si) nMOSFETs due to the lower effective carrier mass in the QWFETs. The product of 彖eff and charge density (ns), which is a measure of �𦤹ntrinsic�� device characteristics, for the QWFETs is 50%��70% higher than strained Si at low-voltage operation despite lower ns in QWFETs. Calibrated simulations of In0.7Ga0.3As QWFETs with reduced gate-to-channel thickness and external resistance matched to the strained Si nMOSFET suggest that the higher 彖eff will result in more than 80% Ion increase over strained Si nMOSFETs at Vds = 0.5 V, (Vg ��� Vt) = 0.3 V, and matched Ioff, thus showing promise for future high-speed and low-power logic applications.",
"method": "DC and high-frequency device characteristics of In0.7Ga0.3As and InSb quantum-well field-effect transistors (QWFETs) are measured and benchmarked against state-of-the-art strained silicon (Si) nMOSFET devices, all measured on the same test bench. To understand the gain in Ion, the effective carrier velocities (彖eff) near the source-end are extracted and it is observed that at constant (Vg ��� Vt) = 0.3 V and Vds = 0.5 V, the 彖eff of In0.7Ga0.3As and InSb QWFETs are 4��5�� higher than that of strained silicon (Si) nMOSFETs due to the lower effective carrier mass in the QWFETs."
},
{
"abstract": "This letter presents a novel approach to detect hot spots (HSs) in active integrated circuits (ICs) and devices. It is based on sensing the HS heat flux within the chip substrate with a probe-laser beam. As the beam passes through the die, it experiences a deflection directly proportional to the heat flux found along its trajectory (internal infrared laser deflection technique). The proposed strategy allows inspecting the chip through its lateral sides (lateral access), avoiding the metal and passivation layers placed over the die. The obtained results demonstrate the suitability of this technique to locate and characterize devices behaving as hot spots in nowadays IC CMOS technologies.",
"method": "It is based on sensing the HS heat flux within the chip substrate with a probe-laser beam. As the beam passes through the die, it experiences a deflection directly proportional to the heat flux found along its trajectory (internal infrared laser deflection technique). The proposed strategy allows inspecting the chip through its lateral sides (lateral access), avoiding the metal and passivation layers placed over the die."
},
{
"abstract": "In this letter, we present a compact model of NAND Flash memory strings for circuit simulation purposes. This model is modular and easy to be implemented, and its parameters can be extracted through a simple procedure. It allows accurate simulation of NAND Flash memories with a limited computational effort, taking into account capacitive coupling effects which will become extremely important in future technology generations. This model is a very valuable tool for IC designers to optimize NVM circuits, particularly in multilevel applications.",
"method": "This model is modular and easy to be implemented, and its parameters can be extracted through a simple procedure."
},
{
"abstract": "In this letter, successful operation at 10 GHz of T-gate HEMTs on epitaxial structures grown by metal�㺸rganic chemical vapor deposition (MOCVD) or MBE on composite substrates is demonstrated. The used device fabrication processis very similar to the process used on monocrystalline SiC substrate. High power density was measured on both epimaterials at 10 GHz. The best value is an output power density of 5.06 W/mm associated to a power-added efficiency (PAE) of 34.7% and a linear gain of 11.8 dB at VDS = 30 V for the components based on MOCVD-grown material. The output power density is 3.58 W/mm with a maximum PAE of 25% and a linear gain around 15 dB at VDS = 40 V for the MBE-grown material.",
"method": "The used device fabrication processis very similar to the process used on monocrystalline SiC substrate. High power density was measured on both epimaterials at 10 GHz."
},
{
"abstract": "In this letter, we investigate bipolar resistive switching of CuTCNQ-based memory cells in which various types of oxides are incorporated as dedicated switching layer (SL) in a bottom electrode\\oxide\\CuTCNQ\\top electrode configuration. The bottom electrode was Pt as well as n+Si. As oxide SL, we used Al2O3, HfO2, ZrO2, and SiO2. Au was employed as the top electrode. The basic memory characteristics appear to be independent of the type of oxide used. This gives clear indication that the materials investigated as SL mainly act as matrix in which conductive channels are formed and dissolved.",
"method": "The bottom electrode was Pt as well as n+Si. As oxide SL, we used Al2O3, HfO2, ZrO2, and SiO2. Au was employed as the top electrode."
},
{
"abstract": "The electrical behavior of organic metal�𧗽nsulator�𦽳emiconductor (MIS) structures incorporating a layer of selfassembled metallic nanoparticles is described. These have been based on thermally evaporated pentacene (semiconductor) and spin-coated polymethylmethacrylate (insulator). The MIS devices containing the nanoparticles exhibited significant hysteresis in their capacitance-versus-voltage and conductance-versus-voltage characteristics, which was attributed to the charging and discharging of the nanoparticles. The memory structure reported here offers a useful advance in the development of flexible organic memory structures.",
"method": "These have been based on thermally evaporated pentacene (semiconductor) and spin-coated polymethylmethacrylate (insulator)."
},
{
"abstract": "A novel architecture to realize the conversion of rectangular to polar coordinates is presented in this paper. The proposed technique for phase calculation uses a logarithmic number system and does not require any multiplications, but only a few small tables and a few multi-operand additions. The modulus is computed by a constant multiplier, a lookup table, and a full multiplier. A test chip has been designed and fabricated in 0.25 弮m CMOS. The realized circuit uses a novel high-speed modified double-pass transistor (DPL) full-adder cell to improve performance. The test chip includes two processors. The first one computes only the phase and reaches 482 MHz maximum clock frequency, with 0.37 mW/MHz power dissipation. The second processor computes the phase and modulus and works up to 430 MHz, with 0.64 mW/MHz. The experimental results compare favorably with previously reported architectures.",
"method": "The proposed technique for phase calculation uses a logarithmic number system and does not require any multiplications, but only a few small tables and a few multi-operand additions. The modulus is computed by a constant multiplier, a lookup table, and a full multiplier. A test chip has been designed and fabricated in 0.25 弮m CMOS. The realized circuit uses a novel high-speed modified double-pass transistor (DPL) full-adder cell to improve performance. The test chip includes two processors. The first one computes only the phase and reaches 482 MHz maximum clock frequency, with 0.37 mW/MHz power dissipation. The second processor computes the phase and modulus and works up to 430 MHz, with 0.64 mW/MHz."
},
{
"abstract": "This paper presents a cancellation scheme of second order intermodulation distortion based on adaptive digital calibration of the RF downconversion mixer. The system utilizes a low-complexity LMS-based equalizer, which correlates differential mode distortion with common mode distortion to estimate optimum settings of the analog IP2 calibration circuit. A tunable IQ mixer prototype, fabricated in a 0.13 弮m RF CMOS technology and operating under low voltage supply of 1.5 V, is presented. Experimental results confirm the feasibility of the proposed IP2 calibration method.",
"method": "The system utilizes a low-complexity LMS-based equalizer, which correlates differential mode distortion with common mode distortion to estimate optimum settings of the analog IP2 calibration circuit. A tunable IQ mixer prototype, fabricated in a 0.13 弮m RF CMOS technology and operating under low voltage supply of 1.5 V, is presented."
},
{
"abstract": "Conventional memory address decoders based on static CMOS gates incur high clock loading and unnecessary power dissipation in unselected banks. This paper presents a dynamic word line decoder which is fast, has reduced active and leakage power dissipation, and also enables faster race-free sense timing. In a multi-bank memory array with sixteen decoders, the energy�𡞫elay product of the dynamic decoder is 66% lower than a low-power static version. The design leverages the predictability of dynamic circuits to provide significant decoder leakage reduction in unselected banks. The dynamic decoder has been fabricated on a 90 nm bulk CMOS process. The measured test chip address to word line delay is 170 ps at 1.5 V and the measured leakage reduction is over 20x at VDD greater than 0.8 V.",
"method": "In a multi-bank memory array with sixteen decoders, the energy�𡞫elay product of the dynamic decoder is 66% lower than a low-power static version. The design leverages the predictability of dynamic circuits to provide significant decoder leakage reduction in unselected banks. The dynamic decoder has been fabricated on a 90 nm bulk CMOS process."
},
{
"abstract": "A tunable, high-Q RF filter suitable for wireless transmitters has been implemented in a standard digital 0.18-弮m CMOS technology. Active circuits are used to enhance the Q of two independent LC resonators, which are cascaded to form a wide bandwidth filter that can be tuned in both center frequency and bandwidth. A 5.145-GHz stagger-tuned filter with a 200-MHz bandwidth and 0.8 dB of ripple is demonstrated in an 802.11a sliding-IF transmitter. The transmitter provides spectral mask and EVM-compliant output power of ��8.26 dBm for a 64-QAM OFDM signal. At lower output power, an EVM of�� 32.3 dB is achieved.",
"method": "Active circuits are used to enhance the Q of two independent LC resonators, which are cascaded to form a wide bandwidth filter that can be tuned in both center frequency and bandwidth. A 5.145-GHz stagger-tuned filter with a 200-MHz bandwidth and 0.8 dB of ripple is demonstrated in an 802.11a sliding-IF transmitter. The transmitter provides spectral mask and EVM-compliant output power of ��8.26 dBm for a 64-QAM OFDM signal."
},
{
"abstract": "Design and implementation of a millimeter-wave dual-band frequency synthesizer, operating in the 24 GHz and 77 GHz bands, are presented. All circuits except the voltage controlled oscillators are shared between the two bands. A multi-functional injection-locked circuit is used after the oscillators to simplify the reconfiguration of the division ratio inside the phase-locked loop. The 1 mm��0.8 mm synthesizer chip is fabricated in a 0.18弮m silicon-germanium BiCMOS technology, featuring 0.15弮m emitter-width heterojunction bipolar transistors. Measurements of the prototype demonstrate a locking range of 23.8��26.95 GHz/75.67��78.5 GHz in the 24/77 GHz modes, with a low power consumption of 50/75 mW from a 2.5 V supply. The closed-loop phase noise at 1 MHz offset from the carrier is less than ��100 dBc/Hz in both bands. The frequency synthesizer is suitable for integration in direct-conversion transceivers for K/W-band automotive radars and heterodyne receivers for 94 GHz imaging applications.",
"method": "All circuits except the voltage controlled oscillators are shared between the two bands. A multi-functional injection-locked circuit is used after the oscillators to simplify the reconfiguration of the division ratio inside the phase-locked loop. The 1 mm��0.8 mm synthesizer chip is fabricated in a 0.18弮m silicon-germanium BiCMOS technology, featuring 0.15弮m emitter-width heterojunction bipolar transistors."
},
{
"abstract": "A highly integrated 1.7��2.0 GHz digitally programmable frequency synthesizer using a MEMS resonator as its reference is presented. Due to the dimensions of the MEMS device (e.g., 25 弮m by 114 弮m), the entire system with a total area of 6.25 mm^2 can be housed in a small standard chip package. This considerably reduces the form factor and cost of the system, compared to using an external crystal as a reference. The MEMS resonators are clamped-clamped beams fabricated using a CMOS-compatible process. The main structural layer is made of silicon carbide, which provides the resonators with higher power handling capabilities and higher operating frequencies, compared to silicon. The resonators are electrostatically and thermally tunable �� an 8.4% frequency tuning is demonstrated for a 9 MHz resonator. The 100 nm vertical transducer gaps of the resonators allow the use of electrostatic actuation voltages as low as 2 V. An integrated high gain-bandwidth trans-impedance amplifier (TIA) is combined with a resonator to generate the synthesizer�䏭 input reference signal. The TIA employs automatic gain control to mitigate the inherent low power handling capabilities and the non-linearities of the MEMS device, thus minimizing their effect on phase noise. The fractional-N synthesizer employs a 3rd-order 20-bit delta-sigma modulator to deliver a theoretical output resolution of ~ 11 Hz, in order to allow for high output frequency stability when used with an appropriate feedback loop. A fully integrated on-chip dual path loop filter is used to maintain a high level of system integration. With a supply voltage of 2 V, the phase noise for a 1.8 GHz output frequency and a ~ 12 MHz reference signal is ��122 dBc/ Hz at a 600 kHz offset, and ��137 dBc Hz at a 3 MHz offset.",
"method": "Due to the dimensions of the MEMS device (e.g., 25 弮m by 114 弮m), the entire system with a total area of 6.25 mm^2 can be housed in a small standard chip package. This considerably reduces the form factor and cost of the system, compared to using an external crystal as a reference. The MEMS resonators are clamped-clamped beams fabricated using a CMOS-compatible process. The main structural layer is made of silicon carbide, which provides the resonators with higher power handling capabilities and higher operating frequencies, compared to silicon. The resonators are electrostatically and thermally tunable �� an 8.4% frequency tuning is demonstrated for a 9 MHz resonator. The 100 nm vertical transducer gaps of the resonators allow the use of electrostatic actuation voltages as low as 2 V. An integrated high gain-bandwidth trans-impedance amplifier (TIA) is combined with a resonator to generate the synthesizer�䏭 input reference signal. The TIA employs automatic gain control to mitigate the inherent low power handling capabilities and the non-linearities of the MEMS device, thus minimizing their effect on phase noise. The fractional-N synthesizer employs a 3rd-order 20-bit delta-sigma modulator to deliver a theoretical output resolution of ~ 11 Hz, in order to allow for high output frequency stability when used with an appropriate feedback loop. A fully integrated on-chip dual path loop filter is used to maintain a high level of system integration."
},
{
"abstract": "The distribution and alignment of high-frequency clocks across a wide bus of links is a significant challenge in modern computing systems. A low power clock source is demonstrated by incorporating a buffer into a cross-coupled oscillator. Because the load is isolated from the tank, the oscillator can directly drive 50-Ohm impedances or large capacitive loads with no additional buffering. Using this topology, a quadrature VCO (QVCO) is implemented in 0.13 弮m digital CMOS. The QVCO oscillates at 20 GHz, consumes 20 mW and provides 12% tuning range. The measured phase noise is ��101 dBc / Hz @ 1 MHz frequency offset. A clock alignment technique based upon injection- locked quadrature-LC or ring oscillators is then proposed. Although injection-locked oscillators (ILOs) are known to be capable of deskewing and jitter filtering clocks, a study of both LC and ring ILOs indicates significant variation in their jitter tracking bandwidth when used to provide large phase shifts. By selectively injecting different phases of a quadrature-LC or ring VCO, this problem is obviated resulting in reduced phase noise. The technique is demonstrated using a LC QVCO at 20 GHz while burning only 20mW of power and providing an 8 dB improvement in phase noise. A ring oscillator deskews a 2 to 7 GHz clock while consuming 14 mW in 90 nm CMOS.",
"method": "Because the load is isolated from the tank, the oscillator can directly drive 50-Ohm impedances or large capacitive loads with no additional buffering. Using this topology, a quadrature VCO (QVCO) is implemented in 0.13 弮m digital CMOS. The QVCO oscillates at 20 GHz, consumes 20 mW and provides 12% tuning range. The measured phase noise is ��101 dBc / Hz @ 1 MHz frequency offset. A clock alignment technique based upon injection- locked quadrature-LC or ring oscillators is then proposed. The technique is demonstrated using a LC QVCO at 20 GHz while burning only 20mW of power and providing an 8 dB improvement in phase noise."
},
{
"abstract": "A supply-regulated phase-locked loop (PLL) employs a split-tuned architecture to decouple the tradeoff between supplynoise rejection performance and power consumption. By placing the regulator in the low-bandwidth coarse loop, the proposed PLL architecture allows us to maximize its bandwidth to suppress the oscillator phase noise with neither the power supply-noise rejection nor the power dissipation of the regulator being affected. A replicabased regulator introduces a low-frequency pole in its supply-noise transfer function and avoids degradation of supply-noise rejection beyond the regulator-loop�䏭 dominant pole frequency. The prototype PLL fabricated in a 0.18 弮m digital CMOS process operates from 0.5 to 2.5 GHz. At 1.5 GHz, the proposed PLL achieves 1.9 ps long-term rms jitter and a worst case supply-noise sensitivity of ��28 dB (0.5 rad/V), an improvement of 20 dB over conventional solutions, while consuming 2.2 mA from a 1.8 V supply.",
"method": "By placing the regulator in the low-bandwidth coarse loop, the proposed PLL architecture allows us to maximize its bandwidth to suppress the oscillator phase noise with neither the power supply-noise rejection nor the power dissipation of the regulator being affected. A replicabased regulator introduces a low-frequency pole in its supply-noise transfer function and avoids degradation of supply-noise rejection beyond the regulator-loop�䏭 dominant pole frequency. The prototype PLL fabricated in a 0.18 弮m digital CMOS process operates from 0.5 to 2.5 GHz."
},
{
"abstract": "Ternary content-addressable memories (TCAMs) can perform high-speed and deterministic table lookups. However, its main drawback is high power consumption. A significant portion of the TCAM power is consumed by match-line sense amplifiers (MLSAs) for match detection. This paper presents a 20-kilobit TCAM featuring two MLSAs with positive-feedback techniques. The proposed circuits have been fabricated on a test chip in 0.18-弮m CMOS technology. Energy measurement results of the two MLSAs show reductions of 56% and 48%, respectively, over the conventional current-race MLSA.",
"method": "The proposed circuits have been fabricated on a test chip in 0.18-弮m CMOS technology."
},
{
"abstract": "Noise analysis for comparator-based circuits is presented. The goal is to gain insight into the different sources of noise in these circuits for design purposes. After the general analysis techniques are established, they are applied to different noise sources in the comparator-based switched-capacitor pipeline analog-to-digital converter (ADC). The results show that the noise from the virtual ground threshold detection comparator dominates the overall ADC noise performance. The noise from the charging current can also be significant, depending on the size of the capacitors used, but the contribution was small in the prototype. The other noise sources have contributions comparable to those in op-amp-based designs, and their effects can be managed through appropriate design. In the prototype, folded flicker noise was found to be a significant contributor to the broadband noise because the flicker noise of the comparator extends beyond the Nyquist rate of the converter.",
"method": "After the general analysis techniques are established, they are applied to different noise sources in the comparator-based switched-capacitor pipeline analog-to-digital converter (ADC)."
},
{
"abstract": "This paper presents a bioinspired integrated tactile coprocessor that is able to generate a warning in the case of slippage via the data provided by a tactile sensor. Some implementations use different layers of piezoresistive and piezoelectric materials to build upon the raw sensor and obtain the static (pressure) as well as the dynamic (slippage) information. In this paper, a simple raw sensor is used, and a circuitry is implemented, which is able to extract the dynamic information from a single piezoresistive layer. The circuitry was inspired by structures found in human skin and retina, as they are biological systems made up of a dense network of receptors. It is largely based on an artificial retina, which is able to detect motion by using relatively simple spatial temporal dynamics. The circuitry was adapted to respond in the bandwidth of microvibrations produced by early slippage, resembling human skin. Experimental measurements from a chip implemented in a 0.35-弮m four-metal two-poly standard CMOS process are presented to show both the performance of the building blocks included in each processing node and the operation of the whole system as a detector of early slippage.",
"method": "In this paper, a simple raw sensor is used, and a circuitry is implemented, which is able to extract the dynamic information from a single piezoresistive layer. The circuitry was inspired by structures found in human skin and retina, as they are biological systems made up of a dense network of receptors. It is largely based on an artificial retina, which is able to detect motion by using relatively simple spatial temporal dynamics. The circuitry was adapted to respond in the bandwidth of microvibrations produced by early slippage, resembling human skin. Experimental measurements from a chip implemented in a 0.35-弮m four-metal two-poly standard CMOS process are presented to show both the performance of the building blocks included in each processing node and the operation of the whole system as a detector of early slippage."
}
]