ppxscal/embedding_network huggingface dataset:
Multiscale Segmentation by Combining Motion and Intensity Cues
Authors: Meirav Galun, Alexander Apartsin, Ronen Basri
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a multiscale method for motion segmentation. Our method begins with local, ambiguous optical flow measurements. It uses a process of aggregation to resolve the ambiguities and reach reliable estimates of the motion. In addition, as the aggregation process proceeds and larger aggregates are identified it employs a progressively more complex model to describe the motion. In particular, we proceed by recovering translational motion at fine levels, through affine transformation at intermediate levels, to 3D motion (described by a fundamental matrix) at the coarsest levels. Finally, the method is integrated with a segmentation method that uses intensity cues. We further demonstrate the utility of the method on both random dot and real motion sequences.
Data versioning techniques for internet transaction management
Authors: Ramkrishna Chatterjee, Gopalan Arun
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

An Internet transaction is a transaction that involves communication over the Internet using standard Internet protocols such as HTTPS. Such transactions are widely used in Internet-based applications such as e-commerce. With the growth of the Internet, the volume and complexity of Internet transactions are rapidly increasing. We present data versioning techniques that can reduce the complexity of managing Internet transactions and improve their scalability and reliability. These techniques have been implemented using standard database technology, without any change in database kernel. Our initial empirical results argue for the effectiveness of these techniques in practice.
Mutual region growing for adaptive segmentation of geographical images
Authors: Naoto Mikami, Yukio Kosugi
Venue: Systems and Computers in Japan (2004)

In this paper we propose a new technique of mutual region growing for solving land-cover sorting problems. Land-cover classification subdivides regions of aerial photographs and satellite photographic images into distinct regions, and automation is required for large-scale investigations. In the conventional division method and region growing scheme used for classification without tutorial data, the processing algorithm is simple. However, much labor is required to find the appropriate processing rules, depending on the type of images. In this study, we propose a method of region growing using the structural features of adjacent pixels in the tutorial image, while also utilizing the features of region growing which organize regions with identical properties.In our new method, we aim at flexibly acquiring classification rules by referring to the classification results for the tutorial data. We propose a region growing method in which region growing is performed in the tutorial image by using characteristics based on the neighboring structures of the pixel under consideration. In this technique, the features of the region to be classified in the tutorial image are expressed in the output image by using an agreement index. This index can be obtained by comparing the image structures of the input image and the tutorial image. We also attempt to speed up processing by rearranging the image structure in the teacher image, using a statistical technique. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 64&ndash;77, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10688
On Hamiltonian cycles and Hamiltonian paths
Authors: M. Sohel Rahman, M. Kaykobad
Venue: Information Processing Letters (2005)

A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths. The significance of the theorems is discussed, and it is shown that the famous Ore's theorem directly follows from our result.
Novel Object Recognition Based on Hypothesis Generation and Verification
Authors: Zhenfeng Zhu, Hanqing Lu, Zhenglong Li
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, a novel two-stage object recognition algorithm is proposed. As an iterative line-search optimization method, mean shift technique is used for fast generalizing of a set of hypothesis. During hypothesis generalization procedure, the weighted global shape context is integrated with weighted gray histogram to enhance object representation. As a measure for the discriminative power of probability distributions, the symmetric discrete KL divergence is adopted instead of Bhattacharyya coefficient. In order to handle the problem of negative weights for samples, a new weight regulation method is introduced. For the verification stage, a robust circular Gabor-based object matching algorithm using weighted Hausdorff distance is adopted to give final verification for the set of hypothesis.
Developing a protocol for bioinformatics analysis: An integrated information behavior and task analysis approach: Research Articles
Authors: Joan C. Bartlett, Elaine G. Toms
Venue: Journal of the American Society for Information Science and Technology (2005)

