ppxscal/embedding_network huggingface dataset:
Robust Auto-Calibration from Pedestrians
Authors: Imran Junejo, Hassan Foroosh
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

The knowledge of camera intrinsic and extrinsic parameters is useful, as it allows us to make world measurements. Unfortunately, calibration information is rarely available in video surveillance systems and it is difficult to obtain once the system is installed. Auto-calibrating cameras using moving objects (humans) has recently attracted a lot of interest. Two methods are proposed by Lv-Nevatia(2002) and Krahnstoever-Mendonca(2005). The inherent difficulty of the problem lies in the noise that is generally present in the data. We propose a robust and a general linear solution to the problem by adopting a formulation different from the existing methods. The uniqueness of formulation lies in recognizing two harmonic homologies present in the geometry obtained by observing pedestrians, and then using properties of these homologies to obtain linear constraints on the unknown camera parameters. Experiments with synthetic as well as on real data are presented - indicating the practicality of the proposed system.
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
Authors: Jie Wu, Mihaela Cardei, Fei Dai
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

We propose a notion of an extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NP-completeness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are nontrivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.
Detecting and Isolating Malicious Routers
Authors: Alper Tugay Mizrak, Yu-Chung Cheng Keith Marzullo, Stefan Savage
Venue: IEEE Transactions on Dependable and Secure Computing (2006)

Network routers occupy a unique role in modern distributed systems. They are responsible for cooperatively shuttling packets amongst themselves in order to provide the illusion of a network with universal point-to-point connectivity. However, this illusion is shattered—as are implicit assumptions of availability, confidentiality, or integrity—when network routers are subverted to act in a malicious fashion. By manipulating, diverting, or dropping packets arriving at a compromised router, an attacker can trivially mount denial-of-service, surveillance, or man-in-the-middle attacks on end host systems. Consequently, Internet routers have become a choice target for would-be attackers and thousands have been subverted to these ends. In this paper, we specify this problem of detecting routers with incorrect packet forwarding behavior and we explore the design space of protocols that implement such a detector. We further present a concrete protocol that is likely inexpensive enough for practical implementation at scale. Finally, we present a prototype system, called Fatih, that implements this approach on a PC router and describe our experiences with it. We show that Fatih is able to detect and isolate a range of malicious router actions with acceptable overhead and complexity. We believe our work is an important step in being able to tolerate attacks on key network infrastructure components.
Equi-distribution over descent classes of the hyperoctahedral group
Authors: Ron M. Adin, Francesco Brenti, Yuval Roichman
Venue: Journal of Combinatorial Theory Series A (2006)

A classical result of MacMahon shows that the length function and the major index are equidistributed over the symmetric group. Foata and Schützenberger gave a remarkable refinement and proved that these parameters are equi-distributed over inverse descent classes, implying bivariate equi-distribution identities. Type B analogues of these results, refinements and consequences are given in this paper.
Hyperelliptic curves encryption combined with block codes for Gaussian channel: Research Articles
Authors: I. Jirón, I. Soto, R. Carrasco, N. Becerra
Venue: International Journal of Communication Systems (2006)

In this paper, a new cryptographic system is constructed using a combination of a hyperelliptic curve of genus g = 2 over the Galois field GF(2n) and a Reed&ndash;Solomon code (N, K) over the Galois field GF(2m) and this system uses a smaller key than the elliptic curves cryptosystem and the Rivest, Shamir, and Adleman cryptosystem. The design criterion for the combination can be expressed as the data compression condition and addressing capability of the code. In addition, the system performance is compared with other systems; extraordinary improvements of 8 and 16.5 dB can be obtained for a BER = 10-5, when compared with binary phase shift keying and differential chaos shift keying, respectively. This system has a polynomial complexity, which depends on data length and the number of operations in GF(2n). Copyright &copy; 2005 John Wiley & Sons, Ltd.
Proceeding from the 2006 workshop on ns-2: the IP network simulator
Venue: WNS2; Vol. 202 (2006)

