Results 1  10
of
787
Verb Semantics And Lexical Selection
, 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract

Cited by 520 (4 self)
 Add to MetaCart
... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new usages; imprecise lexical selection and insufficient system coverage. It seems one approach is to apply probability methods and statistical models for some of these problems. However, the question reminds: has PSR exhausted the potential of the knowledgebased approach? If not, are there any alternatives that can improve the handling of these problems? We suggest an alternative that represents verb semantic knowledge and accounts for not only finetuned systematic semanticsyntactic correspondences, but also semanticinterpretation correspondences. A verb is not represented by a predicate or simple primitives, but by a set of semantic components that are sensitive to the syntactic altern
Implementing Optimal Policy through InflationForecast Targeting
, 2003
"... We examine to what extent variants of inflationforecast targeting can avoid stabilization bias, incorporate historydependence, and achieve determinacy of equilibrium, so as to reproduce a socially optimal equilibrium. We also evaluate these variants in terms of the transparency of the connection w ..."
Abstract

Cited by 257 (76 self)
 Add to MetaCart
We examine to what extent variants of inflationforecast targeting can avoid stabilization bias, incorporate historydependence, and achieve determinacy of equilibrium, so as to reproduce a socially optimal equilibrium. We also evaluate these variants in terms of the transparency of the connection with the ultimate policy goals and the robustness to model perturbations. A suitably designed inflationforecast targeting rule can achieve the social optimum and at the same time have a more transparent connection to policy goals and be more robust than competing instrument rules.
A Minmax Cut Algorithm for Graph Partitioning and Data Clustering
, 2001
"... An important application of graph partitioning is data clustering using a graph model  the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition with an objec ..."
Abstract

Cited by 211 (15 self)
 Add to MetaCart
An important application of graph partitioning is data clustering using a graph model  the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition with an objective function that follows the minmax clustering principle. The relaxed version of the optimization of the minmax cut objective function leads to the Fiedler vector in spectral graph partition. Theoretical analyses of minmax cut indicate that it leads to balanced partitions, and lower bonds are derived. The minmax cut algorithm is tested on newsgroup datasets and is found to outperform other current popular partitioning/clustering methods. The linkagebased re nements in the algorithm further improve the quality of clustering substantially. We also demonstrate that the linearized search order based on linkage differential is better than that based on the Fiedler vector, providing another effective partition method.
Spectral Relaxation for Kmeans Clustering
, 2001
"... The popular Kmeans clustering partitions a data set by minimizing a sumofsquares cost function. A coordinate descend method is then used to find local minima. In this paper we show that the minimization can be reformulated as a trace maximization problem associated with the Gram matrix of the dat ..."
Abstract

Cited by 197 (27 self)
 Add to MetaCart
The popular Kmeans clustering partitions a data set by minimizing a sumofsquares cost function. A coordinate descend method is then used to find local minima. In this paper we show that the minimization can be reformulated as a trace maximization problem associated with the Gram matrix of the data vectors. Furthermore, we show that a relaxed version of the trace maximization problem possesses global optimal solutions which can be obtained by computing a partial eigendecomposition of the Gram matrix, and the cluster assignment for each data vectors can be found by computing a pivoted QR decomposition of the eigenvector matrix. As a byproduct we also derive a lower bound for the minimum of the sumofsquares cost function.
RESEARCH Open Access
"... regulates the trafficking of ASIC1a and acidotoxicity in a BAR domain lipid bindingdependent manner Wenying Jin 1, Chong Shen 1,2, Lan Jing 3,4, Xiangming Zha 3, Jun Xia 1* Background: Acidsensing ion channel 1a (ASIC1a) is the major ASIC subunit determining acidactivated currents in brain neuron ..."
Abstract
 Add to MetaCart