The purpose of this research is to capture, understand, and model the process used by bioinformatics analysts when facing a specific scientific problem. Integrating information behavior with task analysis, we interviewed 20 bioinformatics experts about the process they follow to conduct a typical bioinformatics analysis&mdash;a functional analysis of a gene, and then used a task analysis approach to model that process. We found that each expert followed a unique process in using bioinformatics resources, but had significant similarities with their peers. We synthesized these unique processes into a standard research protocol, from which we developed a procedural model that describes the process of conducting a functional analysis of a gene. The model protocol consists of a series of 16 individual steps, each of which specifies detail for the type of analysis, how and why it is conducted, the tools used, the data input and output, and the interpretation of the results. The linking of information behavior and task analysis research is a novel approach, as it provides a rich high-level view of information behavior while providing a detailed analysis at the task level. In this article we concentrate on the latter. &copy; 2005 Wiley Periodicals, Inc.
Energy-Efficient Flash-Memory Storage Systems with an Interrupt-Emulation Mechanism
Authors: Chin-Hsien Wu, Tei-Wei Kuo, Chia-Lin Yang
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

One of the emerging critical issues for flash-memory storage systems, especially on the implementations of many embedded systems, is on its programmed I/O nature for data transfers. Programmed-I/O-based data transfers might not only result in the wasting of valuable CPU cycles of microprocessors but also unnecessarily consume much more energy from batteries. This paper presents an interrupt-emulation mechanism for flash-memory storage systems with an energy-efficient management strategy. We propose to revise the waiting function in the Memory-Technology-Device (MTD) layer to relieve the microprocessor from busy waiting and to reduce the energy consumption of the system. We show that energy consumption could be significantly reduced with good saving on CPU cycles and minor delay on the average response time in the experiments.
Maran Illustrated Windows XP 101 Hot Tips
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, hundreds of full-color screen shots, illustrations, and useful tips that appeal to and engage visual learners and simplify the learning process. Using simple, easy-to-understand and concise text, this book covers the essential Windows XP topics for both the Home and Professional versions, making it a great reference for all skill levels. Provides extensive coverage of Windows XP, the latest version of Windows, including Windows Security Center, Wi-Fi wireless networking, Bluetooth wireless connections, Windows Media Player 10, and Internet Explorer's Pop-up Blocker. Also covers the latest in computer gadgets and accessories including MP3 player, DVD players, and much more. Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available.
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Authors: Philip E. Gill, Walter Murray, Michael A. Saunders
Venue: SIAM Review (2005)

Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. Second derivatives are assumed to be unavailable or too expensive to calculate. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems. The Hessian of the Lagrangian is approximated using a limited-memory quasi-Newton method. SNOPT is a particular implementation that uses a reduced-Hessian semidefinite QP solver (SQOPT) for the QP subproblems. It is designed for problems with many thousands of constraints and variables but is best suited for problems with a moderate number of degrees of freedom (say, up to 2000). Numerical results are given for most of the CUTEr and COPS test collections (about 1020 examples of all sizes up to 40000 constraints and variables, and up to 20000 degrees of freedom).
A General Purpose 7 DOF Haptic Interface
Authors: Gregory Tholey, Jaydev P. Desai
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A novel haptic interface was designed and developed for use in manipulation tasks. The force feedback mechanism consists of three degrees of spatial force feedback (x, y, and z directions) and 1 degree of grasping/parting (increasing the distance between two or more points) force feedback. This device also provides a net of three additional passive joints for a total of 7 degrees-of-freedom.
Like Rome, a mobile operator's empire wasn't built in a day!: a journey through the rise and fall of mobile network operators
Authors: Jan Damsgaard, Lucia Marchegiani
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

This research provides insights on the key strategic management issues, which lay the basis of a network operator overall competitive strategy. This is done assuming the perspective of a mobile network operator. Through example stemming mainly from the Danish and Italian mobile markets, our paper proposes a model for the management of mobile services, which resembles a lifecycle model. As the Mobile Management Model resembles the rise and fall of network operators, the reader is accompanied on a journey through its four phases. Characteristics of the phases are described in details, and suggestions are derived for optimal strategic behaviors of network operators. The model is supported by evidences from the Danish and Italian mobile markets.
Split-plane shadow volumes
Authors: Samuli Laine
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

We present a novel method for rendering shadow volumes. The core idea of the method is to locally choose between Z-pass and Z-fail algorithms on a per-tile basis. The choice is made by comparing the contents of the low-resolution depth buffer against an automatically constructed split plane. We show that this reduces the number of stencil updates substantially without affecting the resulting shadows. We outline a simple and efficient hardware implementation that enables the early tile culling stages to reject considerably more pixels than with shadow volume optimizations currently available in the hardware.
The AMIDAR Class of Reconfigurable Processors
Authors: Stephan Gatzka, Christian Hochberger
Venue: The Journal of Supercomputing (2005)

