ppxscal/embedding_network huggingface dataset:
Face Recognition in the Presence of Expression and/or Illumination Variation
Authors: Harin Sellahewa, Sabah Jassim
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Face recognition is a technically difficult task that forms part of an ever-growing number of applications. The challenge becomes more complex by requirement of robustness against variation in facial expressions, pose and lighting condition. In this paper, we present a wavelet-based face recognition scheme and report on its performance on 2 databases. We shall also demonstrate that it is more robust against varying facial expressions than a known scheme that has been developed specifically for that purpose. We shall also report on the positive effect of a simple procedure to reduce the effect of variation in illumination level on accuracy, in contrast to Histogram Equalization.
Safe and Reliable Use of Concurrency in Multi-Threaded Shared-Memory Systems
Authors: R. E. K. Stirewalt, Reimer Behrends, Laura K. Dillon
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The safe and reliable use of concurrency in multi-threaded systems has emerged as a fundamental engineering concern. We recently developed a model of synchroniztion contracts to address this concern in programs written in object-oriented languages. Programs written using our model comprise modules that declare access requirments in module interfaces in lieu of using low-level synchroniztion primitives in module implementations. At run time, these contracts are negotiated to derive schedules that guarantee freedom from data races while avoiding a large class of deadlock situations.
Extended-Regular Sequence for Automated Analysis of Microarray Images
Authors: Hee-Jeong Jin, Bong-Kyung Chun, Hwan-Gue Cho
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

A variety of high throughput methods have made it possible to generate detailed temporal expression data for a single gene or large numbers of genes. Methods for analysis of these large data sets can be problematic. One challenge is the comparison of temporal expression data obtained from different growth conditions where the patterns of expression may be shifted in time. We propose the use of wavelet analysis to transform the data obtained under different growth conditions to permit comparison of expression patterns from experiments that have time shifts or delays. We demonstrate this approach using detailed temporal data for a single bacterial gene obtained under 72 different growth conditions. This general strategy for can be applied in the analysis of data sets of thousands of genes during cellular differentiation and response.
A method for retrieving music data with different bit rates using MPEG-4 TwinVQ audio compression
Authors: Michihiro Kobayakawa, Mamoru Hoshi, Kensuke Onishi
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The present paper describes a method for indexing a piece of music using the TwinVQ (Transform-domain Weighted Interleave Vector Quantization) audio compression (MPEG-4 audio standard). First, we present a framework for indexing a piece of music based on the autocorrelation coefficients computed in the encoding step of TwinVQ audio compression. Second, we propose a new music feature that is robust with respect to bit rate based on the fact that the i-th autocorrelation coefficient with bit rate B1 of a piece of music computed in the encoding step of TwinVQ audio compression can approximate the j-th autocorrelation coefficient with bit rate B2 of the piece of music where i= left lfloor frac B_1 B_2 j right rfloor, and on the wavelet transform. Finally, we perform retrieval experiments on 1,023 pieces of polyphonic music with bit rate (8 kbps, 12 kbps, 16 kbps, 20 kbps, 24 kbps, 28 kbps, 32 kbps, 36 kbps, 40 kbps, and 44 kbps). The experimental results indicate that the proposed music feature for indexing has excellent retrieval performance for queries of various bit rates.
Some new algorithms for multiple maneuvering target tracking
Authors: Sumedh P. Puranik
Venue:  (2005)

