ppxscal/embedding_network huggingface dataset:
Reliable Parallel File System with Parity Cache Table Support
Authors: Sheng-Kai Hung, Yarsun Hsu
Venue: IEICE - Transactions on Information and Systems (2007)

Providing data availability in a high performance computing environment is very important, especially in this data-intensive world. Most clusters either equip with RAID (Redundant Array of Independent Disks) devices or use redundant nodes to protect data from loss. However, neither of these can really solve the reliability problem incurred in a striped file system. Striping provides an efficient way to increase I/O throughput both in the distributed and parallel paradigms. But it also reduces the overall reliability of a disk system by N fold, where N is the number of independent disks in the system. Parallel Virtual File System (PVFS) is an open source parallel file system which has been widely used in the Linux environment. Its striping structure is good for performance but provides no fault tolerance. We implement Reliable Parallel File System (RPFS) based on PVFS but with reliability support. Our quantitative analysis shows that MTTF (Mean Time To Failure) of our RPFS is better than that of PVFS. Besides, we propose a parity cache table (PCT) to alleviate the penalty of parity updating. The evaluation of our RPFS shows that its read performance is almost the same as that of PVFS (2% to 13% degradation). As to the write performance, 28% to 45% improvement can be achieved depending on the behavior of the operations.
Algorithm for generating a step matrix by permutation
Authors: J. Seehusen
Venue: ACM SIGNUM Newsletter (1980)

With an efficient algorithm it can be tested whether an n-dimensional matrix B can be reduced by a permutation. The optimal step matrix, which can be obtained by a permutation, is calculated. The algorithm needs 0(n2-n) operations in the case of an array reprsentation of B. If B is a Sparse matrix with m non-zero offdiagonal elements, the cost is of the order 0(max(m, nlog2(n))). Storage for 4 integer arrays of length n is necessary.
Googlepedia: The Ultimate Google Resource
Authors: Michael Miller
Venue:  (2006)

Do you want to learn and ultimately master Google's web and software tools beyond what information can find through their help files?Well Googlepedia shows both casual end-users and professional web developers how to get the most out of the Google search site and Google's powerful tools. For web searchers, Googlepedia describes how Google indexes web pages and ranks search results, and provides step-by-step instructions on conducting both basic and advanced queries. All types of searches are presented, including searches of specific government and university web sites. Finally, webmasters and website developers learn how to submit their pages to Google for indexing, increase their search rankings, incorporate Google searches on their Web sites, and use Google's Adsense service to make money from any sized website.For all web users, Googlepedia shows how to use and master Google's web-based and software-based tools. Readers learn how to enhance their PC's operation with the Google Pack and Google Toolbar; map destinations, get driving directions, and find nearby businesses with Google Maps and Google Earth; find the best online bargains with Froogle; instant message other users with Google Talk; view web pages in other languages with Google Translate; create their own blogs with Blogger; use Google on their mobile phones; and much, much more. 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
Sungear: interactive visualization and functional analysis of genomic datasets
Authors: Christopher S. Poultney, Rodrigo A. Gutiérrez, Manpreet S. Katari, Miriam L. Gifford, W. Bradford Paley, Gloria M. Coruzzi, Dennis E. Shasha
Venue: Bioinformatics (2007)

Summary: Sungear is a software system that supports a rapid, visually interactive and biologist-driven comparison of large datasets. The datasets can come from microarray experiments (e.g. genes induced in each experiment), from comparative genomics (e.g. genes present in each genome) or even from non-biological applications (e.g. demographics or baseball statistics). Sungear represents multiple datasets as vertices in a polygon. Each possible intersection among the sets is represented as a circle inside the polygon. The position of the circle is determined by the position of the vertices represented in the intersection and the area of the circle is determined by the number of elements in the intersection. Sungear shows which Gene Ontology terms are over-represented in a subset of circles or anchors. The intuitive Sungear interface has enabled biologists to determine quickly which dataset or groups of datasets play a role in a biological function of interest. Availability: A live online version of Sungear can be found at http://virtualplant-prod.bio.nyu.edu/cgi-bin/sungear/index.cgi Contact: shasha@cs.nyu.edu Supplementary information: Submitted---link TBD.
Retrieval of Images Captured by Car Cameras Using Its Front and Side Views and GPS Data*This paper was presented at International Workshop on Advanced Image Technology (IWAIT2006).
Authors: Toshihiko Yamasaki, Takayuki Ishikawa, Kiyoharu Aizawa
Venue: IEICE - Transactions on Information and Systems (2007)