In recent years, the ns-2 simulator has become one of the de facto standards (if not the standard) for the simulation of packet-switched networks. It is widely used in both academia and industry as a means of designing, testing and evaluating new and existing protocols and architectures, and it is also a very useful tool for educational purposes.There is a huge volume of research work done with ns-2, which has appeared in many leading networking conferences and journals. However, in spite of the importance of ns-2 for the networking community, it seems that so far there has been no venue devoted to presenting, discussing and publishing research work on the simulator itself. This is the main rationale behind this Workshop on ns-2 (WNS2).This first edition of the Workshop on ns-2 (WNS2) is a one-day, singletrack event held on October 10, 2006, in conjunction with VALUETOOLS, the First International Conference on Performance Evaluation Methodologies and Tools. The program of WNS2 covers a few select topics of interest to the ns-2 research community, such as extending and improving the wireless network simulation capabilities in ns-2, and it also offers a glimpse of things to come with the upcoming ns-3 simulation tool.The workshop received 35 full-paper submissions, of which only 10 papers were accepted after a strict reviewing process involving both the technical program committee members and external reviewers.
Semantic Analysis and Retrieval of Sports Video
Authors: Jun-qing Yu, Yun-feng He, Kai Sun, Zhi-fang Wang, Xiang-mei Wu
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

For bridging the semantic gap, specific-domain approaches are employed in our system, a fully automatic and computationally efficient framework for the indexing, browsing and retrieval of sports video is proposed. A hierarchical organizing model based-on MPEG-7 is introduced to effectively represent highlevel and low-level information in sports video. The model's attributes have been instantiated through a series of multi-modal processing approaches for soccer video. To effectively retrieve highlight clip of sport video, adaptive abstraction is designed based on the excitement time curve, and an XML-based query scheme for semantic search and retrieval is proposed based on the hierarchical model. We develop a robust detection algorithm to automatically locate the field region of sports video based on low-level color features. An effective mid-level shot classification algorithm is proposed based on spatial features and the coarseness of human figures. For retrieval, XQuery, a XML query language, is employed in the proposed querying framework. The proposed framework employs visual, audio, and cinematic features, and can be scalable to different preferences and requirements. Its efficiency, effectiveness, and the robustness of the proposed framework are demonstrated over our extensive experiments.
A Study of the Web-based Learning System for Supply Chain Management Course Teaching
Authors: I-Fan Liu, Meng Chang Chen, Yeali Sun
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This research mainly investigates how to utilize Internet technology to assist the teaching of "Supply Chain Management". It uses the related web-based learning theories as the foundation to develop a webbase learning system. Researchers use observations, questionnaires, and learner portfolio records to collect data for quantitative and qualitative analyses. The major findings of this research are as follow: 1. Through the use of this web-based learning system, students show obvious improvement in learning, and it also serve as supplement for the insufficiency of traditional classroom learning. 2. Among peer students, there shows a high rate of interaction. 3. From verification, the design of this web-based learning system meets the related learning theories.
Trusted grid and p2p computing with security binding and reputation aggregation
Authors: Kai Hwang
Venue:  (2005)

This dissertation investigates the trust and security issues of computational Grids and Peer-to-Peer systems. Realistic platforms for these two distributed computing paradigms are facing security threats from network attacks and system vulnerability. Both systems demand high degree of resource sharing through trust establishment among the peers or among the owning organizations. P2P applications are facing a serious challenge of distrust among the peers who are strangers to each other. In Grid systems, user jobs dispatched across the Grid sites are subject to failures or delays caused by insecure site conditions. To meet the challenges, this thesis provides trust models, defense mechanisms, reputation systems, and security infrastructure to assure security in Grid and P2P systems. A coherent model is provided for trust establishment and security enforcement in distributed systems. The model is based on fuzzy logic inferences. A distributed trust and reputation aggregation scheme is developed through fuzzification and integration of security attributes. To map large-scale applications onto wide-area computational Grids, a security-binding scheme is developed through trust integration across Grid sites. The security binding is achieved by periodic exchange of site security information or peer reputations and matchmaking to satisfy the user job demands. I propose three risk-resilient job scheduling strategies: preemptive, replication, and delay-tolerant. Simulation results show that risk resilient heuristics outperform the traditional heuristic scheduling algorithms. A fuzzy reputation aggregation system---FuzzyTrust---was developed for establishing the mutual trust between peers in P2P transaction applications. FuzzyTrust was built over DHT-based overlay networks. Fuzzy logic inferences were introduced to perform local trust calculation and global reputation aggregation. DHT based implementation offers fast reputation dissemination. The FuzzyTrust system was evaluated with simulation experimental results. In summary, this thesis pushes the state of the art in Trusted Grid and P2P computing and secure resource mapping for large-scale workloads. The research findings, security binding techniques, FuzzyTrust reputation systems, and reported experimental results should be useful to those who work on distributed supercomputing architecture and scalable P2P applications.
Adapting pivoted document-length normalization for query size: Experiments in Chinese and English
Authors: Tze Leung Chung, Robert Wing Pong Luk, Kam Fai Wong, Kui Lam Kwok, Dik Lun Lee
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2006)