regulates the trafficking of ASIC1a and acidotoxicity in a BAR domain lipid bindingdependent manner Wenying Jin 1, Chong Shen 1,2, Lan Jing 3,4, Xiangming Zha 3, Jun Xia 1* Background: Acidsensing ion channel 1a (ASIC1a) is the major ASIC subunit determining acidactivated currents in brain
RESEARCH Open Access
"... ASIC subunit ratio and differential surface trafficking in the brain Junjun Wu1,2, Yuanyuan Xu1,3, YuQing Jiang1,4, Jiangping Xu3, Youjia Hu2 and Xiangming Zha1* Background: Acidsensing ion channels (ASICs) are key mediators of acidosisinduced responses in neurons. However, little is known about ..."
Abstract
 Add to MetaCart
ASIC subunit ratio and differential surface trafficking in the brain Junjun Wu1,2, Yuanyuan Xu1,3, YuQing Jiang1,4, Jiangping Xu3, Youjia Hu2 and Xiangming Zha1* Background: Acidsensing ion channels (ASICs) are key mediators of acidosisinduced responses in neurons. However, little is known
Bipartite graph partitioning and data clustering
 Proc. Int'l Conf. Information and Knowledge Management (CIKM
, 2001
"... ƒ ƒf „ … †D‡i ˆ ‰ ŠŒ ‹ Ž ˆ'†‘k ’ ‹ ‰ “ ”• ‹ †D–˜—& ’ ‰ Ž: ’ ™ ‹ š=›iœ3X( " F17 67 "! # ž " ƒI „ ¡R¢EŠ} ’ ‰ Ž£ “ ‹ šM¤XŽ£†D ’ ‹ ‰Q¥Mš ¦ ’ §m‰, ‹ ›¨œnu "! # ( = 6M+ ( "  p ..."
Abstract

Cited by 104 (16 self)
 Add to MetaCart
ƒ ƒf „ … †D‡i ˆ ‰ ŠŒ ‹ Ž ˆ'†‘k ’ ‹ ‰ “ ”• ‹ †D–˜—& ’ ‰ Ž: ’ ™ ‹ š=›iœ3X( " F17 67 "! # ž " ƒI „ ¡R¢EŠ} ’ ‰ Ž£ “ ‹ šM¤XŽ£†D ’ ‹ ‰Q¥Mš ¦ ’ §m‰, ‹ ›¨œnu "! # ( = 6M+ ( "  p
Robust and Efficient Robotic Mapping
, 2008
"... Mobile robots are dependent upon a model of the environment for many of their basic functions. Locally accurate maps are critical to collision avoidance, while largescale maps (accurate both metrically and topologically) are necessary for efficient route planning. Solutions to these problems have i ..."
Abstract

Cited by 60 (13 self)
 Add to MetaCart
Mobile robots are dependent upon a model of the environment for many of their basic functions. Locally accurate maps are critical to collision avoidance, while largescale maps (accurate both metrically and topologically) are necessary for efficient route planning. Solutions to these problems have immediate and important applications to autonomous vehicles, precision surveying, and domestic robots. Building accurate maps can be cast as an optimization problem: find the map that is most probable given the set of observations of the environment. However, the problem rapidly becomes difficult when dealing with large maps or large numbers of observations. Sensor noise and nonlinearities make the problem even more difficult— especially when using inexpensive (and therefore preferable) sensors. This thesis describes an optimization algorithm that can rapidly estimate the
Policy Evaluation in Uncertain Economic Environments
 BROOKINGS PAPERS ON ECONOMIC ACTIVITY
, 2003
"... It will be remembered that the seventy translators of the Septuagint were shut up in seventy separate rooms with the Hebrew text and brought out with them, when they emerged, seventy identical translations. Would the same miracle be vouchsafed if seventy multiple correlators were shut up with the sa ..."
Abstract

Cited by 58 (11 self)
 Add to MetaCart
It will be remembered that the seventy translators of the Septuagint were shut up in seventy separate rooms with the Hebrew text and brought out with them, when they emerged, seventy identical translations. Would the same miracle be vouchsafed if seventy multiple correlators were shut up with the same statistical material? And anyhow, I suppose, if each had a different economist perched on his a priori, that would make a difference to the outcome.
Results 1  10
of
787