ppxscal/embedding_network huggingface dataset:
Information Criteria and Statistical Modeling, 1st edition
Authors: Sadanori Konishi, Genshiro Kitagawa
Venue: Springer Series In Statistics (2007)

The Akaike information criterion (AIC) derived as an estimator of the Kullback-Leibler information discrepancy provides a useful tool for evaluating statistical models, and numerous successful applications of the AIC have been reported in various fields of natural sciences, social sciences and engineering. One of the main objectives of this book is to provide comprehensive explanations of the concepts and derivations of the AIC and related criteria, including Schwarzs Bayesian information criterion (BIC), together with a wide range of practical examples of model selection and evaluation criteria. A secondary objective is to provide a theoretical basis for the analysis and extension of information criteria via a statistical functional approach. A generalized information criterion (GIC) and a bootstrap information criterion are presented, which provide unified tools for modeling and model evaluation for a diverse range of models, including various types of nonlinear models and model estimation procedures such as robust estimation, the maximum penalized likelihood method and a Bayesian approach.
Combining graph connectivity & dominant set clustering for video summarization
Authors: D. Besiris, A. Makedonas, G. Economou, S. Fotopoulos
Venue: Multimedia Tools and Applications (2009)

The paper presents an automatic video summarization technique based on graph theory methodology and the dominant sets clustering algorithm. The large size of the video data set is handled by exploiting the connectivity information of prototype frames that are extracted from a down-sampled version of the original video sequence. The connectivity information for the prototypes which is obtained from the whole set of data improves video representation and reveals its structure. Automatic selection of the optimal number of clusters and hereafter keyframes is accomplished at a next step through the dominant set clustering algorithm. The method is free of user-specified modeling parameters and is evaluated in terms of several metrics that quantify its content representational ability. Comparison of the proposed summarization technique to the Open Video storyboard, the Adaptive clustering algorithm and the Delaunay clustering approach, is provided.
Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period
Authors: Min Kyoung Park, Volkan Rodoplu
Venue: IEEE Transactions on Mobile Computing (2009)

We show that even though mobile networks are highly unpredictable when viewed at the individual node scale, the end-to-end quality-of-service (QoS) metrics can be stationary when the mobile network is viewed in the aggregate. We define the coherence time as the maximum duration for which the end-to-end QoS metric remains roughly constant, and the spreading period as the minimum duration required to spread QoS information to all the nodes. We show that if the coherence time is greater than the spreading period, the end-to-end QoS metric can be tracked. We focus on the energy consumption as the end-to-end QoS metric, and describe a novel method by which an energy map can be constructed and refined in the joint memory of the mobile nodes. Finally, we show how energy maps can be utilized by an application that aims to minimize a node's total energy consumption over its near-future trajectory.
Adaptive dynamics of regulatory networks: size matters
Authors: Dirk Repsilber, Thomas Martinetz, Mats Björklund
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2009)

To accomplish adaptability, all living organisms are constructed of regulatory networks on different levels which are capable to differentially respond to a variety of environmental inputs. Structure of regulatory networks determines their phenotypical plasticity, that is, the degree of detail and appropriateness of regulatory replies to environmental or developmental challenges. This regulatory network structure is encoded within the genotype. Our conceptual simulation study investigates how network structure constrains the evolution of networks and their adaptive abilities. The focus is on the structural parameter network size. We show that small regulatory networks adapt fast, but not as good as larger networks in the longer perspective. Selection leads to an optimal network size dependent on heterogeneity of the environment and time pressure of adaptation. Optimal mutation rates are higher for smaller networks. We put special emphasis on discussing our simulation results on the background of functional observations from experimental and evolutionary biology.
Multi-Objective Multicast Routing based on Ant Colony Optimization
Authors: Diego Pinto, Benjamín Barán, Ramón Fabregat
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes cost of the multicast tree, average delay and maximum end-to-end delay. In this way, a set of optimal solutions, know as Pareto set, is calculated in only one run of the algorithm, without a priori restrictions. The proposed algorithm was inspired in a Multi-objective Ant Colony System (MOACS). Experimental results prove the proposed algorithm outperforms a recently published Multiobjective Multicast Algorithm (MMA), specially designed for solving the multicast routing problem.
Zone identification in biology articles as a basis for information extraction
Authors: Yoko Mizuta, Nigel Collier
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

