ppxscal/embedding_network huggingface dataset:
The Evolution of a WILDLAND Forest FIRE FRONT
Authors: Francisco J. Ser&#x00f3;n, Diego Guti&#x00e9;rrez, Juan Magall&#x00f3;n, Luis Ferragut, M. Isabel Asensio
Venue: The Visual Computer: International Journal of Computer Graphics (2005)

The rate of the spread and shape of a forest fire front is a problem that has not been thoughtfully studied from a computer graphics perspective. Here, using physically based computer graphics modeling, we propose a model for the simulation of wildland fires over 3D complex terrain. The model is based on conservation laws of energy and species, which includes radiation convection, reaction and natural convection, and takes into account the endothermic and exothermic phases of this kind of phenomenon. As an application, a simulation of a wildland fire in the Ebro basin of Spain is presented. The results are visualized on synthetic imagery, obtained by using the digital model of the studied terrain plus its corresponding images acquired by the Spot 4 and LandSat TM satellites.
Design of Square-Root Domain Filters
Authors: Gwo-Jeng Yu, Chun-Yueh Huang, Bin-Da Liu, Jenn-Jiun Chen
Venue: Analog Integrated Circuits and Signal Processing (2005)

In this paper, a square-root domain band-pass filter and biquad filter which are based on the MOSFET square law are proposed. Both of the square-root domain filters operated at 2.5 V supply voltage are constituted by current mirrors, current-mode square-root circuits and capacitors. The circuits presented have been simulated and fabricated using 0.25 ¿ m CMOS process. Both of simulation and measured results which are in good agreement indicate that the center frequency f0 is not only attainable at megahertz frequencies but also tunable electronically. The proposed circuits have the merits of high frequency operation, tuneability, low power supply voltage operation, low third order intermodulation distortion and low total harmonic distortion.
Giving the caller the finger: collaborative responsibility for cellphone interruptions
Authors: Stefan Marti, Chris Schmandt
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present a system in which a cell phone decides whether to ring by accepting votes from the others in a conversation with the called party. When a call comes in, the phone first determines who is in the conversation by using a decentralized network of autonomous body-worn sensor nodes. It then vibrates all participants' wireless finger rings. Although the alerted people do not know if it is their own cellphones that are about to interrupt, each of them has the possibility to veto the call anonymously by touching his/her finger ring. If no one vetoes, the phone rings. A user study showed significantly more vetoes during a collaborative group-focused setting than during a less group oriented setting. Our system is a component of a larger research project in context-aware computer-mediated call control.
Decision support systems evolution: framework, case study and research agenda
Authors: David Arnott
Venue: European Journal of Information Systems (2004)

Evolutionary development has been central to the theory and practice of decision support systems (DSS) since the inception of the field. Terms such as 'adaptive' and 'evolutionary' capture the organic nature of the development of a decision support system. However, the terms are rarely defined and their meaning varies widely in the research literature. The aim of this paper is to contribute to decision support systems theory by investigating and clearly specifying the nature of the evolutionary process of a DSS. Using insights from other disciplines and prior DSS research, a framework for understanding DSS evolution is developed based on the aetiology, lineage, and tempo of evolution. The descriptive validity of the framework is demonstrated by applying it to published DSS studies and to an intensive case study of DSS development. The framework and the case study findings are used to define a research agenda that is important for evolutionary DSS development.
Research at Tartu State University: Estonian S.S.R., U.S.S.R.
Authors: Haldur Oim, Illo Sildmae, Sergei Litvak, Tiit Roosmaa, Madis Saluveer
Venue: Issue 79 (January 1982) (1982)

There are two natural language processing projects in progress at the AI Laboratory of Tartu State University, both of which belong to the broader context of AI and natural language understanding.
Human dynamics: computation for organizations
Authors: Alex Pentland, Tanzeem Choudhury, Nathan Eagle, Push Singh
Venue: Pattern Recognition Letters (2005)

The human dynamics group at the MIT Media Laboratory proposes that active pattern analysis of face-to-face interactions within the workplace can radically improve the functioning of the organization. There are several different types of information inherent in such conversations: interaction features, participants, context, and content. By aggregating this information, high-potential collaborations and expertise within the organization can be identified, and information efficiently distributed. Examples of using wearable machine perception to characterize face-to-face interactions and using the results to initiate productive connections are described, and privacy concerns are addressed.
Robust circuit and system design methodologies for nanometer-scale devices and single-electron transistors
Authors: Alexandre Schmid, Yusuf Leblebici
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

