Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

San Jose State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 421 - 438 of 438

Full-Text Articles in Computer Engineering

Incentive Mechanisms In P2p Media Streaming Systems, Xiao Su, Suchreet Dhaliwal Jan 2010

Incentive Mechanisms In P2p Media Streaming Systems, Xiao Su, Suchreet Dhaliwal

Faculty Publications

This paper highlights the need to curb free-riding in P2P media streaming systems and discusses the mechanisms by which this could be accomplished. Free riding, whereby a peer utilizes network resources, but does not contribute services could have a huge impact on the efficacy of blue streaming systems, leading to scalability issues and service degradation. We discuss why BitTorrent-like tit-for-tat mechanisms cannot be simply tailored and used in streaming. Even though the problem of free riding is more severe in P2P media streaming than in file sharing, the deployed systems still lack incentive schemes. In this paper, we categorize, analyze, …


Mobility Handling In Mac For Wireless Ad Hoc Networks, Anjali Raja, Xiao Su Mar 2009

Mobility Handling In Mac For Wireless Ad Hoc Networks, Anjali Raja, Xiao Su

Faculty Publications

Wireless Sensor Networks (WSNs) are becoming popular in a wide variety of applications. In a WSN, sensor nodes can be static or mobile, depending on applications. Handling mobility in a sensor network can pose interesting challenges in sensor protocol design, and special algorithms are needed to adapt to mobility in the network. In this paper, we survey the current state of art in handling mobility in sensor networks. We first study how mobility affects the design of different layers in the sensor network architecture, and then take a closer look at mobility handling in the MAC layer. We also describe …


Query Recommendations For Interactive Database Exploration, Gloria Chatzopoulou, Magdalini Eirinaki, Neoklis Polyzotis Jan 2009

Query Recommendations For Interactive Database Exploration, Gloria Chatzopoulou, Magdalini Eirinaki, Neoklis Polyzotis

Faculty Publications

Relational database systems are becoming increasingly popular in the scientific community to support the interactive exploration of large volumes of data. In this scenario, users employ a query interface (typically, a web-based client) to issue a series of SQL queries that aim to analyze the data and mine it for interesting information. First-time users, however, may not have the necessary knowledge to know where to start their exploration. Other times, users may simply overlook queries that retrieve important information. To assist users in this context, we draw inspiration from Web recommender systems and propose the use of personalized query recommendations. …


Selfish Wavelength Assignment In Multifiber Optical Networks, Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika Apr 2008

Selfish Wavelength Assignment In Multifiber Optical Networks, Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika

Faculty Publications, Computer Science

No abstract provided.


Efficient Peer Assignment For Low-Latency Transmission Of Scalable Coded Images, Xiao Su, Tao Wang Mar 2008

Efficient Peer Assignment For Low-Latency Transmission Of Scalable Coded Images, Xiao Su, Tao Wang

Faculty Publications

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the …


A Survey Of Worm Detection And Containment, Pele Li, M. Salour, Xiao Su Jan 2008

A Survey Of Worm Detection And Containment, Pele Li, M. Salour, Xiao Su

Faculty Publications

Self-duplicating, self-propagating malicious codes known as computer worms spread themselves without any human interaction and launch the most destructive attacks against computer networks. At the same time, being fully automated makes their behavior repetitious and predictable. This article presents a survey and comparison of Internet worm detection and containment schemes. We first identify worm characteristics through their behavior, and then classify worm detection algorithms based on the parameters used in the algorithms. Furthermore, we analyze and compare different detection algorithms with reference to the worm characteristics by identifying the type of worms that can and cannot be detected by these …


Web Site Personalization Based On Link Analysis And Navigational Patterns, Magdalini Eirinaki, M. Varzirgiannis Oct 2007

Web Site Personalization Based On Link Analysis And Navigational Patterns, Magdalini Eirinaki, M. Varzirgiannis

Faculty Publications

The continuous growth in the size and use of the World Wide Web imposes new methods of design and development of on-line information services. The need for predicting the users’ needs in order to improve the usability and user retention of a web site is more than evident and can be addressed by personalizing it. Recommendation algorithms aim at proposing “next” pages to users based on their current visit and the past users’ navigational patterns. In the vast majority of related algorithms, however, only the usage data are used to produce recommendations, disregarding the structural properties of the web graph. …


Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang Jun 2006

Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang

Faculty Publications

In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting fine-scalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we …


Mobile Messaging In The Pacific Rim, Thomas Asmuth May 2006

Mobile Messaging In The Pacific Rim, Thomas Asmuth

SWITCH

This article explores the growth of mobile messaging across the Pacific Rim, focusing on how cultural, economic, and infrastructural factors shape its use.


Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah Dec 2005

Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah

Faculty Publications

For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality …


Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis Oct 2005

Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis

Faculty Publications

No abstract provided.


