ppxscal/embedding_network huggingface dataset:
An ID-SP-M4M Scheme and Its Security Analysis*A preliminary version was presented at WCC2005 [22].
Authors: Lihua Wang, Eiji Okamoto, Ying Miao, Takeshi Okamoto, Hiroshi Doi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

ID-SP-M4M scheme means ID-based series-parallel multisignature schemes for multi-messages. In this paper, we investigate series-parallel multisignature schemes for multi-messages and propose an ID-SP-M4M scheme based on pairings in which signers in the same subgroup sign the same message, and those in different subgroups sign different messages. Our new scheme is an improvement over the series-parallel multisignature schemes introduced by Doi et al. [6]--[8] and subsequent results such as the schemes proposed by Burmester et al. [4] and the original protocols proposed by Tada [20], [21], in which only one message is to be signed. Furthermore, our ID-SP-M4M scheme is secure against forgery signature attack from parallel insiders under the BDH assumption.
Cramer's rule on 2-by-2 systems
Authors: Cleve Moler
Venue: ACM SIGNUM Newsletter (1974)

Cramer's rule expresses the solution to a system of simultaneous linear equaations in terms of ratios of determinants. It is widely known as an example of an impractical method for large systems because of the time required to compute the determinants. For 2-by-2 systems this time difficulty disappears and, since the method does not involve a search for pivots, it may appear to have an advantage over Gaussian elimination. In fact, methods based upon 2-by-2 Cramer's rule have been proposed for use on parallel computers. In this note we wish to point out that Cramer's rule is unsatisfactory even for 2-by-2 systems because of roundoff error difficulties.
IBM Rational(R) ClearCase(R), Ant, and CruiseControl: The Java(TM) Developer's Guide to Accelerating and Automating the Build Process
Authors: Kevin A. Lee
Venue:  (2006)

Optimize your entire Java build and release process with ClearCase®, Ant, and CruiseControlBetter builds mean better software. Effective, regular build processes accelerate development and improve quality, helping you identify small problems early, before they grow complex and costly to fix. Now, there's a step-by-step guide to creating Java build processes that are right for your organization. Leading build and release management expert Kevin Lee introduces best practices for integrating and using three exceptionally powerful and recognized industry standard tools: IBM Rational® ClearCase software configuration management system, the open source Ant build tool, and CruiseControl for automating continuous builds.No previous build experience is necessary: Lee thoroughly explains everything from configuring SCM environments and defining build scripts through to release packaging and deployment. He offers solutions and techniques for both Base ClearCase and Unified Change Management (UCM)ï¾IBM Rational's best practice Software Configuration Management usage model. Key techniques are presented in real-world context, through a full-fledged three-tier application case study.Whether you are a software developer, manager, or integrator, this book will help you create better buildsï¾and reap the benefits in efficiency, traceability, quality, and speed.Coverage includesï¾·ï¾ ï¾ ï¾ ï¾ Ensuring that every build you create is complete, consistent, and reproducible ï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Configuring a ClearCase-controlled environment to support your development organization's build and release process ï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Installing Ant and configuring it to build all of your project assets ï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Integrating Ant with ClearCase and effectively using them together ï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Installing CruiseControl and configuring it to schedule and automate different types of builds ï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Integrating CruiseControl with ClearCase to schedule builds and automate baselines and reportsï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Creating custom baseline and change request reportsï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Setting up automatic notification whenever build problems ariseï¾·ï¾ ï¾ ï¾ ï¾ ï¾ Creating and packaging releasable, traceable builds with ClearCase and ClearQuest™ 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
GPS/IMU data fusion using multisensor Kalman filtering: introduction of contextual aspects
Authors: Francois Caron, Emmanuel Duflos, Denis Pomorski, Philippe Vanheeghe
Venue: Information Fusion (2006)

The aim of this article is to develop a GPS/IMU multisensor fusion algorithm, taking context into consideration. Contextual variables are introduced to define fuzzy validity domains of each sensor. The algorithm increases the reliability of the position information. A simulation of this algorithm is then made by fusing GPS and IMU data coming from real tests on a land vehicle. Bad data delivered by GPS sensor are detected and rejected using contextual information thus increasing reliability. Moreover, because of a lack of credibility of GPS signal in some cases and because of the drift of the INS, GPS/INS association is not satisfactory at the moment. In order to avoid this problem, the authors propose to feed the fusion process based on a multisensor Kalman filter directly with the acceleration provided by the IMU. Moreover, the filter developed here gives the possibility to easily add other sensors in order to achieve performances required.
Sams Teach Yourself AJAX in 10 Minutes (Sams Teach Yourself)
Authors: Phil Ballard
Venue:  (2006)

