ppxscal/embedding_network huggingface dataset:
A Design Principle for Coarse-to-Fine Classification
Authors: Sachin Gangaputra, Donald Geman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shared attributes and the hierarchical nature of the visual world. The basic structure is a nested representation of the space of hypotheses and a corresponding hierarchy of (binary) classifiers. In existing work, the representation is manually crafted. Here we introduce a design principle for recursively learning the representation and the classifiers together. This also unifies previous work on cascades and tree-structured search. The criterion for deciding when a group of hypotheses should be "retested" (a cascade) versus partitioned into smaller groups ("divide-and-conquer") is motivated by recent theoretical work on optimal search strategies. The key concept is the cost-to-power ratio of a classifier. The learned hierarchy consists of both linear cascades and branching segments and outperforms manual ones in experiments on face detection.
A basic stochastic network calculus
Authors: Yuming Jiang
Venue: ACM SIGCOMM Computer Communication Review (2006)

A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum-(virtual)-backlog-centric (m. b. c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service curve in the deterministic network calculus framework. With m. b. c stochastic arrival curve and stochastic service curve, various basic results are derived under the (min, +)algebra for the general case analysis, which are crucial to the development of stochastic network calculus. These results include (i)superposition of flows, (ii)concatenation of servers, (iii) output characterization, (iv)per-flow service under aggregation, and (v)stochastic backlog and delay guarantees. In addition, to perform independent case analysis, stochastic strict server is defined, which uses an ideal service process and an impairment process to characterize a server. The concept of stochastic strict server not only allows us to improve the basic results (i)-(v)under the independent case, but also provides a convenient way to find the stochastic service curve of a serve. Moreover, an approach is introduced to find the m.b.c stochastic arrival curve of a flow and the stochastic service curve of a server.
Social Software and the Emergence of Control
Authors: Jon Dron
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Social software, such as blogs, wikis, tagging systems and collaborative filters, treats the group as a first-class object within the system. Drawing from theories of transactional distance and control, this paper proposes a model of e-learning that extends traditional concepts of learner-teacher-content interactions to include these emergent properties of the group. It suggests that this feature of social software can facilitate an approach to e-learning that is qualitatively different from and capable of significantly augmenting traditional methods. It goes on to explore some of the dangers and issues that need to be addressed in order for this new model to fulfill its promise.
Evolving visual sonar: Depth from monocular images
Authors: Martin C. Martin
Venue: Pattern Recognition Letters (2006)

To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible interpretations, constraints are needed to eliminate ambiguity, and the most powerful constraints are domain specific. As an experiment in the automatic discovery and exploitation of constraints, genetic programming was used to find algorithms for obstacle detection. The algorithms are designed to be a replacement for sonar, returning the location of the nearest obstacle in a given direction. The evolved algorithms worked surprisingly well. Errors were largely transient. The algorithms generalized to both novel views of the office environment and to unseen obstacles. They were combined with a simple reactive wandering program originally written for sonar. The result exhibited good performance in an office environment, colliding only with obstacles outside the robot's field of view. Time to collision results and failure modes are presented. Code is available for download.
MUSTA: a multi-stage numerical flux
Authors: E. F. Toro
Venue: Applied Numerical Mathematics (2006)

Numerical methods for conservation laws constructed in the framework of finite volume and discontinuous Galerkin finite elements require, as the building block, a monotone numerical flux. In this paper we present some preliminary results on the MUSTA approach [E.F. Toro, Multi-stage predictor-corrector fluxes for hyperbolic equations, Technical Report NI03037-NPA, Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK, 17th June, 2003] for constructing upwind numerical fluxes. The scheme may be interpreted as an un-conventional approximate Riemann solver that has simplicity and generality as its main features. When used in its first-order mode we observe that the scheme achieves the accuracy of the Godunov method used in conjunction with the exact Riemann solver, which is the reference first-order method for hyperbolic systems. At least for the scalar model hyperbolic equation, the Godunov scheme is the best of all first-order monote schemes, it has the smallest truncation error. Extensions of the scheme of this paper are realized in the framework of existing approaches. Here we present a second-order TVD (TVD for the scalar case) extension and show numerical results for the two-dimensional Euler equations on non-Cartesian geometries. The schemes find their best justification when solving very complex systems for which the solution of the Riemann problem, in the classical sense, is too complex, too costly or is simply unavailable.
Secure Negotiation in Virtual Organizations
Authors: Sakyibea Darko-Ampem, Maria Katsoufi, Pablo Giambiagi
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Virtual organizations are dynamic associations of business partners that join forces to achieve a common goal. Because partners live in very competitive environments and they do not fully trust each other, they establish contractual agreements to help reduce the risk of participating in the virtual organization. This naturally puts severe demands on the security of the process leading to the establishment of a contract, including negotiation of terms and conditions. The open context in which virtual organizations are created raises further security concerns. This papers discusses the security requirements over contract negotiation that arise in this context, examines current negotiation protocols and proposes enhancements to one of them.
Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions
Authors: Ming Xiong, Biyu Liang
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

The More-Less (ML) scheme has been shown to be an efficient approach for maintaining temporal consistency of real-time data objects. Although ML provides a deterministic guarantee in temporal consistency, the number of update transactions that can be supported in a system is limited. This is due to its use of the worst-case computation time in deriving deadlines and periods of update transactions. This paper studies the problem of temporal consistency maintenance where a certain degree of temporal inconsistency is tolerable. A suite of Statistical More-Less (SML) approaches are proposed to explore the trade-off between quality of service (QoS) of temporal consistency and the number of supported transactions. It begins with a base-line algorithm, SML-BA, which provides the requested QoS of temporal consistency. Then, SML with Optimization (SML-OPT) is proposed to further improve the QoS by better utilizing the excess processor capacity. Finally, SML-OPT is enhanced with a Slack Reclaiming scheme (SML-SR). The reclaimed slacks are used to process jobs whose required computation time is larger than the guaranteed computation time. Simulation experiments are conducted to compare the performance of these schemes (SML-BA, SML-OPT, and SML-SR) together with the deterministic More-Less and Half-Half schemes. The results show that the SML schemes are effective in trading the schedulability of transactions for the QoS guaranteed. Moreover, SML-SR performs best and offers a significant QoS improvement over SML-BA and SML-OPT.
An efficient concurrent implementation of a neural network algorithm: Research Articles
Authors: R. Andonie, A. T. Chronopoulos, D. Grosu, H. Galmeanu
Venue: Concurrency and Computation: Practice Experience (2006)

The focus of this study is how we can efficiently implement the neural network backpropagation algorithm on a network of computers (NOC) for concurrent execution. We assume a distributed system with heterogeneous computers and that the neural network is replicated on each computer. We propose an architecture model with efficient pattern allocation that takes into account the speed of processors and overlaps the communication with computation. The training pattern set is distributed among the heterogeneous processors with the mapping being fixed during the learning process. We provide a heuristic pattern allocation algorithm minimizing the execution time of backpropagation learning. The computations are overlapped with communications. Under the condition that each processor has to perform a task directly proportional to its speed, this allocation algorithm has polynomial-time complexity. We have implemented our model on a dedicated network of heterogeneous computers using Sejnowski's NetTalk benchmark for testing. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Real-Time MCLT Audio Watermarking and Comparison of Several Whitening Methods in Receptor Side
Authors: Jose Juan Garcia Hernandez, Mariko Nakano Miyatake, Hector Perez Meana
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

A Real-Time audio watermarking scheme is presented. The strength of audio signal modifications is limited by the necessity to produce an output signal that is perceptually equal to the original signal. The proposed scheme uses a blind detection approach. To embed the watermark a spread spectrum algorithm is used in the Modulated Complex Lapped Transform (MCLT) domain. Here the watermark is generated using a private key and modeling according to the Human Auditory System. Comparison of several whitening methods in the receptor side is carried out. The embedded watermark is robust to common attacks such like, D/A A/D conversion, filtering, noise addition and high quality MPEG audio coding.
Practical Design and Implementation of Web-Based Document Management Systems
Authors: Jason Yao, Jessica H. Li
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

This paper presents the design and implementation of two web-based document management systems customized to serve the need of an international organization. The systems were designed to replace a paper-based process that gradually became unmanageable due to the increasingly large volume of texts and the need to distribute the documents to geographically remote locations. Features of the new systems include online recording of forms and texts, automatic email notifications and reminders, electronic authorization, database query functions, a secure mechanism for web access of documents for approval and future references. We describe the design principles and introduce the functional modules in each system. Besides technical issues, a paragraph is devoted to discuss the factor of user behaviors in the process. Both systems were implemented on Windows and UNIX platforms using open-source software such as PHP4, MySQL, Apache, etc. They have been functioning online for more than three years and have processed over 1,000 documents without any problem.
Syntactical & Semantical Web Services Discovery And Composition
Authors: V. Ramasamy
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In this paper, a method for syntactical and semantical web service discovery and composition is described based on the CEC-06/EEE-06 WSChallenge requirements. Analysis of service discovery method shows that it can quickly find the exact, partial as well as over-qualified matching services. Service composition can also be speeded up via two parallel execution of forward as well as backward chaining process.
Agent-based modeling of human education data
Authors: Yuqing Tang, Simon Parsons, Elizabeth Sklar
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Agent-based simulation is increasingly used to analyze the performance of complex systems. There are two main ways agent-based models are built --- from equation-based models and directly from data. We are building models in both ways, investigating approaches for creating them and for validating them. In this paper we describe results of our work on one specific agent-based model, showing how it can be validated against the equation-based model from which it was derived, and the extent to which it can be used to derive additional results over and above those that the equation-based model can provide.
Leopard Image Retrieval using Region of Interest and Texture Feature
Authors: Jing Zhang, Seok-Wun Ha
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In content based image retrieval system, texture based natural image retrieval can not extract texture feature efficiently and accurately, because the nature image is very complex and most of method extract feature use the whole nature image. In this paper, a new method is proposed for leopard texture image retrieval. Usually, the habitat of leopard is grass or tree, there is large difference between leopard image background and foreground, so it is easy to separate the leopard region from background using Canny edge detection, and then extract region of interest of foreground. The similarity of two images will be determined by the similarities between pairs of region of interest. The experimental results on the leopard texture image database demonstrate that the proposed method is encouraging with an average successful retrieval rate of 95.66%.
Lectern II: a multimedia lecture capturing and editing system
Authors: N. Joukov, Tzi-cker Chiueh
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Deployment of asynchronous learning systems is still very limited mainly because of the use of expensive video to record and play back classroom lectures. The key advantage of the Lectern II approach is that all important lecture components can be effectively captured without video. Lectern II employs the touch-sensitive screen technology to build a "digital desk," which is shown to be able to effectively support and transparently capture the standard classroom lecturing activity. Recorded lectures can be edited and automatically uploaded to a Web server, and than viewed by students via a standard streaming player. As the total cost of a complete Lectern II system is under $4,000, Lectern II represents the first course lecture recording system that has the potential to be widely deployed in the classrooms of universities and K-12 schools.
Perl Testing: A Developer's Notebook
Authors: Ian Langworth, chromatic
Venue:  (2005)

Is there any sexier topic in software development than software testing? That is, besides game programming, 3D graphics, audio, high-performance clustering, cool websites, et cetera? Okay, so software testing is low on the list. And that's unfortunate, because good software testing can increase your productivity, improve your designs, raise your quality, ease your maintenance burdens, and help to satisfy your customers, coworkers, and managers. Perl has a strong history of automated tests. A very early release of Perl 1.0 included a comprehensive test suite, and it's only improved from there. Learning how Perl's test tools work and how to put them together to solve all sorts of previously intractable problems can make you a better programmer in general. Besides, it's easy to use the Perl tools described to handle all sorts of testing problems that you may encounter, even in other languages.Like all titles in O'Reilly's Developer's Notebook series, this "all lab, no lecture" book skips the boring prose and focuses instead on a series of exercises that speak to you instead of at you.Perl Testing: A Developer's Notebook will help you dive right in and:Write basic Perl tests with ease and interpret the resultsApply special techniques and modules to improve your testsBundle test suites along with projectsTest databases and their dataTest websites and web projectsUse the "Test Anything Protocol" which tests projects written in languages other than PerlWith today's increased workloads and short development cycles, unit tests are more vital to building robust, high-quality software than ever before. Once mastered, these lessons will help you ensure low-level code correctness, reduce software development cycle time, and ease maintenance burdens.You don't have to be a die-hard free and open source software developer who lives, breathes, and dreams Perl to use this book. You just have to want to do your job a little bit better.
ProModel Corporation
Authors: Carl Napoletano
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Over 90% of all projects are late and over budget! Why? Because when developing plans, traditional methods don't account for variability in processes and complex interdependencies combined with resource contention. ProModel Project Simulator is a Microsoft Project plug-in that enables planners to incorporate these factors into their project plans. Want more? Roll up projects and predict the impacts of resource contention on portfolio performance using Portfolio Simulator. 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
Design and Evaluation of a Distributed Diagnosis Algorithm in Dynamic Fault Environments For Not-Completely Connected Network
Authors: Pabitra Mohan Khilar, S. Mahapatra
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

This paper has considered the problem of distributed diagnosis in dynamic fault environments for not-completely connected network. An algorithm has been designed and its formal analysis has been presented. The algorithm is simulated and results are compared with the algorithm FHB proposed in paper [3]. The result validates for better average diagnostic latency under more realistic crash and value fault model which is suitable for general purpose and real time distributed systems.
Aligning ASL for Statistical Translation Using a Discriminative Word Model
Authors: Ali Farhadi, David Forsyth
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We describe a method to align ASL video subtitles with a closed-caption transcript. Our alignments are partial, based on spotting words within the video sequence, which consists of joined (rather than isolated) signs with unknown word boundaries. We start with windows known to contain an example of a word, but not limited to it. We estimate the start and end of the word in these examples using a voting method. This provides a small number of training examples (typically three per word). Since there is no shared structure, we use a discriminative rather than a generative word model. While our word spotters are not perfect, they are sufficient to establish an alignment. We demonstrate that quite small numbers of good word spotters results in an alignment good enough to produce simple English-ASL translations, both by phrase matching and using word substitution.
The nonorientable genus of complete tripartite graphs
Authors: M. N. Ellingham, Chris Stephens, Xiaoya Zha
Venue: Journal of Combinatorial Theory Series B (2006)

In 1976, Stahl and White conjectured that the nonorientable genus of Kl,m.n, where l ≥ m ≥ n, is ⌈(l-2)(m + n - 2)/2⌉. The authors recently showed that the graphs K3,3,3, K4,4,1, and K4,4,1 are counterexamples to this conjecture. Here we prove that apart from these three exceptions, the conjecture is true. In the course of the paper we introduce a construction called a transition graph, which is closely related to voltage graphs.
High performance wireless switch protocol for IEEE 802.11 wireless networks
Authors: Jenhui Chen, Ai-Chun Pang, Shiann-Tsong Sheu, Hsueh-Wen Tseng
Venue: Mobile Networks and Applications (2005)

All mobile stations (STAs) in IEEE 802.11 infrastructure wireless local area networks (IWLAN) are coordinated by an access point (AP). Within the 2.4 GHz unlicensed industry, science, and medicine (ISM) band defined in the IEEE 802.11 2.4 GHz physical layer (PHY) specifications, three channels are available for concurrently transferring data packets at the coverage area of an AP. In most of small/medium enterprises or home environments, an AP with one selected channel is sufficient for covering whole service area, but this implies that the radio resources for the remaining two channels are wasted. In order to overcome the drawback, we propose a new and simple media access control (MAC) protocol, named wireless switch protocol (WSP), for increasing the throughput of IEEE 802.11 IWLAN network to support high quality multimedia traffic. This is achieved by allowing any pair of STAs in IWLAN to exchange data packets in one of other idle channels after their handshake with each other in the common channel controlled by AP. Simulation results show that the total network throughput of WSP depends on the time taken by channel switching, and on the 'Intranet' and 'Internet' traffic distribution, where the Intranet and Internet mean data transmission between STAs in IWLAN and between the STA and wired host, respectively. When all data packets are Intranet traffic and the traffic load is heavy, the ratio of Goodput for the proposed WSP to that of IEEE 802.11 standard approximates 400%. In the worse case of all Internet traffic, the proposed WSP still obtains the similar throughput as that of IEEE 802.11 standard.
A methodology for construct development in MIS research
Authors: Bruce R. Lewis, Gary F. Templeton, Terry Anthony Byrd
Venue: European Journal of Information Systems (2005)

This paper presents a comprehensive methodology for developing constructs in MIS research. It is applicable to both individual and organizational levels of analysis, depending on the nature of the concept under study. The methodology is presented as a research guide progressing through three stages: (1) domain definition, (2) instrument construction, and (3) evaluation of measurement properties. The methodology addresses six key measurement properties (content validity, factorial validity, reliability, convergent validity, discriminant validity, nomological validity), which are discussed in detail. An assessment of the proposed methodology indicates that its adoption in MIS research would greatly improve the rigor of construct development projects. This is evidenced by the wide range of quality publications that have used its techniques and its performance when compared to a number of prominent standards for assessing construct development research.