ppxscal/embedding_network huggingface dataset:
A fast and accurate approach for 3D image registration using the scatter search evolutionary algorithm
Authors: O. Cordón, S. Damas, J. Santamaría
Venue: Pattern Recognition Letters (2006)

Nowadays, image registration (IR) is still an important and useful task in several areas such as remote sensing, medicine, cartography, and computer vision. Different approaches to solve the existing variants of the problem are commonly proposed in the specialized literature. In this paper, we focus our interest on the 3D IR problem considering similarity transformations and our proposal is based on the use of a new procedure based on the evolutionary computation framework for non-linear optimization. We apply an emergent global optimization strategy called scatter search providing a fast and accurate algorithm. To measure its performance, we design an experimental setup considering some of the most accepted and accurate classical and evolutionary techniques for the problem, as well as six different shapes, one synthetic and five magnetic resonance images, dealing with different levels of noise and occlusion in the scenarios treated.
ANNODA: Tool for integrating Molecular-biological Annotation Data
Authors: Supawan Prompramote, Yi-Ping Phoebe Chen
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Collecting, analyzing, and making Molecularbiological annotation data accessible in different public data sources is still an ongoing project. Integration of such data from these data sources might lead to valuable biological knowledge. There are numerous annotation data and only some of those are structured. The number and contents of related sources are continuously increasing. In addition, the existing data sources have their own storage structure and implementation. As a result, these could lead to a limitation in the combining of annotation. Here, we proposed a tool, called ANNODA, for integrating Molecular-biological annotation data. Unlike the past work on database interoperation in the bioinformatics community, this database design uses web-links which are very useful for interactive navigation and meanwhile it also supports automated large-scale analysis tasks.
Event-based Specification for Controlling Spatio-temporal Changes of Geographic situation
Authors: Masakazu IKEZAKI, Naoto MUKAI, Toyohide WATANABE, Taketoshi USHIAMA
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper, we propose a data model to manage dynamic aspects of geographic information. In our model, a geographic change is represented as an event. Three relations are defined on events: they are is-a relation, partof relation, and event-driven relation. We implemented a prototype system, and confirmed that our model is adaptable to searching dynamic aspects of geographic information based on real world phenomena.
Genetic Algorithm-based Text Clustering Technique: Automatic Evolution of Clusters with High Efficiency
Authors: Wei Song, Soon Cheol Park
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

In this paper, we propose a modified variable string length genetic algorithm (MVGA) for text clustering. Our algorithm has been exploited for automatically evolving the optimal number of clusters as well as providing proper data set clustering. The chromosome is encoded by a string of real numbers with special indices to indicate the location of each gene. More effective versions of operators for selection, crossover, and mutation are introduced in MVGA which can also automatically adjust the influence between the diversity of the population and selective pressure during generations. The superiority of the MVGA over conventional variable string length genetic algorithm (VGA) is demonstrated by providing proper Reuter text collection clusters in terms of number of clusters and clustering data sets.
Synchronization of Operating Part Model in Failure Context
Authors: Eric Deschamps, Sebastien Henry, Eric Zamai
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The objective of the Automated Manufacturing System reconfiguration is to react to failures and thus to engage the required monitoring treatments to restart the AMS as fast as possible. But the control laws run by the control system are often blocked and thus become inadequate. Therefore it is required to reconfigure the control system. This reconfiguration process is based on functions such as detection, diagnostic, prognostic, decision and automatic control laws synthesis. In the context of discrete event systems (DES), this paper focuses on the synchronization of the operating part model after a failure, in order to take decisions and to synthesize new adapted control laws.
Minimizing the embedding impact in steganography
Authors: Jessica Fridrich
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a scalar value that measures the impact of making an embedding change at that pixel (e.g., the embedding distortion). Given the embedding impact profile of all pixels, we derive an analytic formula for the optimal number of pixels that should be used in combination with syndrome coding to minimize the overall embedding impact. We interpret the results and formulate several "rules of thumb" that should improve steganographic security. Contrary to what has been recommended in the literature before, our analysis implies that it is never optimal to only use the pixels with the smallest embedding impact. We also study q-ary embedding in the spatial domain and conclude that the smallest embedding impact is achieved for ternary schemes. This confirms some empirically derived facts previously published elsewhere.
DISCIPLINARY DIFFERENCES - Frameworks for Better Learning Design
Authors: Su White, Ilaria Liccardi
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper presents research into ways that e-learning can be integrated into conventional higher education teaching. It examines how appropriate techniques and technologies may be selected, adapted and combined for effectiveness, to accommodate the preferences or needs associated with disciplinary differences. The research reviews existing literature and surveys practice. Disciplinary differences are analyzed and examples of typical applications are presented with an analysis of those techniques which are most appropriate. It also analyses quantitative and qualitative data gathered from interviews with students across a number of academic disciplines. The conclusions have implications for the direction of future work on learning design
Comparison of the nearest feature classifiers for face recognition
Authors: Mauricio Orozco-Alzate, C&#x00e9;sar Germ&#x00e1;n Castellanos-Dom&#x00ed;nguez
Venue: Machine Vision and Applications (2006)

