ppxscal/embedding_network huggingface dataset:
Two-Dimensional PCA: A New Approach to Appearance-Based Face Representation and Recognition
Authors: Jian Yang, David Zhang, Alejandro F. Frangi, Jing-yu Yang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, a new technique coined two-dimensional principal component analysis (2DPCA) is developed for image representation. As opposed to PCA, 2DPCA is based on 2D image matrices rather than 1D vectors so the image matrix does not need to be transformed into a vector prior to feature extraction. Instead, an image covariance matrix is constructed directly using the original image matrices, and its eigenvectors are derived for image feature extraction. To test 2DPCA and evaluate its performance, a series of experiments were performed on three face image databases: ORL, AR, and Yale face databases. The recognition rate across all trials was higher using 2DPCA than PCA. The experimental results also indicated that the extraction of image features is computationally more efficient using 2DPCA than PCA.
Image Denoising and Decomposition with Total Variation Minimization and Oscillatory Functions
Authors: Luminita A. Vese, Stanley J. Osher
Venue: Journal of Mathematical Imaging and Vision (2004)

In this paper, we propose a new variational model for image denoising and decomposition, witch combines the total variation minimization model of Rudin, Osher and Fatemi from image restoration, with spaces of oscillatory functions, following recent ideas introduced by Meyer. The spaces introduced here are appropriate to model oscillatory patterns of zero mean, such as noise or texture. Numerical results of image denoising, image decomposition and texture discrimination are presented, showing that the new models decompose better a given image, possible noisy, into cartoon and oscillatory pattern of zero mean, than the standard ones. The present paper develops further the models previously introduced by the authors in Vese and Osher (Modeling textures with total variation minimization and oscillating patterns in image processing, UCLA CAM Report 02-19, May 2002, to appear in Journal of Scientific Computing, 2003). Other recent and related image decomposition models are also discussed.
Automatic code generation for a convection scheme
Authors: Paul van der Mark, Lex Wolters, Gerard Cats
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Traditional design and implementation of large atmospheric models is a difficult, tedious and error prone task. With the CTADEL project we investigate a new method of code generation, where the designer describes the model in an abstract high-level specification language which is translated into highly optimized Fortran code. This is applied to a convection scheme as used in a numerical weather prediction model (NWP). We address problems like how to generate efficient code for conditional expressions by using polymorphic templates. Finally, we compare the generated code for the convection scheme with the hand-written reference code.
Editorial: Journal Rankings: Save the Outlets for Your Research
Authors: Steven M. Shugan
Venue: Marketing Science (2003)

Rankings of MBA programs by journalists have had a dramatic impact on business schools. Now, we face the prospect of journal rankings. Journal rankings impose a single dimension for evaluating journals that will inevitably hurt some journals. However, there are steps that researchers can take to keep their journals strong. For example, we should all support our professional organizations, subscribe to relevant journals, and count journal service in promotion decisions. In sum, this article identifies ten steps all researchers should take.
Customization of Enterprise Content Management Systems: An Exploratory Case Study
Authors: Stig Nordheim, Tero Päivärinta
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Enterprise Content Management (ECM) systems are mostly implemented in organizations by acquiring commercial software packages and customizing them to meet the organizational requirements. The customization aspect of ECM systems lacks empirical research. This paper explores the concepts of ECM customization and issues identified with ECM customization. The data are based on an in-depth case study from the oil industry and complemented with asecondary analysis of 60 vendor-reported cases of ECM implementations. The results show considerable customization challenges related to ECM, especially concerning integration, usability and functional adaptation. A resulting framework of customization concepts in ECM is suggested and discussed, along with issues for further research.
A &lambda;-calculus with explicit weakening and explicit substitution
Authors: René David, Bruno Guillaume
Venue: Mathematical Structures in Computer Science (2001)