Sams Teach Yourself Ajax in 10 Minutesï¾ is a concise introduction to the basics of building Ajax applications and the architecture and operation of these applications. You will learn the techniques employed in using Ajax, introducing Ajax and explaining how it may be used to solve realistic user interface problems. You will be able to immediately begin building web applications, and will have platform from which to explore more advanced aspects of Ajax.
Airspace geometry and 4D flight proximity detection for simulation of the National Airspace System
Authors: Paul T. R. Wang, Richard E. Snow
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The authors present uncomplicated and well established equations that can be used in simulation or real-world applications to determine key crossing points and aircraft proximity when the trajectory and speed of aircraft pairs are known. These equations, in closed form, were developed for computing the minimum distance between two aircraft within the four-dimensional (4D) space-time domain. The 4D flight proximity information can be used in simulation to evaluate large numbers of scheduled routes over a limited airspace for controller workload assessment. Also, it can be used to detect potential separation violations and impacts of traffic flow management (TFM) strategies. An example of computing the distance between two flights in 4D is presented. Sample aircraft proximity landscape in 4D space-time simulation with MATLAB code is also provided.
Prediction of structural classes for protein sequences and domains-Impact of prediction algorithms, sequence representation and homology, and test procedures on accuracy
Authors: Lukasz A. Kurgan, Leila Homaeian
Venue: Pattern Recognition (2006)

This paper addresses computational prediction of protein structural classes. Although in recent years progress in this field was made, the main drawback of the published prediction methods is a limited scope of comparison procedures, which in same cases were also improperly performed. Two examples include using protein datasets of varying homology, which has significant impact on the prediction accuracy, and comparing methods in pairs using different datasets. Based on extensive experimental work, the main aim of this paper is to revisit and reevaluate state of the art in this field. To this end, this paper performs a first-of-its-kind comprehensive and multi-goal study, which includes investigation of eight prediction algorithms, three protein sequence representations, three datasets with different homologies and finally three test procedures. Quality of several previously unused prediction algorithms, newly proposed sequence representation, and a new-to-the-field testing procedure is evaluated. Several important conclusions and findings are made. First, the logistic regression classifier, which was not previously used, is shown to perform better than other prediction algorithms, and high quality of previously used support vector machines is confirmed. The results also show that the proposed new sequence representation improves accuracy of the high quality prediction algorithms, while it does not improve results of the lower quality classifiers. The study shows that commonly used jackknife test is computationally expensive, and therefore computationally less demanding 10-fold cross-validation procedure is proposed. The results show that there is no statistically significant difference between these two procedures. The experiments show that sequence homology has very significant impact on the prediction accuracy, i.e. using highly homologous datasets results in higher accuracies. Thus, results of several past studies that use homologous datasets should not be perceived as reliable. The best achieved prediction accuracy for low homology datasets is about 57% and confirms results reported by Wang and Yuan [How good is the prediction of protein structural class by the component-coupled method?. Proteins 2000;38:165-175]. For a highly homologous dataset instance based classification is shown to be better than the previously reported results. It achieved 97% prediction accuracy demonstrating that homology is a major factor that can result in the overestimated prediction accuracy.
JET: dynamic join-exit-tree amortization and scheduling for contributory key management
Authors: Yinian Mao, Yan Sun, Min Wu, K. J. Ray Liu
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then, optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that, on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management.
Digital Content Creation/Distribution in a Broadband-Ubiquitous Environment
Authors: Hiroshi Yasuda
Venue: IEICE - Transactions on Information and Systems (2007)

Under the broadband-ubiquitous environment, digital content creation/distribution will be the key factor to activating new industries. This paper first describes the impact of a broadband-ubiquitous environment on digital content creation/distribution; then it proposes new models for digital content creation/distribution businesses. In a broadband-ubiquitous environment, the key is creation of moving picture content; thus the paper describes a system that allows non-CG experts to make CG movies easily.
Leo Laporte's 2006 Gadget Guide (Laporte Press)
Authors: Leo Laporte, Michael Miller
Venue:  (2005)

Gadget geeks and technology buffs, this is the book for you! Leo Laporte's 2006 Gadget Guide is the definitive guide to all of your gadget-buying questions for 2005-06. Leo Laporte, host of TechTVs "Call for Help" and Que Publishing's resident gadget guru, boils down the reams and reams of product specs, slices through the marketing hype, and delivers his best of breed picks for everything from digital cameras to MP3 players. Organized in a sereis of categories, such as "Gadgets for the Ultimate Home Theater," Leo will provide you with the best picks for gadgets and equipment on any kind of budget. This is the ultimate guide for anyone interested in gadgets, gidgets, whos-its and whats-its. Don't go shopping again without it!
Apple Pro Training Series: Compressor Quick-Reference Guide (Apple Pro Training)
Authors: Brian Gary
Venue:  (2006)