This paper presents an experimental comparison of the nearest feature classifiers, using an approach based on binomial tests in order to evaluate their strengths and weaknesses. In addition, classification accuracies and the accuracy-dimensionality tradeoff have been considered as comparison criteria. We extend two of the nearest feature classifiers to label the query point by a majority vote of the samples. Comparisons were carried out for face recognition using ORL database. We apply the eigenface representation for feature extraction. Experimental results showed that even though the classification accuracy of k-NFP outperforms k-NFL in some dimensions, these rate differences do not have statistical significance.
Constrained models of evolution lead to improved prediction of functional linkage from correlated gain and loss of genes
Authors: Daniel Barker, Andrew Meade, Mark Pagel
Venue: Bioinformatics (2007)

Motivation: We compare phylogenetic approaches for inferring functional gene links. The approaches detect independent instances of the correlated gain and loss of pairs of genes from species' genomes. We investigate the effect on results of basing evidence of correlations on two phylogenetic approaches, Dollo parsminony and maximum likelihood (ML). We further examine the effect of constraining the ML model by fixing the rate of gene gain at a low value, rather than estimating it from the data. Results: We detect correlated evolution among a test set of pairs of yeast (Saccharomyces cerevisiae) genes, with a case study of 21 eukaryotic genomes and test data derived from known yeast protein complexes. If the rate at which genes are gained is constrained to be low, ML achieves by far the best results at detecting known functional links. The model then has fewer parameters but it is more realistic by preventing genes from being gained more than once. Availability: BayesTraits by M. Pagel and A. Meade, and a script to configure and repeatedly launch it by D. Barker and M. Pagel, are available at http://www.evolution.reading.ac.uk Contact: m.pagel@rdg.ac.uk Supplementary information: Supplementary Data are available at Bioinformatics online.
An Efficient Algorithm for Web Services Composition with a Chain Data Structure
Authors: Li Lian, Jun Ma, ZhuMin Chen, Ling Song
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Automatic composition of web services has drawn a great deal of attention recently. Current web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(log_mm,n)), improved the known O(nXlog_m) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure.
Relation between Semantic Completeness and Syntax Completeness on General Formal Systems
Authors: Zhenghua Pan
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper analyze the relation between semantic completeness of a formal system S and syntax completeness under certain condition and the relation between the syntax completeness of S and the syntax completeness of consistent extension of S, and following results are proved. (1) If S has syntax completeness then S must has semantic completeness when S has soundness. (2) If S doesn't has syntax completeness then any consistent extensions of S don't have syntax completeness either, the converse not holds. (3) Any extensions of the first order predicate logic don't have syntax completeness.
Construction of bent functions via Niho power functions
Authors: Hans Dobbertin, Gregor Leander, Anne Canteaut, Claude Carlet, Patrick Felke, Philippe Gaborit
Venue: Journal of Combinatorial Theory Series A (2006)