Recently, cars are equipped with a lot of sensors for safety driving. We have been trying to store the driving-scene video with such sensor data and to detect the change of scenery of streets. Detection results can be used for building historical database of town scenery, automatic landmark updating of maps, and so forth. In order to compare images to detect changes, image retrieval taken at nearly identical locations is required as the first step. Since Global Positioning System (GPS) data essentially contain some noises, we cannot rely only on GPS data for our image retrieval. Therefore, we have developed an image retrieval algorithm employing edge-histogram-based image features in conjunction with hierarchical search. By using edge histograms projected onto the vertical and horizontal axes, the retrieval has been made robust to image variation due to weather change, clouds, obstacles, and so on. In addition, matching cost has been made small by limiting the matching candidates employing the hierarchical search. Experimental results have demonstrated that the mean retrieval accuracy has been improved from 65% to 76% for the front-view images and from 34% to 53% for the side-view images.
UNIX: The Complete Reference, Second Edition, 2 edition
Authors: Kenneth H. Rosen, Douglas A. Host, Rachel Klee, Richard R. Rosinski
Venue:  (2006)

The Definitive UNIX Resource--Fully UpdatedGet cutting-edge coverage of the newest releases of UNIX--including Solaris 10, all Linux distributions, HP-UX, AIX, and FreeBSD--from this thoroughly revised, one-stop resource for users at all experience levels. Written by UNIX experts with many years of experience starting with Bell Laboratories, UNIX: The Complete Reference, Second Edition provides step-by-step instructions on how to use UNIX and take advantage of its powerful tools and utilities. Get up-and-running on UNIX quickly, use the command shell and desktop, and access the Internet and e-mail. You'll also learn to administer systems and networks, develop applications, and secure your UNIX environment. Up-to-date chapters on UNIX desktops, Samba, Python, Java Apache, and UNIX Web development are included. Install, configure, and maintain UNIX on your PC or workstationWork with files, directories, commands, and the UNIX shellCreate and modify text files using powerful text editorsUse UNIX desktops, including GNOME, CDE, and KDE, as an end user or system administrator Use and manage e-mail, TCP/IP networking, and Internet servicesProtect and maintain the security of your UNIX system and networkShare devices, printers, and files between Windows and UNIX systemsUse powerful UNIX tools, including awk, sed, and grepDevelop your own shell, Python, and Perl scripts, and Java, C, and C++ programs under UNIXSet up Apache Web servers and develop browser-independent Web sites and applications Table of contentsPART I – BASICS FOR LINUX/UNIX (revised)Chapter 1. Background (revised)Chapter 2. Getting Started (revised)Chapter 3. Working with Files and Directories (revised)Chapter 4. Working with Shells and Enhanced Shells (revised)Chapter 5. Text Editing (revised)Chapter 6. The Desktop: GNOME (new)Chapter 7. CDE and other Desktops (new)PART II – USER NETWORKINGChapter 8. Electronic Mail (revised)Chapter 9. TCP/IP and other Basic Networking Protocols (revised)Chapter 10. Using the Internet (revised)PART III – SYSTEM ADMINISTRATIONChapter 11. Processes and Scheduling (revised)Chapter 12. Security and Authentication (revised)Chapter 13. Basic System Administration (revised)Chapter 14. Advanced System Administration (revised)PART IV – NETWORK ADMINISTRATIONChapter 15. Clients and Servers (revised)Chapter 16. Administering the Network (revised)Chapter 17. Using UNIX and Windows Together: SAMBA and other Integration Tools (revised)PART V - TOOLSChapter 18. Filters and Utilities (revised)Chapter 19. Shell Programming (revised)Chapter 20. awk and sed (revised) Chapter 21. Perl (revised)Chapter 22. Python and PHP (new)Chapter 23. Developing Applications (revised)Chapter 24. Overview of Java (revised)PART VI – ENTERPRISE SOLUTIONSChatper 25. UNIX Applications and Middleware (revised)Chatper 26. Databases (new)Chapter 27. Developing Web Applications and Running a Website (new)VII – APPENDICESAPPENDIX A. HOW TO FIND OUT MORE (revised)APPENDIX B. COMMAND SUMMARIES(revised)
Notes from journals
Authors: Stanley Habib
Venue: ACM SIGMICRO Newsletter (1973)