In this contribution we present a novel general model for adaptive processors. We describe its basic principle of operation and introduce several formal characterizations. The adaptive operations that are possible with this model are thoroughly discussed. The model allows runtime variations of the type and number of functional units as well as variations of the communication structure. We introduce simple heuristics to achieve adaptivity of the architecture. Experimental results show that a processor implementing this model can adapt its architecture to the requirements of diverse applications.
A comprehensive approach for the development of modular software architecture description languages
Authors: Eric M. Dashofy, André van der Hoek, Richard N. Taylor
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2005)

Research over the past decade has revealed that modeling software architecture at the level of components and connectors is useful in a growing variety of contexts. This has led to the development of a plethora of notations for representing software architectures, each focusing on different aspects of the systems being modeled. In general, these notations have been developed without regard to reuse or extension. This makes the effort in adapting an existing notation to a new purpose commensurate with developing a new notation from scratch. To address this problem, we have developed an approach that allows for the rapid construction of new architecture description languages (ADLs). Our approach is unique because it encapsulates ADL features in modules that are composed to form ADLs. We achieve this by leveraging the extension mechanisms provided by XML and XML schemas. We have defined a set of generic, reusable ADL modules called xADL 2.0, useful as an ADL by itself, but also extensible to support new applications and domains. To support this extensibility, we have developed a set of reflective syntax-based tools that adapt to language changes automatically, as well as several semantically-aware tools that provide support for advanced features of xADL 2.0. We demonstrate the effectiveness, scalability, and flexibility of our approach through a diverse set of experiences. First, our approach has been applied in industrial contexts, modeling software architectures for aircraft software and spacecraft systems. Second, we show how xADL 2.0 can be extended to support the modeling features found in two different representations for modeling product-line architectures. Finally, we show how our infrastructure has been used to support its own development. The technical contribution of our infrastructure is augmented by several research contributions: the first decomposition of an architecture description language into modules, insights about how to develop new language modules and a process for integrating them, and insights about the roles of different kinds of tools in a modular ADL-based infrastructure.
TYPHOON: mobile distributed hash tables
Authors: Hung-Chang Hsiao, Chung-Ta King, Chia-Wei Wang
Venue: Journal of Parallel and Distributed Computing (2005)

TYPHOON is a capability-aware peer-to-peer (P2P) system. It exploits the heterogeneity of nodes in the system based on the concept of virtual homes. Nodes participating in the system are classified as good and inactive. TYPHOON uses resources provided by good peers. It is thus more reliable and agile than a naive structured P2P system. When a good peer is overloaded, it picks a suitable inactive node and migrates some loads (i.e., virtual homes) to that node. However, migration of virtual homes may cause instability in the system. TYPHOON thus incorporates a mechanism for tracking virtual homes. A migrated home can receive states of relevant homes using an adaptive, logical tree structure that can also react to system heterogeneity, node loading and network locality. A migrated home can also proactively discover the state of an interested home to ensure the correctness of lookup. We evaluate TYPHOON using theoretical and simulation analysis. We also benchmark TYPHOON using a prototype system on 34 desktop PCs. The results all confirm the effectiveness of TYPHOON.
Software engineering for secure systems
Authors: Danilo Bruschi, Bart De Win, Mattia Monga
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Does an online course work in computer science?
Authors: Robert McCloud
Venue: Journal of Computing Sciences in Colleges (2004)

At many colleges and universities there is considerable interest in offering courses online. Yet some faculty members express skepticism that online courses are not as rigorous as their classroom counterparts. This paper explores what happens when the exact same service learning computer science course was offered in a classroom and online environment to similar students at one university. The author found that there were no significant differences in learning outcomes. There were, however, differences in the types of students who tended to enroll in the online course.
A conceptual approach to information security in financial account aggregation
Authors: Manish Agrawal, Hemant Padmanabhan, Lokesh Pandey, H. R. Rao, Shambhu Upadhyaya
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

