ppxscal/embedding_network huggingface dataset:
Two-View Geometry Estimation Unaffected by a Dominant Plane
Authors: Ondrej Chum, Tomas Werner, Jiri Matas
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

A RANSAC-based algorithm for robust estimation of epipolar geometry from point correspondences in the possible presence of a dominant scene plane is presented. The algorithm handles scenes with (i) all points in a single plane, (ii) majority of points in a single plane and the rest off the plane, (iii) no dominant plane. It is not required to know a priori which of the cases (i) ¿ (iii) occurs. The algorithm exploits a theorem we proved, that if five or more of seven correspondences are related by a homography then there is an epipolar geometry consistent with the seven-tuple as well as with all correspondences related by the homography. This means that a seven point sample consisting of two outliers and five inliers lying in a dominant plane produces an epipolar geometry which is wrong and yet consistent with a high number of correspondences. The theorem explains why RANSAC often fails to estimate epipolar geometry in the presence of a dominant plane. Rather surprisingly, the theorem also implies that RANSAC-based homography estimation is faster when drawing non-minimal samples of seven correspondences than minimal samples of four correspondences.
Remote access virtual private network architecture for high-speed wireless internet users: Research Articles
Authors: O. Elkeelany, M. M. Matalgah, J. Qaddour
Venue: Wireless Communications Mobile Computing (2004)

The new emerging broadband wireless network (BWN) technologies with high-speed wireless internet access promotes corporations to provide their roaming employees with high-speed wireless access to the computing resources on their corporate networks. Thus, a value added service to broadband wireless network is the remote access virtual private network (VPN), where the corporate legitimate users can connect to their offices wirelessly from different locations and get secure services as if they were connected to the corporate local area network (LAN). One of the most important challenges is to block out illegitimate user requests, which are wirelessly received, to protect corporate privacy. Registration (adding new users) and authentication (accepting current users) functions should be implemented with highly secured wireless connection. These functions are accomplished by encapsulating (i.e. tunneling) the user information in a secured form to the corporate authentication server through the internet traffic. The corporate authentication server then grants or denies the user access. In this paper, we propose a new operational design algorithm for remote access wireless VPN authentication and registration protocols that depends on modifying tunnel establishment as compared to existing dial-in VPN mechanisms. The modifications proposed in this paper are made to support successful deployment of the remote access VPN services over high-speed wireless network. The paper presents an overview of two tunneling approaches using Layer 3 and Layer 2 separately for implementing these functions. Then we propose how we establish the tunnel in both approaches, and compare it to similar operation steps previously reported for the dial-in VPN protocols. The proposed algorithms are distinguished from previously developed dial-in VPN protocols by using L2TP and IPSEC instead of mobile IP. It is also shown that the steps involved in the establishment of the tunnel are functionally different and more appropriate to our applications using communication environment of the BWN. Finally, a qualitative analysis of the added functions, and a comparison between L2TP-based and IPSec-based approaches are established. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Addressing software dependability with statistical and machine learning techniques
Authors: Armando Fox
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Our ability to design and deploy large complex systems is outpacing our ability to understand their behavior. How do we detect and recover from "heisenbugs," which account for up to 40% of failures in complex Internet systems, without extensive application-specific coding? Which users were affected, and for how long? How do we diagnose and correct problems caused by configuration errors or operator errors? Although these problems are posed at a high level of abstraction, all we can usually measure directly are low-level behaviors---analogous to driving a car while looking through a magnifying glass. Machine learning can bridge this gap using techniques that learn "baseline" models automatically or semi-automatically, allowing the characterization and monitoring of systems whose structure is not well understood a priori. I'll discuss initial successes and future challenges in using machine learning for failure detection anbd diagnosis, configuration troubleshooting, attribution (which low-level properties appear to be correlated with an observed high-level effect such as decreased performance), and failure forecasting.
ART2-Based Genetic Watermarking
Authors: Ying-Lan Chang, Koun-Tem Sun, Yueh-Hong Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

A genetic watermarking approach based on ART2 neural network is proposed in the paper. This approach uses an ART2 neural network to classify 8×8DCT blocks of images in training sets. For each cluster genetic algorithm (GA) is then performed to find out the optimal coefficients for watermark embedding. All the results are recorded in a table, called Optimal Position Table (OPT). According to the OPT table, the for watermark embedding can be decided straightforward. Two features of the proposed approach make itself a suitable enhancement for genetic watermarking. First, it have the ability to keep and refine the results obtained from genetic watermarking. Second, the proposed method greatly increases the speed of genetic watermarking so that genetic watermarking can be used in practice. The experimental results shows that the watermarked images are perceptually equal to the originals, and that the watermarks are still detectable after low pass filtering high pass filtering and JPEG compression.
Book review: EXPERT SYSTEMS 85. Edited by Martin Merry (British Computer Society)
Venue: Issue 101 (July 1987) (1987)