In this paper, various circuit and system level design challenges for nanometer-scale devices and single-electron transistors are discussed, with an emphasis to the functional robustness and fault tolerance point of view. A set of general guidelines is identified for the design of very high-density digital systems using inherently unreliable and error-prone devices. The fundamental principles of a highly regular, redundant, and scalable design approach based on fixed-weight neural networks and multiple-valued logic are presented. It is demonstrated that the proposed design technique offers significantly improved immunity to permanent and transient faults occurring at the transistor level, and that it results in graceful degradation of circuit performance in response to device failures.
The Study of KKM Theorems With Applications to Vector Equilibrium Problems and Implict Vector Variational Inequalities Problems
Authors: Lai-Jiu Lin, Hsiu-Li Chen
Venue: Journal of Global Optimization (2005)

In this paper, we establish some equivalence relations between coincidence theorems and KKM-type theorems. We also obtain some new coincidence theorems and fixed point theorems. Applying the KKM-type theorems we obtain the existence theorems of generalized vector equilibrium problems. From these results, some existence theorems of generalized vector implicit variational inequality problems are established in this paper.
Direct simulation for discrete mixture distributions
Authors: Paul Fearnhead
Venue: Statistics and Computing (2005)

We demonstrate how to perform direct simulation for discrete mixture models. The approach is based on directly calculating the posterior distribution using a set of recursions which are similar to those of the Forward-Backward algorithm. Our approach is more practicable than existing perfect simulation methods for mixtures. For example, we analyse 1096 observations from a 2 component Poisson mixture, and 240 observations under a 3 component Poisson mixture (with unknown mixture proportions and Poisson means in each case). Simulating samples of 10,000 perfect realisations took about 17 minutes and an hour respectively on a 900 MHz ultraSPARC computer. Our method can also be used to perform perfect simulation from Markov-dependent mixture models. A byproduct of our approach is that the evidence of our assumed models can be calculated, which enables different models to be compared.
A Call to Arms
Authors: Jim Gray, Mark Compton
Venue: Queue (2005)

Long anticipated, the arrival of radically restructured database architectures is now finally at hand. We live in a time of extreme change, much of it precipitated by an avalanche of information that otherwise threatens to swallow us whole. Under the mounting onslaught, our traditional relational database constructs - always cumbersome at best - are now clearly at risk of collapsing altogether.
Using the environment as an interactive interface to motivate positive behavior change in a subway station
Authors: Anijo Punnen Mathew
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper examines the use of incremental persuasion techniques to motivate behavior change using the environment. It also describes three design schemes to motivate positive behavior change through the modification of architectural elements and integration of interactive interfaces into the environment of a subway station.
A Bayesian Mixture Model for Multi-View Face Alignment
Authors: Yi Zhou, Wei Zhang, Xiaoou Tang, Harry Shum
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

For multi-view face alignment, we have to deal with two major problems: 1. the problem of multi-modality caused by diverse shape variation when the view changes dramatically; 2. the varying number of feature points caused by self-occlusion. Previous works have used nonlinear models or view based methods for multi-view face alignment. However, they either assume all feature points are visible or apply a set of discrete models separately without a uniform criterion. In this paper, we propose a unified framework to solve the problem of multi-view face alignment, in which both the multi-modality and variable feature points are modeled by a Bayesian mixture model. We first develop a mixture model to describe the shape distribution and the feature point visibility, and then use an efficient EM algorithm to estimate the model parameters and the regularized shape. We use a set of experiments on several datasets to demonstrate the improvement of our method over traditional methods.
Improvement of Non-Linear Mapping Computation for Dimensionality Reduction in Data Visualization and Classification
Authors: Kuncup Iswandy, Andreas Konig
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The projection of high-dimensional data by linear or non-linear techniques is a well established technique in pattern recognition and other scientific and industrial application fields. Commonly, methods affiliated to multidimensional-scaling, projection pursuit or Sammons non-linear distance preserving mapping are applied, based on gradient descent techniques. These suffer from well known dependence on initial or starting value and their limited ability to reach only local minimum. In this paper, stochastic search techniques are applied to the NLM to achieve lower residual stress or error value in competitive time. Encouraging results have been obtained for a particular developed local algorithm both with regard to convergence time and residual error.
Repeated additions
Authors: Eldon Hansen
Venue: ACM SIGNUM Newsletter (1970)

The recent note by Morris [1] prompts me to describe the following process for doing repreated floating point additions. It seems certain that the process is not new; but I have not seen it described elsewhere. It has perhaps been ignored because of its limited practical value. However, it serves as an interesting example for the classroom.
The Korea Brassica Genome Project: A glimpse of the Brassica genome based on comparative genome analysis with Arabidopsis: Conference Papers
Authors: Tae-Jin Yang, Jung-Sun Kim, Ki-Byung Lim, Soo-Jin Kwon, Jin-A Kim, Mina Jin, Jee Young Park, Myung-Ho Lim, Ho-Il Kim, Seog Hyung Kim, Yong Pyo Lim, Beom-Seok Park
Venue: Comparative and Functional Genomics (2005)

