ppxscal/embedding_network huggingface dataset:
Super-resolution reconstruction in a computational compound-eye imaging system
Authors: Wai-San Chan, Edmund Y. Lam, Michael K. Ng, Giuseppe Y. Mak
Venue: Multidimensional Systems and Signal Processing (2007)

From consumer electronics to biomedical applications, device miniaturization has shown to be highly desirable. This often includes reducing the size of some optical systems. However, diffraction effects impose a constraint on image quality when we simply scale down the imaging parameters. Over the past few years, compound-eye imaging system has emerged as a promising architecture in the development of compact visual systems. Because multiple low-resolution (LR) sub-images are captured, post-processing algorithms for the reconstruction of a high-resolution (HR) final image from the LR images play a critical role in affecting the image quality. In this paper, we describe and investigate the performance of a compound-eye system recently reported in the literature. We discuss both the physical construction and the mathematical model of the imaging components, followed by an application of our super-resolution algorithm in reconstructing the image. We then explore several variations of the imaging system, such as the incorporation of a phase mask in extending the depth of field, which are not possible with a traditional camera. Simulations with a versatile virtual camera system that we have built verify the feasibility of these additions, and we also report the tolerance of the compound-eye system to variations in physical parameters, such as optical aberrations, that are inevitable in actual systems.
Word vectors and two kinds of similarity
Authors: Akira Utsumi, Daisuke Suzuki
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper examines what kind of similarity between words can be represented by what kind of word vectors in the vector space model. Through two experiments, three methods for constructing word vectors, i.e., LSA-based, cooccurrence-based and dictionary-based methods, were compared in terms of the ability to represent two kinds of similarity, i.e., taxonomic similarity and associative similarity. The result of the comparison was that the dictionary-based word vectors better reflect taxonomic similarity, while the LSA-based and the cooccurrence-based word vectors better reflect associative similarity.
Single-machine scheduling problems with start-time dependent processing time
Authors: Wen-Hung Kuo, Dar-Li Yang
Venue: Computers Mathematics with Applications (2007)

In this paper, we study the single-machine makespan scheduling problem with start-time dependent processing time. The objectives are to minimize the makespan and to minimize the sum of the kth powers of completion times. We prove that several cases are polynomially solvable under some restrictions of the parameters. In addition, these cases still remain polynomially solvable when the restriction of a certain parameter is relaxed from a positive integer to a real number.
Studying our inclusive practices: course experiences of students with disabilities
Authors: Katherine Deibel
Venue: ACM SIGCSE Bulletin (2007)

Students with disabilities can experience difficulty in receiving an education; inclusive education is an educational practice designed to ameliorate these problems. This paper presents the design for a study of the current inclusivepractices in computer science courses. Challenges in studying the experiences of disabled students are discussed, and a methodology using semi-structured interviews and grounded theory is developed to address these difficulties. A pilot study involving students taking their first computing courses is also described.
Detection and estimation of soliton signals
Authors: A. C. Singer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Soliton solutions to nonlinear wave equations have been recently proposed as signaling waveforms in a variety of communication contexts. One such system modulates the relative positions or amplitudes of multiple solitons generated by a nonlinear ladder circuit. At the receiver, there are inherent difficulties in the problems of parameter estimation and detection of soliton signals due to the nonlinear coupling imposed by the soliton dynamics. We demonstrate that the ladder circuit can act as a tuned receiver for the component solitons, naturally decoupling them so that the detection and estimation problems can be solved with standard techniques. We develop robust and asymptotically efficient algorithms for maximum likelihood parameter estimation and present a technique for generalized likelihood ratio test detection.
Engineering concepts in the high school classroom: the Dartmouth/Thayer problem-solving methods
Authors: C. B. Muller, J. P. Collier
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