<u>COMPUTER DESIGN</u> - July 1973 - "A Compatible MOS/LSI Microprocessor Device Family" - William E. Wickes, Rockwell International Corporation, Microelectronics Division, Anaheim, California - Reprinted with permission from COMPUTER DESIGN, July 1973 issue.
Dynamic fractal unifying interaction confirmed with magnetospheric behavior and orbital data: Research Articles
Authors: Eugene Savov
Venue: Complexity (2007)

The solar wind makes the magnetosphere to expand and contract as indicated by the expansions and contractions of the auroral oval due to balancing of the dynamic pressure of the ambient space plasma at inner and outer magnetic lines. This self-similar magnetospheric behavior elucidates the controversial magnetic storm-substorm relationship and reveals the 3D-spiral structure of magnetic interaction. The found self-similarly evolving structure of one seen as fundamental interaction suggests dynamic fractal unifying interaction that builds a firework universe having 3D-spiral code. The unifying interaction is described with equation drawn in new fundamental dynamic fractal framework. The equation of unifying interaction converges to the inverse square laws and the principle of uncertainty at laboratory scales. The dynamic fractal fundamental framework is made of one 3D-spirally-faster-inward contracting and expanding, oscillating, basic matter. It simply accounts for observed constant speed of light and for the creation of bright and dark bands on a screen behind a tiny slit. The dynamic fractal framework is quantitatively confirmed with the orbital data for the Milky Way Galaxy, the Sun, the Earth, and the triple asteroid system 87 Sylvia. Many testable predictions are also made. The presented new fundamental dynamic fractal framework allows qualitative and quantitative modeling and simplification. &copy; 2007 Wiley Periodicals, Inc. Complexity 12: 61&ndash;76, 2007This paper was submitted as an invited paper resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois-Urbana Champaign, May 2005On December 18, 2005, after a brief illness, Eugene Petrov Savov passed away. With the help and encouragement of his sister, Dr. Valentina Ilcheva, we proceeded with the review and posthumous publication of Dr. Savov's paper. We would also like to thank Emeritus Professor Oliver K. Manuel for his help as peer reviewer of the paper.
Adobe Photoshop CS2 Studio Techniques
Authors: Ben Willmore
Venue:  (2005)

If you're ready to go from blindly following step-by-step instructions to "Aha, I finally GET Photoshop!" this is the place to start. In these pages, world renowned Photoshop instructor and best-selling author Ben Willmore writes in his signature styleï¾intuitive, crystal clear, and in-depthï¾helping you gain the deep understanding needed to master Photoshop's most essential features. Complex concepts like Curves and Channels are broken down into easy to digest metaphors and descriptions, and features new to Photoshop CS2ï¾such as Bridge, Smart Objects, the revamped Layers Palette and Camera Raw dialog box, as well as the awesome new Warping and Vanishing Point featuresï¾are all covered in the depth they deserve, making it possible to quickly adapt them into your daily workflow. Whether you're a photographer, designer, production artist or hobbyist, the knowledge you gain in this book can dramatically change the way you think about Photoshop.
Implicit parallel peer methods for stiff initial value problems
Authors: B. A. Schmitt, R. Weiner, K. Erdmann
Venue: Applied Numerical Mathematics (2005)

A class of implicit two-step integration methods is introduced having s stages which may be computed in parallel. Since all stage solutions are approximations with equal accuracy and stability properties these methods were attributed as 'peer' methods. Using a special result on Vandermonde matrices we identify one subclass of order s-1 which is zero stable for general stepsize sequences. A further analysis for singularly perturbed problems shows that no order reduction occurs and the accuracy is essentially determined by the regularity of the smooth component. These results are backed by several numerical examples even including one differential algebraic problem.
Intersections of Leray complexes and regularity of monomial ideals
Authors: Gil Kalai, Roy Meshulam
Venue: Journal of Combinatorial Theory Series A (2006)