A complete genome sequence provides unlimited information in the sequenced organism as well as in related taxa. According to the guidance of the Multinational Brassica Genome Project (MBGP), the Korea Brassica Genome Project (KBGP) is sequencing chromosome 1 (cytogenetically oriented chromosome &num;1) of Brassica rapa. We have selected 48 seed BACs on chromosome 1 using EST genetic markers and FISH analyses. Among them, 30 BAC clones have been sequenced and 18 are on the way. Comparative genome analyses of the EST sequences and sequenced BAC clones from Brassica chromosome 1 revealed their homeologous partner regions on the Arabidopsis genome and a syntenic comparative map between Brassica chromosome 1 and Arabidopsis chromosomes. In silico chromosome walking and clone validation have been successfully applied to extending sequence contigs based on the comparative map and BAC end sequences. In addition, we have defined the (peri)centromeric heterochromatin blocks with centromeric tandem repeats, rDNA and centromeric retrotransposons. In-depth sequence analyses of five homeologous BAC clones and an Arabidopsis chromosomal region reveal overall co-linearity, with 82&percnt; sequence similarity. The data indicate that the Brassica genome has undergone triplication and subsequent gene losses after the divergence of Arabidopsis and Brassica. Based on in-depth comparative genome analyses, we propose a comparative genomics approach for conquering the Brassica genome. In 2005 we intend to construct an integrated physical map, including sequence information from 500 BAC clones and integration of fingerprinting data and end sequence data of more than 100 000 BAC clones. The sequences have been submitted to GenBank with accession numbers: 10 204 BAC ends of the KBrH library (CW978640&ndash;CW988843); KBrH138P04, AC155338; KBrH117N09, AC155337; KBrH097M21, AC155348; KBrH093K03, AC155347; KBrH081N08, AC155346; KBrH080L24, AC155345; KBrH077A05, AC155343; KBrH020D15, AC155340; KBrH015H17, AC155339; KBrH001H24, AC155335; KBrH080A08, AC155344; KBrH004D11, AC155341; KBrH117M18, AC146875; KBrH052O08, AC155342. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Reconfigurable distributed systems based on FPGAs and fieldbuses
Authors: José Fonseca, Arnaldo Oliveira
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Today, distributed systems based on a set of processor-based nodes are pervasive in many applications such as acquisition systems or embedded systems. The communication is often based in a fieldbus network which enables also functionalities such as program download and node synchronization. The use of FPGAs, replacing processors is appealing, providing remote reconfiguration through the fieldbus is possible. This paper describes a solution for this requirement.
A Voting-Based Computational Framework for Visual Motion Analysis and Interpretation
Authors: Mircea Nicolescu, Gerard Medioni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

Most approaches for motion analysis and interpretation rely on restrictive parametric models and involve iterative methods which depend heavily on initial conditions and are subject to instability. Further difficulties are encountered in image regions where motion is not smooth¿typically around motion boundaries. This work addresses the problem of visual motion analysis and interpretation by formulating it as an inference of motion layers from a noisy and possibly sparse point set in a 4D space. The core of the method is based on a layered 4D representation of data and a voting scheme for affinity propagation. The inherent problem caused by the ambiguity of 2D to 3D interpretation is usually handled by adding additional constraints, such as rigidity. However, enforcing such a global constraint has been problematic in the combined presence of noise and multiple independent motions. By decoupling the processes of matching, outlier rejection, segmentation, and interpretation, we extract accurate motion layers based on the smoothness of image motion, then locally enforce rigidity for each layer in order to infer its 3D structure and motion. The proposed framework is noniterative and consistently handles both smooth moving regions and motion discontinuities without using any prior knowledge of the motion model.
Decentralized Multiple Target Tracking Using Netted Collaborative Autonomous Trackers
Authors: Ting Yu, Ying Wu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents a decentralized approach to multiple target tracking. The novelty of this approach lies in the use of a set of autonomous while collaborative trackers to overcome the tracker coalescence problem with linear complexity. In this approach, the individual trackers are autonomous in the sense that they can select targets to track and evaluate themselves, and they are also collaborative since they need to compete for the targets against those trackers that are close to them through communication. The theoretical foundation of this new approach is based on the variational analysis of a Markov network that reveals the collaborative mechanism through a fixed point iteration among these trackers and the existence of the equilibriums. In addition, a trained object detector is incorporated to help sense the potential newly appearing targets in the dynamic scene. Experimental results on challenging video sequences demonstrate the effectiveness and efficiency of the proposed method.
Optical flow detection using segmentation and MDL criterion
Authors: Hideaki Tsuchiya, Noburu Uemura, Shuichi Itoh
Venue: Systems and Computers in Japan (2004)

