Search For:

Displaying 1-37 out of 37 total
Run-Time Reference Clustering for Cache Performance Optimization
Found in: Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on
By Wesley K. Kaplow, Boleslaw K. Szymanski, Peter Tannenbaum, Viktor K. Decyk
Issue Date:March 1997
pp. 42
We introduce a method for improving the cache performance of irregular computations in which data are referenced through run-time defined indirection arrays. Such computations often arise in scientific problems. The presented method, called Run-Time Refere...
 
SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process
Found in: Data Mining Workshops, International Conference on
By Jierui Xie,Boleslaw K. Szymanski,Xiaoming Liu
Issue Date:December 2011
pp. 344-349
Overlap is one of the characteristics of social networks, in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a novel, general...
 
Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Eyuphan Bulut,Boleslaw K. Szymanski
Issue Date:December 2012
pp. 2254-2265
Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a gr...
 
Constructing Limited Scale-Free Topologiesover Peer-to-Peer Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Eyuphan Bulut,Boleslaw K. Szymanski
Issue Date:April 2014
pp. 919-928
Overlay network topology together with peer/data organization and search algorithm are the crucial components of unstructured peer-to-peer (P2P) networks as they directly affect the efficiency of search on such networks. Scale-free (power-law) overlay netw...
 
Grammatical Inference for Modeling Mobility Patterns in Networks
Found in: IEEE Transactions on Mobile Computing
By Sahin Cem Geyik,Eyuphan Bulut,Boleslaw K. Szymanski
Issue Date:November 2013
pp. 2119-2131
Modeling of the mobility patterns arising in computer networks requires a compact and faithful representation of the mobility data collected from observations and measurements of the relevant network applications. This data can range from the information o...
 
Parallel Overlapping Community Detection with SLPA
Found in: 2013 International Conference on Social Computing (SocialCom)
By Konstantin Kuzmin,S. Yousaf Shah,Boleslaw K. Szymanski
Issue Date:September 2013
pp. 204-212
Social networks consist of various communities that host members sharing common characteristics. Often some members of one community are also members of other communities. Such shared membership of different communities leads to overlapping communities. De...
 
A Middleware Framework for Maximum Likelihood Evaluation over Dynamic Grids
Found in: e-Science and Grid Computing, International Conference on
By Wei-Jen Wang, Kaoutar El Maghraoui, John Cummings, Jim Napolitano, Boleslaw K. Szymanski, Carlos A. Varela
Issue Date:December 2006
pp. 105
We have designed a maximum likelihood fitter using the actor model to distribute the computation over a heterogeneous network. The prototype implementation uses the SALSA programming language and the Internet Operating System middleware. We have used our f...
 
Analyzing the Proximity and Interactions of Friends in Communities in Gowalla
Found in: 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)
By Tommy Nguyen,Mingming Chen,Boleslaw K. Szymanski
Issue Date:December 2013
pp. 1036-1044
We collected friendship information and location data from a social media website called Go Walla to analyze the relationship between geographical space and friendship. First, we analyzed how geographic proximity shapes the structure of the social network ...
 
Robust Dynamic Service Composition in Sensor Networks
Found in: IEEE Transactions on Services Computing
By Sahin Cem Geyik,Boleslaw K. Szymanski,Petros Zerfos
Issue Date:October 2013
pp. 560-572
Service modeling and service composition are software architecture paradigms that have been used extensively in web services where there is an abundance of resources. They mainly capture the idea that advanced functionality can be realized by combining a s...
 
On Measuring the Quality of a Network Community Structure
Found in: 2013 International Conference on Social Computing (SocialCom)
By Mingming Chen,Tommy Nguyen,Boleslaw K. Szymanski
Issue Date:September 2013
pp. 122-127
Modularity is widely used to effectively measure the strength of the community structure found by community detection algorithms. However, modularity maximization suffers from two opposite yet coexisting problems: in some cases, it tends to favor small com...
 
Transient traffic congestion control with Traveling Auctions
Found in: Pervasive Computing and Communications Workshops, IEEE International Conference on
By S. Yousaf Shah,Boleslaw K. Szymanski
Issue Date:March 2012
pp. 14-19
The use of market mechanisms to solve computer science problems such as resource sharing, load distribution and network routing, is gaining significant traction. In this paper, we investigate new market mechanisms to solve the problem of bandwidth sharing ...
 
Community detection using a neighborhood strength driven Label Propagation Algorithm
Found in: IEEE Network Science Workshop
By Jierui Xie,Boleslaw K. Szymanski
Issue Date:June 2011
pp. 188-195
Studies of community structure and evolution in large social networks require a fast and accurate algorithm for community detection. As the size of analyzed communities grows, complexity of the community detection algorithm needs to be kept close to linear...
 
Dynamic Composition of Services in Sensor Networks
Found in: Services Computing, IEEE International Conference on
By Sahin Cem Geyik, Boleslaw K. Szymanski, Petros Zerfos, Dinesh Verma
Issue Date:July 2010
pp. 242-249
Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in senso...
 