Information extraction (IE) in the biomedical domain is now regarded as an essential technique for the dynamic management of factual information contained in archived journal articles and abstract collections. We aim to provide a technique serving as a basis for pinpointing and organizing factual information related to experimental results. In this paper, we enhance the idea proposed in (Mizuta and Collier, 2004); annotating articles in terms of rhetorical zones with shallow nesting. We give a qualitative analysis of the zone identification (ZI) process in biology articles. Specifically, we illustrate the linguistic and other features of each zone based on our investigation of articles selected from four major online journals. We also discuss controversial cases and nested zones, and ZI using multiple features. In doing so, we provide a stronger theoretical and practical support for our framework toward automatic ZI.
A non-rigid motion estimation algorithm for yawn detection in human drivers
Authors: Mihir Mohanty, Aurobinda Mishra, Aurobinda Routray
Venue: International Journal of Computational Vision and Robotics (2009)

This work focuses on the estimation of possible fatigue or drowsiness by detecting the occurrence of yawns with human drivers. An image processing technique has been proposed to analyse the deformation occurring on driver's face and accurately identify the yawn from other types of mouth opening such as talking and singing. The algorithm quantifies the degree of deformation on lips when a driver yawns. The image processing methodology is based on study of non-rigid motion patterns on 2D images. The analysis is done on a temporal sequence of images acquired by a camera. A shape-based correspondence of templates on contours of a particular region is established on the basis of curvature information. The shape similarity between the contours is analysed, after decomposing with wavelets at different levels. Finally, the yawn is correlated with fatigue-induced behaviour of drivers on a simulator.
Complex Systems and Self-organization Modelling, 1st edition
Authors: Cyrille Bertelle, Grard H.E. Duchamp, Hakima Kadri-Dahmani
Venue: Understanding Complex Systems (2009)

The concern of this book is the use of emergent computing and self-organization modelling within various applications of complex systems. The authors focus their attention both on the innovative concepts and implementations in order to model self-organizations, but also on the relevant applicative domains in which they can be used efficiently. This book is the outcome of a workshop meeting within ESM 2006 (Eurosis), held in Toulouse, France in October 2006.
Propagation of Orifice- and Nozzle-Generated Vortex Rings in Air
Authors: A. H. Syed, H. J. Sung
Venue: Journal of Visualization (2009)

The effect of the exit geometry of a vortex ring generator was studied experimentally. Two types of exit geometries were chosen: an orifice and a nozzle. Vortex rings were generated by pushing a solenoid-valve-controlled, pressurized-air jet through the circular opening of the orifice or nozzle. Experiments were performed over a wide range of initial Reynolds number (450 &les; Re &les; 4580) and length-to-diameter ratio (0.7 &les; L / D &les; 7.0) of the air jet. The exit geometry was found to significantly influence the entire course of propagation of the vortex ring. The orifice-generated vortex ring had superior characteristics to that produced by the nozzle under the same conditions. The vorticity generated along the wall in the orifice exit plane had a negligible effect on the circulation of the vortex ring within the specified range of Reynolds number. Compared to the nozzle-generated vortex ring, the orifice-generated ring showed reduced initial vorticity losses and less diffusive entrainment of ambient fluid. The vortex rings produced by the orifice attained more circulation, less entrainment of ambient fluid and hence rapidly propagated through longer distances in comparison to the nozzle-generated rings.
Sub-optimal Convergence of Non-symmetric Discontinuous Galerkin Methods for Odd Polynomial Approximations
Authors: Johnny Guzmán, Béatrice Rivière
Venue: Journal of Scientific Computing (2009)

We numerically verify that the non-symmetric interior penalty Galerkin method and the Oden-Babus¿ka-Baumann method have sub-optimal convergence properties when measured in the L 2-norm for odd polynomial approximations. We provide numerical examples that use piece-wise linear and cubic polynomials to approximate a second-order elliptic problem in one and two dimensions.
Performance analysis of HIP-based mobility and triggering
Authors: P. Paakkonen, P. Salmela, R. Aguero, J. Choque
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Ambient Networks concentrates on the co-operation of heterogeneous networks over multiple domains and accesses. One of the main goals of the project is the integration of developed concepts for validation purposes. This paper presents a performance analysis on the integration of mobility triggering and Host Identity Protocol (HIP) based mobility on the Ambient Networks/FreeBSD platform. The scalability of triggering and handover latency has been focused on in terms of different mobility triggers and access technologies. The results enable identification of the largest delay components, which have been analyzed.
Global exponential stability analysis of delayed Cohen-Grossberg neural networks with distributed delays [International Journal of Systems Science, Vol. 38 (2007) p. 601]
Authors: Xuyang Lou, Baotong Cui
Venue: International Journal of Systems Science (2009)

In this article, we indicate that two proposed sufficient conditions in the paper by X.Y. Lou and B.T. Cui [International Journal of Systems Science, Vol. 38 (2007) p. 601] were incorrect in general, which cannot guarantee the existence and global exponential stability of the system's equilibrium. For correcting the mistakes, a correct version of global exponential stability is given and proved in this article.
Parameter Space Exploration Using Scientific Workflows
Authors: David Abramson, Blair Bethwaite, Colin Enticott, Slavisa Garic, Tom Peachey
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

