ppxscal/embedding_network huggingface dataset:
Compensation of partly photographed page-images using 3-D shape information
Authors: T. Nakajima
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We propose a method in order to compensate contortion of page-image which is caused by photographing a book opened and placed face-up (two pages opposite each other state) on the stage just above. For compensating contortion 3-D shape information of the page surface is necessary to apply some geometrical adjustment. To obtain much higher resolution image a page needs to be photographed partly, in this situation each neighboring image necessarily has overlap area for the purpose of joining together. We put characters existing in an overlap area to good use for seeking of corresponding points in the stereo method by which 3-D shape information (3-D coordinate of corresponding points) of book surface can be obtained. If the assumption that no change of the shape of page cross section along the binding are satisfied, satisfactory compensated images were obtained and joining them together was well performed.
Solution of fuzzy matrix games: An application of the extension principle: Research Articles
Authors: Shiang-Tai Liu, Chiang Kao
Venue: International Journal of Intelligent Systems (2007)

Conventional game theory is concerned with how rational individuals make decisions when they are faced with known payoffs. This article develops a solution method for the two-person zero-sum game where the payoffs are only approximately known and can be represented by fuzzy numbers. Because the payoffs are fuzzy, the value of the game is fuzzy as well. Based on the extension principle, a pair of two-level mathematical programs is formulated to obtain the upper bound and lower bound of the value of the game at possibility level &agr;. By applying a dual formulation and a variable substitution technique, the pair of two-level mathematical programs is transformed to a pair of ordinary one-level linear programs so they can be manipulated. From different values of &agr;, the membership function of the fuzzy value of the game is constructed. It is shown that the two players have the same fuzzy value of the game. An example illustrates the whole idea of a fuzzy matrix game. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 891&ndash;903, 2007.
Adaptive filtering algorithms and alpha stable signals
Authors: E. Masry
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We consider the problem of optimal FIR linear and regression filters for jointly stationary symmetric alpha stable processes with index alpha greater than one. We then consider the signed-error and sign-sign adaptive filtering algorithms and provide various convergence results for the signal and tap weights estimation errors.
High coverage detection of input-related security facults
Authors: Eric Larson, Todd Austin
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Improperly bounded program inputs present a major class of program defects. In secure applications, these bugs can be exploited by malicious users, allowing them to overwrite buffers and execute harmful code. In this paper, we present a high coverage dynamic technique for detecting software faults caused by improperly bounded program inputs. Our approach is novel in that it retains the advantages of dynamic bug detection, scope and precision; while at the same time, relaxing the requirement that the user specify the input that exposes the bug. To implement our approach, inputs are shadowed by additional state that characterize the allowed bounds of input-derived variables. Program operations and decision points may alter the shadowed state associated with input variables. Potentially hazardous program sites, such as an array references and string functions, are checked against the entire range of values that the user might specify. The approach found several bugs including two high-risk security bugs in a recent version of OpenSSH.
The Impact of the Mobility Model on Delay Tolerant Networking Performance Analysis
Authors: Muhammad Abdulla, Robert Simon
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. The topological impairments experienced within a DTN pose unique challenges for designing effective DTN routing protocols. For an important class of DTNs nodes depend on their mobility to carry message to the destination. It is therefore essential to understand the impact of commonly-used mobility models on performance analysis of DTN routing schemes. This paper shows how the underlying statistical properties of a frequently used mobility model can be used to enhance our understanding of DTN simulation results. Using these results we also analyze several DTN routing techniques, including direct transmission, Spray and Wait, and a novel core-assisted routing schemes.
Dynamic Route Selection Policy Protocol in MANET
Authors: Fang Jing, R. S. Bhuvaneswaran, Yoshiaki Katayama, Naohisa Takahashi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Multipath route selection policy has been studied in the context of mobile ad hoc networks (MANET). According to the utilization of multiple routes these selection policies have been categorized into two parts: best routing policy and load balancing policy. Many ad hoc routing protocols are based on best routing policy, such as the fastest or the shortest routing policy with local traffic optimization. However, the lack of global perspective might increase congestion resulting in damage of the local traffic. On the other hand, load balancing policy protocols try to avoid traffic congestion by equalizing traffic load of the multipath. But these load balancing policy protocols lost many traffic chances and cause low traffic performance on special condition. In this paper, we illustrate the adverse impact of these two types of route selection policy protocols on mobile ad hoc network and propose a new routing protocol, which switches the route selection policy with consideration of the dynamic network condition. Our protocol is evaluated with Omnet simulator. The simulation results show that the proposed scheme offers a high packet delivery ratio and low packet overhead ratio than other protocols.
An Operational Semantics of an Event-Driven System-Level Simulator
Authors: Xiaoqing Peng, Huibiao Zhu, Jifeng He, Naiyong Jin
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