Since Melli&egrave;s showed that &lambda;&sigma; (a calculus of explicit substitutions) does not preserve the strong normalization of the &beta;-reduction, it has become a challenge to find a calculus satisfying the following properties: step-by-step simulation of the &beta;-reduction, confluence on terms with metavariables, strong normalization of the calculus of substitutions and preservation of the strong normalization of the &lambda;-calculus. We present here such a calculus. The main novelty of this calculus (given with de Bruijn indices) is the use of labels that represent updating functions and correspond to explicit weakening. A typed version is also presented.
A Feature Oriented Approach to Modeling and Reusing Requirements of Software Product Lines
Authors: Hong Mei, Wei Zhang, Fang Gu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Getting a proper set of reusable requirements is animportant milestone for successful software product line(SPL) practice. But modeling SPL requirements is usuallymore complex and difficult than modeling requirementsfor individual applications because it often involvessystematically exploring commonality and variationacross a set of applications. This paper presents afeature-oriented approach to modeling and reusing SPLrequirements. A framework of the feature model is firstproposed from five aspects, namely, basic structure,variation representation mechanism, variation bindingtime, variation constraint mechanism and quality featureanalysis. Then, a customization-based reusing method issuggested, and a feature-oriented domain modelingmethod (FODM) is presented, including a concrete formof the feature model and a modeling process for it. At theend, a case study of a real domain is used to validate thefeature model framework and demonstrate FODM.
A lower bound for integer multiplication on randomized ordered read-once branching programs
Authors: Farid Ablayev, Marek Karpinski
Venue: Information and Computation (2003)

We prove an exponential lower bound 2Ω(n/log n) on the size of any randomized ordered read-once branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's randomized one-way communication complexity of certain Boolean functions. It generalizes to some other models of randomized branching programs. In contrast, we prove that testing integer multiplication, contrary even to a nondeterministic situation, can be computed by randomized ordered read-once branching program in polynomial size. It is also known that computing the latter problem with deterministic read-once branching programs is as hard as factoring integers.
Vulnerability of Sensor Networks to Unauthorized Traversal and Monitoring
Authors: Veradej Phipatanasuphorn, Parameswaran Ramanathan
Venue: IEEE Transactions on Computers (2004)

Abstract--There is a growing interest in the use of wireless ad hoc sensor networks to monitor, detect, and track the movement of specified targets in a geographic region. A common concern in the deployment of such networks is whether or not a target can pass or intrude a sensor field without being detected. Recent papers in the literature have defined a measure called exposure to quantify the likelihood of a target passing through a sensor field without being detected. These papers differ in the definition of exposure. Also, the existing definitions of exposure are indicators of the likelihood of intrusion and not a direct measure of it. In this paper, we directly work with probability of detection instead of its indicators. We also probabilistically account for the presence of noise in the sensor readings. In the presence of noise, there is a trade off between the probability of a target passing through a sensor field without detection and the false alarm probability (i.e., the probability of falsely detecting the presence of target). We analytically characterize this trade off and illustrate the trade off for example deployments. We also introduce a variant of the traversal problem called unauthorized monitoring. This problem is of interest if sensor fields are used to secure an asset. We analytically characterize the probability of detecting unauthorized monitoring. We also show a trade off between this probability and the corresponding false alarm probability in the presence of noise.
Harmonizing IT and business strategies
Authors: Kevin Johnston
Venue: Managing globally with information technology (2003)

This chapter proposes that all business strategies should be harmonized into a single strategy, rather than attempt to align IT strategy with business strategy. It focuses on two hypotheses: firstly, that IT strategy is not widely aligned with business strategy; and secondly, that IT is still thought of as "something different" in businesses. The chapter proposes that rather than attempt to align IT strategy with business strategy, the strategies should be harmonized into a single strategy. The chapter attempts to use lessons from geese to outline the process of strategic development.
A/B Dashboard: The Case for a Virtual Information Systems Development Environment to Support a RAD Project
Authors: Panos Louvieris, Jan Powell-Perry, Paul Beynon-Davies
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The impact of digitization on organizational structures and processes is transforming relationships and work practices. The dynamics of the digital economy fuelled by the high rate of innovation in digital technologies demand that firms adopt an equally rapid and responsive information systems development model/paradigm to keep pace. With reference to Rapid Applications Development (RAD), this case study considers the degree to which an iterative and participative information systems development process is amenable to being conducted in a virtual manner. Using participatory action research, this paper investigates the potential for deploying a virtual learning environment as a CASE tool for the development of web-based applications. In this instance the final IT artefact is an operational prototype - the A/B Dashboard. We demonstrate that a virtual information systems development environment can successfully support a RAD/DSDM approach, resolving some of the existing problems associated with RAD.
How Extreme Does Extreme Programming Have to Be? Adapting XP Practices to Large-Scale Projects
Authors: Lan Cao, Kannan Mohan, Peng Xu, Balasubramaniam Ramesh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