For a simplicial complex X and a field K, let h˜i(X) = dim H˜i (X; K).It is shown that if X, Y are complexes on the same vertex set, then for k ≥ 0 h˜k-1(X ∩ Y) ≤ Σσ ∈ Y Σi+j=k h˜i-1 (X[σ])ċ h˜j-1 (lk(Y, σ)).A simplicial complex X is d-Leray over K, if H˜i(Y; K) = 0 for all induced subcomplexes Y ⊂ X and i ≥ d. Let LK(X) denote the minimal d such that X is d-Leray over K. The above theorem implies that if X, Y are simplicial complexes on the same vertex set then LK(X ∩ Y) ≤ LK(X) + LK(Y).Reformulating this inequality in commutative algebra terms, we obtain the following result conjectured by Terai: If I, J are square-free monomial ideals in S = K[x1, ..., xn], then reg(I + J) ≤ reg(I) + reg(J) - 1, where reg (I) denotes the Castelnuovo-Mumford regularity of I.
Non-optimistic Secure Circuit Evaluation Based on ElGamal Encryption and Its Applications
Authors: Koji Chida, Go Yamamoto, Koutarou Suzuki, Shigenori Uchiyama, Noburou Taniguchi, Osamu Shionoiri, Atsushi Kanai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

We propose a protocol for implementing secure circuit evaluation (SCE) based on the threshold homomorphic ElGamal encryption scheme and present the implementation results of the protocol. To the best of knowledge of the authors, the proposed protocol is more efficient in terms of computational complexity than previously reported protocols. We also introduce applications using SCE and estimate their practicality based on the implementation results.
Hierarchical retargetting of 2D motion fields to the animation of 3D plant models
Authors: Julien Diener, Lionel Reveret, Eugene Fiume
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

The complexity of animating trees, shrubs and foliage is an impediment to the efficient and realistic depiction of natural environments. This paper presents an algorithm to extract, from a single video sequence, motion fields of real shrubs under the influence of wind, and to transfer this motion to the animation of complex, synthetic 3D plant models. The extracted motion is retargeted without requiring physical simulation. First, feature tracking is applied to the video footage, allowing the 2D position and velocity of automatically identified features to be clustered. A key contribution of the method is that the hierarchy obtained through statistical clustering can be used to synthesize a 2D hierarchical geometric structure of branches that terminates according to the cut-off threshold of a classification algorithm. This step extracts both the shape and the motion of a hierarchy of features groups that are identified as geometrical branches. The 2D hierarchy is then extended to three dimensions using the estimated spatial distribution of the features within each group. Another key contribution is that this 3D hierarchical structure can be efficiently used as a motion controller to animate any complex 3D model of similar but non-identical plants using a standard skinning algorithm. Thus, a single video source of a moving shrub becomes an input device for a large class of virtual shrubs. We illustrate the results on two examples of shrubs and one outdoor tree. Extensions to other outdoor plants are discussed.
A prototype for model-based on board diagnosis of automotive systems
Authors: Martin Sachenbacher, Peter Struss, Claes M. Carlén
Venue: AI Communications (2000)

Within the European &lsquo;Vehicle Model Based Diagnosis&rsquo; (VMBD) project, demonstrator vehicles with built&dash;in faults provided a serious challenge to model&dash;based diagnosis techniques and a real&dash;life test&dash;bed for their evaluation. One of the guiding applications within VMBD was model&dash;based on&dash;board diagnosis of faults in a turbo diesel engine system with a focus on potential origins of increased carbon emissions. This paper focuses on the application aspects. We discuss the requirements imposed, the way they were addressed by the chosen solutions, and the results obtained by the on&dash;board diagnosis prototype running on the demonstrator vehicle. The most important challenges of the demonstrator were to apply model&dash;based diagnosis systems to dynamic systems with feedback, to handle systems without a rigorous mathematical model (such as a combustion engine), and to try to provide the response times required for real&dash;time applications.
Outlier correction from uncalibrated image sequence using the Triangulation method
Authors: Jae-Hak Kim, Joon H. Han
Venue: Pattern Recognition (2006)

