ppxscal/embedding_network huggingface dataset:
Detecting Doctored Images Using Camera Response Normality and Consistency
Authors: Zhouchen Lint, Rongrong Wang, Xiaoou Tang, Heung-Yeung Shum
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The advance in image/video editing techniques has facilitated people in synthesizing realistic imageshideos that may hard to be distinguished from real ones by visual examination. This poses a problem: how to differentiate real imageshideosfrom doctored ones? This is a serious problembecause some legal issues may occur if there is no reliable way for doctored image/video detection when human inspection fails. Digital watermarking cannot solve this problem completely. Wepropose an approach that computes the response functions of the camera by selecting appropriate patches in different ways. An image may be doctored if the response functions are abnormal or inconsistent to each other. The normality of the response functions is classified by a trained support vector machine (SVM). Experiments show that our method is effective for high-contrast images with many textureless edges.
Word prediction using a clustered optimal binary search tree
Authors: Eyas El-Qawasmeh
Venue: Information Processing Letters (2004)

Word prediction methodologies depend heavily on the statistical approach that uses the unigram, bigram, and the trigram of words. However, the construction of the N-gram model requires a very large size of memory, which is beyond the capabilily of many existing computers. Beside this, the approximation reduces the accuracy of word prediction. In this paper, we suggest to use a cluster of computers to build an Optimal Binary Search Tree (OBST) that will be used for the statistical approach in word prediction. The OBST will contain extra links so that the bigram and the trigram of the language will be presented. In addition, we suggest the incorporation of other enhancements to achieve optimal performance of word prediction. Our experimental results showed that the suggested approach improves the keystroke saving.
Understanding the effects of wrong-path memory references on processor performance
Authors: Onur Mutlu, Hyesoon Kim, David N. Armstrong, Yale N. Patt
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

High-performance out-of-order processors spend a significant portion of their execution time on the incorrect program path even though they employ aggressive branch prediction algorithms. Although memory references generated on the wrong path do not change the architectural state of the processor, they can affect the arrangement of data in the memory hierarchy. This paper examines the effects of wrong-path memory references on processor performance. It is shown that these references significantly affect the IPC (Instructions Per Cycle) performance of a processor. Not modeling them can lead to errors of up to 10% in IPC estimates for the SPEC2000 integer benchmarks; 7 out of 12 benchmarks experience an error of greater than 2% in IPC estimates. In general, the error in the IPC increases with increasing memory latency and instruction window size.We find that wrong-path references are usually beneficial for performance, because they prefetch data that will be used by later correct-path references. L2 cache pollution is found to be the most significant negative effect of wrong-path references. Code examples are shown to provide insights into how wrong-path references affect performance.
Diagram Structure Recognition by Bayesian Conditional Random Fields
Authors: Yuan Qi, Martin Szummer, Thomas P. Minka
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Hand-drawn diagrams present a complex recognition problem. Elements of the diagram are often individually ambiguous, and require context to be interpreted. We present a recognition method based on Bayesian conditional random fields (BCRFs) that jointly analyzes all drawing elements in order to incorporate contextual cues. The classification of each object affects the classification of its neighbors. BCRFs allow flexible and correlated features, and take both spatial and temporal information into account. BCRFs estimate the posterior distribution of parameters during training, and average predictions over the posterior for testing. As a result of model averaging, BCRFs avoid the overfitting problems associated with maximum likelihood training. We also incorporate Automatic Relevance Determination (ARD), a Bayesian feature selection technique, into BCRFs. The result is significantly lower error rates compared to ML- and MAP-trained CRFs.
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing
Authors: Minyi Guo, Michael Ho, Weng-Long Chang
Venue: Parallel Computing (2004)