Expert Systems 85, edited by Martin Merry, contains the papers presented at the fifth technical conference of the British Computer Society's Specialist Group on Expert Systems. The conference covered a wide variety of topics ranging from general discussions of expert systems, applications, planning systems, uncertain inference, and knowledge representation. For the most part the authors assume some familarity with AI and expert systems although one does not need to be well versed in the area in order to follow the papers. Anybody with an interest in expert systems should be able to find at least a few papers worth reading in this collection. Both researchers and students would find this book interesting. Expert Systems 85 may be helpful in broadening the horizons of those who are relatively new to the area and it would be especially appropriate as a source of supplemental readings for a graduate or undergraduate course. 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
An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity
Authors: Sombat Sindhuchao, H. Edwin. Romeijn, Elif Akçali, Rein Boondiskulchok
Venue: Journal of Global Optimization (2005)

In this paper, we develop a mathematical programming approach for coordinating inventory and transportation decisions in an inbound commodity collection system. In particular, we consider a system that consists of a set of geographically dispersed suppliers that manufacture one or more non-identical items, and a central warehouse that stocks these items. The warehouse faces a constant and deterministic demand for the items from outside retailers. The items are collected by a fleet of vehicles that are dispatched from the central warehouse. The vehicles are capacitated, and must also satisfy a frequency constraint. Adopting a policy in which each vehicle always collects the same set of items, we formulate the inventory-routing problem of minimizing the long-run average inventory and transportation costs as a set partitioning problem. We employ a column generation approach to determine a lower bound on the total costs, and develop a branch-and-price algorithm that finds the optimal assignment of items to vehicles. We also propose greedy constructive heuristics, and develop a very large-scale neighborhood (VLSN) search algorithm to find near-optimal solutions for the problem. Computational tests are performed on a set of randomly generated problem instances.
Application of the Taguchi's design of experiments to optimize a bromine chemistry-based etching recipe for deep silicon trenches
Authors: Ping Hsun Chen, Colin Yau, Kuang Yung Wu, Steeve Lin, Han Chang Shih
Venue: Microelectronic Engineering (2005)

In this article, the design of experiments (DOE) of the Taguchi method was used to optimize a deep silicon trench etching recipe in a commercial etcher, Lam Research TCP9400. A L9 orthogonal array was selected with four factors and three levels. The four factors included chamber pressure, bottom power, flow rate ratio of HBr to He, and flow rate of He-O"2. It was found that the chamber pressure has a stronger influence on the etching rate and taper angle of a trench and that the bottom power has a proportional effect on the taper angle of a trench.
MIMO ARIMA models for handoff resource reservation in multimedia wireless networks: Research Articles
Authors: Nikola Rožić, Gorazd Kandus
Venue: Wireless Communications Mobile Computing (2004)

This paper presents a new approach to prediction of resource demand for future handoff calls in multimedia wireless IP networks. Our approach is based on application of multi-input-multi-output (MIMO) multiplicative autoregressive-integrated-moving average (ARIMA) (p,d,q)x(P,D,Q)S models fitted to the traffic data measured in the considered cell itself and on the new call admission control (CAC) algorithm that simultaneously maximizes the system throughput while keeping the handoff call dropping probability (CDP) below the targeted value. The main advantages of the proposed approach are the following: first, the proposed multi-variable prediction method gives on average better predictions (i.e. narrower prediction confidence interval) for realistic traffic situations, which results in lower new call blocking probability (CBP) at the targeted handoff CDP and second, the model is simple to implement since it does not require communication among the adjacent cells. Simulation results show the superiority of the proposed MIMO prediction approach combined with the proposed call admission control algorithm for some typical nonstationary situations in comparison with univariate models. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Approaches for Service Deployment
Authors: Vanish Talwar, Dejan Milojicic, Qinyi Wu, Calton Pu, Wenchang Yan, Gueyoung Jung
Venue: IEEE Internet Computing (2005)

Traditional IT service-deployment technologies are based on scripts and configuration files, which have a limited ability to express dependencies and verify configurations, resulting in hard-to-use and erroneous system configurations. Emerging language- and model-based tools promise to address these deployment challenges, but their benefits aren't yet clearly established. The authors compare manual, script-, language-, and model-based deployment solutions in terms of scale, complexity, expressiveness, and barriers to first use.
A robust cross-style bilingual sentences alignment model
Authors: Tz-Liang Kueng, Keh-Yih Su
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