In the early 1960s, the introductory course in engineering offered at Dartmouth's Thayer School of Engineering was re-designed to focus on the introduction and implementation of problem-solving strategies used by engineers in practice. In 1990, having determined that this course would find great interest among K-12 educational practitioners, we encapsulated it into a program for high school science and math teachers. "Engineering Concepts for the High School Classroom" includes an intensive summer workshop, post-workshop consultation and communication with Thayer School staff and other past participants, and materials development. The program offers teachers a framework wherein their students develop problem-solving skills requiring critical thinking, communication and teamwork. Within this framework, students are given the opportunity to define their own problems and develop original solutions to those problems. They make testable predictions and analyze test results, encounter the real world in the search for answers, take into account ideas from a variety of disciplines, and communicate their findings both in a traditional written format and orally to a review board composed of professionals in the field. As students develop new skills and learn to trust their own judgment, they also accomplish highly technical tasks, giving them solid expertise in their field of inquiry. This paper describes the program and its method provides examples of high school classroom results, and discusses its dissemination beyond Dartmouth through workshops composed and run by past participants in this program.
Interference of Mesoscopic Particles: Quantum&mdash;Classical Transition
Authors: P. Facchi, T. Yoneda, S. Pascazio
Venue: Open Systems Information Dynamics (2007)

We analyze the double slit interference of a mesoscopic particle. We calculate the visibility of the interference pattern in the far field case, introduce a characteristic temperature that defines the onset to decoherence and scrutinize the conditions that must be satisfied for an interference experiment to be possible.
Profit maximization and risk minimization in semi-Markovian networks
Authors: E. A. Lebedev, I. A. Makushenko
Venue: Cybernetics and Systems Analysis (2007)

The problem of profit maximization and risk minimization under stationary conditions is considered for multichannel semi-Markovian networks. Systems of integral equations that describe data handling and profit accumulation in the network are subjected to asymptotic analysis. The objective functions of the optimization problems are expressed explicitly in terms of network parameters.
Characterizing Genres of Web Pages: Genre Hybridism and Individualization
Authors: Marina Santini
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

When dealing with genres of web pages, there are two important aspects to be taken into account. On the one hand, the web is fluid, unstable and fast-paced. On the other hand, genres on the web are instantiated in web pages, which are a complex type of document, more composite and unpredictable than paper documents. These two aspects are interwoven and often result in classification hurdles. In this paper, I suggest analyzing these classification problems in terms of two broad textual phenomena: genre hybridism and individualization. The identification of these two phenomena helps pinpoint the range of flexibility that an automatic classification system should have. More precisely, genre hybridism accounts for multi-genre variation within the individual web page, while individualization refers to absence of any recognized genre in a web page. In a few words, the aim of this paper is to show that web pages need a zero-to-multi-genre classification scheme, i.e. a scheme that allows zero genre or multi-genre classification, in addition to the traditional single-genre classification.
What do you do when your students want to lead?
Authors: K. Bester
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Engineering students in the NSF-sponsored foundation coalition (FC) program at the University of Alabama formed a student coalition team "to help provide organization, communication, and support to the students of the coalition". The impetus for the formation of the student coalition team came from students, not faculty. This paper describes the student coalition team and explores how the structure of the foundation coalition program at the University of Alabama, primarily through enhanced student-student, faculty-student, and faculty-faculty interaction and communication, helped to create an environment which gave rise to the student coalition team.
Road Travel Time Information on VMS and Traffic Congestion
Authors: Brigitte Cambon de Lavalette, Charles Tijus, Sebastien Poitrenaud Christine Leproux
Venue: Proceedings of the Third International Conference on Wireless and Mobile Communications (2007)