This paper shows how to use DNA strands to construct solution space of molecules for the dominating-set problem and how to apply biological operations to solve the problem from the solution space of molecules. In order to achieve this, we have proposed some DNA based parallel algorithms using the operations in Adleman-Lipton model, together with the analysis of the computational complexity for DNA parallel algorithms.
Linearized stability in periodic functional differential equations with state-dependent delays
Authors: Ferenc Hartung
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we study stability of periodic solutions of a class of nonlinear functional differential equations (FDEs) with state-dependent delays using the method of linearization. We show that a periodic solution of the nonlinear FDE is exponentially stable, if the zero solution of an associated linear periodic linear homogeneous FDE is exponentially stable.
Modeling network and web services resource using WSDL
Authors: Martin Tsenov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper explained decision for network and web services architecture between distributed network systems. The proposed method is based on Web services standard WSDL Software solution for development of an application, which provides data access and exchange to various distributed networks is presented and explained.
Voting and political information gathering on paper and online
Authors: Scott P. Robertson, Palakorn Achananuparp, James L. Goldman, Sang Joon Park, Nan Zhou, Matthew J. Clare
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Electronic voting is slowly making its way into American politics. At the same time, more voters and potential voters are using online news and political information sources to help them make voting choices. We conducted a mock-voting study, using real candidates, issues, and campaign materials. Political information was browsed either online or on paper, and participants marked electronic ballots either while they browsed or later, in a separate step. Our initial data shows that voters prefer electronic browsing although they are no faster or slower with paper materials. Voters felt that they understood the issues best when they voted during browsing, and they felt most confident about their decisions when they studied electronic campaign materials alongside an active electronic ballot.
Software basics for computational mathematics
Authors: W. J. Cody
Venue: ACM SIGNUM Newsletter (1980)

This article discusses problems at the software design and implementation level that transcend any particular subfield of computational mathematics, but which are important to all subfields. The discussion includes desirable attributes of numerical software that are independent of the underlying algorithms, ways in which software with these attributes exploit arithmetic characteristics of the host computer, advantages to the gathering of numerical software into thematic packages and the problems involved in such work, and challenges in testing numerical software. A nontechnical overview of the subject is followed by a technical discussion which includes suggestions for research activities within DOE.
A Waterfall Model for Knowledge Management and Experience Management
Authors: Zhaohao Sun
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper examines experience and knowledge, experience management (EM) and knowledge management (KM), and their interrelationships. It then proposes waterfall models for both EM and KM. The models characterize EM and KM as the integration of experience processing and corresponding management, that of knowledge processing and corresponding management respectively. The proposed approach will facilitate research and development of KM, EM, and hybrid intelligent systems.
Load elimination for low-power embedded processors
Authors: Gokhan Memik, Mahmut T. Kandemir, Arindam Mallik
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

The performance requirements of emerging embedded applications are rapidly increasing. One attractive approach to increase the performance of processors, while keeping their energy consumption low, is to utilize instruction-level parallelism. Hence, we are witnessing a significant increase in the number of superscalar embedded processors. In this paper, we present a method to reduce the energy consumption in such processors. Particularly, we will show that a) the load instructions in representative applications exhibit a large address locality, i.e., two consecutive executions of the same load instruction is very likely to access the same data, and b) the register file utilization of these applications are usually low. To take advantage of these observations, we devise a load elimination scheme, which tries to store the data values of load instructions in the register file. Our results with 11 MediaBench applications reveal that this method eliminates 20.5% of all cache accesses, resulting in 11.5% reduction in the energy consumption.
Applications oriented algorithms
Authors: K. K. Gupta
Venue: ACM SIGNUM Newsletter (1972)

Numerical analysis has become an integral part of practical engineering problem analysis. Thus current structural analysis techniques essentially consist of two distinct numerical procedures. Firstly the continuum is discretized by the finite element method, a variant of the well-known Ritz's process, yielding sets of simultaneous algebraic equations for equilibrium and eigenvalue problems or sets of simultaneous ordinary differential equations for the propagation problems. Second such equations are next solved by relevant numerical techniques.
Evolution and cellular function of monothiol glutaredoxins: involvement in iron&ndash;sulphur cluster assembly: Research Papers
Authors: Felipe Vilella, Rui Alves, María Teresa Rodríguez-Manzaneque, Gemma Bellí, Swarna Swaminathan, Per Sunnerhagen, Enrique Herrero
Venue: Comparative and Functional Genomics (2004)

A number of bacterial species, mostly proteobacteria, possess monothiol glutaredoxins homologous to the Saccharomyces cerevisiae mitochondrial protein Grx5, which is involved in iron&ndash;sulphur cluster synthesis. Phylogenetic profiling is used to predict that bacterial monothiol glutaredoxins also participate in the iron&ndash;sulphur cluster (ISC) assembly machinery, because their phylogenetic profiles are similar to the profiles of the bacterial homologues of yeast ISC proteins. High evolutionary co-occurrence is observed between the Grx5 homologues and the homologues of the Yah1 ferredoxin, the scaffold proteins Isa1 and Isa2, the frataxin protein Yfh1 and the Nfu1 protein. This suggests that a specific functional interaction exists between these ISC machinery proteins. Physical interaction analyses using low-definition protein docking predict the formation of strong and specific complexes between Grx5 and several components of the yeast ISC machinery. Two-hybrid analysis has confirmed the in vivo interaction between Grx5 and Isa1. Sequence comparison techniques and cladistics indicate that the other two monothiol glutaredoxins of S. cerevisiae, Grx3 and Grx4, have evolved from the fusion of a thioredoxin gene with a monothiol glutaredoxin gene early in the eukaryotic lineage, leading to differential functional specialization. While bacteria do not contain these chimaeric glutaredoxins, in many eukaryotic species Grx5 and Grx3&#x002F;4-type monothiol glutaredoxins coexist in the cell. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Mac OS X Help Line, Tiger Edition
Authors: Ted Landau
Venue:  (2005)