Target tracking is the processing of noise-corrupted measurements obtained from a target in order to maintain an estimate of its current state. In this dissertation we develop a set of new suboptimal filtering and smoothing algorithms for maneuvering target tracking application. The proposed algorithms provide better performance in terms of estimation accuracy over the existing algorithms. The dissertation is organized in five parts: (1) We propose a novel suboptimal filtering algorithm for the problem of tracking multiple maneuvering targets in the presence of clutter. In the proposed algorithm, we exploit the multiscan joint probabilistic data association (Mscan-JPDA) approach to address the measurement-to-track association problem. Earlier work on the multiscan JPDA is restricted to non-maneuvering targets, in which single kinematic model is used to model the motion behavior of the target. We use switching multiple model approach in which distinct kinematic models describe the motion of the target and switching among these models is governed by a Markov chain. We then exploit the basic interacting multiple model (IMM) approach for multiple model estimation. (2) We extend the proposed IMM/Mscan-JPDA filtering algorithm to the fixed-lag smoothing case in which the objective is to obtain the state estimates at time k when given the measurements up to time k + d ( d > 0 and is fixed). The smoothing algorithm achieves significant improvement in the estimation accuracy over the filtering algorithm, by introducing a small time lag between the instants of estimation and latest measurements. (3) We extend the proposed IMM/Mscan-JPDA filtering algorithm to a multisensor tracking scenario. We carry out sequential updating of the state by obtaining measurements from the multiple sensors. (4) We consider the problem of scheduling multiple sensors for a maneuvering target tracking application. Tracking of highly maneuvering target is achieved by an effective suboptimal filtering algorithm based on the IMM filtering approach combined with the probabilistic data association (PDA) technique and the proposed sensor scheduling algorithm. (5) We propose a new adaptive sampling policy for a maneuvering target tracking application. Multisensor tracking is achieved by a suboptimal filtering algorithm developed by the IMM/PDA filter combined with the proposed adaptive sampling scheme. (Abstract shortened by UMI.)
Component Specification for Enterprise Software Development on Web Services Environment
Authors: Il-Hyung Cho, John D. McGregor
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The idea of developing software systems by putting software modules together has been a goal for many software researchers and practitioners for a long time. This goal is within sight due to the increased adoption of componentbased software engineering, the development of component standards, and their wide acceptance by industry. Component- based development is an approach to developing a software system by assembling and composing already built software components. It promises reusable and plugand- playable software system development environments. The component concept is not new and has been perceived in several different ways by software researchers in academics and practitioners in industry. The different perspectives from diverse researchers and practitioners have led to a plethora of definitions of component and different component specification and implementation models. In this paper, we will briefly review several of these different views and definitions on software components. We then present the Interoperable Component Specification Model (ICSM) for the Web services environment.
Out of the mouths of middle school children: I. Developing user-defined controlled vocabularies for subject access in a digital library: Research Articles
Authors: June Abbas
Venue: Journal of the American Society for Information Science and Technology (2005)

Representation and retrieval obstacles within a digital library designed for use by middle school children are presented. Representation of objects is key to retrieval. Tools used to create representations for children's resources, such as controlled vocabularies, need to be more age appropriate. Development of age-appropriate controlled vocabularies requires us to learn more about the ways children interact with systems and form search strategies to represent their information needs. Children's search terms and questions are a rich resource for learning more about their information seeking process, their question state, and their formulation of searches. A method for gathering and using children's own search terms and the benefits of their utilization in developing more age-appropriate controlled vocabularies are discussed. &copy; 2005 Wiley Periodicals, Inc.
Uniform random numbers in APL
Authors: William R. Franta
Venue: ACM SIGSIM Simulation Digest (1973)

In the article by R. Wheeler, the author laments the integer nature of the APL operator ? when faced with the need to construct a generator which produces random numbers uniformly distributed on (0, 1). The difficulty arises in that the definition specifies that ? X returns a random integer from 1 to X inclusive. It is indeed unfortunate, since in many ways APL is ideally suited to Monte Carlo experiments. Recently when designing and implementing an APL processor for the CDC 6600, the deficiency was clearly recognized. Under such conditions three possibilities exist in choosing a course of action, namely: (1) the deficiency can be ignored, (2) the operator definition can be altered, and (3) the operator definition can be extended. The design effort dictated that the processor be consistent (in every conceivable way) with the specifications given in [2] thus disallowing (2). This is important so that APL remains APL rather than a series of dialects all labeled APL. The only possible route for emmendation of the deficiency that remains, therefore, is (3).
Simulation of a dynamic balance theory
Authors: BERRY VAN KONINGSVELD
Venue: ACM SIGSIM Simulation Digest (1976)