A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of the form f(x) = tr(α1xd1 + α2xd2), α1, α2, x ∈ F2n, are considered, where the exponents di (i = 1, 2) are of Niho type, i.e. the restriction of xdi on F2k is linear. We prove for several pairs of (d1, d2) that f is a bent function, when α1 and α2 fulfill certain conditions. To derive these results we develop a new method to prove that certain rational mappings on F2n, are bijective.
An External Test Approach for Network-on-a-Chip Switches
Authors: Jaan Raik, Vineeth Govind, Raimund Ubar
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Over the past few years, Network-on-a-Chip (NoC) has become increasingly popular as a scalable interconnect infrastructure for IP cores. Simultaneously to developing new design paradigms, testing strategies for such network architectures have to be considered. The previous works on testing NoCs have been mainly based on general purpose Designfor- Testability (DfT) approaches and there is a lack of test algorithms dedicated to on-chip networks. The main contribution of this paper is a well-scalable external test method, where insertion of wrappers and scan paths will not be required. The paper proposes an external test method for NoC based on functional fault models, which targets single stuck-at faults in the network switches. Furthermore, 100 per cent of delay faults, opens and shorts between adjacent interconnection lines are covered by the method. The approach allows to reach higher fault coverages in comparison to the recent DfT based solutions.
Optimal lot-sizing in a two-stage system with auto-correlated arrivals
Authors: S. T. Enns, Ping Zhu
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Most research on lot-size optimization has concentrated on single-stage batch production systems. However, in practice it is of interest to optimize performance over multiple processing stages, where stages are not independent. The models in this study consider two stages, where multiple products are produced using the processing stages sequentially. The objective is to minimize total lot flow times across both stages by selecting the optimal lot sizes for each product, subject to these remaining constant across both stages. Analytical relationships can be developed but rely on the assumption of lot interarrival time independence. This is clearly not the case in most manufacturing problems. Better solutions can be obtained experimentally using simulation and response surface methods. Alternatively, an approach has been developed that allows dynamic feedback to be used in adjusting analytical relations to compensate for auto-correlation. Results using this approach compare well with those obtained experimentally.
OCaml + XDuce
Authors: Alain Frisch
Venue: ACM SIGPLAN Notices (2006)

This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very different natures while preserving the best properties of both (principality and automatic type reconstruction on one side; very precise types and implicit subtyping on the other side). Type inference can be described by two successive passes: the first one is an ML-like unification-based algorithm which also extracts data flow constraints about XML values; the second one is an XDuce-like algorithm which computes XML types in a direct way. An optional preprocessing pass, called strengthening, can be added to allow more implicit use of XML subtyping. This pass is also very similar to an ML type checker.
Prony residual analysis for the identification of cardiac arrhythmias
Authors: Szi-Wen Chen, P. M. Clarkson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

An investigation into the use of Prony modeling for the identification of late potentials (LPs) from signal-averaged electrocardiograms (SAECGs) is described. We develop a noninvasive method, based on the short-time Prony modeling algorithm, to extract a diagnostic feature, dubbed the Prony residual marker (PRM), from the SAECG waveform. The PRM is used as a marker for the presence of LPs and is thus used to predict the diagnostic outcome of invasive electrophysiologic study.
Architecture and Software Implementation of HDTV Video Decoder on a Singlechip, MPEG Decoder
Authors: Yuhuang Ye, Yuanjiu Li, Kaixiong Su
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper presents the architecture and software design of HDTV video decoder on a 200-MHz single-chip microprocessor. First, the paper analyzes the hardware architecture of video decoder system on this MPEG decoder and describes the function of each module in this system, including the PES Parser, Decode pipeline, SC Analyzer, and Display Processor. Then it gives the software control and implementation of this video decoder. This video decoder meets the requirements for MPEG-2 MP@HL real-time decoding. The outcome of this paper should be helpful to the design of HDTV Set Top Box.
When the rubber meets the road: putting research-based methods to test in urban classrooms
Authors: Junlei Li, David Klahr, Amanda Jabbour
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

We created a hypothetically "optimal" instructional scenario in which a knowledgeable researcher, under the guidance of an experienced classroom teacher, carried out a set of research-based science instruction in a low-SES urban school. The training group's performance was assessed by standardized test items and compared with that of a high-SES no training comparison group. The results demonstrate that instructional methods based on experimental psychological research have great potential for addressing the achievement gap problem. However, the analyses also reveal a significant discrepancy between low-SES students' performance on standardized test items and on alternative assessments with lower reading and writing demands. We discuss our methodological choices in making basic research more relevant to real world issues. We highlight the critical challenges of test validity, research relevancy, and reform feasibility for researchers and policymakers.
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
Authors: Christophe Duhamel, Philippe Mahey
Venue: Networks (2007)