The vector space model (VSM) is one of the most widely used information retrieval (IR) models in both academia and industry. It was less effective at the Chinese ad hoc retrieval tasks than other retrieval models in the NTCIR-3 evaluation workshop, but comparable to those in the NTCIR-4 and NTCIR-5 workshops. We do not know whether the lower level performance was due to the VSM's inherent deficiencies or to a less effective normalization of document length. Hence we evaluated the VSM with various pivoted normalizations of document length using the NTCIR-3 collection for confirmation. We found that VSM's retrieval effectiveness with pivoted normalization was comparable to other competitive retrieval models (for example, 2-Poisson), and that VSM's retrieval speed with pivoted normalization was similar to competitive retrieval models (2-Poisson). We proposed a novel adaptive scheme that automatically estimates the (near) best parameters for pivoted document-length normalization based on query size; the new normalization is called adaptive pivoted document-length normalization. This scheme achieved good retrieval effectiveness, sometimes for short (title) queries and sometimes for long queries, without manually adjusting parameter values. We found that unique, adaptive pivoted normalization can enhance fixed pivoted normalizations for different test collections (TREC-5 and TREC-6). We also evaluated the VSM with the adaptive pivoted normalization using the pseudo-relevance feedback (PRF) and found that this type of VSM performs similarly to the competitive retrieval models (2-Poisson) with PRF. Hence, we conclude that the VSM with unique (adaptive) pivoted document-length normalization is effective for Chinese IR and that its retrieval effectiveness is comparable to that of other competitive retrieval models with or without PRF for the reference test collections used in this evaluation.
Reflections on WebGuide: seven issues for the next generation of collaborative knowledge-building environments
Authors: Gerry Stahl
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

A number of software environments have been developed as media to support collaborative knowledge building, typically featuring a Web-based threaded discussion facility. We have recently developed such a system, known as WebGuide. The distinctive feature of this system is support for structuring collaboration and knowledge construction with personal, group and comparison perspectives. While piloting WebGuide in a middle school classroom and a graduate seminar, we encountered a variety of issues related to both software design and classroom practices. Some of these issues are common to experiences with similar systems and some have to do specifically with support for perspectives. In this paper we review seven of the major issues encountered with an eye toward suggestions for future work.
2000 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS (Cat. No.00EX422)
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The following topics are dealt with: performance analysis of systems of software; real time systems; workload characterization; multiprocessor systems; World Wide Web enabled software and systems; trace generation; and disk subsystems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
biXid: a bidirectional transformation language for XML
Authors: Shinya Kawanaka, Haruo Hosoya
Venue: ACM SIGPLAN Notices (2006)

Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such formats. Existng XML transformation languages, such as XSLT and XDuce, are unsatisfactory for this purpose since we would have to write, e.g., two programs for the forward and the backward transformations in case of two formats, incur high developing and maintenance costs.This paper proposes the bidirectional XML transformation language biXid, allowing us to write only one program for both directions of conversion. Our language adopts a common paradigm programming-by-relation, where a program defines a relation over documents and transforms a document to another in a way satisfying this relation. Our contributions here are specific language features for facilitating realistic conversions whose target formats are loosely in parallel but have many discrepancies in details. Concretely, we (1) adopt XDuce-style regular expression patterns for describing and analyzing XML structures, (2) fully permit ambiguity for treating formats that do not have equivalent expressivenesses, and (3) allow non-linear pattern variables for expressing non-trivial transformations that cannot be written only with linear patterns, such as conversion between unordered and ordered data.We further develop an efficient evaluation algorithm for biXid, consisting of the "parsing" phase that transforms the input document to an intermediate "parse tree" structure and the "unparsing" phase that transforms it to an output document. Both phases use a variant of finite tree automata for performing a one-pass scan on the input or the parse tree by using a standard technique that "maintains the set of all transitable states." However, the construction of the "unparsing" phase is challenging since ambiguity causes different ways of consuming the parse tree and thus results in multiple possible outputs that may have different structures.We have implemented a prototype system of biXid and confirmed that it has enough expressiveness and a linear-time performance from experiments with several realistic bidirectional transformations including one between vCard-XML and ContactXML.
Advanced programming language design in enterprise software: a lambda-calculus theorist wanders into a datacenter
Authors: Chet Murthy
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