We propose a robust algorithm for estimating the projective reconstruction from image features using the RANSAC-based Triangulation method. In this method, we select input points randomly, separate the input points into inliers and outliers by computing their reprojection error, and correct the outliers so that they can become inliers. The reprojection error and correcting outliers are computed using the Triangulation method. After correcting the outliers, we can reliably recover projective motion and structure using the projective factorization method. Experimental results showed that errors can be reduced significantly compared to the previous research as a result of robustly estimated projective reconstruction.
Using ontologies for simulation modeling
Authors: Perakath Benjamin, Mukul Patki, Richard Mayer
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Ontological analysis has been shown to be an effective first step in the construction of robust knowledge based systems. However, the modeling and simulation community has not taken advantage of the benefits of ontology management methods and tools. Moreover, the popularity of semantic technologies and the semantic web has provided several beneficial opportunities for the modeling and simulation communities of interest. This paper describes the role of ontologies in facilitating simulation modeling. It outlines the technical challenges in distributed simulation modeling and describes how ontology-based methods may be applied to address these challenges. The paper concludes by describing an ontology-based solution framework for simulation modeling and analysis and outlining the benefits of this solution approach.
Snort Cookbook
Authors: Angela D. Orebaugh, Simon Biles, Jacob Babbin
Venue:  (2005)

If you are a network administrator, you're under a lot of pressure to ensure that mission-critical systems are completely safe from malicious code, buffer overflows, stealth port scans, SMB probes, OS fingerprinting attempts, CGI attacks, and other network intruders. Designing a reliable way to detect intruders before they get in is an essential--but often overwhelming--challenge. Snort, the defacto open source standard of intrusion detection tools, is capable of performing real-time traffic analysis and packet logging on IP network. It can perform protocol analysis, content searching, and matching. Snort can save countless headaches; the new Snort Cookbook will save countless hours of sifting through dubious online advice or wordy tutorials in order to leverage the full power of SNORT. Each recipe in the popular and practical problem-solution-discussion O'Reilly cookbook format contains a clear and thorough description of the problem, a concise but complete discussion of a solution, and real-world examples that illustrate that solution. The Snort Cookbook covers important issues that sys admins and security pros will us everyday, such as: installation optimization logging alerting rules and signatures detecting viruses countermeasures detecting common attacks administration honeypots log analysis But the Snort Cookbook offers far more than quick cut-and-paste solutions to frustrating security issues. Those who learn best in the trenches--and don't have the hours to spare to pore over tutorials or troll online for best-practice snippets of advice--will find that the solutions offered in this ultimate Snort sourcebook not only solve immediate problems quickly, but also showcase the best tips and tricks they need to master be security gurus--and still have a life.
Quickbooks 2005: The Missing Manual
Authors: Bonnie Biafore
Venue:  (2005)

Every company large and small wants to boost its sales, control its spending, and keep the auditors at the Internal Revenue Service happy. But, no company wants to waste time on more paperwork. These days, a growing number of companies are turning to QuickBooks accounting software not only to speed up their bookkeeping efforts, but manage their businesses more effectively. Organizations come in all shapes, sizes, and business models, so it's no surprise that accounting practices can be a convoluted road to travel. QuickBooks can handle many of the financial tasks companies face, but the price you pay is an overabundance of software features. To make the learning curve even more challenging, QuickBooks doesn't come with a manual. Fortunately, to help pave the road to accounting success, there's QuickBooks 2005: The Missing Manual, a comprehensive guide from O'Reilly that examines everything the QuickBooks Pro edition has to offer, from invoices and inventory to assets and accounts payable. With QuickBooks 2005: The Missing Manual, financial managers can quickly learn how to use the program's tools to implement and maintain critical accounting processes. By covering details in a friendly and light-hearted way, the book explains when and why a feature is useful, and then offers indispensable, relevant advice. Each page of this Missing Manual provides insightful tips and tricks to help readers become more efficient, sophisticated users no matter what the extent of their existing knowledge is. Whether you're interested in QuickBooks for its basic bookkeeping features or its more powerful, business planning tools, the only way to truly harness its power is to read the book that should have been in the box: QuickBooks 2005: The Missing Manual.