Search For:

Displaying 1-5 out of 5 total
Next-Generation Team-Science Platform for Scientific Collaboration
Found in: IEEE Intelligent Systems
By Xiaolong Zheng,Guanyan Ke,Daniel D. Zeng,Sudha Ram,Hao Lu
Issue Date:November 2011
pp. 72-76
Emerging research on team science aims at better understanding the key contextual factors during the trans-disciplinary scientific collaboration process and enhancing the outcomes of large-scale collaborative research programs. Team science can range from ...
Click Fraud and the Adverse Effects of Competition
Found in: IEEE Intelligent Systems
By Xiarong Li,Daniel D. Zeng,Yong Liu,Yanwu Yang
Issue Date:November 2011
pp. 31-39
Modeling click fraud as a competitive strategy illustrates the motivations behind publisher behaviors and shows how it evolves and harms market efficiency.
Coordination of Purchasing and Bidding Activities across Markets
Found in: Hawaii International Conference on System Sciences
By Daniel D. Zeng, James C. Cox, Moshe Dror
Issue Date:January 2004
pp. 70167a
In both consumer purchasing and industrial procurement, combinatorial interdependencies among the items to be purchased are commonplace. E-commerce compounds the problem by providing more opportunities for switching suppliers at low costs, but also potenti...
A Random Walk Model for Item Recommendation in Social Tagging Systems
Found in: ACM Transactions on Management Information Systems (TMIS)
By Ahmed Abbasi, Daniel D. Zeng, Jing Peng, Xiaolong Zheng, Zhu Zhang
Issue Date:August 2013
pp. 1-24
Social tagging, as a novel approach to information organization and discovery, has been widely adopted in many Web 2.0 applications. Tags contributed by users to annotate a variety of Web resources or items provide a new type of information that can be exp...
Storage allocation in web prefetching techniques
Found in: Proceedings of the conference on Electronic commerce (EC '03)
By Daniel D. Zeng, Fei-Yue Wang, Sudha Ram
Issue Date:June 2003
pp. 264-265
We propose a new identity-based signature scheme from Weil pairing or Tate pairing. We prove that the confirmation and denial protocols of our scheme have the completeness and soundness properties. Our scheme is efficient in computation.