As a system-level modelling language, SystemC possesses some new and interesting features such as delayed notifications, notification cancelling, notification overriding and delta-cycle. It is challenging to formalise SystemC. In this paper, we first select a kernel subset of SystemC and study its operational semantics. Based on the operational semantics we define a bisimulation relation, from which program equivalence is explored. Finally, we present a set of algebraic laws for the subset language, which can be proved based on the operational semantics model via bisimulation.
Cognitive artifacts: an art-science engagement
Authors: Derek Lomas
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

'Cognitive Artifacts' is a theoretical framework that may allow a common evaluation of the impact of the products of science and art. Describes need for transformations of science that engage emotional, aesthetic, social and spiritual cognitive processes. Artist describes current work investigating 'Social Architectures.'.
IPOG: A General Strategy for T-Way Software Testing
Authors: Yu Lei, Raghu Kacker, D. Richard Kuhn, Vadim Okun, James Lawrence
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Most existing work on t-way testing has focused on 2-way (or pairwise) testing, which aims to detect faults caused by interactions between any two parameters. However, faults can also be caused by interactions involving more than two parameters. In this paper, we generalize an existing strategy, called In-Parameter-Order (IPO), from pairwise testing to t-way testing. A major challenge of our generalization effort is dealing with the combinatorial growth in the number of combinations of parameter values. We describe a t-way testing tool, called FireEye, and discuss design decisions that are made to enable an efficient implementation of the generalized IPO strategy. We also report several experiments that are designed to evaluate the effectiveness of FireEye.
Optimization of time and frequency resolution for radar transmitter identification
Authors: B. W. Gillespie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

An entirely new set of criteria for the design of kernels for time-frequency representations (TFRs) has been previously proposed. The goal of these criteria is to produce kernels (and thus, TFRs) which will enable accurate classification without explicitly defining, a priori, the underlying structure that differentiates individual classes. These kernels, which are optimized to discriminate among multiple classes of signals, are referred to as signal class-dependent kernels, or simply class-dependent kernels. Until now, our technique has utilized the Rihaczek TFR as the base representation, deriving the optimal smoothing in time and frequency from this representation. Here the performance of the class-dependent approach is investigated in relation to the choice of the base representation. Classifier performance using several base TFRs is analyzed within the context of radar transmitter identification. It is shown that both the Rihaczek and the Wigner-Ville distributions yield equivalent results, far superior to the short-time Fourier transform. In addition, a correlation reduction step is presented. This improves performance and extensibility of the class-dependent approach.
Failures in complex systems: case studies, causes, and possible remedies
Authors: Danny Kopec, Suzanne Tamang
Venue: ACM SIGCSE Bulletin (2007)

Computers are the pervasive technology of our time. As computers become critically tied to human life, it also becomes more important that interactions with them are under control. They are no longer a novelty, but are integrated into the fabric of our world, performing both high and low-level tasks. That is, computers may be used to eliminate heavy, redundant work and more sophisticated machines have been deployed to perform remote surgery or detect subterranean landmines in repopulated civilian areas. The increasing importance of computers in our lives means that it is essential that the design of computer systems incorporates techniques that can ensure reliability, safety, and security. This paper will examine technological mishaps involving the use of computers. This review will include notorious software bugs that have affected finance, communication, transit, defense, health and medicine and other systems or industries. The sequences and etiology of these "accidents" will be discussed as well as how catastrophes may be avoided in the future through lessons and practices based on artificial intelligence research.
A description and study of intermediate student programmer errors
Authors: Danny Kopec, Gavriel Yarmish, Patrick Cheung
Venue: ACM SIGCSE Bulletin (2007)