Most current sentence alignment approaches adopt sentence length and cognate as the alignment features; and they are mostly trained and tested in the documents with the same style. Since the length distribution, alignment-type distribution (used by length-based approaches) and cognate frequency vary significantly across texts with different styles, the length-based approaches fail to achieve similar performance when tested in corpora of different styles. The experiments show that the performance in F-measure could drop from 98.2% to 85.6% when a length-based approach is trained by a technical manual and then tested on a general magazine.Since a large percentage of content words in the source text would be translated into the corresponding translation duals to preserve the meaning in the target text, transfer lexicons are usually regarded as more reliable cues for aligning sentences when the alignment task is performed by human. To enhance the robustness, a robust statistical model based on both transfer lexicons and sentence lengths are proposed in this paper. After integrating the transfer lexicons into the model, a 60% F-measure error reduction (from 14.4% to 5.8%) is observed.
Corporate Information Strategy and Management: Text and Cases, 7 edition
Authors: Lynda M. Applegate
Venue:  (2005)

Corporate Information Strategy and Management: Text and Cases 7/e by Applegate, Austin and McFarlan is written for students and managers who desire an overview of contemporary information systems technology management. It explains the relevant issues of effective management of information services activities and highlights the areas of greatest potential application of the technology. No assumptions are made concerning the reader’s experience with IT, though it is presumed that the reader has some course work or work experience in administration and/or management. This text is comprised of an extensive collection of Harvard Business cases devoted to Information Technology.Table of contentsPrefaceTable of ContentsIntroduction: The Challenges of Managing in a Networked WorldCase #I-1 Li and Fung Internet Issues (A) (HBS #301-009)Module 1: Business Impacts Chapter 1: IT and StrategyChapter 2: IT and Organization Chapter 3. Extending the EnterpriseChapter 4. Making the Case for ITCase #1-1 Charles Schwab in 2002 (HBS #803-070)Case #1-2 Learning from Leapfrog (HBS #804-062)Case #1-3 Wyndham International: Fostering High-Touch with High Tech (HBS #803-092)Case #1-4 Global Healthcare Exchange (HBS #804-002)Article #1-5 IT Doesn’t Matter HBR #3566)Module 2: MANAGING INFRASTRUCTURE AND OPERATIONSChapter 5. Understanding Internetworking InfrastructureChapter 6. Assuring Reliable and Secure IT ServicesChapter 7. Managing Diverse IT InfrastructuresCase #2-1 CareGroup (HBS #303-097)Case #2-2 The iPremier Company: Denial of Service Attack (A) (HBS #601-114)Case #2-3 Ford Motor Company: Supply Chain Strategy ((HBS #699-198)Article #2-4 The Power of Virtual Integration: An Interview with Dell Computer's Michael Dell (HBR #98208)Case #2-5 Postgirot Bank and Provment AB: Managing the Cost of IT Operations (HBS #302-061)Module 3: LEADERSHIP ISSUESChapter 8. Organizing and Leading the IT Functions Chapter 9. Managing IT OutsourcingChapter 10. A Portfolio Approach to IT ProjectsCase #3-1 Cathay Pacific: Doing More with Less (HBS #303-106)Case #3-2 Royal Caribbean Cruises, Ltd. (HBS #304-019)Case #3-3 Rakuten (HBS #305-050)Case #3-4 Telecomunicacoes de São Paulo S.A. (Telesp) (HBS #804-149)Case #3-5 Outsourcing IT: The Global Landscape in 2004 (HBS #304-104)Conclusion: The Challenges of Managing in a Network Economy RevisitedCase #C-1 UCB: Managing Information for Globalization and Innovation A) Abridged)(HBS #304-096)Case #C-2 Enabling Business Strategy with IT at the World Bank (HBS #304-055)Annotated BibliographyIndex
Energy Minimization via Graph Cuts: Settling What is Possible
Authors: Daniel Freedman, Petros Drineas
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was first attacked by two papers of Kolmogorov and Zabih [23, 24], in which they dealt with functions with pairwise and triplewise pixel interactions. In this work, we extend their results in two directions. First, we examine the case of k-wise pixel interactions; the results are derived from a purely algebraic approach. Second, we discuss the applicability of provably approximate algorithms. Both of these developments should help researchers best understand what can and cannot be achieved when designing graph cut based algorithms.
A letter to the editor concerning draft proposed ANS FORTRAN
Authors: William R. Knight
Venue: ACM SIGNUM Newsletter (1976)