The need to develop software at Internet speed and accommodate changes during the entire software development life cycle has made lightweight or agile development methodologies like Extreme Programming popular. However, such methodologies have been considered to be beneficial for small and medium sized projects, with small teams. In this research, based on a case study in an organization that develops large-scale, complex software using a modified form of extreme programming, we highlight the key differences between agile principles proposed in prior literature and the agile practices that are suitable for large-scale, complex software development. Based on these differences, we propose general guidelines on tailoring agile development methodologies to make them suitable for the development of large, complex software systems .
Multi-Rate Access Schemes for MC-CDMA
Authors: Mizhou Tan, Pingping Zong, Yeheskel Bar-Ness
Venue: Wireless Personal Communications: An International Journal (2003)

In order to accommodate different types of traffic in future wireless communications, it is necessary to consider a system, which can operate satisfactorily at multiple transmission rates. Due to its capability to cope with the hostile frequency selective fading, that limits transmission rate, and its suitability to handle multi-rate data, multi-carrier CDMA (MC-CDMA) has recently drawn considerable attention as a suitable candidate for supporting multimedia services in wireless communications. Multi-rate access schemes where users are able to transmit at different data rates on MC-CDMA systems are presented in this paper. Four multi-rate access schemes: uncoded fixed spreading length (UFSL), coded fixed spreading length (CFSL), multi-code fixed spreading length (MFSL) and variable spreading length (VSL) schemes are proposed. With these schemes, different traffic such as voice, video and high rate data can be transmitted seamlessly through one MC-CDMA infrastructure. A chip-level minimum mean square error combining (MMSEC) technique is employed for joint energy combining and interference cancellation purpose. The performance of these schemes with MMSEC is compared by both theoretical derivations and simulation results under frequency selective Rayleigh fading channels.
Exploiting syntactic structure of queries in a language modeling approach to IR
Authors: Munirathnam Srikanth, Rohini Srihari
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Natural Language Processing (NLP) techniques have been explored to enhance the performance of Information Retrieval (IR) methods with varied results. Most efforts in using NLP techniques have been to identify better index terms for representing documents. This use in the indexing phase of IR has implicit effect on retrieval performance. However, the explicit use of NLP techniques during the retrieval or information seeking phase has been restricted to interactive or dialogue systems. Recent advances in IR are based on using Statistical Language Models (SLM) to represent documents and ranking them based on their model generating a given user query. This paper presents a novel method for using NLP techniques on user queries, specifically, a syntactic parse of a query, in the statistical language modeling approach to IR. In the proposed method, named Concept Language Models, a query is viewed as a sequence of concepts and a concept as a sequence terms. The paper presents different approximations to estimate the concept and term probabilities and compute the query likelihood estimate for documents. Some empirical results on TREC test collections comparing Concept Language Models with smoothed N-gram language models are presented.
Constraint-Based Negotiation in a Multi-Agent Information System with Multiple Platform Support
Authors: Dickson K. W. Chiu, S. C. Cheung, Patrick C. K. Hung, Ho-fung Leung
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Agent technologies have been deployed to model and implement E-commerce activities as multi-agent information systems (MAIS). Agents provide services to one another for mutual gain on behalf of their users. This paper presents an MAIS infrastructure based on belief-desire-intension (BDI) agent architecture, constraint technology, and contemporary Web Services to facilitate negotiation support. Further, the MAIS infrastructure also supports customizable degree of agent delegation for users on different platforms, with or without agent support. We present a constraint-based negotiation protocol extended for a MAIS environment and detail the required adaptations on different platforms from a three-tier implementation architecture aspect.
User interface generation with OlivaNova model execution system
Authors: Pedro J. Molina
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

This demo proposal shows the capabilities for user interface code generation provided by OlivaNova Model Execution System (ONME). This system is based on the conceptual pattern language Just-UI for user interface specification. The suite comprises a modeling tool, a model validator and code generators to transform specification to source code ready to run.
Online Scheduling and Placement of Real-time Tasks to Partially Reconfigurable Devices
Authors: Christoph Steiger, Herbert Walder, Marco Platzner, Lothar Thiele
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