To date there has been considerable investigation into the study of novice programmer errors. The research has analyzed both syntactic and semantic errors. However, the next level of programmers, who make more sophisticated errors, the internmediate level programmers, have been somewhat neglected. In this paper, we focus on the nature of the errors which intermediate level programmers make. The basis of our study is the semantic approach. Here, we the study problems which require more difficult program constructs such as nested loops, arrays, recursion, and functions.
Efficient Query Evaluation in XML Information Subscription Systems
Authors: Keishi Tajima
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

In this paper, we propose two methods of improving the efficiency of query evaluation in XML information subscription systems, where the users register queries to the server, and they are evaluated periodically. First, we show a method of optimizing communication costs between client sites and the server sites. In information subscription systems, when a user registers many queries, the answers to those queries can be redundant. Therefore, sending those redundant answers separately to the client is not optimal. In our approach, the server sends a minimal-size view set that can answer all the original queries, and the client produces answers from it. We show algorithms for computing a minimal view set for given queries. Second, we show a method of improving the efficiency of query evaluation on the servers. In information subscription systems, registered queries are evaluated periodically, and only changes to the answers to those queries are notified to the users. We show a method of incrementally computing only changes to the answers to the given queries upon the updates of the database.
Totally corrective boosting algorithms that maximize the margin
Authors: Manfred K. Warmuth
Venue:  (2006)

We consider boosting algorithms which maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate these updates as minimizing the relative entropy subject to linear constraints. For example, AdaBoost can be interpreted as constraining the edge of the last hypothesis w.r.t. the updated distribution to be at most &gamma; = 0. In some sense, AdaBoost is "corrective" w.r.t. the last hypothesis. A cleaner boosting method is to be "totally corrective": the edges of all past hypotheses are constrained to be at most &gamma; where &gamma; is suitably adapted. Using new techniques, we prove the same iteration bounds for the totally corrective algorithms as for their corrective versions. Moreover with adaptive &gamma;, the totally corrective algorithms provably maximize the margin. The new techniques include the application of the Generalized Pythagorean Theorem of Bregman divergences and an inequality about relative entropies derived from Pinsker's inequality. We are able to prove iteration bounds for the totally corrective algorithms which optimize the relative entropy w.r.t. the initial or the last distribution as well as for totally corrective algorithms that use the binary relative entropy instead of the relative entropy. Experimentally, the totally corrective versions return smaller convex combinations of weak hypotheses than the corrective ones and are competitive with LP-Boost, a totally corrective boosting algorithm with no regularization, for which there is no iteration bound known.
Spectral Methods for 3-D Motion Segmentation of Sparse Scene-Flow
Authors: Diana Mateus, Radu Horaud
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