We propose a modified version of the Flow Deviation method of Fratta, Gerla, and Kleinrock to solve multicommodity problems with minimal congestion and a bounded number of active paths. We discuss the approximation of the min&ndash;max objective function by a separable convex potential function and give a mixed-integer nonlinear model for the constrained routing problem. Heuristic control of the path generation is then embedded in the original algorithm based on the concepts of cleaning the quasi inactive paths and reducing the flow width for each commodity. Numerical experiments show the validity of the approach for realistic medium-sized networks associated with routing problems in broadband communication networks with multiple protocols and label-switched paths (MPLS). &copy; 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 80&ndash;89 2007
Interactive Object Annotation for Construction of Video Information System
Authors: Xiaomeng Wu, Shunsuke Kamijo, Wenli Zhang, Masao Sakauchi
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this paper, an interactive object annotation approach for video database will be proposed. The same semantic objects such as characters, backgrounds, and the main subjects in keyframes of each video shots can be queried and annotated based on the similarity of low-level features such as the color, area, and position of each region. An adaptive image enhancement algorithm is used for handling the lighting changes, and a region-based fuzzy feature matching approach is used for addressing the typical feature representation impreciseness. The content provider can then select relevant keyframes interactively from the results to annotate matched objects in them according to the descriptions that are added into the model. Based on this approach, a video information system is proposed for supporting video content generation. Furthermore, a novel practical application is constructed by using this support system and implemented to show the practicability of it.
Maximizing lifetime for data aggregation in wireless sensor networks
Authors: Yuan Xue, Yi Cui, Klara Nahrstedt
Venue: Mobile Networks and Applications (2005)

This paper studies energy efficient routing for data aggregation in wireless sensor networks. Our goal is to maximize the lifetime of the network, given the energy constraint on each sensor node. Using linear programming (LP) formulation, we model this problem as a multicommodity flow problem, where a commodity represents the data generated from a sensor node and delivered to a base station. A fast approximate algorithm is presented, which is able to compute (1-ε)-approximation to the optimal lifetime for any ε > 0. Then along this baseline, we further study several advanced topics. First, we design an algorithm, which utilizes the unique characteristic of data aggregation, and is proved to reduce the running time of the fastest existing algorithm by a factor of K, K being the number of commodities. Second, we extend our algorithm to accommodate the same problem in the setting of multiple base stations, and study its impact on network lifetime improvement. All algorithms are evaluated through both solid theoretical analysis and extensive simulation results.
Measuring and Enhancing Prediction Capabilities of Vulnerability Discovery Models for Apache and IIS HTTP Servers
Authors: Omar H. Alhazmi, Yashwant K. Malaiya
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

The prediction of the number of vulnerabilities in an HTTP server can allow us to evaluate the security risk associated with its use. Vulnerability discovery models have recently been proposed which can be used to estimate the future number of vulnerabilities expected to be discovered. A detailed analysis of the prediction capabilities of two models termed AML and LVD for the vulnerabilities in the two major HTTP servers is presented. Four complete data sets for Apache and IIS are used, representing an open source and a commercial web server respectively. Both long term predictions involving several years and short term predictions for the following year are considered. Potential methods for enhancing the prediction accuracy are considered. The results show good predictive capabilities of the AML model when constraints are used for estimating the model parameters. The LVD model works well in some special cases when saturation has not yet set in. The results can be used by both developers to plan the test and maintenance effort needed and by users to assess the potential security risks associated with a specific server.
Atomic diffusion at the Cu-Au-Si multilayers interface
Authors: S. Iaiche, N. Benouattas, A. Bouabellou, L. Osmani, L. Salik
Venue: Microelectronic Engineering (2005)

Si(100) and (111) oriented silicon wafers were used as a substrate for metallic bilayers deposition of copper and gold. Cu/Au/Si structures were obtained by thermal evaporation and then heated below 400^oC in vacuum. These solid-state reactions occurred in the samples have been studied using X-ray diffraction (XRD), Rutherford backscattering spectroscopy (RBS), scanning electronic microscopy (SEM) and X-ray dispersive energy analyzer (XDE). The study shows that heat treatment at 200^oC of the multilayered Cu/Au/Si structure leads to the formation and the co-existence of both Cu"3Si and Cu"4Si copper rich-silicides with the expansion of their respective cells, independently of the orientation of the substrate. The increasing of the annealing temperature until 400^oC leads to the growth of well-oriented crystallites corresponding to Cu"3Si and Cu"4Si silicides on Si(111) but only Cu"4Si crystallites with square and rectangular shapes on Si(100). The thermal stability of formed copper silicides after heat treatment at 400^oC during 30min for both Cu/Au/Si(100) and Cu/Au/Si(111) systems is analyzed.