基本信息
浏览量:85
职业迁徙
个人简介
Education
· Computer Science President's Post Doctoral Fellow - University of California, Santa Barbara.
· Ph.D. University of California, San Diego.
Specialization in Combinatorial Algorithms,
Supervised by Professor Stanley Gill Williamson.
· M.S. University of California, Santa Barbara.
Specialization in Operating Systems,
Supervised by Professor John Bruno.
Research Areas
· Current areas of research center on External Memory Algorithms, Data Graph Mining, Relational Learning and Visualization of Massive Data Sets. Typical examples of data we have dealt with include information networks like The Web, Query co-occurrence, Internet, Wireless Call Detail and Epidemiological data. Our research has been funded mainly by NSF, DHS, USDA and LLNL.
· Previous research focus included Computational Geometry, Combinatorics and Complexity, Algorithm Animation and some applications in Petroleum Engineering and Biology.
Professional Experience
· Industrial
o Senior Research Scientist, Ask.com, 2004 – 2007.
o Senior Member of Technical Staff, AT&T Labs, and Bell Labs, 1995 - 2002.
· Academic
o DIMACS, Rutgers University
Research Professor 2006 – present; Research Associate 2002-present.
o Computer Science Department, Texas A&M University
Research Associate Professor, 1994-1995;
Director of the Laboratory for Algorithms Design, 1990-1994;
Assistant Professor, 1988-1993;
Supervised 1 Ph.D. Dissertation and 7 Master Theses.
o Computer Science and Mathematics Departments - University of California, Santa Barbara and San Diego: Visiting Professor and Lecturer, 1986-1987.
· Administrative
o Leader of the Universal Information Graphs Project at DyDAn (A newly founded multi million DHS center of excellence at Rutgers University). Conceived and designed the project. Developed new algorithms for semi-external data partitioning. Identified, hired and supervised key personal to build the overall hardware and software infrastructure. Participated in the overall DyDAn proposal writing.
o Organizer of the DyDAn Seminar series, 2007.
o Organizer of DIMACS Computational and Mathematics Epidemiology Seminar series, 2006-2007.
o Program Co-Chair (with G. Cormode) of DIMACS Tutorial on Data Mining and Epidemiology, March 23-24, 2006.
o Program Chair of the First DIMACS Workshop on Data Mining and Epidemiology, March 18-19, 2004.
o Conceived, Designed and made operational a software platform for Query Relevance Algorithms Research. Interviewed, hired and supervised the required technical personal, Ask.com, 2004-2006.
o Member of the Editorial Board of the Journal on Discrete Algorithms, Elsevier Publishers, 2002-present.
o Program Chair of the First AT&T Visualization Days, May 30, 2001.
o Program Co-Chair (with J. Vitter) of the First DIMACS Workshop on External Memory Algorithms and Visualization, May 20-22, 1998.
o Co-Editor of the Massive Computing Series, Kluwer Academic Publishers, 1998-present.
o Associate Managing Editor of the Journal on Computing and Information, Canada, 1994-1998.
o Algorithms Group Leader. In charge of recruiting, interviewing, evaluating and recommending faculty candidates. Founder and director of the Laboratory for Algorithms Design, Texas A&M University, 1990-1994.
Software
Conceived, designed and supervised the software projects listed below. Responsibilities included proposal writing, identification of necessary skills for involved personal, hiring, supervision, preparation of periodic progress reports, testing, evaluation, deployment and publication of associated research papers.
· An External Memory Algorithms Platform (on going project). The goal is to provide the basis for a system to "mine" dynamic weighted graphs with several billion edges. This platform has been built as the initial infrastructure for the “Universal Information Graphs project” which is being conducted at DyDAn – the new funded DHS center of excellence at Rutgers University. Four of its major components are: HGV, Graph-Zoom, MGV, and a Quasi-Clique Extractor. Each of these components is described briefly next.
o Hierarchical Graph Views. A C/C++ library to compute nested partitions of semi-external graphs.
It incorporates a variety of recursive graph partitioning and Markov clustering methods
(in cooperation with Roman Dementiev and Ali E. Qursh ).
o Graph-Zoom. A Unix/Windows prototype to navigate large graphs. It is based on a hierarchy of spanning trees. It incorporates a rectangular Fish-Eye view technique to provide focus within context. It uses our own circular layout of graph hierarchies (in cooperation with J. Korn and M. Kreuseler).
o MGV. Uses semi-external memory algorithms to build hierarchical partitions of weighted multi-digraphs. These partitions are mapped to the screen. They provide a virtual geography for the input stream. This virtual geography is used to guide the exploration of the data set. MGV follows the client-server paradigm and it is implemented in C and Java 3D. (In cooperation with J. Korn. US patent 6781599).
o Quasi-Clique Extractor. Extracts subgraphs with density above certain pre-specified threshold (quasi-cliques) and uses these subgraphs as seeds to partition the vertex set(in cooperation with S. Sudarsky). The extractor is implemented in C. Some of this work has been cited in popular writings like: American Scientist (Graph Theory in Practice, Sept-Oct 2006, Jan-Feb 2000) and Siam News (1999).
· X-AGE: An Animated Graph Environment. This is an interactive system for algorithms teaching and research; Texas A&M University, 1991-1994;
· SEDS: A Simple Experimental Distributed System. It provides a single machine, multiple user environment for an experimental distributed function-base; Computer Science Department and Center for Robotics Systems, University of California, Santa Barbara, CA, 1987;
· A Template to Implement Mathematical Software following the Interpretive Frame Approach; Mathematics Department, University of California, San Diego, 1984.
Books
· J. Abello, G. Cormode (eds.), Discrete Methods in Epidemiology, Vol. 70 of DIMACS, AMS, May 2006.
· J. Abello, P. Pardalos, M. Resende (eds.), Handbook of Massive Data Sets , Vol. 3 of the Kluwer Series on Massive Computing, 2002.
· J. Abello, J. Vitter (eds.), External Memory Algorithms, Vol. 50 of the AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1999.
Patents
· J. Abello and J. Korn, “System and Method for Visualizing massive Multi-diagraphs”, US patent 6781599
Honors and Awards
· DIMACS Permanent Member, Rutgers University, 1995;
· First Prize Paper/Poster Award(with M. Veach), ACM National Conference, Phoenix, AZ, March 1994;
· Fellow of the Institute of Combinatorics and its Applications, 1993;
· SIAM Young Investigator Award, ICIAM, Paris, 1988;
· Post Doctoral Visitor: IMA (University of Minnesota) and MSRI(University of California, Berkeley), 1987;
· University of California President's Post-Doctoral Fellow, 1986-1987;
· General Dynamics Scholarship, University of California, San Diego, 1984;
· Outstanding Teaching Award, University of California, Santa Barbara, 1983.
研究兴趣
论文共 64 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation (2017): 1-14
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn