62972305
On the complexity of computation and learning in neural networks
This dissertation is on the complexity of computation and learning in Neural Networks. One of the reasons for studying neural networks is that they provide a computational model which seems closer to the computational framework employed by the human brain for information processing than the conventional computers. Neural networks are highly simplified model of the human brain and one hopes that by attaining a proper understanding of the computational aspects in neural networks, one can gain significant insights into the computational characteristics of the human brain. 
In this dissertation, we have considered three different kinds of neural networks, namely, the Boltzmann Machines, the Hopfield Nets and the Feedforward Neural Nets. We studied the computational and learning abilities of these networks from a complexity theory point of view. We also related the computational power of various neural nets, in particular, the Boltzmann Machines and the Feedforward Neural Nets which are also known as Threshold circuits in the complexity theory literature.
270982
A Method for the Efficient Design of Boltzmann Machines for Classiffication Problems
We introduce a method for the efficient design of a Boltzmann machine (or a Hopfield net) that computes an arbitrary given Boolean function f. This method is based on an efficient simulation of acyclic circuits with threshold gates by Boltzmann machines. As a consequence we can show that various concrete Boolean functions f that are relevant for classification problems can be computed by scalable Boltzmann machines that are guaranteed to converge to their global maximum configuration with high probability after constantly many steps.
887786
Efficient Design of Boltzmann Machines
6504247
Hardware Diagnosis as Program Debugging
Horn clauses provide a useful framework for writing executable structural representations for digital circuits. This paper discusses how these representations can be used to diagnose faulty circuits using algorithmic program debugging techniques developed by Shapiro. The sound theoretical basis of these techniques is one of the major advantages of this approach. This framework also provides a new perspective on some of the hardware diagnosis techniques suggested in the literature.
496243
Mini Track: 'Ethical, Legal and Economic Issues in the Digital Economy: Intellectual Property Rights, Piracy, Trust, Security and Privacy'
The emergence of the Internet as the de facto medium for business has accentuated the role of factors such as intellectual property rights (IPR), consumer privacy, and trust. Newer technologies have it made it a challenging task to protect content for sellers and private information for consumers. This is the second time for this mini track at HICSS and it includes technical, analytical, empirical, and conceptual research spanning diverse research areas and methodologies including the social, behavioral, and economic issues. In his paper “Does drop in copying cost support copyright term extension?” Michael Y. Yuan examines copyright duration and analyzes the validity of the extending copyright duration. Through a simulation of an information product market, this model recommends that decrease in copying cost of information products reduces the optimal duration of copyright. Further, while longer life expectancy may support copyright term extension, this work finds that increase in demand for information products supports reduction in copyright duration.
41429895
Explanation-based Failure Recovery
Interactions are inherent in design-type problem-solving tasks where only partially compiled operators are available. Failures arising from such interactions can best be recovered by explaining them in the underlying domain models. In this paper we explain how Explanation-Based Learning provides a framework for recovering in this manner. This approach also alleviates some of the problems associated with the least-commitment approach to design-type problem-solving.
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.
18859582
Auctioning Vertically Integrated Online Services: Computational Approaches for Real-Time Allocation
We develop three auction-based pricing and allocation solution methods for the case where a capacity-constrained online service provider offers multiple classes of unique, one-time services with differentiated quality. Consumers desire exactly one of the many service classes offered. We call such a setting a vertically integrated online services market. Examples of these services are webcasting of special events over the Internet, provision of video-on-demand, and allocation of grid computing resources. We model the pricing and allocation decision faced by firms in such a setting as a knapsack problem with an added preference elicitation dimension. We present a variety of computational solution approaches based on adaptations of the traditional greedy heuristic for knapsack problems. The solution approaches vary in efficacy depending on whether bidders are restricted to bid in one service class or allowed to bid in multiple service classes, as well as on the overall variability of the demand. In the case bidders can bid in multiple classes but are interested in consuming only one service class, a direct application of the heuristics developed for the single service case results in a nonfair allocation. We develop a novel data structure to eliminate the unfair allocation while maintaining the original computation complexity of the simpler setting. The paper contributes by presenting a menu of auction clearing mechanisms for selling vertically integrated online services.