Conditional shortest path routing in delay tolerant networks
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szymanski
Issue Date:June 2010
pp. 1-6
Delay tolerant networks are characterized by the sporadic connectivity between their nodes and therefore the lack of stable end-to-end paths from source to destination. Since the future node connections are mostly unknown in these networks, opportunistic f...
 
Auction-based congestion management for target tracking in wireless sensor networks
Found in: Pervasive Computing and Communications, IEEE International Conference on
By Lei Chen, Boleslaw K. Szymanski, Joel W. Branch
Issue Date:March 2009
pp. 1-10
This paper addresses the problem of providing congestion-management for a shared wireless sensor network-based target tracking system. In many large-scale wireless sensor network target tracking scenarios (e.g., a surveillance system for tracking vehicles ...
 
Selecting Scientific Papers for Publication via Citation Auctions
Found in: IEEE Intelligent Systems
By Josep Lluis de la Rosa, Boleslaw K. Szymanski
Issue Date:November 2007
pp. 16-20
Peer review aims to get authors to meet their discipline's standards and thus achieve scientific objectivity. However, it has many drawbacks. We propose replacing it with an auction-based approach that uses citations as currency: the better the submitted p...
 
Dynamic Malleability in Iterative MPI Applications
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K. Szymanski, Carlos A. Varela
Issue Date:May 2007
pp. 591-598
Malleability enables a parallel application?s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to dynamic execution environments, it is limited by the granularity of the applic...
 
On the Development of an Internetwork-Centric Defense for Scanning Worms
Found in: Hawaii International Conference on System Sciences
By Scott E. Coull, Boleslaw K. Szymanski
Issue Date:January 2007
pp. 144a
The speed with which Internet worms propagate, and their potential for carrying devastating payloads makes them a significant threat to the stability of the Internet. Current approaches for containing these worms are ineffective due to their completely loc...
   
Parallel Logic Simulation of Million-Gate VLSI Circuits
Found in: Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
By Lijuan Zhu, Gilbert Chen, Boleslaw K. Szymanski, Carl Tropper, Tong Zhang
Issue Date:September 2005
pp. 521-524
<p>The complexity of today?s VLSI chip designs makes veri fication a necessary step before fabrication. As a result, gate-level logic simulation has became an integral component of the VLSI circuit design process which verifies the design and analyze...
 
A Novel Auction Mechanism for Selling Time-Sensitive E-Services
Found in: E-Commerce Technology, IEEE International Conference on
By Juong-Sik Lee, Boleslaw K. Szymanski
Issue Date:July 2005
pp. 75-82
Many e-services are time-sensitive as the users request them for a specific time period. Such services need to be repeatedly offered to keep them constantly utilized. This paper studies winner selection strategies in a recurring auction for such time-sensi...
 
Local Leader Election, Signal Strength Aware Flooding, and Routeless Routing
Found in: Parallel and Distributed Processing Symposium, International
By Gilbert Chen, Joel W. Branch, Boleslaw K. Szymanski
Issue Date:April 2005
pp. 244a
We have identified a fundamental operator in wireless networks that we named the local leader election in which the goal is to select a node in a spatially close neighborhood. We present a simple and efficient solution to the local leader election problem ...
 
Parallel Network Simulation under Distributed Genesis
Found in: Parallel and Distributed Simulation, Workshop on
By Boleslaw K. Szymanski, Yu Liu, Rashim Gupta
Issue Date:June 2003
pp. 61
<p>We describe two major developments in the General Network Simulation Integration System (Genesis): the support for BGP protocol in large network simulations and distribution of the simulation memory among Genesis component simulations.</p> &...
 
Four Types of Lookback
Found in: Parallel and Distributed Simulation, Workshop on
By Gilbert Chen, Boleslaw K. Szymanski
Issue Date:June 2003
pp. 3
We present a classification that groups lookback into four types: direct strong lookback, universal strong lookback, direct weak lookback, and universal weak lookback. They are defined in terms of absolute and dynamic impact times. We discuss relationships...
 
Lookback: A New Way of Exploiting Parallelism in Discrete Event Simulation
Found in: Parallel and Distributed Simulation, Workshop on
By Gilbert Chen, Boleslaw K. Szymanski
Issue Date:May 2002
pp. 153
Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabling new synchronization protocols for th...
 
Genesis: A System for Large-Scale Parallel Network Simulation
Found in: Parallel and Distributed Simulation, Workshop on
By Boleslaw K. Szymanski, Adnan Saifee, Anand Sastry, Yu Liu, Kiran Madnani
Issue Date:May 2002
pp. 89
<p>We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and concurrently with the others over...
 
Performance Mining of Large-Scale Data-Intensive Applications
Found in: Parallel and Distributed Processing Symposium, International
By Christopher Carothers, Boleslaw K. Szymanski, Mohammed Zaki
Issue Date:April 2002
pp. 0177b
To address the challenges for next generation software systems we propose the development of the PerfMiner engine for the performance mining of large-scale data-intensive distributed object applications. PerfMiner, a system for continuous performance optim...
   
Real-Time On-Line Network Simulation
Found in: Distributed Simulation and Real Time Applications, IEEE/ACM International Symposium on
By Boleslaw K. Szymanski, Yu Liu, Anand Sastry, Kiran Madnani
Issue Date:August 2001
pp. 0022
Abstract: The complexity and dynamics of the Internet is driving the demand for scalable and efficient network simulation. Yet, parallelizing network simulation at packet level does not work efficiently and therefore do not scale to large number of process...
 
Object-oriented parallel computation for plasma simulation
Found in: Communications of the ACM
By Boleslaw K. Szymanski, Charles D. Norton, Viktor K. Decyk
Issue Date:January 1988
pp. 88-100
Object-oriented techniques promise to improve the software design and programming process by providing an application-oriented view of programming while facilitating modification and reuse. Since the software design crisis is particularly acute in parallel...
     
Trends in computer science research
Found in: Communications of the ACM
By Apirak Hoonlor, Boleslaw K. Szymanski, Mohammed J. Zaki
Issue Date:October 2013
pp. 74-83
Keywords in the ACM Digital Library and IEEE Xplore digital library and in NSF grants anticipate future CS research.
     
Overlapping community detection in networks: The state-of-the-art and comparative study
Found in: ACM Computing Surveys (CSUR)
By Boleslaw K. Szymanski, Jierui Xie, Stephen Kelley
Issue Date:August 2013
pp. 1-35
This article reviews the state-of-the-art in overlapping community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms (a total of fourteen) is provided. In addition to community-level evaluation, we propos...
     
WiFi access point deployment for efficient mobile data offloading
Found in: Proceedings of the first ACM international workshop on Practical issues and applications in next generation wireless networks (PINGEN '12)
By Boleslaw K. Szymanski, Eyuphan Bulut
Issue Date:August 2012
pp. 45-50
Recently, there has been a tremendous increase in mobile data usage with the wide-spread proliferation of smartphone like devices. However, this increased demand from users has caused severe traffic overloading in cellular networks. Offloading the traffic ...
     
Socially-aware market mechanism for participatory sensing
Found in: Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking (MiSeNet '12)
By Boleslaw K. Szymanski, Buster O. Holzbauer, Eyuphan Bulut
Issue Date:August 2012
pp. 9-14
By using personal mobile devices, participatory sensing provides an alternative to deploying dedicated mobile nodes to perform data acquisition tasks in areas where human carriers are already present. However, this application comes with some unique challe...
     
Distributed energy-efficient target tracking with binary sensor networks
Found in: ACM Transactions on Sensor Networks (TOSN)
By Boleslaw K. Szymanski, Eyuphan Bulut, Zijian Wang
Issue Date:July 2010
pp. 1-32
Target tracking is a typical and important cooperative sensing application of wireless sensor networks. We study it in its most basic form, assuming a binary sensing model in which each sensor returns only 1-bit information regarding target's presence or a...
     
VOGUE: A variable order hidden Markov model with duration based on frequent sequence mining
Found in: ACM Transactions on Knowledge Discovery from Data (TKDD)
By Boleslaw K. Szymanski, Christopher D. Carothers, Mohammed J. Zaki
Issue Date:January 2010
pp. 1-31
We present VOGUE, a novel, variable order hidden Markov model with state durations, that combines two separate techniques for modeling complex patterns in sequential data: pattern mining and data modeling. VOGUE relies on a variable gap sequence mining met...
     
Editorial message: special track on applications of spatial simulation of discrete entities
Found in: Proceedings of the 2002 ACM symposium on Applied computing (SAC '02)
By Boleslaw K. Szymanski, William A. Maniatty
Issue Date:March 2002
pp. 120-121
Many important phenomena result from localized interactions including: population dynamics and epidemics, cell and tissue modeling, mobile computing and wireless networks. Modeling these systems can reduce experimentation costs or enable non-destructive in...
     
Simulating Lyme disease using parallel discrete event simulation
Found in: Proceedings of the 28th conference on Winter simulation (WSC '96)
By Boleslaw K. Szymanski, Ewa Deelman, Thomas Caraco
Issue Date:December 1996
pp. 1191-1198
This paper describes the CONVERSIM simulation language. CONVERSIM is a developmental general-purpose, discrete-event language which has been used in the classroom to introduce the use and operation of simulators prior to the introduction of languages such ...
     
Generating parallel code for SIMD machines
Found in: ACM Letters on Programming Languages and Systems (LOPLAS)
By Boleslaw K. Szymanski
Issue Date:March 1992
pp. 59-73
Massively parallel SIMD machines rely on data parallelism usually achieved by a careful hand coding to support program efficiency. This paper describes parallelization of code generated for SIMD machines by the compiler for the Equational Programming Langu...
     
 1