The purpose of this article is to report on an attempt to substitute a <u>dynamic</u> model for Heider's well known Psychological "Balance" theory.Additionally, a computer simulation of this model is suggested, with help of a computer language for dynamically modelling large samples of biological cells: CELLSIM. (Computer outputs are available upon request from Henk Koppelaar MPS group, Oudennoord 6, Utrecht.
A Ground-Truthed Mathematical Character and Symbol Image Database
Authors: Masakazu Suzuki, Seiichi Uchida, Akihiro Nomura
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes the specifications for our ground-truthed mathematical character and symbol image database, called InftyCDB-1. The ground-truth of each character is composed of type, font, quality (touched/broken) and link (relative position), etc. The database includes all the characters and symbols of 467 pages of 30 articles on mathematics, and is organized so that it can be used as word image database or as mathematical formula image database. InftyCDB-1 is a public database that is freely usable for research and development purposes.
A New Segmentation Method for Lung HRCT Images
Authors: Rahil Garnavi, Ahmad Baraani-Dastjerdi, Hamid Abrishami Moghaddam, Masoomeh Giti, Ali Adjdari Rad
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Image segmentation plays a crucial role in many medical imaging applications by automating or facilitating the delineation of anatomical structures and other regions of interest. The aim of this paper is to develop an accurate and reliable method for segmentation of lung HRCT images using a pixel-based approach. The proposed method combines traditional concepts, such as global-threshold segmentation, mathematical morphology, edge detection and noise reduction, with new ideas, such as performing geometrical computations to achieve the defined ROIs. Two different approaches are proposed and tested on 100 computed-tomography images. Noise tolerance of the algorithm is calculated considering several parameters and objective criteria. In addition, the image segmentation results were visually validated by radiologists.
Office blogger
Authors: Berna Erol, Jonathan J. Hull
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The Office Blogger (OBlog) is an experimental prototype of a multimedia appliance that allows an office worker to easily record events, conversations, meetings, pictures and documents, and helps create blog entries from that data. OBlog employs a novel image classification algorithm and automatic post processing to make the information about images more accessible to users. The OBlog system uses an älways-on" design that makes it convenient to use and it's packaged as a stand-alone system to remove any computational burden from a user's PC. Results show that the image classification algorithm achieves over 90% recall on five image categories commonly encountered by office workers.
Importance-Driven Visualization Layouts for Large Time Series Data
Authors: Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Tobias Schreck
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in parallel. Sets of time series may show intrinsic hierarchical relationships and varying degrees of importance among the individual time series. Effective techniques for visually analyzing large sets of time series should encode the relative importance and hierarchical ordering of the time series data by size and position, and should also provide a high degree of regularity in order to support comparability by the analyst. In this paper, we present a framework for visualizing large sets of time series. Based on the notion of inter time series importance relationships, we define a set of objective functions that space-filling layout schemes for time series data should obey. We develop an efficient algorithm addressing the identified problems by generating layouts that reflect hierarchyand importance-based relationships in a regular layout with favorable aspect ratios. We apply our technique to a number of real-world data sets including sales and stock data, and we compare our technique with an aspect ratio aware variant of the well-known TreeMap algorithm. The examples show the advantages and practical usefulness of our layout algorithm.
Proportional Nested Deficit Round Robin with Credit Adjusting
Authors: Afshin Shiravi, Paul S. Min, Yoon G. Kim
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

In recent years, many fair Packet scheduling algorithms have been proposed for switches and routers to provide the Quality of Service (QoS) guarantees required by many applications. In addition to the fairness and low end-to-end delay that these algorithms have to have, simplicity and scalability are two significant factors that play an important role. In this paper, we present Proportional Nested Deficit Round Robin with Credit Adjusting (PNDRR-CA), which is a modified version of PNDRR. PNDRR-CA has a low latency and reduces burstiness. PNDRR-CA takes advantage of the input traffic pattern and decreases the serving size of flows when the input traffic contains many small packets. This helps to interleave packets in many practical scenarios, such as the Internet, where the majority of packets are relatively small. The latency and fairness of PNDRR-CA are studied and compared to other algorithms using simulation.
Requirements engineering for e-business advantage
Authors: J. Bleistein, Karl Cox, June Verner, T. Phalp
Venue: Requirements Engineering (2005)