The progress in the acquisition of 3-D data from multicamera set-ups has opened the way to a new way of loking at motion analysis. This paper proposes a solution to the motion segmentation in the context of sparse scene flow. In particular, our interest focuses on the disassociation of motions belonging to different rigid objects, starting from the 3-D trajectories of features lying on their surfaces. We analyze these trajectories and propose a representation suitable for defining robust-pairwise similarity measures between trajectories and handling missing data. The motion segmentation is treated as graph multi-cut problem, and solved with spectral clustering techniques (two algorithms are presented). Experiments are done over simulated and real data in the form of sparse scene-flow; we also evaluate the results on trajectories from motion capture data. A discussion is provided on the results for each algorithm, the parameters and the possible use of these results in motion analysis.
PanoCAST: A Panoramic Multicasting System for Mobile Entertainment
Authors: Barnabas Takacs, Alex Beregszaszi, Gergely Komaromi-Meszaros
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper presents the design, architecture and implementation of a novel panoramic broadcasting system for Internet and mobile entertainment, where real-time images obtained with spherical camera are distributed to multiple viewers, each having their own respective perspective and interactive capabilities. The system, called PanoCAST (Panoramic Broadcasting), was designed to deliver telepresence to a mass media market. We discuss its overall architecture and present examples of its uses.
Low-end uniform hardness vs. randomness tradeoffs for AM
Authors: Ronen Shaltiel, Christopher Umans
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In 1998, Impagliazzo and Wigderson [18] proved a hardnessvs. randomness tradeoff for BPP in the uniform setting,which was subsequently extended to give optimal tradeoffs for thefull range of possible hardness assumptions by Trevisan and Vadhan [29] (in a slightly weaker setting). In 2003, Gutfreund,Shaltiel and Ta-Shma [11] proved a uniform hardness vs. randomness tradeoff for AM, but that result only worked on the "high-end" of possible hardness assumptions. In this work, we give uniform hardness vs. randomness tradeoffsfor AM that are near-optimal for the full range of possiblehardness assumptions. Following [11], we do this by constructing a hitting-set-generator (HSG) for AM with "resilient reconstruction." Our construction is a recursive variant of the Miltersen-Vinodchandran HSG [24], the only known HSG construction with this required property. The main new idea is to have the reconstruction procedure operate implicitly and locally on superpolynomially large objects, using tools from PCPs(low-degree testing, self-correction) together with a novel use ofextractors that are built from Reed-Muller codes [28, 26] for a sort of locally-computable error-reduction. As a consequence we obtain gap theorems for AM (and AM ∩ coAM) that state, roughly, that either AM (or AM ∩ coAM)protocols running in time t(n) can simulate all of EXP("Arthur-Merlin games are powerful"), or else all of AM (or AM ∩ coAM) can be simulated in nondeterministic time s(n) ("Arthur-Merlin games can be derandomized"), for a near-optimal relationship between t(n) and s(n). As in GST, the case of AM ∩ coAM yields a particularly clean theorem that is ofspecial interest due to the wide array of cryptographic and other problems that lie in this class.
Turbo codes for data compression and joint source-channel coding
Authors: Javier Garcia-Frias
Venue:  (2007)

We exploit the power of turbo-like codes (mainly turbo codes) in the fields of source coding and joint source channel coding, with the objective of achieving performance close to the theoretical limits. Turbo codes are well known for their near Shannon limit performance in noisy channels. However, those "random-like" codewords also allow for compression rates close to the theoretical limits when applied to source coding. Besides the particular case of single sources, we are more interested in the general case of compression and joint source channel coding of correlated sources, which is of interest in many practical applications such as sensor networks. Different correlation models between the sources and different channel environments (independent or multiple-access AWGN/fading channels) have been considered in this dissertation. The resulting performance is always very close to the theoretical limits. Moreover, the encoding process is independent for each source and the correlation model can be estimated in the decoder site without a priori knowledge. Especially for joint source-channel coding, the simplicity at the encoder sites facilitates the implementation of the proposed scheme in practical applications, and the use of a single encoder stage in each source prevents error propagation.
ER-EDF: A QoS Scheduler for Real-Time Embedded Systems
Authors: David Matschulat, Cesar A. M. Marcon, Fabiano Hessel
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

The increasing demand for embedded multimedia applications makes evident the need for end-to-end Quality of Service (QoS) provisioning. Particularly, operating systems, despite their location at end systems, switches or routers, must guarantee that resources under their control are adequately managed to fulfill the application requirements. This work proposes the implementation of QoS provisioning in real-time embedded systems scheduler. In order to achieve the end-to-end QoS, we propose the implementation of the control and management of QoS mechanisms in the operating system scheduler. The implementation of such mechanisms includes admission control and resource reservation, as well as process scheduling control and active monitoring of the delivered QoS. As a result, a new scheduling algorithm, named EREDF, is proposed and compared to previous scheduler solutions. This approach was validated through a set of benchmarks and we conclude that ER-EDF adds performance and simplified hard real-time support to realtime embedded applications.
Inclusive computer science education using a ready-made computer game framework
Authors: Joseph Distasio, Thomas Way
Venue: ACM SIGCSE Bulletin (2007)

Leveraging the prevailing interest in computer games among college students, both for entertainment and as a possible career path, is a major reason for the increasing prevalence of computer game design courses in computer science curricula. Because implementing a computer game requires strong programming skills, game design courses are most often restricted to more advanced computer science students, yet real game design involves a diverse and creative team. This paper reports on a ready-made game design and experimentation framework, implemented in Java, which makes game programming more widely accessible. This framework, called Labyrinth, enables students at all programming skill levels to participate in computer game design. We describe the architecture of the framework, and discuss programming projects suitable for a wide variety of computer science courses, from capstone to non-major.