With every update, Mac OS X grows more powerful, more dependable, and easier to use--and Mac OS X Tiger is no exception. But along with the new features come fresh issues--new areas to troubleshoot, new functionality to unravel, and new glitches waiting to confound even the savviest Mac users. Not to worry. Best-selling author and Mac guru Ted Landau turns his diagnostician's eye on Mac OS X Tiger, arming readers with fix-it knowledge This popular fix-it classic offers more troubleshooting information, tips, and hacks than any other single volume. Chock-full of detailed, understandable advice for maintaining and troubleshooting Mac OS X Tiger, this comprehensive reference is where users will turn before they head to the repair shop. Readers will find solutions for every Mac OS X problem under the sun plus the technical grounding they need to turn a diagnostic eye on their own operating systems. Filled with tips, tools, and preventive measures, the guide includes in-depth coverage of Library directories and folders, file and font maintenance, crash prevention and recovery, and more.
Identifying and Addressing Problems in Framework Reuse
Authors: Douglas Kirk, Marc Roper, Murray Wood
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Object-oriented frameworks are a powerful form of reuse but they can be difficult to understand and reuse correctly. Over the last decade a large range of candidate documentation techniques have been proposed to address this difficulty. There is little research, however, to identify the specific problems that arise during framework reuse and to evaluate documentation techniques in terms of these problems. This paper reports on a long-term investigation that firstly identifies four fundamental problems of framework reuse: mapping, understanding functionality, understanding interactions and understanding the framework architecture. It then describes two forms of documentation specifically developed to address the mapping, interaction and functionality problems namely a pattern language and a set of micro architectures. An in-depth, qualitative analysis of these two documentation types evaluates the key strengths and weaknesses of their support for framework understanding, whilst confirming the significance of the four problem categories.
A 10-Bit, Low Power, Successive Approximation, Digitally Auto-Zeroed CMOS ADC Core for the NASA TRIO Smart Sensor System on a Chip
Authors: G. Kottaras, N. P. Paschalidis, E. T. Sarris, N. Stamatopoulos, K. Karadamoglou, V. Paschalidis
Venue: Analog Integrated Circuits and Signal Processing (2005)

In spacecraft applications there is a great need for robust analogue to digital converters (ADC) that can withstand the harsh space environment. Commercially available ADCs cannot operate in the space environment due to radiation effects. In this paper we present an ADC that has been developed for the NASA TRIO smart sensor system on a chip (SoC), a versatile low power device specifically designed for spacecraft data acquisition and telemetry of several types of sensors such as temperature, voltage/current transducers, radFETs, etc. It is required for the ADC to operate in excess of 300 Krad total ionizing dose and to be robust to single event upsets. The successive approximation topology was chosen and it was enhanced with a special auto-zeroing technique to compensate for possible lifetime offset errors. Due to the comparator design, a rail-to-rail input capability is achieved, a feature very useful in some type of Vdd ratio metric sensors. It has 10-bit resolution for a reference in the range 0.1 to Vdd + 1 V, and for power supply in the range 2.5 to 5.5 V; the positive reference terminal Vref+ is settable up to Vdd + 0.5 V and the negative voltage terminal is settable down to GND-0.5 V. The power dissipation is less than 2 mW at 50 Ksamlles/sec. The TRIO chip is used in several NASA spacecraft including CONTOUR, STEREO, MESSENGER, EUROPA, PLUTO, etc.
Native 10 Gigabit Ethernet experiments over long distances
Authors: Catalin Meirosu, Piotr Golonka, Andreas Hirstius, Stefan Stancu, Bob Dobinson, Erik Radius, Antony Antony, Freek Dijkstra, Johan Blom, Cees de Laat
Venue: Future Generation Computer Systems (2005)