Enterprise software systems automate the business processes of most nontrivial organizations in the world economy. These systems are immensely complex, and their function is critical to our living standards and everyday lives. Their design, implementation, and maintenance occupies many thousands of programmers and engineers, who work in what are aptly called the "COBOL dungeons"1 of the IT sector. These systems have persisted, growing by accretion -- some for decades; there are enterprise systems in existence today whose original and even subsequent authors are retired or deceased. Such extraordinarly old, multi-layered systems might appear to be the last place to apply avante-garde techniques, but in fact, they are extremely promising candidates, and for reasons directly connected to their history and structure.In this talk we take a tour of several deployed enterprise software systems, and demonstrate that the appropriate application of methods from functional programming can and does in fact yield dramatic performance improvements and thus commercial advan-tage in the design and implementation of enterprise software. This concrete application is an instance of a general plan for the application of advanced programming language design and analysis methods, to the problem of improving enterprise software. It is the thesis of this talk that to a great extent, it is in enterprise software that advanced PL techniques can find their most advantageous application. This talk literally breaks no new ground in PL research: every technique discussed is nearly two decades old, and our goal is to introduce PL researchers to what we feel is an ideal target for their work.
Probe Distribution Techniques to Profile Events in Deployed Software
Authors: Madeline Diep, Myra Cohen, Sebastian Elbaum
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Profiling deployed software provides valuable insights for quality improvement activities. The probes required for profiling, however, can cause an unacceptable performance overhead for users. In previous work we have shown that significant overhead reduction can be achieved, with limited information loss, through the distribution of probes across deployed instances. However, existing techniques for probe distribution are designed to profile simple events. In this paper we present a set of techniques for probe distribution to enable the profiling of complex events that require multiple probes and that share probes with other events. Our evaluation of the new techniques indicates that, for tight overhead bounds, techniques that produce a balanced event allocation can retain significantly more field information.
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
Authors: Tsz-Chiu Au, Dana Nau
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "cooperate" action will accidentally be changed into a "defect" action and vice versa. Tit-For-Tat and other strategies that do quite well in the ordinary (non-noisy) IPD can do quite badly in the Noisy IPD.This paper presents a technique called symbolic noise detection, for detecting whether anomalies in player's behavior are deliberate or accidental. The key idea is to construct a model of the other agent's behavior, and watch for any deviation from this model. If the other agent's next action is inconsistent with this model, the inconsistency can be due either to noise or to a genuine change in their behavior; and we can often distinguish between two cases by waiting to see whether this inconsistency persists in next few moves.We entered several different versions of our strategy in the 2005 Iterated Prisoner's Dilemma competition, in Category 2 (noisy environments). Out of the 165 contestants in this category, our programs consistently ranked among top ten. The best of our programs ranked third, and it was beaten only by two "master-slave strategy" programs that each had a large number of "slave" programs feeding points to them.