Last week a colleague in the compiler area showed me his copy of "SIGPLAN Notices" for 1976 March (vol. 11, #3). The issue is entitled "Draft proposed ANS FORTRAN" and is devoted to a proposed new Fortran Standard. There is a development therein which I think ought to be of concern to people doing numeric computing in Fortran: A limited introduction of array operations is proposed.
A case for a working-set-based memory hierarchy
Authors: Steve Carr, Soner Önder
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design. Unfortunately, corresponding improvements in memory design technology have not been realized, resulting in latencies of over 100 cycles between processors and main memory. This ever-increasing gap in speed has pushed the current memory-hierarchy approach to its limit.Traditional approaches to memory-hierarchy management have not yielded satisfactory results. Hardware solutions require more power and energy than desired and do not scale well. Compiler solutions tend to miss too many optimization opportunities because of limited compile-time knowledge of run-time behavior. This paper explores a different approach that combines both approaches by making use of the static knowledge obtained by the compiler in the dynamic decision making of the micro-architecture. We propose a memory-hierarchy design based on working sets that uses compile-time annotations regarding the working set of memory operations to guide cache placement decisionsOur experiments show that a working-set-based memory hierarchy can significantly reduce the miss rate for memory-intensive tiled kernels by limiting cross interference. The working-set-based memory hierarchy allows the compiler to tile many loops without concern for cross interference in the cache, making tile size choice easier. In addition, the compiler can more easily tailor tile choices to the separate needs of different working sets.
Display of search results in Hebrew: a comparison study between Google and LCC&K interface
Authors: Offer Drori, Ehud Tamir
Venue: Journal of Information Science (2005)

Google search engine is one of the most popular search engines used on the Internet today. It is used to display search results in English, but also in other languages as well. In this paper, we focus on display of search results in Hebrew. Search results retrieved from textual databases may be presented in several ways. In commercial search engines, the most common method is the presentation of a list that includes the titles of the retrieved documents, and, sometimes, the first few lines of each document and additional information. A series of studies at the Hebrew University examined the impact of different textual elements presented to the user on the effectiveness of the search. In the current experiment, presentation of search results in the Google-based interface was compared to presentation of search results in the LCC&K (Line in Context, Categories & Keywords) interface that was developed consequent to the findings of a previous series of studies. Both interfaces displayed the search results in Hebrew and addressed a Hebrew-speaking population. The outcome of the experiment shows that although Hebrew is considered to be a complex language considering its morphology aspects, there is little difference between the results obtained in a previous experiment that was conducted in English and the current experiment that was conducted in Hebrew. This paper will address the experimental process and its findings.
Measuring Scalability of Resource Management Systems
Authors: Arindam Mitra, Muthucumaru Maheswaran, Shoukat Ali
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

Scalability refers to the extent of configuration modifications over which a system continues to be economically deployable. Until now, scalability of resource management systems (RMSs) has been examined implicitly by studying different performance measures of the RMS designs for different parameters. However, a framework is yet to be developed for quantitatively evaluating scalability to unambiguously examine the trade-offs among the different RMS designs. In this paper, we present a methodology to study scalability of RMSs based on overhead cost estimation. First, we present a performance model for a managed distributed system (e.g., Grid computing system) that separates the manager and managee. Second, based on the performance model we present a metric used to quantify the scalability of a RMS. Third, simulations are used to apply the proposed scalability metric to selected RMSs from the literature. The results show that the proposed metric is useful in quantifying the scalabilities of the RMSs.
Improving the accuracy of measurement-based geographic location of internet hosts
Authors: Artur Ziviani, Serge Fdida, José F. de Rezende, Otto Carlos M. B. Duarte
Venue: Computer Networks and ISDN Systems (2005)

Location-aware applications take into account from where the users are accessing and thereby can offer novel functionalities in the Internet. This paper focuses on improving the accuracy of a geographic location service that relies on delay measurements to locate Internet hosts. Host locations are inferred by comparing delay patterns of geographically distributed landmarks, which are hosts with a known geographic location, with the delay pattern of the target host to be located. We deal with two problems that influence the accuracy of the resulting location estimation: (i) the placement of the landmarks and the probe machines that perform the delay measurements; and (ii) how to best measure the similarity between the delay patterns of the landmarks and the one observed for the target host. For the landmark placement problem, we propose a demographic approach to improve the representativeness of each landmark with respect to the hosts to be located. Given a limited number of landmarks, results show that a demographic placement provides closer landmarks and more accurate location estimations for most hosts. Concerning the placement of probe machines, we show that they have to be sparsely placed to avoid gathering redundant data. Furthermore, we define and evaluate three similarity models. Experiments show that other similarity models outperform the commonly adopted Euclidean distance, resulting then in a more accurate geographic location of Internet hosts.