Open Access. Powered by Scholars. Published by Universities.®
Electrical and Computer Engineering
Electrical Engineering and Computer Science Faculty Publications
- Keyword
-
- Broadband wireless access (1)
- Central limit theorem. statistical control (1)
- Clustering algorithm (1)
- Concept clustering (1)
- Consistency restoration (1)
-
- Dynamic programming (1)
- Electronic business (1)
- Electronic commerce (1)
- Enterprise Web Server (1)
- Feature extraction (1)
- Genetic algorithms (1)
- Interactive constraint satisfaction problem (1)
- Internet routing protocols (1)
- Load balancing (1)
- Microcell (1)
- Multimedia services (1)
- Multiresolution (1)
- Network availability (1)
- Optimal resource allocation (1)
- Optimization (1)
- Packet-switched networks (1)
- Propagation loss (1)
- Quality-of-service (QoS) routing (1)
- Temporal reasoning (1)
- User interest hierarchy (1)
- User profile (1)
- Wavelet transform (1)
- Web Server (1)
- Web Server Availability (1)
- Web Server Down-Time (1)
Articles 1 - 11 of 11
Full-Text Articles in Engineering
An Optimum Greedy Algorithm For Choosing Minimal Set Of Conflicting Constraints In The Point Sequencing Problem, Florent Launay, Mitra Debasis
An Optimum Greedy Algorithm For Choosing Minimal Set Of Conflicting Constraints In The Point Sequencing Problem, Florent Launay, Mitra Debasis
Electrical Engineering and Computer Science Faculty Publications
In this work, we first have proposed a technique to define the "causes" of inconsistency on an online point based reasoning constraint network. Second, we introduce an algorithm that proposes the user a minimal set of relations to remove when inconsistencies are detected. We have developed and implemented a battery of algorithms for the purpose of this type of reasoning. Some useful theorems and properties are defined for proving the 'minimal' aspect of the algorithm. Finally, we found that our investigation was a polynomially solvable sub problem of the vertex cover problem.
Learning Implicit User Interest Hierarchy For Context In Personalization, Philip K. Chan, Hyoung-Rae Kim
Learning Implicit User Interest Hierarchy For Context In Personalization, Philip K. Chan, Hyoung-Rae Kim
Electrical Engineering and Computer Science Faculty Publications
To provide a more robust context for personalization, we desire to extract a continuum of general (long-term) to specific (short-term) interests of a user. Our proposed approach is to learn a user interest hierarchy (UIH) from a set of web pages visited by a user. We devise a divisive hierarchical clustering (DHC) algorithm to group words (topics) into a hierarchy where more general interests are represented by a larger set of words. Each web page can then be assigned to nodes in the hierarchy for further processing in learning and predicting interests. This approach is analogous to building a subject …
An Algorithm Applicable To Clearing Combinatorial Exchanges, Marius Silaghi
An Algorithm Applicable To Clearing Combinatorial Exchanges, Marius Silaghi
Electrical Engineering and Computer Science Faculty Publications
It is important to approach negotiations in a way that ensures privacy. So far, research has focused on securely solving restricted classes of negotiation techniques, mainly the (M+1)-st-price auctions. Here we show how these results can be adapted to more general problems. This paper extends our previous results on how distributed finite discrete problems can be solved securely. Such problems can model larger classes of negotiation problems, .e.g. Combinatorial Exchanges [Sil02]. In Finite Discrete Maximization, each tuple in the problem space is associated with an integer value in a predefined interval and we search for a maximizing input. Values from …
Network Traffic Anomaly Detection Based On Packet Bytes, Philip K. Chan, Matthew V. Mahoney
Network Traffic Anomaly Detection Based On Packet Bytes, Philip K. Chan, Matthew V. Mahoney
Electrical Engineering and Computer Science Faculty Publications
Hostile network traffic is often "different" from benign traffic in ways that can be distinguished without knowing the nature of the attack. We describe a two-stage anomaly detection system for identifying suspicious traffic. First, we filter traffic to pass only the packets of most interest, e.g., the first few packets of incoming server requests. Second, we model the most common protocols (IP, TCP, telnet, FTP, SMTP, HTTP) at the packet byte level to flag events (byte values) that have not been observed for a long time. This simple system detects 132 of 185 attacks in the 1999 DARPA IDS evaluation …
Linear Feature Detection Using Multiresolution Wavelet Filters, Samuel Peter Kozaitis, Somkait Udomhunsakul, Rufus H. Cofer, A. Agarawal, Shuwu Song
Linear Feature Detection Using Multiresolution Wavelet Filters, Samuel Peter Kozaitis, Somkait Udomhunsakul, Rufus H. Cofer, A. Agarawal, Shuwu Song
Electrical Engineering and Computer Science Faculty Publications
We detected roads in aerial imagery based on multiresolution linear feature detection. Our method used the products of wavelet coefficients at several scales to identify and locate linear features. After detecting possible road pixels, we used a shortest-path algorithm to identify roads. The multiresolution approach effectively increased the size of the region we examined when looking for possible road pixels and reduced the effect of noise. We found that our approach leads to an effective method for detecting roads in aerial imagery.
Unicode Compression: Does Size Really Matter?, Ryan Stansifer, Steve Atkin
Unicode Compression: Does Size Really Matter?, Ryan Stansifer, Steve Atkin
Electrical Engineering and Computer Science Faculty Publications
The Unicode standard provides several algorithms, techniques, and strategies for assigning, transmitting, and compressing Unicode characters. These techniques allow Unicode data to be represented in a concise format in several contexts. In this paper we examine several techniques and strategies for compressing Unicode data using the programs gzip and bzip. Unicode compression algorithms known as SCSU and BOCU are also examined. As far as size is concerned, algorithms designed specifically for Unicode may not be necessary.
Probabilistic Microcell Prediction Model, Song-Kyoo Kim
Probabilistic Microcell Prediction Model, Song-Kyoo Kim
Electrical Engineering and Computer Science Faculty Publications
A microcell is a cell with 1-km or less radius which is suitable for heavily urbanized area such as a metropolitan city. This paper deals with the microcell prediction model of propagation loss which uses probabilistic techniques. The RSL (Receive Signal Level) is the factor which can evaluate the performance of a microcell and the LOS (Line-Of-Sight) component and the blockage loss directly effect on the RSL. We are combining the probabilistic method to get these performance factors. The mathematical methods include the CLT (Central Limit Theorem) and the SPC (Statistical Process Control) to get the parameters of the distribution. …
Learning Nonstationary Models Of Normal Network Traffic For Detecting Novel Attacks, Philip K. Chan, Matthew V. Mahoney
Learning Nonstationary Models Of Normal Network Traffic For Detecting Novel Attacks, Philip K. Chan, Matthew V. Mahoney
Electrical Engineering and Computer Science Faculty Publications
Traditional intrusion detection systems (IDS) detect attacks by comparing current behavior to signatures of known attacks. One main drawback is the inability of detecting new attacks which do not have known signatures. In this paper we propose a learning algorithm that constructs models of normal behavior from attack-free network traffic. Behavior that deviates from the learned normal model signals possible novel attacks. Our IDS is unique in two respects. First, it is nonstationary, modeling probabilities based on the time since the last event rather than on average rate. This prevents alarm floods. Second, the IDS learns protocol vocabularies (at the …
Genetic Routing Algorithms To Optimize Availability In Broadband Wireless Networks With Load Balancing, William S. Hortos
Genetic Routing Algorithms To Optimize Availability In Broadband Wireless Networks With Load Balancing, William S. Hortos
Electrical Engineering and Computer Science Faculty Publications
Packet-switched networks using the Internet Protocol (IP) provide multimedia services through broadband wireless access to mobile and fixed subscribers from an IP core network via bi-directional paths consisting of a hierarchy of high-speed routers, switches, and servers. Packets are aggregated at the nodes that form the ordered links of end-to-end paths between subscriber and gateway. Network resources are allocated at nodes to meet quality of service (QoS) requirements of new and existing calls. If sufficient resources are not available to satisfy a call's QoS, the call is blocked or dropped, reducing network "uptime" or availability. Packet flows are shared among …
On The Use Of Linda As A Framework For Distributed Database Systems, Madhan M. Thirukonda, Ronaldo Menezes
On The Use Of Linda As A Framework For Distributed Database Systems, Madhan M. Thirukonda, Ronaldo Menezes
Electrical Engineering and Computer Science Faculty Publications
Linda is a coordination language capable of solving issues in distributed computing environments that relate to process synchronization, communication and creation. The expressiveness of Linda in distributed systems is such that researchers are proposing novel applications using Linda as a primary means of coordination. The examples range from peer-to-peer to groupware computing, from simple chat applications to control systems. Surprisingly, Linda has not been used in the field of distributed databases, although Linda can be helpful in solving coordination issues in a distributed database system. In this paper, we look at a possibility of using Linda in the context of …
Webspy: An Architecture For Monitoring Web Server Availability In A Multi-Platform Environment, Madhan M. Thirukonda
Webspy: An Architecture For Monitoring Web Server Availability In A Multi-Platform Environment, Madhan M. Thirukonda
Electrical Engineering and Computer Science Faculty Publications
For an electronic business (e-business), customer satisfaction can be the difference between long-term success and short-term failure. Customer satisfaction is highly impacted by Web server availability, as customers expect a Web site to be available twenty-four hours a day and seven days a week. Unfortunately, unscheduled Web server downtime is often beyond the control of the organization. What is needed is an effective means of identifying and recovering from Web server downtime in order to minimize the negative impact on the customer. An automated architecture, called WebSpy, has been developed to notify administration and to take immediate action when Web …