In recent years there has been interest in performing parameter space exploration across "scientific workflows", however, many existing workflow tools are not well suited to this. In this paper we augment existing systems with a small set of special "actors" that implement the parameter estimation logic. Specifically, we discuss a set of new Kepler actors that support both complete and partial sweeps based on experimental design techniques. When combined with a novel parallel execution mechanism, we are able to execute parallel sweeps and searches across workflows that run on distributed "Grid" infrastructure. We illustrate our new system with a case study in cardiac cell modelling.
Avalanche Dynamics in Grids: Indications of SOC or HOT?
Authors: A. Vijay Srinivas, D. Janakiram, M. Venkateswar Reddy
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

Complex systems such as those in evolution, growth and depinning models do not evolve slowly and gradually, but exhibit avalanche dynamics or punctuated equilibria. Self-Organized Criticality (SOC) and Highly Optimized Tolerance (HOT) are two theoretical models that explain such avalanche dynamics. We have studied avalanche dynamics in two vastly different grid computing systems: Optimal Grid and Vishva. Failures in optimal grid cause an avalanche effect with respect to the overall computation. Vishva does not exhibit failure avalanches. Interestingly, Vishva exhibits load avalanche effects at critical load density, wherein a small load disturbance in one node can cause load disturbances in several other nodes. The avalanche dynamics of grid computing systems implies that grids can be viewed as SOC systems or as HOT systems. An SOC perspective suggests that grids may be sub-optimal in performance, but may be robust to unanticipated uncertainties. A HOT perspective suggests that grids can be made optimal in performance, but would then be sensitive to unanticipated perturbations. An ideal approach for grid systems research is to explore a combination of SOC and HOT as a basis for design, resulting in robust yet optimal systems.
A robust power gating structure and power mode transition strategy for MTCMOS design
Authors: Afshin Abdollahi, Farzan Fallah, Massoud Pedram
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The large magnitude of supply/ground bounces, which arise from power mode transitions in power gating structures, may cause spurious transitions in a circuit. This can result in wrong values being latched in the circuit registers. We propose a design methodology for limiting the maximum value of the supply/ground currents to a user-specified threshold level while minimizing the wake up (sleep to active mode transition) time. In addition to controlling the sudden discharge of the accumulated charge in the intermediate nodes of the circuit through the sleep transistors during the wake up transition, we can eliminate short circuit current and spurious switching activity during this time. This is, in turn, achieved by reducing the amount of charge that must be removed from the intermediate nodes of the circuit and by turning on different parts of the circuit in a way that causes a uniform distribution of current over the wake up time. Simulation results show that, compared to existing wakeup scheduling methods, the proposed techniques result in a 1-2 orders of magnitude improvement in the product of the maximum ground current and the wake up time.
Potential Impact of Value Prediction on Communication in Many-Core Architectures
Authors: Shaoshan Liu, Jean-Luc Gaudiot
Venue: IEEE Transactions on Computers (2009)

The newly emerging many-core-on-a-chip designs have renewed an intense interest in parallel processing. By applying Amdahl's formulation to the programs in the PARSEC and SPLASH-2 benchmark suites, we find that most applications may not have sufficient parallelism to efficiently utilize modern parallel machines. The long sequential portions in these application programs are caused by computation as well as communication latency. However, value prediction techniques may allow the “parallelization” of the sequential portion by predicting values before they are produced. In conventional superscalar architectures, the computation latency dominates the sequential sections. Thus, value prediction techniques may be used to predict the computation result before it is produced. In many-core architectures, since the communication latency increases with the number of cores, value prediction techniques may be used to reduce both the communication and computation latency. In this paper, we extend Amdahl's formulation to model the data redundancy inherent to each benchmark, thereby identifying the potential of value prediction techniques. Our analysis shows that the performance of PARSEC benchmarks may improve by a factor of 180 and 230 percent for the SPLASH-2 suite, compared to when only the intrinsic parallelism is considered. This demonstrates the immense potential of fine-grained value prediction in reducing the communication latency in many-core architectures.
3S: A novel program for field spectroscopy
Authors: Michele Meroni, Roberto Colombo
Venue: Computers Geosciences (2009)

The graphic user interface software package spectroscopy at subnanometer spectral resolution is presented in this manuscript. The software permits efficient acquisition of field spectroscopy data and is specifically designed to facilitate the operations to compute the reflectance factor of a given object or surface from standard field spectroscopy measurements (so-called field remote sensing): incident and reflected solar radiance measurements. The developed computer code runs with widely diffused commercial low-cost visible/near-infrared Ocean Optics spectrometers. Its development was originally intended for plant studies using field spectroscopy at leaf and canopy level, but 3S can be employed in other applications such as ocean and water quality studies, geological exploration, mineral identification, precision farming and other environmental applications.
Modeling e-government business processes: New approaches to transparent and efficient performance
Authors: Hafedh Chourabi, Sehl Mellouli, Faouzi Bouslama
Venue: Information Polity (2009)