As a means of contributing to the achievement of business advantage for companies engaging in e-business, we propose a requirements engineering framework that incorporates a business strategy dimension. We employ Jackson&#x2019;s Problem Frames approach, goal modeling, and business process modeling (BPM) to achieve this. Jackson&#x2019;s context diagrams, used to represent business model context, are integrated with goal models to describe the requirements of the business strategy. We leverage the paradigm of projection in both approaches as a means of simultaneously decomposing both the requirement and context parts, from an abstract business level to concrete system requirements. Our approach maintains traceability to high-level business objectives via contribution relationship links in the goal model. We integrate use of role activity diagrams to describe business processes in detail where needed. The feasibility of our approach is shown by a well-known case study taken from the literature.
Colorimetric and Chemical Modeling Based Aging Simulation of Dunhuang Murals
Authors: Xifan Shi, Dongming Lu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Employing computer techniques to visualize the aging of Dunhuang Frescoes is of great significance since the audience can re-experience this process. But previously, because colorimetric and chemical modeling was not introduced to the Dunhuang Mural aging simulation system, there was a lack of objectivity. In this paper, however, the color-changing model is based on colorimetric and chemical modeling. Since this modeling describes the natural behavior of the color changing process, the simulation result is quite impressive. In this article, first, the former related works is reviewed. Then, three modeling methods are narrated. After that, the simulation result is shown and discussed. And finally, future research is suggested.
A Linear Time Algorithm for Wire Sizing with Simultaneous Optimization of Interconnect Delay and Crosstalk Noise
Authors: Narender Hanchate, Nagarajan Ranganathan
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, we propose a new methodology for wire sizing with simultaneous optimization of interconnect delay and crosstalk noise in deep submicron VLSI circuits. The wire sizing problem is modeled as an optimization problem formulated as a normal form game and solved using the Nash equilibrium. Game theory allows the optimization of multiple metrics with conflicting objectives. This property is exploited in modeling the wire sizing problem while simultaneously optimizing interconnect delay and crosstalk noise, which are conflicting in nature. The nets connecting the driving cell and the driven cell are divided into net segments. The net segments within a channel are modeled as players, the range of possible wire sizes forms the set of strategies and the payoff function is derived as the geometric mean of interconnect delay and crosstalk noise. The net segments are optimized from the ones closest to the driven cell towards the ones at the driving cell. The complete information about the coupling effects among the nets is extracted after the detailed routing phase. The resulting algorithm for wire sizing is linear in terms of the number of wire segments in the given circuit. Experimental results on several medium and large open core designs indicate that the proposed algorithm yields an average reduction of 21.48% in interconnect delay and 26.25% in crosstalk noise over and above the optimization from the Cadence place and route tools without any area overhead. The algorithm performs significantly better than simulated annealing and genetic search as established through experimental results. A mathematical proof of existence for Nash equilibrium solution for the proposed wire sizing formulation is provided.
The Turán problem for projective geometries
Authors: Peter Keevash
Venue: Journal of Combinatorial Theory Series A (2005)

We consider the following Turán problem. How many edges can there be in a (q + 1)-uniform hypergraph on n vertices that does not contain a copy of the projective geometry PGm(q)? The case q = m = 2 (the Fano plane) was recently solved independently and simultaneously by Keevash and Sudakov (The Turán number of the Fano plane, Combinatorica, to appear) and Füredi and Simonovits (Triple systems not containing a Fano configuration, Combin. Probab. Comput., to appear). Here we obtain estimates for general q and m via the de Caen-Füredi method of links combined with the orbit-stabiliser theorem from elementary group theory. In particular, we improve the known upper and lower bounds in the case q = 2, m = 3.
A Comparative Evaluation of Query Modeling Cost of SQL/MDR
Authors: Dongwon Jeong, Hoh Peter In, Lee-Sub Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper shows the feasibility of SQL/MDR development. Previous approach has several problems such as complicated exchanging mechanism, dependent description to local MDR systems, high cost for adding new systems, etc. Until now, the advantages of SQL/MDR have been qualitatively shown in several papers. In this paper, its merits are illustrated in quantitative views. Especially, we focus on the query modeling cost. To do this, we define several factors and evaluation model. Through the quantitative evaluation, the reason why SQL/MDR is required for exchanging metadata can be explicitly identified.
Iris synthesis: a reverse subdivision application
Authors: Lakin Wecker, Faramarz Samavati, Marina Gavrilova
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Due to renewed interest in security, iris images have become a popular biometric alternative to fingerprints for human identification. However, there exist very few databases on which researchers can test iris recognition technology. We present a novel method to augment existing databases through iris image synthesis. A multiresolution technique known as reverse subdivision is used to capture the necessary characteristics from existing irises, which are then combined to form a new iris image. In order to improve the results, a set of heuristics to classify iris images is proposed. We analyze the performance of these heuristics and provide preliminary results of the iris synthesis method.
PEIS ecologies: ambient intelligence meets autonomous robotics
Authors: Alessandro Saffiotti, Mathias Broxvall
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

A common vision in the field of autonomous robotics is to create a skilled robot companion that is able to live in our homes and perform physical tasks to help us in our everyday life. Another vision, coming from the field of ambient intelligence, is to create a network of intelligent home devices that provide us with information, communication, and entertainment. We propose to combine these two visions into the new concept of an ecology of networked Physically Embedded Intelligent Systems (PEIS). In this paper, we define this concept, and illustrate it by describing an experimental system that involves real robotic devices.