5665849
Streamlining the Digital Economy: How to Avert a Tragedy of the Commons
To achieve its unique potential in a digital economy, the Internet must be able to guarantee a quality of service. Solving this problem requires the integration of economic principles and engineering design. The authors describe their work on a control mechanism that is decentralized and computationally feasible.
30721210
Economic analysis of consumer purchase intentions in electronic and traditional retail channels: competitive and strategic implications
We develop a multiattribute economic model to analyze consumer behavior for traditional and electronic channels based on consumers' risk profiles and risk-neutral or risk-averse. We then conduct comparative analyses of consumer purchase decisions to derive strategies for different channels. We study the attitudinal and economic factors that lead to specific purchase decisions under different combinations of price, delivery time, and product customization. We develop theoretical propositions concerning consumer channel switching behavior, incentives to consumers, and pricing strategies for different channels. We also use simulations to gain insights for cases where analytical model becomes intractable.
166893960
Priority pricing of integrated services networks
57631
Insights and analyses of online auctions
17233820
IT-enabled transparent electronic markets: the case of the air travel industry
The electronic market hypothesis predicts that by reducing coordination costs, information technology (IT) will shift industrial organization from hierarchical to market-based forms of economic activity. While academic researchers and practitioners have witnessed these shifts with the advent of the Internet, there is little understanding about the process and the underlying forces that drive them. In this paper, we provide an in-depth analysis of the air travel industry, which has recently experienced significant IT-driven transformations. We conclude that, together with IT, pro-competitive laws and the information-intensive nature of air travel products have triggered competition for consumers with transparent market mechanisms, which is leading to the emergence of more transparent electronic markets in the air travel industry.
7914809
Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights
We develop a real-time estimation approach to predict bidders' maximum willingness to pay in a multiunit ascending uniform-price and discriminatory-price (Yankee) online auction. Our two-stage approach begins with a bidder classification step, which is followed by an analytical prediction model. The classification model identifies bidders as either adopting a myopic best-response (MBR) bidding strategy or a non-MBR strategy. We then use a generalized bid-inversion function to estimate the willingness to pay for MBR bidders. We empirically validate our two-stage approach using data from two popular online auction sites. Our joint classification-and-prediction approach outperforms two other naive prediction strategies that draw random valuations between a bidder's current bid and the known market upper bound. Our prediction results indicate that, on average, our estimates are within 2% of bidders' revealed willingness to pay for Yankee and uniform-price multiunit auctions. We discuss how our results can facilitate mechanism-design changes such as dynamic-bid increments and dynamic buy-it-now prices.
19327594
Mobility-Pattern-Based Anomaly Detection Algorithm in Mobile Networks
Numerous approaches have been proposed for intrusion detection in immobile networks. However, little research work has been done in actually implementing them, especially for anomaly detection, in mobile networks. In this paper, we present an efficient mobility-pattern-based (MPB) anomaly detection algorithm. It can effectively identify abnormal mobility patterns of the nodes in mobile networks. In the proposed algorithm, the normal mobility profile of a specific node is characterized by a multi-leaf tree structure in which each node corresponds to a possible destination cluster. A normal mobility profile is generated during the training process through data mining and fuzzy logic techniques. More specifically, data mining techniques are used for cluster classifications, and fuzzy logic techniques are used to integrate the 'similar'' pattern strings after the corresponding cluster generation. These two techniques are also used during the testing process for distinguishing abnormal mobility patterns of the node from those of the normal in mobile networks. Simulation results demonstrate that our proposed MPB anomaly detection algorithm can achieve good performance in terms of detection rate and false alarm rate for nodes with regular movement behaviors by fine tuning the design parameter - threshold, that can be chosen efficiently.
195894838
Dynamic Access Control Framework Based On Events.
30968721
Tracking Deformable Templates Using a Shortest Path Algorithm
This paper proposes a new technique to track deformable templates. We extend the typical graph algorithms that have been used for active contour recovery to incorporate shape information. The advantage of graph algorithms is that they are guaranteed to find the global minimum of the energy function. The difficulty with their traditional use for active contours is that they consider only two pixels at a time when recovering the contour, making it impossible to enforce shape constraints. We define the deformable template as a polygonal contour, demonstrate the proper mapping between the image, the contour, and a graph, and show how to apply Dijkstra's algorithm to track contours in image sequences. Examples are shown for deforming contours, articulated objects, and smooth contours being tracked in simple and complicated backgrounds. We also provide an analysis of the computational requirements.
18770378
A new model for the recovery of cylindrical structures from medical image data
We introduce a novel analytic model formulation for recovering cylindrical structures (e.g., blood vessels) from segmented 3-D medical image data. Unlike all previous formulations, our model is capable of describing a cylinder with an arbitrary spine (a space curve based on cubic B-splines) and arbitrary cross section which is guaranteed to be orthogonal to the spine. Given this expressiveness, we are able to provide a second order continuous approximation to the centerline of nearly any tubular object. This information may be used for such tasks as a reformatting of the original image data in order to visually detect stenoses or aneurysms. In addition, the cross-section parameter values of our model may aid in automatically isolating these regions. We maintain a relatively simple cross-section function to make this detection straightforward (note that any cross-section function is possible). To describe fine detail in the data, we employ local finite element deformations from the model surface. Thus we are able to recover gross geometric approximations as well as quantify characteristics of the object such as its surface area. We apply our model to the recovery of both a healthy and diseased aorta from segmented CT acquisitions.
1276171
Using Lagrangean Relaxation for Service Location Planning with QoS Constraints in Large-Scale Networks
Current trends in computing indicate that there is a great potential for service oriented computing and similar technologies, such as Cisco's Application Oriented Networks, where services provide a higher-level of abstraction to traditional applications. In such cases, providing and consuming services and establishing a relationship between consumers (users of services) and producers (providers of services) are still challenging and vastly researched aspects. We define a service location planning problem (SLP) that is novel in the approach it takes to match consumers to producers, such that the cost of providing services is minimized while taking into account quality of service constraints of throughput and delay. In previous work, we presented an integer linear programming (ILP) model to formulate the service location planning problem. In this paper, we present Lagrangean Relaxation of the model for large-scale networks. We use the approach of Trick [3] to decrease computational overheads.