The current solutions for transmitting data over Wide Area Networks (WANs) are expensive and require protocol translation at layer 1. The IEEE recently standardized the 10 Gigabit Ethernet (10 GE) WAN PHY as a native gateway from the Local Area Networks (LAN) to the WAN. This opened a debate as to whether Ethernet is now a valid alternative to Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) for WANs. In this article, we report on the experience gathered while building the first trans-European native 10 Gigabit Ethernet testbed based on WAN PHY. We describe and analyze network tests with a 1700 km Ethernet network. Our work validates this approach and indicates that Ethernet can offer a large bandwidth to long-distance bulk data transfers at a trans-European level.
A New Low Latency Parallel FIR Filter Scheme
Authors: Paraskevas Kalivas, Vassilis Vassilakis, Chris Meletis, Kiamal Z. Pekmestzi
Venue: Journal of VLSI Signal Processing Systems (2005)

A new array type parallel scheme for an FIR digital filter is presented in this paper. The proposed scheme is based on the structure of the carry-save array multiplier where each cell implements the computation of an FIR filter at the bit-level. This structure leads to latency independent of the number of the filter taps. The proposed scheme is pipelined at the bit-level, is systolic at the cell-level and requires less hardware than other schemes based on discrete multipliers.
Graded Relative Evidence
Authors: David Bell
Venue: Artificial Intelligence Review (2005)

Relative Evidential Supports (RES) was developed and justified several years ago as a non-numeric apparatus that allows us to compare evidential supports for alternative conclusions when making a decision. An extension, called Graded Relative Evidence (GRE), of the RES concept of pairwise balancing and trading-off of evidence is reported here which keeps its basic features of simplicity and perspicacity, but enriches its modelling fidelity by permitting very modest, and intuitive, variations in degrees of outweighing (which the essentially binary RES does not). The formal justification is very simply based on linkages to RES and to the Dempster--Shafer theory of evidence. The use of the simple extension is illustrated, and to a small degree further justified empirically, by application to a topical scientific debate, about what is called the Congo Crossover Conjecture here. This decision-making instance is chosen because of the wealth of evidence that has been accumulated on both sides of the debate, and the range of evidence strengths manifested in it. The conjecture is that the advent of Aids was in the late 1950s in the Congo, when a vaccine for polio was allegedly cultivated in the kidneys of chimpanzees, which allowed the Aids infection to cross over to humans from primates.
SLL: running my web services on your WS platforms
Authors: Donald Kossmann, Christian Reichel
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Today, the choice for a particular programming language limits the alternative products that can be used to deploy the program. For instance, a Java program must be executed using a Java VM. This limitation is particularly harmful for the emergence of a new programming paradigm like SOA and Web Services because platforms for new innovative programming languages are typically not as stable and mature as the established platforms for traditional programming paradigms. The purpose of this work is to break the strong ties between programming languages and runtime environments and thus make it possible to innovate at both ends independently. Thereby, the specific focus is on Web Services and Service-Oriented Architectures; focusing on this domain makes it possible to achieve this goal with affordable efforts. The key idea is to introduce a Service Language Layer (SLL) which gives a high-level abstraction of a service-oriented program and which can easily and efficiently be executed on alternative Web Services platforms.
Formulating Semantic Image Annotation as a Supervised Learning Problem
Authors: Gustavo Carneiro, Nuno Vasconcelos
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We introduce a new method to automatically annotate and retrieve images using a vocabulary of image semantics. The novel contributions include a discriminant formulation of the problem, a multiple instance learning solution that enables the estimation of concept probability distributions without prior image segmentation, and a hierarchical description of the density of each image class that enables very efficient training. Compared to current methods of image annotation and retrieval, the one now proposed has significantly smaller time complexity and better recognition performance. Specifically, its recognition complexity is O(CxR), where C is the number of classes (or image annotations) and R is the number of image regions, while the best results in the literature have complexity O(TxR), where T is the number of training images. Since the number of classes grows substantially slower than that of training images, the proposed method scales better during training, and processes test images faster. This is illustrated through comparisons in terms of complexity, time, and recognition performance with current state-of-the-art methods.
Monocular 3-D Tracking of the Golf Swing
Authors: Raquel Urtasun, David J. Fleet, Pascal Fua
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose an approach to incorporating dynamic models into the human body tracking process that yields full3-D reconstructions from monocular sequences. We formulate the tracking problem in terms of minimizing a differentiable criterion whose differential structure is rich enough for successful optimization using a simple hill-climbing approach as opposed to a multi-hypotheses probabilistic one. In other words, we avoid the computational complexity of multi-hypotheses algorithms while obtaining excellent results under challenging conditions. To demonstrate this, we focus on monocular tracking of a golf swing from ordinary video. It involves both dealing with potentially very different swing styles, recovering arm motions that are perpendicular to the camera plane and handling strong self-occlusions.