Kanatani applied the concept of noise to optical flow calculation using the constraint equation proposed by Horn, and presented a renormalization method which estimates the flow and the noise components simultaneously. In the renormalization method, the image is segmented into blocks, and the constraint that flows of the pixels in a block remain the same is assumed. This paper applies MDL criterion to the renormalization method and proposes an optical flow estimation algorithm that segments the image self-organizationally. It is assumed that the sender has a pair of images from time-ordered sequence and the receiver has one of these images. In this assumption, the image segmentation is determined by using MDL criterion so that the intensity gradient vectors generated from the image pair are encoded most efficiently. Each intensity gradient vector is encoded to two components, namely, the flow vector and the error. The image segmentation and the flow vectors obtained by this procedure are defined as the estimated optical flows. As an experiment, the algorithm is applied to artificial image pairs and a real image pair and the results are presented. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 51&ndash;59, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10335
Multidisciplinary design optimization of mechanisms
Authors: Ting-Yu Chen, Chen-Ming Yang
Venue: Advances in Engineering Software (2005)

The optimization of mechanisms is usually done in the field of mechanism itself. As a result the structural safety of the mechanism is neglected. To ensure the safety and improve the dynamic characteristics of mechanisms, a multidisciplinary design optimization procedure is proposed in this paper to synthesize optimum mechanisms. Two disciplines are involved in the multidisciplinary design optimization. They are the mechanism and the structure. The multi-level decomposition approach is chosen to generate optimum mechanisms. The optimized mechanisms not only satisfy mechanism and structural constraints but also have optimum objective function values in the two disciplines. In order to solve general mechanism design problems two widely used commercial softwares MSC/NASTRAN and MSC/ADAMS are integrated in the procedure to do the structural and the mechanism analysis, respectively. When the structural optimization is performed, a compromised approach is introduced to treat multiple configurations of mechanisms during operation. Two mechanism design problems are given to test the proposed method.
A New Approach for Near-Lossless and Lossless Image Compression with Bayer Color Filter Arrays
Authors: Xiang Xie, GuoLin Li, XiaoWen Li, ZhiHua Wang, Chun Zhang, DongMei Li, Li Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents a new approach for near-lossless and lossless image compression in digital colorful image sensors with Bayer Color Filter Arrays (CFAs). In this approach, the captured CFA raw data is firstly transformed from quincunx shape to rectangular shape and then smoothed by a low-pass filter. Lastly, the filtered data are compressed directly before full color interpolation that introduces redundancy. Assuring very high image quality, the method can provide lower compression ratio (bit/pixel) and lower complexity than conventional interpolation-first image compression methods and other existing similar compression-first methods. Furthermore, through altering the quality control factor, the image quality, PSNR, can be changed from 44.15dB to infinite with the compression ratio from averagely 3.3bits/pixel to 6.9bits/pixel.
Best-Effort Patching for Multicast True VoD Service
Authors: Huadong Ma, G. Kang Shin, Weibiao Wu
Venue: Multimedia Tools and Applications (2005)

A multicast Video-on-Demand (VoD) system allows clients to share a server stream by batching their requests, and hence, improves channel utilization. However, it is very difficult to equip such a VoD system with full support for interactive VCR functions which are important to a growing number of Internet applications. In order to eliminate service (admission) latency, patching was proposed to enable an existing multicast session to dynamically add new clients, and requests can be served without delay if patching channels are available. A true VoD (TVoD) service should support not only zero-delay client admission but also continuous VCR-like interactivity. However, the conventional patching is only suitable for admission control. We propose a new patching scheme, called Best-Effort Patching (BEP), that offers a TVoD service in terms of both request admission and VCR interactivity. Moreover, by using a novel dynamic merging algorithm, BEP significantly improves the efficiency of TVoD interactivity, especially for popular videos. We also model and evaluate the efficiency of the dynamic merging algorithm. It is shown that BEP outperforms the conventional TVoD interaction protocols.
Unsupervised Border Detection of Skin Lesion Images
Authors: M. Emre Celebi, Y. Alp Aslandogan, Paul R. Bergstresser
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

As a result of the advances in skin imaging technology and the development of suitable image processing/computer vision algorithms, during the last decade, there has been a significant increase of interest in the computer-aided diagnosis of skin cancer. Automated border extraction is one of the most important steps in this procedure since the accuracy of the subsequent steps crucially depends on the accuracy of this very first step. In this paper, we present an unsupervised approach to border detection in skin lesion (tumor) images based on a modified version of the JSEG algorithm. The segmentation results are visually examined by an expert dermatologist and are found to be highly accurate.