Michael Kelly
580 California St., Suite 400
San Francisco, CA, 94104
A paradigm for semantic picture recognition
1974
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
AI
AI
A new paradigm for semantic picture recognition is proposed, addressing limitations in existing syntactic approaches that fail to utilize contextual information and adequately describe various shapes. This semantic paradigm incorporates rules of inference and intensional class descriptions to enhance recognition of ambiguous shapes and non-pictorial paraphrases. The effectiveness of this model is evaluated against challenges such as non-ideal data and perceptual multistability.
Related papers
Dynamic control of session input rates in communication networks
IEEE Transactions on Automatic Control, 1984
On Retransmission Control Policies in Multiaccess Channels
B&. NAME OF FUNDING/SPONSORING 8b. OFFICE SYMBOL 9. PROCUREMENT INSTRUMENT IDENTIFICATION NUMBER AORI NM AFOSR-82-0030, ft. ADDRESS lCity. Stele end ZIP Code) 10. SOURCE OF FUN6ING NOS.
A Dynamic Rate Control Mechanism for Source Coded Traffic in a Fast Packet Network
IEEE Journal on Selected Areas in Communications, 1991
To achieve better statistical gain for voice and video traffic and to relieve congestion in fast packet networks, a dynamic rate control mechanism is proposed. An analytical model is developed to evaluate the performance of this control mechanism for voice traffic. The feedback delay for the source node to obtain the network congestion information is represented in the model. The study indicates that significant improvement in statistical gain can be realized for smaller capacity links (e.g., links that can accommodate less than 24 voice calls) with a reasonable feedback time (about 100 ms). The tradeoff for increasing the statistical gain is temporary degradation of voice quality to a lower rate. It is shown that whether the feedback delay is exponentially distributed or constant does not significantly affect performance in terms of fractional packet loss and average received coding rate. It is also shown that using the number of calls in talkspurt or the packet queue length as measures of congestion provides comparable performance.
Packet Scheduling and Congestion Control
Lecture Notes in Electrical Engineering, 2009
Buffer size for data communications over fading radio links
Computer Networks (1976), 1980
With the increasing importance of computer traffic over radio channels, it is important to study the effect of signal fluctuation. This paper is the first analysis of buffer requirements for retransmission error control schemes operating over fading links. It contains four principal contributions: design curves are presented for buffer size in terms of traffic and channel parameters; an intermittent server model for the channel is introduced and verified by simulation; transforms are found which give very tight approximations to buffer overflow and lost traffic probabilities for independent arrivals pattern and a semi-Markov server; and finally, an exact analysis of Bernoulli arrivals is presented and assessed as an easily calculated approximation to more general arrival patterns.
A fast packet switching satellite communication network
Ieee Infcom 91 the Conference on Computer Communications Tenth Annual Joint Comference of the Ieee Computer and Communications Societies Proceedings, 1991
A multibeam fast packet switching satellite communication network serving multiple zones is studied in this paper. The synchronous Time Division Multiple Access protocol (TDM) is use in transmitting messages in the uplink channels while the Asinchronous Time Division Multiple Access protocol (ATDM) is used in the downlink channels. Moreover, fast packet switching capabilities are assumed on-board the satellite. Alternatives for the architecture of the on-board fast packet switching fabric are considered. The perjormance of the considered approaches have been derived by theoretical analysis and computer simulations. A novel input queueing technique is also proposed and analyzed to show that it achives betterperformance with respect to the classical input queueing approach. Therefore, by means of the novel input queueing approach it is possible to lower the end-to-end delay without increasing the complexity of the on-board equipmnts. Work carried out under thefinancial suppofl of the National Research Council (C.N. R.) in the frame of the Telecommunication Project. packets attained switching while queueing is required for the other to wait for a later route.
Exploiting Wireless Channel State Information for Throughput Maximization
IEEE Transactions on Information Theory, 2004
We consider the problem of scheduling packets over channels with time-varying quality. This problem received a lot of attention lately in the context of devising methods for providing quality of service in wireless communications. Earlier work in this problem considered two cases. One case is that the arrival rate vector is in the throughput region and then policies that stabilize the system are pursued. The other case is that all packet queues are saturated and then policies that optimize an objective function of the channel throughputs are investigated. In this paper we address the case where no assumption on the arrival rates is made. We obtain a scheduling policy that maximizes the weighted sum of channel throughputs. Under the optimal policy, in the general case, the system may operate in a regime where some queues are stable while the rest become saturated. If stability for the whole system is at all possible, it is always achieved. The optimal policy is a combination of a criterion that gives priorities based on queue lengths and a strict priority rule. The scheduling mechanism switches between the two criteria based on thresholds on the queue lengths and is modulated by the availability of the channels. The analysis of the operation of the system involves the study of a vector process which in steady state has some of its components stable while the others are unstable. We adopted a novel model for time-varying channel availability that dispenses with the statistical assumptions and makes a rigorous description of system dynamics possible. * This paper has been presented in part at the IEEE Infocom '03, April
Communication Over Individual Channels
IEEE Transactions on Information Theory, 2000
We consider the problem of communicating over a channel for which no mathematical model is specified. We present achievable rates as a function of the channel input and output sequences known a-posteriori for discrete and continuous channels. Furthermore we present a rate-adaptive scheme employing feedback which achieves these rates asymptotically without prior knowledge of the channel behavior.
A rate-adjusting congestion control scheme for satellite based packet switches
15th International Communicatons Satellite Systems Conference and Exhibit, 1994
This paper deals with two different ways to adapt a multibeam satellite payload capacity in terms of satellite antenna gain and frequency bandwidth according to traffic pattern variations. One proposed solution consists in using a channel to beam switching device which allocates channels to beams. The other one consists in using a reconfigurable active antenna which can change the shape of each radiated beam. The two solutions are compared in terms of service quality : call blocking probability and mean waiting time for a new incoming station in the network. It is shown that, for a satellite payload using high gain beams and a frequency-reuse scheme, the second solution is the most efficient one in the case of heavy traffic loads.
Rate based flow control with bandwidth information
1996
The ATM Forum has chosen the rate-based approach for flow control of ABR (Available Bit Rate) traffic in ATM.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
References (2)
- T. Welch, A mechanical analysis of the cyclic structure of undirected linear graphs. J. ACM 13, 2 (April 1966), 205-210.
- E. Gibbs, A cycle generation algorithm for finite undirected linear graphs. J. ACM i_~6, 4 (Oct. 1969), 564-568.