An important dimension of mobile computing is the ubiquitous and location-independent availability of data. Aggregation is the ability to electronically access and display personal account information from disparate sources through a single identity. The client financial data is assembled in an organized format providing meaningful summarization and analysis. The prevalent methods of aggregation pose issues in information security and assurance. Utilizing advances in Internet technology such as web services and SOAP coupled with the best of the present approaches to aggregation we can arrive at better solutions to securing the identity and data of aggregation customers. The paper puts forth conceptual solutions to address issues regarding security of user profile and identifying aggregators masquerading as users through processes such as screen scraping.
Fast quantum algorithms for computing the unit group and class group of a number field
Authors: Sean Hallgren
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's equation, which is a special case of computing the unit group, but a reduction in the other direction is not known and appears more difficult. We give polynomial-time quantum algorithms for computing the unit group and class group when the number field has constant degree.
Sams Teach Yourself Mac OS X Tiger All in One (Sams Teach Yourself All in One)
Authors: Robyn Ness, John Ray
Venue:  (2005)

The Macintosh environment is very exciting - and very confusing, especially for the first time user. What you need is one book that will guide you through all of the exciting features and programs that came with your new Mac. That's where Mac OS X Tiger All in One comes in. This thorough, easy-to-understand introduction to all of the components of Mac OS X Tiger will teach you how to easily work with Mac hardware, the operating system and all of the powerful digital media applications that are built right into your system. Did you know you can make your own music with a program called Garage Band? You can even burn CDs and DVDs using a program called iDVD. All of the features and programs in a Mac work together cohesively, so why consult multiple books that work against the natural flow of the Mac system? Mac OS X Tiger All in One is all you need to become a fluent Mac user.
Performance Measurements of the Saturation Throughput in IEEE 802.11 Access Points
Authors: Enrico Pelletta, Hector Velayos
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

Performance measurements of IEEE 802.11 access points provide important information for networking research and network management. In this paper, we present an active measurement method to determine the maximum saturation throughput of wireless LAN access points. The saturation throughput is achieved when there always is a frame ready to transmit, and it reaches the maximum for optimal transmission conditions. We use the proposed method to measure and analyze the performance of five IEEE 802.11b access points. The results show the strength of our method and identify performance characteristics of commercial access points. The analysis produces the following results. The maximum saturation throughput shows significant differences between models. Increasing the offered load to the access pointýs Ethernet interface does not always increase the throughput; a few access points present a downlink throughput reduction when the offered load exceeds their bridging capabilities. Some access points exhibit better performance in certain orientations.
The N/R One Time Password System
Authors: Vipul Goyal, Ajith Abraham, Sugata Sanyal, Sang Yong Han
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

A new one time password system is described which is secure against eavesdropping and server database compromise at the same time. Traditionally, these properties have proven to be difficult to satisfy at the same time and only one previous scheme i.e. Lamport Hashes also called S/KEY one time password system has claimed to achieve that. Lamport hashes however have a limitation that they are computationally intensive for the client and the number of times a client may login before the system should be re-initialized is small. We address these limitations to come up with a new scheme called the N/R one time password system. The basic idea is have the server aid the client computation by inserting 'breakpoints' in the hash chains. Client computational requirements are dramatically reduced without any increase in the server computational requirements and the number of times a client may login before the system has to be reinitialized is also increased significantly. The system is particularly suited for mobile and constrained devices having limited computational power.
Filtration of a random process in a statistically uncertain linear stochastic differential system
Authors: G. B. Miller, A. R. Pankov
Venue: Automation and Remote Control (2005)

Minimax filtration of a process in a stochastic linear differential system with uncertain perturbation intensities for dynamics and observation models is studied. The filter is optimized by an integral quality criterion. Minimax filtering equations are derived from the solution of the dual optimization problem. A numerical filter designing method is described and its convergence is proved. Results of numerical experiments are given.
Use of standards in a production environment
Authors: A. J. Payne
Venue: ACM SIGDA Newsletter (1978)

This paper reviews the effects of standards when they are applied to the learning of a production technique. In the first part we describe what has been published on the subject previously. The second section develops a theoretical model for the learning of a production operation and then we apply it to experimental results which are described in part three.