Many governments worldwide are restructuring their business practices to improve their performances. To help describe and understand the process of restructuring, modeling techniques are used at different levels of modeling abstraction. This paper presents a new approach to the modeling of e-government business processes. It is based on two existing modeling techniques: Business Process Mapping (BPMapping) and UN/CEFACT Modeling Methodology (UMM). The BPMapping technique provides an overall graphical representation of an organization depicting all different types of business processes, their inputs, outputs, and the environment in which the organization operates. The UMM methodology with its different business views gives details on collaborations and interactions of business processes. Combining BPMapping with UMM leads to a very expressive modeling approach which can provide artifact details at the higher levels of modeling abstraction and which also shows deployment strategies of the business processes. To illustrate the effectiveness of the proposed approach, it is applied to the modeling of the Record Integrated Management business process at Quebec Government.
Protein sequence alignment and structural disorder: a substitution matrix for an extended alphabet
Authors: Uros Midic, A. Keith Dunker, Zoran Obradovic
Venue: Proceedings of the KDD-09 Workshop on Statistical and Relational Learning in Bioinformatics (2009)

In protein sequence alignment algorithms, a substitution matrix of 20x20 alignment parameters is used to describe the rates of amino acid substitutions over time. Development and evaluation of most substitution matrices including the BLOSUM family [1] was based almost entirely on fully structured proteins. Structurally disordered proteins (i.e. proteins that lack structure, either in part or as a whole) that have been shown to be very common in nature [2] have a significantly different amino acid composition than ordered (i.e. structured) proteins [3]. Furthermore, the sequence evolution rate is higher in unstructured as compared to structured regions of proteins containing both structured and unstructured regions [4]. These results cast doubt on appropriateness of the BLOSUM substitution matrices for alignment of structurally disordered proteins [5].To address this problem, we take into the account the concept of structural disorder by extending the alphabet for sequence representation from 20 to 2x20=40 symbols, 20 for amino acids in disordered regions and 20 for amino acids in ordered regions. A 40x40 substitution matrix is required for alignment of sequences represented in the extended alphabet. Such an expanded matrix contains 20x20 submatrices that correspond to matching ordered-ordered, ordered-disordered, and disordered-disordered pairs of residues. In this paper we describe an iterative procedure that we used to estimate such a 40x40 substitution matrix. The iterative procedure converged with stable results with respect to the choice of the sequences in the dataset. In the obtained 40x40 matrix we found substantial differences between the 20x20 submatrices corresponding to ordered-ordered, ordered-disordered, and disordered-disordered region matching. These differences provide evidence that for alignment of protein sequences that contain disordered segments, the discovered substitution matrix is more appropriate than the BLOSUM substitution matrices. At the same time, the new substitution matrix is applicable for sequence alignment of fully ordered proteins as its order-order submatrix is very similar to a BLOSUM matrix.
Computer assisted assessment for computer programming course with agent based architecture
Authors: S. Masrom, A. S. Abd. Rahman, A. S. Shafie
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

Computer programming is considered a fundamental subject in most of engineering and computer related programs in many universities. Usually, the teaching responsibility is given to a single department, which will service the entire university. The limit on staffing will most certainly result in the creation of big-sized classes. This in turn, will produce voluminous workload to the teaching staff hence rendering close monitoring of students' performance next to impossible. This paper proposes a distributed and agent oriented architecture for a Student Assessment System. In the realm of Computer Assisted Assessment (CAA) a lot of systems in used currently are both centralized and standalone. Our design concentrates on two primary goals; to harness the power of distributed computing and to make CAA an integrated part of any existing E-Learning System. We have analyzed and extracted important functionalities required for the system, describe agent's roles for concerning each of the functions. We also describe the communication and accessibility aspect of the agents. We have developed an independent assessment module and performed some tests in a computer laboratory environment. We present in the last section of the paper, our findings regarding the assessment module's performance.
High order alternating group explicit finite difference method for parabolic equations
Authors: Qinghua Feng, Bin Zheng
Venue: WSEAS Transactions on Mathematics (2009)

Based on the concept of domain decomposition we construct a class of alternating group explicit method for fourth order parabolic equations. Furthermore, an exponential type alternating group explicit method for 2D convection-diffusion equations is derived, which is effective in convection dominant cases. Both of the two methods have the property of unconditional stability and intrinsic parallelism. Domain decomposition and group computing can be obtained in both of the two methods.