Whether you're distributing dailies, authoring a commercial DVD, or prepping video clips for the Web, Compressor is essential for creating quality digital content. In this quick-reference guide, professional filmmaker Brian Gary reveals essential techniques for audio and video compression. Learn timesaving batch-encoding and test-clip workflows. Import files in Final Cut Pro and QuickTime formats and encode them for authoring in DVD Studio Pro. Use advanced codecs like H.264 to create standard- and high-definition content. Compress content for the latest hardware platforms, including iPod and HD DVD. Also learn how to take advantage of job management strategies, such as letting Compressor oversee hours of encoding unattended and emailing you when it's done. With this guide you'll master the art of minimizing file size and maximizing image quality. 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
Sams Teach Yourself PHP, MySQL and Apache All in One (3rd Edition) (Sams Teach Yourself)
Authors: Julie C. Meloni
Venue:  (2006)

You own your own business. You have also created a website for your business that details the products or services that you offer, but it doesn't allow potential customers to purchase anything online. Don't risk losing business-learn to create a dynamic online environment using only three programs. PHP, MySQL and Apache are three popular open-source tools that can work together to help you create a dynamic website, such as an online shopping experience. Sams Teach Yourself PHP, MySQL and Apache All in One is a complete reference manual for all three development tools. You will learn how to install, configure and set up the PHP scripting language, use the MySQL database system, and work withï¾ the Apache Web server.ï¾ Then you'll take it a step further andï¾ discoverï¾ how they work together to create a dynamic website. Use the book and the included CD to create a simple website, as well as a mailing list, online address book, shopping cart and storefront. Updated to reflect the most recent developments in PHP and MySQL, including the final stable release of MySQL 5.0, you will open your website to limitless possibilities with Sams Teach Yourself PHP, MySQL and Apache All in One.
Efficient Legendre moment computation for grey level images
Authors: G. Y. Yang, H. Z. Shu, C. Toumoulin, G. N. Han, L. M. Luo
Venue: Pattern Recognition (2006)

Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity. Nevertheless, the existing algorithms are mainly focused on binary images. We propose here a new fast method for computing the Legendre moments, which is not only suitable for binary images but also for grey level images. We first establish a recurrence formula of one-dimensional (1D) Legendre moments by using the recursive property of Legendre polynomials. As a result, the 1D Legendre moments of order p, L"p=L"p(0), can be expressed as a linear combination of L"p"-"1(1) and L"p"-"2(0). Based on this relationship, the 1D Legendre moments L"p(0) can thus be obtained from the arrays of L"1(a) and L"0(a), where a is an integer number less than p. To further decrease the computation complexity, an algorithm, in which no multiplication is required, is used to compute these quantities. The method is then extended to the calculation of the two-dimensional Legendre moments L"p"q. We show that the proposed method is more efficient than the direct method.
Mining evolving data streams for frequent patterns
Authors: Pierre-Alain Laur, Richard Nock, Jean-Emile Symphor, Pascal Poncelet
Venue: Pattern Recognition (2007)

A data stream is a potentially uninterrupted flow of data. Mining this flow makes it necessary to cope with uncertainty, as only a part of the stream can be stored. In this paper, we evaluate a statistical technique which biases the estimation of the support of patterns, so as to maximize either the precision or the recall, as chosen by the user, and limit the degradation of the other criterion. Theoretical results show that the technique is not far from the optimum, from the statistical standpoint. Experiments performed tend to demonstrate its potential, as it remains robust even under significant distribution drifts.
On the expressive power of semi-normal defaults in some semantic variants of default logic
Authors: Zhang Mingyi, Zhang Ying
Venue: AI Communications (2003)