Some years ago, progress in road telematics had made it possible to introduce time travel information in real time on VMS devices. Such information can lead road users to avoid congested areas as well as to waiting in a better condition for the end of the congestion. In a way, they increase congestion, in another way, they reduce it. Our research aimed at explaining the reasons why some people behave in a way and another one in. We assumed that travel time messages may be interpreted from several points of view, depending on driver knowledges in memory, experience and will, and as a result, the decision taken. An enquiry on a group of drivers aimed at analysing mental activity involved in decision taking process will be presented.
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
Authors: Gregory Chockler, Roie Melamed, Yoav Tock, Roman Vitenberg
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. SpiderCast is designed to effectively tread the balance between average overlay degree and communication cost of event dissemination. It employs a novel coverage-optimizing heuristic in which the nodes utilize partial subscription views (provided by a decentralized membership service) to reduce the average node degree while guaranteeing (with high probability) that the events posted on each topic can be routed solely through the nodes interested in this topic (in other words, the overlay is topic-connected). SpiderCast is unique in maintaining an overlay topology that scales well with the average number of topics a node is subscribed to, assuming the subscriptions are correlated insofar as found in most typical workloads. Furthermore, the degree grows logarithmically in the total number of topics, and slowly decreases as the number of nodes increases. We show experimentally that, for many practical work-loads, the SpiderCast overlays are both topic-connected and have a low per-topic diameter while requiring each node to maintain a low average number of connections. These properties are satisfied even in very large settings involving up to 10,000 nodes, 1,000 topics, and 70 subscriptions per-node, and under high churn rates. In addition, our results demonstrate that, in a large setting, the average node degree in SpiderCast is at least 45% smaller than in other overlays typically used to support decentralized pub/sub communication (such as e.g., similarity-based, rings-based, and random overlays).
A robust algorithm for fusing noisy depth estimates using stochastic approximation
Authors: A. K. R. Chowdhury
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The problem of structure from motion (SFM) is to extract the three-dimensional model of a moving scene from a sequence of images. Most of the algorithms which work by fusing the two-frame depth estimates (observations) assume an underlying statistical model for the observations and do not evaluate the quality of the individual observations. However, in real scenarios, it is often difficult to justify the statistical assumptions. Also, outliers are present in any observation sequence and need to be identified and removed from the fusion algorithm. We present a recursive fusion algorithm using the Robbins-Monro stochastic approximation (RMSA) which takes care of both these problems to provide an estimate of the real depth of the scene point. The estimate converges to the true value asymptotically. We also propose a method to evaluate the importance of the successive observations by computing the Fisher information (FI) recursively. Though we apply our algorithm in the SFM problem by modeling of a human face, it can be easily adopted to other data fusion applications.
A simple and extensible graphical debugger
Authors: David R. Hanson, Jeffrey L. Korn
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

deet is a simple but powerful debugger for ANSIC and Java. It differs from conventional debuggers in that it is machine-independent, graphical, programmable, distributed, extensible, and small. Low-level operations are performed by communicating with a "nub," which is a small set of machine-dependent functions that are embedded in the target program at compile-time, or are implemented on top of existing debuggers. deet has a set of commands that communicate with the target's nub. The target and deet communicate by passing messages through a pipe or socket, so they can be on a different machines. deet is implemented in tksh, an extension of the Korn shell that provides the graphical facilities of Tcl/Tk. Users can browse source files, set breakpoints, watch variables, and examine data structures by pointing and clicking. Additional facilities, like conditional breakpoints, can be written in either Tcl or the shell. Most debuggers are large and complicated, deet is less than 1,500 lines of shell plus a few hundred lines of machine-specific nub code. It is thus easy to understand, modify, and extend. We describe an implementation of the nub API for Java and an implementation that is layered on top of gdb. We have also implemented a version of gdb using the nub API, which demonstrates the modularity of the design.
Multi-port interconnection networks for radix-R algorithms
Authors: J. H. Takala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In array processors, complex data reordering is often needed to realize the interconnection topologies between the computational nodes in algorithms. Several important algorithms, e.g., discrete trigonometric transforms and Viterbi decoding, can be represented in a radix-R form where the principal topology is stride by R permutation. A general factorialization of stride permutations is derived, which can be mapped onto register-based structures for constructing area-efficient multi-port interconnection networks. The networks can be modified to support several stride permutations and sequence sizes.
Dominating Set based Overhead Reduction for Broadcast Authentication in Large Sensor Networks
Authors: Qijun Gu, Jawad Drissi
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In an earlier work [6], a localized broadcast authentication protocol was proposed to reduce verification delay in a large sensor network via using a few trusted nodes to divide sensor nodes into several sub areas and coordinate broadcast authentication in the sub areas. However, further study shows that the delay reduction is at the expense of increasing broadcast overhead due to updating localization information. Hence, the protocol in deployment can consume more energy of sensor nodes. To address the problem, we propose LD-TESLA to incorporate dominating nodes in broadcast authentication to eliminate redundant broadcast packets. The simulation illustrates that LD-TESLA can achieve significant reduction of broadcast overhead as well as verification delay. Compared with previous broadcast authentication protocols, LD-TESLA can save around 40% broadcast overhead.
Assertion-based power/performance analysis of network processor architectures
Authors: J. Yu, W. Wu, X. Chen, H. Hsieh, J. Yang
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Network processors (NPUs) have emerged as successful platforms to provide both high performance and flexibility in building powerful routers. With the scaling of technology and higher requirements on performance and functionality, power dissipation is becoming one of the major design considerations in NPU development. In this paper, we present an assertion-based methodology for system-level power/performance analysis of network processor designs, which can help designers choose the right architecture features and low power techniques. We write power and performance assertions, based on logic of constraints. Trace checkers and simulation monitors are automatically generated to analyze the power and performance characteristics of the network processor model. Furthermore, we apply a low power technique, dynamic voltage scaling (DVS), to the network processor model, and explore their pros and cons with the assertion-based analysis technique. We demonstrate that the assertion-based methodology is useful and effective for system level power/performance analysis.
Composite Phase PDF in Gamma Shadowed Nakagami Fading Channel
Authors: I. M. Kostić
Venue: Wireless Personal Communications: An International Journal (2007)

