Institution
University of Texas at Arlington
Education•Arlington, Texas, United States•
About: University of Texas at Arlington is a education organization based out in Arlington, Texas, United States. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 11758 authors who have published 28598 publications receiving 801626 citations. The organization is also known as: UT Arlington & University of Texas-Arlington.
Topics: Population, Large Hadron Collider, Wireless sensor network, Artificial neural network, Computer science
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A novel reinforcement learning value iteration algorithm is given to solve the dynamic graphical games in an online manner along with its proof of convergence, and it is proved that this notion holds if all agents are in Nash equilibrium and the graph is strongly connected.
179 citations
••
01 Nov 2004TL;DR: In this article, the stability of a buck converter feeding a downstream dc-dc converter is analyzed for a large-signal-averaged model of the converter, and the complete analysis is carried out considering a buck dc-DC converter operating with a constant power load (CPL).
Abstract: Power-electronics-based zonal direct current (dc) power distribution systems are being considered for sea and undersea vehicles. The stability of the dc power-electronics-based power distribution systems is a significant design consideration because of the potential for negative-impedance-induced instabilities. In this paper, the dynamic properties and control of a buck converter feeding a downstream dc-dc converter are studied. The controller in this system combines an instantaneous current feedback loop using hysteresis with a proportional-integral (PI) algorithm to regulate the output voltage of the converter. Based on a large-signal-averaged model of the converter, the stability-in-large around the operation point is presented. The complete analysis is carried out considering a buck dc-dc converter operating with a constant power load (CPL). Simulations and experimental results are provided to verify the analysis.
179 citations
••
TL;DR: In this article, the authors found that agreeableness was associated with both indirect and direct aggression in adolescents and that the link between aggression and adjustability was strongest for direct strategies.
Abstract: This multi-method research linked the Big Five personality dimensions to aggression in early adolescence. Agreeableness was the personality dimension of focus because this dimension is associated with motives to maintain positive interpersonal relations. In two studies, middle school children were assessed on the Big Five domains of personality. Study 1 showed that agreeableness was associated with both indirect and direct aggression. In addition, the link between agreeableness and aggression was strongest for direct strategies. Study 2 examined the hypotheses that agreeableness predicts social cognitions associated with aggression, peer reports of direct aggression, and teacher reports of adjustment. Agreeableness predicted peer reports of aggression and social cognitions associated with aggression. In addition, aggression mediated the link between agreeableness and adjustment. Results suggest that of the Big Five dimensions, Agreeableness is most closely associated with processes and outcomes related to aggression in adolescents.
179 citations
••
TL;DR: This paper formalizes the location privacy issues in sensor networks under this strong adversary model and computes a lower bound on the communication overhead needed for achieving a given level of location privacy, and proposes two techniques to provide location privacy to monitored objects and data sinks.
Abstract: While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed Such contextual information can be exploited by an adversary to derive sensitive information such as the locations of monitored objects and data sinks in the field Attacks on these components can significantly undermine any network application Existing techniques defend the leakage of location information from a limited adversary who can only observe network traffic in a small region However, a stronger adversary, the global eavesdropper, is realistic and can defeat these existing techniques This paper first formalizes the location privacy issues in sensor networks under this strong adversary model and computes a lower bound on the communication overhead needed for achieving a given level of location privacy The paper then proposes two techniques to provide location privacy to monitored objects (source-location privacy)-periodic collection and source simulation-and two techniques to provide location privacy to data sinks (sink-location privacy)-sink simulation and backbone flooding These techniques provide trade-offs between privacy, communication cost, and latency Through analysis and simulation, we demonstrate that the proposed techniques are efficient and effective for source and sink-location privacy in sensor networks
179 citations
••
24 Aug 2008TL;DR: This work proposes a general framework for stable feature selection which emphasizes both good generalization and stability of feature selection results, and identifies dense feature groups based on kernel density estimation and treats features in each dense group as a coherent entity for feature selection.
Abstract: Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selection for knowledge discovery from high-dimensional data, and identify two causes of instability of feature selection algorithms: selection of a minimum subset without redundant features and small sample size. We propose a general framework for stable feature selection which emphasizes both good generalization and stability of feature selection results. The framework identifies dense feature groups based on kernel density estimation and treats features in each dense group as a coherent entity for feature selection. An efficient algorithm DRAGS (Dense Relevant Attribute Group Selector) is developed under this framework. We also introduce a general measure for assessing the stability of feature selection algorithms. Our empirical study based on microarray data verifies that dense feature groups remain stable under random sample hold out, and the DRAGS algorithm is effective in identifying a set of feature groups which exhibit both high classification accuracy and stability.
179 citations
Authors
Showing all 11918 results
Name | H-index | Papers | Citations |
---|---|---|---|
Zhong Lin Wang | 245 | 2529 | 259003 |
Hyun-Chul Kim | 176 | 4076 | 183227 |
David H. Adams | 155 | 1613 | 117783 |
Andrew White | 149 | 1494 | 113874 |
Kaushik De | 139 | 1625 | 102058 |
Steven F. Maier | 134 | 588 | 60382 |
Andrew Brandt | 132 | 1246 | 94676 |
Amir Farbin | 131 | 1125 | 83388 |
Evangelos Gazis | 131 | 1147 | 84159 |
Lee Sawyer | 130 | 1340 | 88419 |
Fernando Barreiro | 130 | 1082 | 83413 |
Stavros Maltezos | 129 | 943 | 79654 |
Elizabeth Gallas | 129 | 1157 | 85027 |
Francois Vazeille | 129 | 952 | 79800 |
Sotirios Vlachos | 128 | 789 | 77317 |