Papers.

Characterizing Objectionable Image Content (Pornography and Nude Images) of Specific Web Segments: Chile as a Case Study

Analysis of Web Search Engine Clicked Documents

Where and How Duplicates Occur in the Web

Optimal Multicast with Erasure Correction Coding

Optimal Multicast with Erasure Correction Coding

Efficient don't care computation for hierarchical designs

A probabilistic method to determine the minimum leakage vector for combinational designs

Memory-based crosstalk canceling CODECs for on-chip buses

IP over P2P: enabling self-configuring virtual IP networks for grid computing

Peer-to-peer (P2P) networks have mostly focused on task oriented networking, where networks are constructed for single applications, i.e. file-sharing, DNS caching, etc. In this work, we introduce IPOP, a system for creating virtual IP networks on top of a P2P overlay. IPOP enables seamless access to grid resources spanning multiple domains by aggregating them into a virtual IP network that is completely isolated from the physical network. The virtual IP network provided by IPOP supports deployment of existing IP-based protocols over a robust, self-configuring P2P overlay. We present implementation details as well as experimental measurement results taken from LAN, WAN, and Planet-Lab tests

A Markov Random Field Model of Context for High-Level Information Fusion

Declarative Network Monitoring with an Underprovisioned Query Processor

Scalable Exploration of Physical Database Design

Security and Privacy in the Computer Forensics Context

An Efficient, Scalable Hardware Engine for Boolean SATisfiability

LIMBS: Open Source, Open Standards, and Open Content To Foster Learning Resource Exchanges

WOW: Self-Organizing Wide Area Overlay Networks of Virtual Workstations

You Are Who You Talk To: Detecting Roles in Usenet Newsgroups

Text Mining of Business News for Forecasting

A Case Study: News Classification Based on Term Frequency

Applications of a Web Information Mining Model to Data Mining and Information Retrieval Tasks

WIM: An Information Mining Model for the Web

Correlating Topology and Path Characteristics of Overlay Networks and the Internet

Controlling inductive cross-talk and power in off-chip buses using CODECs

Reflections on Reflection in Agile Software Development

This paper analyzes the reflections of an agile team, developing a large-scale project in an industry setting. The team uses an iteration summary meeting practice, which includes four elements: the customer's summary, a formal presentation of the system, review of metrics and a reflection. The technique for the entire meeting and for the reflection element in particular is described, and empirical evidence is given to show that it is assessed as highly effective, achieving its intended goals, and increasing team satisfaction. Further, the proposed practice supports tracking past decisions. This practice is shown to be valuable to stabilizing a new project as well as a continuous improvement forum for a stable project. It also incurs a lower overhead than existing alternative reflection practices

On Agile Performance Requirements Specification and Testing

Underspecified performance requirements can cause performance issues in a software system. However, a complete, upfront analysis of a software system is difficult, and usually not desirable. We propose an evolutionary model for performance requirements specifications and corresponding validation testing. The principles of the model can be integrated into agile development methods. Using this approach, the performance requirements and test cases can be specified incrementally, without big upfront analysis. We also provide a post hoc examination of a development effort at IBM that had a high focus on performance requirements. The examination indicates that our evolutionary model can be used to specify performance requirements such that the level of detail is commensurate with the nature of the project. Additionally, the IBM experience indicates that test driven development-type validation testing corresponding to the model can be used to determine if performance objectives have been met.

Agile metrics at the Israeli Air Force

It is a significant challenge to implement and research agile software development methods in organizations such as the army. Since it differs from organizations in the industry and the academia, data gathered in the army and its continuous analysis may enrich the community knowledge abut agile methods. This work describes a research, conducted during an entire release, about one development team at the Israeli Air Force that works according to Extreme Programming. The establishment of this team and the investigation of the first release is part of a long-term process, started last year, aiming to reduce delivery time while raising communication and customer collaboration. Among several themes this research is concerned with, we focus on agile metrics and provide a metrics mechanism that was established and refined along the release development.

From Languages to Systems: Understanding Practical Application Development in Security-typed Languages

Reheating Metastable O'Raifeartaigh Models

Self-reproduction in k-inflation

We study cosmological self-reproduction in models of inflation driven by a scalar field $φ$ with a noncanonical kinetic term ($k$-inflation). We develop a general criterion for the existence of attractors and establish conditions selecting a class of $k$-inflation models that admit a unique attractor solution. We then consider quantum fluctuations on the attractor background. We show that the correlation length of the fluctuations is of order $c_{s}H^{-1}$, where $c_{s}$ is the speed of sound. By computing the magnitude of field fluctuations, we determine the coefficients of Fokker-Planck equations describing the probability distribution of the spatially averaged field $φ$. The field fluctuations are generally large in the inflationary attractor regime; hence, eternal self-reproduction is a generic feature of $k$-inflation. This is established more formally by demonstrating the existence of stationary solutions of the relevant FP equations. We also show that there exists a (model-dependent) range $φ_{R}<φ<φ_{\max}$ within which large fluctuations are likely to drive the field towards the upper boundary $φ=φ_{\max}$, where the semiclassical consideration breaks down. An exit from inflation into reheating without reaching $φ_{\max}$ will occur almost surely (with probability 1) only if the initial value of $φ$ is below $φ_{R}$. In this way, strong self-reproduction effects constrain models of $k$-inflation.

Approximating Subtree Distances Between Phylogenies

We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances. The novel ideas are in the analysis. In the analysis, the cost of the algorithm uses a "cascading" scheme that accounts for possible wrong moves. This accounting is missing from previous analysis of tree distance approximation algorithms. Further, we show how all algorithms of this type can be implemented in linear time and give experimental results.

Generic Damping Functions for Propagating Importance in Link-Based Ranking

Structure and tie strengths in mobile communication networks

Electronic databases, from phone to e-mails logs, currently provide detailed records of human communication patterns, offering novel avenues to map and explore the structure of social and communication networks. Here we examine the communication patterns of millions of mobile phone users, allowing us to simultaneously study the local and the global structure of a society-wide communication network. We observe a coupling between interaction strengths and the network's local structure, with the counterintuitive consequence that social networks are robust to the removal of the strong ties but fall apart after a phase transition if the weak ties are removed. We show that this coupling significantly slows the diffusion process, resulting in dynamic trapping of information in communities and find that, when it comes to information diffusion, weak and strong ties are both simultaneously ineffective.

Topology of music recommendation networks

Creation and implications of a phenome-genome network

Building autonomic systems using collaborative reinforcement learning

Scalable percolation search on complex networks

Seasonal variation in the development of chilling injury in ‘O’Henry’ peaches

Secured macro/micro-mobility protocol for multi-hop cellular IP

2004 Symposium on String Processing and Information Retrieval

Analyzing imbalance among homogeneous index servers in a web search system

The visibility–Voronoi complex and its applications

Revealing Complex Traits with Small Molecules and Naturally Recombinant Yeast Strains

Building a terabyte NEXRAD radar database for hydrometeorology research.

360-Degree Programming the Oracle Database

Database as web services provider service

Abridged Oracle JPublisher

SQLJ data access and best practices

The SQLJ language and oracle extensions

Introducing the SQLJ technology and oracle's implementation

JDBC quality of services and best practices