Optimizing Transmission Time Of Scalable Coded Images In Peer-To-Peer Networks, Xiao Su, Rod Fatoohi, Tao Wang Aug 2005

Optimizing Transmission Time Of Scalable Coded Images In Peer-To-Peer Networks, Xiao Su, Rod Fatoohi, Tao Wang

Faculty Publications

In this paper, we study how to optimize image transmission time in peer-to-peer networks by considering the property of bitstreams generated by image coding algorithms. Images can be either scalable coded or nonscalable coded. Since transmission of nonscalable coded images is well understood, we focus on the transmission of scalable coded images in this paper.Because scalable coding embeds lower bit-rate bitstreams into higher bit-rate bitstreams, there exists a many-to-one relationship between supplying and requesting peers. When a requesting peer asks for an image coded in a particular bit rate, multiple peers with the same image but coded in different bit …


Delay-Constrained Transmission Of Fine Scalable Coded Content Over P2p Networks, Xiao Su, Yi Shang, Tao Wang, Yuqing Mai Jan 2005

Delay-Constrained Transmission Of Fine Scalable Coded Content Over P2p Networks, Xiao Su, Yi Shang, Tao Wang, Yuqing Mai

Faculty Publications

Images or videos are generally coded before transmission, and they can be either non-scalable coded or scalable coded, which can be further classified into fine-scalable coded and coarse-scalable coded. In this paper, we focus on delivery of fine-scalable coded content. The objective of our work is to design algorithms to optimize the quality of fine-scalable coded images or videos on peer-to-peer networks when a requesting peer is delay-sensitive and has to display content within a certain delay bound. Fine-scalable coding has two properties: (1) it embeds lower bit-rate bitstreams into higher bit-rate bitstreams; and (2) its coding quality increases with …


Web Mining For Web Personalization, Magdalini Eirinaki, M. Vazirgiannis Feb 2003

Web Mining For Web Personalization, Magdalini Eirinaki, M. Vazirgiannis

Faculty Publications

Web personalization is the process of customizing a Web site to the needs of specific users, taking advantage of the knowledge acquired from the analysis of the user's navigational behavior (usage data) in correlation with other information collected in the Web context, namely, structure, content, and user profile data. Due to the explosive growth of the Web, the domain of Web personalization has gained great momentum both in the research and commercial areas. In this article we present a survey of the use of Web mining for Web personalization. More specifically, we introduce the modules that comprise a Web personalization …


Difi: Digital And Fiber, Wendy Angel May 2001

Difi: Digital And Fiber, Wendy Angel

SWITCH

This article discusses the similarities between the histories of digital technologies and textiles. The author describes the ways that digital and fiber technologies are affected by the growing arts and cultures. The author provides details of how digital and fiber technologies are both used as signal-transmitting information media. The article describes the importance of both digital and fiber in societal standing, the power and status it generates, and how they separates the wealthy and the working class. The article closes with an interpretative analysis of the interwoven properties between industry, information, technology, and art.


Book Review: Ken Goldberg's "The Robot In The Garden", Cindy Ahuna Jan 2000

Book Review: Ken Goldberg's "The Robot In The Garden", Cindy Ahuna

SWITCH

In this book review, Cindy Ahuna summarizes Ken Goldberg's view on the relationships between technology and shared experiences of telepresence and cybernetic systems. The book, "Robot in the Garden" is a collective transcription of telerobotic research and documentation. In the article, Ahuna dissects this book as a breakdown of telerobotic and its relationship with the internet, epistemology, and subcategories of technology based around the internet. The book illustrates critical points of reference regarding telerobotic “case studies in progress; theoretical beliefs; telerobotic scenarios; arguments and parallels of epistemology; questions and approaches to mediation; differences between using the Internet and other acknowledge-based …


Singular And Plural Non-Deterministic Parameters, Sigurd Meldal, M. A. Walicki Aug 1997

Singular And Plural Non-Deterministic Parameters, Sigurd Meldal, M. A. Walicki

Faculty Publications

The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) nondeterministic parameter passing and presents a specification language in which operations with both kinds of parameters can be defined simultaneously. Sound and complete calculi for both semantics are introduced. We study the relations between the two semantics and point out that axioms for operations with plural arguments may be considered as axiom schemata for operations with singular arguments.


Linda Jacobson Interview Virtual Reality Evangelist, Loretta L. Lange Sep 1995

Linda Jacobson Interview Virtual Reality Evangelist, Loretta L. Lange

SWITCH

In the interview with Linda Jacobson, a Virtual Reality (VR) artist, Jacobson discusses the current and future state of VR technology’s role in the politics of the body, social identity, self, gender, class, and race. This article discusses the fact that barriers to access exist for a more diverse set of artists across race, class, and gender to engage with VR technology and the need to evolve the development platform, so artists can implement their ideas in a low-cost way. The author discusses Jaron Lanier’s ideas about using VR to explore other identities based on a theatrical model where the …