This paper presents a new Fourier series form probability density function (PDF) for the phase of the received signal over gamma shadowed Nakagami-m fading channel with additive Gaussian noise. This PDF is further used to evaluate the average symbol-error probability of M-ary CPSK. An alternative new closed-form expression for bit error-rate of binary CPSK is also derived and numerically compared with the corresponding result based on the Fourier series form phase PDF. We show that the two expressions are indeed numerically equivalent.
An Implementation and Experimentation of a Composite Video Streaming
Authors: Kaoru Sugita, Masao Yokota
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, we propose a live video streaming system based on virtual reality technologies for intuitive interaction among people remotely located. This system is one kind of sever-client system and can provide remote users with virtual 3D audiovisual fields in real time via a very high-speed network. The server captures audio and video data from its clients, compiles them into one 3D audiovisual scene at a virtual conference and broadcasts it over the clients. At the present stage, our system captures 2 videos and creates one 3D video at a time. Our system can play 3D audiovisual contents on Windows XP systems as well as on CAVE systems. Currently, our implementation can play the 3D video contents about 12 fps on both systems.
Stochastic-algebraic wideband LSF quantization
Authors: S. Ragot
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper describes a fixed-rate quantizer using algebraic techniques as well as conventional stored codebooks to represent the wideband line spectral frequencies (LSF). It is based on two-stage split vector quantization with random and lattice codebooks in the first and second stage, respectively. We investigate the use of variable bit allocation in lattice quantization in order to capture outliers and reduce the overload distortion in spectral quantization, particularly for non-speech signals. Experimental results show that a variable bit allocation in split quantization yields performances slightly better than a fixed allocation at the same rate.
The optimal solutions to the continuous and discrete-time versions of the Hirschman uncertainty principle
Authors: V. DeBrunner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We have previously developed an uncertainty measure that is suitable for finitely-supported (N samples) discrete-time signals. A specific instance of our measure has been termed the "discrete Hirschman (1957) uncertainty principal" in the literature, and we have adopted this terminology for our more general measure. We compare the optimal signals of this discrete version to the already determined optimal signals of the (continuous-time) Hirschman uncertainty principal. From our comparison, we conclude that a basic premise in signal processing, that if we sample densely enough, the discrete-time case directly corresponds to the continuous-time case, is not correct in this instance. The arithmetic of N, which seems to have no analog in continuous time, is crucial to the construction of the Hirschman optimal discrete representation. We suggest that more work in this important area be performed to determine what impact this has, and to find out how widespread this problem may be.
From Functional Programs to Interaction Nets via the Rewriting Calculus
Authors: Horatiu Cirstea, Germain Faure, Maribel Fernández, Ian Mackie, François-Régis Sinot
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We use the @r-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the @r-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, where pattern-matching and 'traditional'@b-reduction can proceed in parallel without overheads.
Performance Evaluation of Autonomous Clustering for Hierarchical Routing Protocols in Mobile Ad Hoc Networks
Authors: Tomoyuki Ohta, Naoyoshi Murakami, Yoshiaki Kakuda
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In mobile ad hoc networks, along with the increased network size, the clustering scheme becomes more important technique to efficiently manage the network and utilize the network resources for the hierarchical routings based on the clustering scheme. Therefore, we have proposed the autonomous clustering for mobile ad hoc networks. The main feature of the autonomous clustering is that each cluster maintains a multihop cluster structure. This paper shows the effectiveness of the autonomous clustering by investigating that the autonomous clustering and 1-hop clustering have an influence on the hierarchical routings.