Normality, semi-normality and prerequisite-freedom are examples of syntactic restrictions proposed for defaults. The expressive powers of Reiter's default logic under the corresponding syntactic restrictions have been analyzed by Janhunen. It is quite natural that to ask if such restrictions affect the expressive power of variants of default logic. In this paper we analyze the expressive powers of semi-normal (SN) variants of Lukaszewicz's default logic (LDL). Among another variants of default logic are cumulative default logic (CDL) by Brewka as well as commitment to assumptions default logic and quasi-default logic (CADL and QDL) by Giordano and Martelli. The expressive powers of these three variants under the corresponding syntactic restrictions are also investigated. The framework is based on the notion of Janhunen's polynomial, faithful and modular (PFM) translation function that maps systematically theories of one nonmonotonic logic to theories of other such that the semantics of theories is preserved. The criteria for evaluating expressive powers of nonmonotonic logics are existence/nonexistence of PFM translations between such nonmonotonic logics. According to the measure provided by PFM translation we point out that semi-normality, in general (allowing defaults possessing no consistency conditions) may decrease expressive power of defaults in LDL and prove that semi-normality does not affect expressiveness of defaults in LDL *(where defaults have at least one consistency condition). For assertion default theories, expressive power may decrease in certain DL variants if syntactic resections (such as semi-normality) are introduced. The reason why such anomalies arise is that consistency conditions of applied defaults are recorded in the support of extensions. To deal with this problem we introduce a weaker notion of PFM translation function, called quasi-PFM translation function (QPFM). According to the measure provided by QPFM translations we analyze expressive powers of semi-normal defaults in CDL, CADL and QDL and establish that, in CDL and QDL, semi-normality does not affect expressiveness of defaults yet. For CADL, unfortunately, semi-normal defaults are less expressive than general defaults even if we adopt a weaker notion of faithfulness than one by Janhunen. Noticing that arbitrary consistency conditions (including empty consistency condition) are allowed for LDL, CADL and QDL, we also consider the possibility of reducing multiple consistency conditions to a single consistency condition.
Java: The Complete Reference, Seventh Edition, 7 edition
Authors: Herbert Schildt
Venue:  (2006)

The world's leading programming author offers comprehensive coverage of the new Java release The definitive guide to Java has been fully expanded to cover every aspect of Java SE 6, the latest version of the world's most popular Web programming language. This comprehensive resource contains everything you need to develop, compile, debug, and run Java applications and applets.Table of contentsPart I: The Java LanguageChapter 1. History & Evolution of Java Chapter 2. Overview of JavaChapter 3. Data Types, Variables, and ArraysChapter 4. OperatorsChapter 5. Control StatementsChapter 6. Introducing ClassesChapter 7. A Closer Look at Methods and ClassesChapter 8. InheritanceChapter 9. Packages and InterfacesChapter 10. Exception HandlingChapter 11. Multithreaded ProgrammingChapter 12. Enumerations, Autoboxing, and Annotations (Metadata)Chapter 13. I/O, Applets, and Other TopicsChapter 14. GenericsPart II: The Java LibraryChapter 15. String HandlingChapter 16. Exploring java.langChapter 17. java.util Part 1: Collections FrameworkChapter 18. java.util Part 2: More Utility ClassesChapter 19. Input/Output: Exploring java.ioChapter 20. NetworkingChapter 21. The Applet classChapter 22. Event HandlingChapter 23. Introducing the AWT: Working with Windows, Graphics, and TextChapter 24. Using AWT Controls, Layout Managers, and MenusChapter 25. ImagesChapter 26. The Concurrency UtilitiesChapter 27. NIO, Regular Expressions, and Other PackagesPart III: Software Development Using JavaChapter 28. Java BeansChapter 29. Introducing SwingChatper 30. Exploring SwingChapter 31. ServletsPart IV: Applying JavaChapter 32: Financial Applets and ServletsChapter 33: Creating a Download Manager in JavaAPPENDIX A: USING JAVA'S DOCUMENTATION COMMENTSINDEX
Making a Living from Your eBay Business (2nd Edition)
Authors: Michael Miller
Venue:  (2006)

The power of online auctions is attracting hundreds of thousands--if not millions--of users who want to turn their eBay hobbies into profitable businesses. While turning an eBay hobby into an eBay business might look easy, making that business profitable is much more difficult. Not enough sellers treat their eBay sales as a business, and subsequently are disappointed in the results. To launch a successful and profitable eBay business,ï¾ the detailed instructions in this book will show you how to get started. It will help you determine what kind of businessï¾ you want to run, write an action-oriented business plan, establish an effective accounting system, set up a home office, obtain starting inventory, arrange initial funding, establish an eBay presence, and arrange for automated post-auction management. This book is a step-by-step guide forï¾ anyone serious about making money from their eBay sales. Unlike other computer-oriented titles, this is a straight-ahead business book that shows how to set up and run different types of eBay businesses, and how to maximize sales and profits while doing so. This book includes a section titled "Choosing Your eBay Business" that details six different types of eBay businesses you can start. Included in this section is a chapter on eBay Trading Assistants (AKA drop-off stores or consignment stores), which is the newest form of an eBay business. 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
The classification of the smallest nontrivial blocking sets in PG(n, 2)
Authors: Patrick Govaerts, Leo Storme
Venue: Journal of Combinatorial Theory Series A (2006)

We determine the smallest nontrivial blocking sets with respect to t-spaces in PG(n, 2), n ≥ 3. For t = n - 1, they are skeletons of solids in PG(n, 2); for 1 ≤ t < n - 1, they are cones with vertex an (n - t - 3)- space πn-t - 3 and base the set of points on the edges of a tetrahedron in a solid skew to πn-t-3.