This paper deals with online scheduling of tasks to partiallyreconfigurable devices. Such devices are able toexecute several tasks in parallel. All tasks share the reconfigurablesurface as a single resource which leads tohighly dynamic allocation situations. To manage such devicesat runtime, we propose a reconfigurable operatingsystem that splits into three main modules: scheduler,placer, and loader. The main characteristics of the resultingonline scheduling problem is the strong nexus betweenscheduling and placement. We discuss a fast online placementtechnique and then focus on scheduling real-timetasks. We devise guarantee-based schedulers for two scenarios,namely tasks with arbitrary and synchronous arrivaltimes. The schedulers exploit the knowledge about taskproperties to improve the system's performance. The experimentsshow that the developed schedulers lead tosubstantial performance gains at an acceptable run-timeoverhead.
Fully automated interoperability test suite derivation for communication protocols
Authors: Soonuk Seol, Myungchul Kim, Sungwon Kang, Jiwon Ryu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We propose an automatic test derivation method for testing interoperability of communication protocols. It first derives a skeleton test suite for control part through a sort of reachability analysis. Next, it parameterizes each test case. Finally, it completes the test suite by actualizing test cases by assigning values to their parameters. By constructing test case space based on stable states and by basing test case actualization step on orthogonal arrays used in experimental design techniques, state space explosion is avoided. In order to demonstrate the feasibility and effectiveness, out method is applied to the ATM/B-ISDN signaling protocol and TCP. The application results show that our method surpasses the conventional methods in terms of both test size and coverage.
Decision-feedback interference suppression in CDMA systems: a ML-based semiblind approach
Authors: Mónica F. Bugallo, Joaquín Míguez, Luis Castedo
Venue: Signal Processing (2003)

This paper addresses the problem of interference suppression in direct sequence code division multiple access systems. We propose a novel semiblind decision feedback (DF) receiver based on the maximum likelihood principle that simultaneously exploits the transmission of training sequences and the statistical information of the unknown transmitted symbols. Both iterative and adaptive implementations of the proposed receiver, derived within the framework of the expectation maximization algorithm, are presented. Computer simulations show that the resulting multiuser detectors attain practically the same performance as the theoretical DF minimum mean square error receiver.
On the Dengfeng-Chuntian similarity measure and its application to pattern recognition
Authors: H. B. Mitchell
Venue: Pattern Recognition Letters (2003)

Recently Dengfeng and Chuntian defined the first operational definition of a similarity measure for intuitionistic fuzzy sets and showed how it may be used in pattern recognition problems. Unfortunately the Dengfeng and Chuntian operator may give counter-intuitive results. We show how a simple modification of the Dengfeng-Chuntian operator may correct this problem. We illustrate the application of the modified similarity measure on a simple pattern recognition problem.
Interactive PL/1
Authors: Marvin V. Zelkowitz
Venue: ACM SIGPLAN Notices (1974)

An investigation of the PL/1 language in an interactive environment has lead to the discovery of several deficiencies in the language when used as a pedagogical tool. How these deficiencies were eliminated (or avoided) in one particular implementation is discussed.
Dimensionality Reduction in Automatic Knowledge Acquisition: A Simple Greedy Search Approach
Authors: Samuel H. Huang
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Knowledge acquisition is the process of collecting domain knowledge, documenting the knowledge, and transforming it into a computerized representation. Due to the difficulties involved in eliciting knowledge from human experts, knowledge acquisition was identified as a bottleneck in the development of knowledge-based system. Over the past decades, a number of automatic knowledge acquisition techniques have been developed. However, the performance of these techniques suffers from the so called curse of dimensionality, i.e., difficulties arise when many irrelevant (or redundant) parameters exist. This paper presents a heuristic approach based on statistics and greedy search for dimensionality reduction to facilitate automatic knowledge acquisition. The approach deals with classification problems. Specifically, Chi-square statistics are used to rank the importance of individual parameters. Then, a backward search procedure is employed to eliminate parameters (less important parameters first) that do not contribute to class separability. The algorithm is very efficient and was found to be effective when applied to a variety of problems with different characteristics.
Least-squares fit of genomic data by sums of epistatic effects
Authors: Philip Hanlon, William Andrew Lorenz, Dave Strenski
Venue: Journal of Parallel and Distributed Computing (2003)

With the growth of genetic information, new methods and computational approaches are needed to understand the volume of data. In this paper, we first define a class of functions (additive epistatic effects (AEE) functions) which capture the notion of additive combination of epistatic effects. We propose an exhaustive bootstrapping methodology to search for an AEE function which most closely approximates an observed phenotype. Lastly, we present a computational approach, which takes advantage of several features of the CRAY SV1ex, to obtain an optimized implementation of this search method. The program has been tested with several test cases and good results are shown with varying amounts of noise added to the test phenotype.
XML Retrieval
Authors: Ricardo Baeza-Yates
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

This tutorial covers the main concepts related to retrieving information from data structured in XML. The content is divided in three parts. The first covers the main concepts of XML, including defining, displaying and querying XML data. The second part addresses the challenges of retrieving information from XML data, in particular ranking and benchmarking. The last part covers indices for structure and their algorithms, focusing in the trade-off of expressivity vs. efficiency. Along the tutorial the state of the art of the above issues is emphasized, including current available software.