ppxscal/embedding_network huggingface dataset:
Statistical consensus methods for improving predictive geomorphology maps
Authors: Mathieu Marmion, Jan Hjort, Wilfried Thuiller, Miska Luoto
Venue: Computers Geosciences (2009)

A variety of predictive models is currently used to map the spatial distribution of earth surface processes and landforms. In this study, we tested statistical consensus methods in order to improve the predictive accuracy of geomorphological models. The distributions of 12 geomorphological formations were recorded at a resolution of 25ha in a sub-arctic landscape in northern Finland. Nine environmental variables were used to predict probabilities of occurrence of the formations using eight state-of-the-art modelling techniques. The probability values of the models were combined using four different consensus methods. The accuracy of the models was calculated using spatially independent test data by the area under the curve (AUC) of a receiver-operating characteristic (ROC) plot. The mean AUC values of the geomorphological models varied between 0.711 and 0.755 based on single-model techniques, whereas the corresponding values based on consensus methods ranged from 0.752 to 0.782. The weighted average consensus method had the highest predictive performance of all methods. It improved the accuracy of 11 predictions out of 12. The results of this study suggest that the consensus methods have clear advantages over single-model predictions. The simplicity of the consensus methods makes it straightforward to implement them in predictive modelling studies in geomorphology.
Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration
Authors: Masato Edahiro
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Fundamental algorithms should be parallelized to accelerate EDA software on multi-core architecture. In this paper, we introduce scalable algorithms that have scalability on multi-cores. As an example, a sorting algorithm, called Map Sort, is presented. This algorithm uses a map from subsets of input data to intervals on data range. Experimental results show that, in comparison with quick sort on a single CPU, processing time of Map Sort is comparable on a CPU and three times faster on four CPUs.
Determination of operating policies for a barge transportation system through simulation and optimization modeling
Authors: Nicholas P. Anderson, Gerald W. Evans
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents a simulation model of a barge transportation system for petroleum delivery within an inland waterway. The simulation is employed as an evaluation model within a decision support system which also includes a criterion model, represented as a decision maker's utility function, and an optimization procedure which employs scatter search. Variance reduction techniques are also employed in order to improve the accuracy of the estimates of the performance measures associated with the system. The main purpose of the system is to determine values for important inventory policy variables.
The design of a novel context-aware policy model to support machine-based learning and reasoning
Authors: John Strassner, José Neuman Souza, David Raymer, Srini Samudrala, Steven Davy, Keara Barrett
Venue: Cluster Computing (2009)

The purpose of autonomic networking is to manage the business and technical complexity of networked components and systems. However, the lack of a common lingua franca makes it impossible to use vendor-specific network management data to ascertain the state of the network at any given time. Furthermore, the tools used to analyze management data are all different, and hence require different data in different formats. This complicates the construction of context from diverse information sources. This paper describes a new version of the DEN-ng context-aware policy model, which is part of the FOCALE autonomic network architecture. This model has been built using three guiding principles: (1) both the context model and the policy model are rooted in information models, so that they can govern managed entities, (2) each model is expressly constructed to facilitate the generation of ontologies, so that reasoning about policies constructed from the model may be done, and (3) the model is expressly constructed so that a policy language that supports machine-based reasoning and learning can be developed from it.
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Authors: Decheng Dai, Changyuan Yu
Venue: Theoretical Computer Science (2009)

We study the minimum weight dominating set problem in weighted unit disk graph, and give a polynomial time algorithm with approximation ratio 5+epsilon (Porson), improving the previous best result of 6+epsilon (Porson) in [Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu, A better constant-factor approximation for weighted dominating set in unit disk graph, J. Comb. Optim. (ISSN: 1382-6905) (2008) 1573&ndash;2886. (Print) (Online)]. Combining the common technique used in the above mentioned reference, we can compute a minimum weight connected dominating set with approximation ratio 9+epsilon (Porson), beating the previous best result of 10+epsilon (Porson) in the same work.
C# 2008: new features: tutorial presentation
Authors: David R. Naugler
Venue: Journal of Computing Sciences in Colleges (2009)

C#, the flagship .NET language, is still a rapidly evolving language. C# 2008 with .NET 3.5 introduces many new features which can ease coding. It has also introduced an alphabet soup of new acronyms such as, XAML, and BAML, and new technologies such as WCP, WPF and LINQ. WPF (Windows Presentation Foundation) is a new GUI API.
Comparison Study on Sketching Behaviors with and without Interactive Pen Displays
Authors: Lai-Chung Lee, Whei-Jane Wei
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Sketching can stimulate creativity especially in the idea generation stage of design process. However, there is little research on sketching behaviors with an interactive pen display. This is an experimental study to identify the sketching behavior patterns with and without interactive pen displays in two groups below. In experimental group, a senior designer and a junior designer communicated at a distance with an interactive pen display each side. Two designers discussed together in person without an interactive pen display in the reference group. The study identified four patterns of sketching behaviors including creation, modification, annotation and indication. There was a significant difference of creation behavior and indication behavior between groups in the design briefing stage.
Development of a dynamical software for doing geometrical constructions
Authors: Anca Iordan, George Savii, Manuela Paănoiu, Caius Paănoiu
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this work will be presented the elaboration of an educational informatics system for doing geometry on a computer. In a way it replaces pencil, paper, ruler and compass with equivalent computer tools. The achieved informatics system will be able to be used for teachning Euclidean geometry, both in pre-university and in university education.
Acoustic Echo Cancellation Using Sub-Adaptive Filter
Authors: Satoshi Ohta, Yoshinobu Kajikawa, Yasuo Nomura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In the acoustic echo canceller (AEC), the step-size parameter of the adaptive filter must be varied according to the situation if double talk occurs and/or the echo path changes. We propose an AEC that uses a sub-adaptive filter. The proposed AEC can control the step-size parameter according to the situation. Moreover, it offers superior convergence compared to the conventional AEC even when the double talk and the echo path change occur simultaneously. Simulations demonstrate that the proposed AEC can achieve higher ERLE and faster convergence than the conventional AEC. The computational complexity of the proposed AEC can be reduced by reducing the number of taps of the sub-adaptive filter.
Component-based software version management based on a Component-Interface Dependency Matrix
Authors: Shi-Ming Huang, Chih-Fong Tsai, Po-Chun Huang
Venue: Journal of Systems and Software (2009)

As much component-based software is developed, a software configuration management (SCM) tool for component-based software is necessary. In this paper, we propose a version management mechanism for impact analysis while components are upgraded. We separately version the components and interfaces based on a Component-Interface Dependency Matrix (CIDM), and analyze impacts according to their dependency relationship. The result of our simulation shows that CIDM is capable of managing large numbers of components without impedance mismatch. In addition, in a well-designed software system, using CIDM to analyze impacts can save resources in the software development phase.
Drug targets for tumorigenesis: Insights from structural analysis of EGFR signaling network
Authors: Saliha Durmuş Tekir, Kazım Yalçın Arga, Kutlu Ö. ílgen
Venue: Journal of Biomedical Informatics (2009)

Deciphering the complex network structure is crucial in drug target identification. This study presents a framework incorporating graph theoretic and network decomposition methods to analyze system-level properties of the comprehensive map of the epidermal growth factor receptor (EGFR) signaling, which is a good candidate model system to study the general mechanisms of signal transduction. The graph theoretic analysis of the EGFR network indicates that it has small-world characteristics with scale-free topology. The employment of network decomposition analysis enlightened the system-level properties, such as network cross-talk, specific molecules in each pathway and participation of molecules in the network. Participating in a significant fraction of the fundamental paths connecting the ligands to the phenotypes, cofactor GTP and complex G@b/G@c were identified as ''housekeeping'' molecules, through which all pathways of EGFR network are cross-talking. c-Src-Shc complex is identified as important due to its role in all fundamental paths through tumorigenesis and being specific to this phenotype. Inhibitors of this complex may be good anti-cancer agents having very little or no effect on other phenotypes.
A scaffolded introduction to dynamic website development for female high school students
Authors: Mary Beth Rosson, Anastassia Ioujanina, Timothy Paone, Gretel Sheasley, Hansa Sinha, Craig Ganoe, John M. Carroll, Jan Mahar
Venue: ACM SIGCSE Bulletin (2009)

We describe work on developing workshop activities that are part of wConnect, a project that is building an online community of women in computer and information science. The workshops are designed by college women for high school girls, with hands-on construction of dynamic web sites. Because of limited workshop time, the activities use scaffolding to help girls achieve the in-tended learning objectives. In this paper we describe the design of the activities, their formative evaluation in a series of four work-shops, and how we are using these results in the larger project.
Optimizing distributed data bases: a framework for research
Authors: K. Dan Levin, Howard Lee Morgan
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The interaction between computers and communication technology has steadily developed in recent years bringing with it the creation of large computer communication complexes. Earlier computer communication systems were generally focused around a single large computer installation. Although a strong argument can still be made for serving distributed users with a centralized system, we now witness an increasing number of systems in which information processing and storage functions are distributed among several computers. The idea is to distribute the resources (programs, data, computing hardware, etc.) of each computer site to a widely spread community of users. Various factors may favor a shift toward computer networks, especially with similarly structured organizations which are independent but can be motivated to share. The most well-known example is the network developed under the sponsorship of the Advanced Research Project Agency (ARPA), that links independent research organizations, all involved in solving closely related problems. The libraries of specialized software and data at each research center, make it attractive to link the computers of these organizations. Clearly, access to specialized data bases is a major feature of the networks and the cost incurred by such an access is an important consideration in determining the economic viability of this kind of resource sharing.
Complicated Geologic Body Modeling and Visualization Technique Based on Quasi Tri-prism
Authors: Min Zhang, Wunian Yang, Zhiyong Luo, Xueming Wu, Li Peng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Based on the "quasi tri-prism" model and the improved borehole data recording approach, this paper presents a method of "dummy borehole chain" to control the complicated geo-body modeling. An algorithm was designed to identify the fold, the lens body, the pinch and the fault automatically. The proposed "window densification" in this paper was used to handle the TIN densification. The "cross-boundary problem" neglected in previous studies was solved here. The "isolation belt" as a character of Delaunay triangle found in this paper was used to build the "moving window ROI" of Delaunay triangle network. Three solutions for algorithm acceleration were also presented. C#, Microsoft Access and Open Inventor were applied to the 3D visualization of the complicated geo-body, providing the ability to operate geo-body in ways such as incision, mining, 3D-probing, layer filtering, raster displaying and vector displaying.
A novel sequential circuit optimization with clock gating logic
Authors: Yu-Min Kuo, Shih-Hung Weng, Shih-Chieh Chang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

To save power consumption, it has been shown that the clock signal can be gated without changing the functionality under certain clock-gating conditions. We observe that the clock-gating conditions and the next-state function of a Flip-Flop (FF) are correlated and can be used for sequential optimization. We show that the implementation of the next-state function of any FF can be just an inverter if the clock signal is appropriately gated. By exploiting the flexibility between the clock-gating conditions and the next-state function, we propose an iterative optimization technique to minimize the overall timing.
A New Differential Evolution Algorithm for Solving Global Optimization Problems
Authors: Miliie Pant, Radha Thangaraj, V. P. Singh
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ranked as one of the best search algorithm for solving global optimization problems in several case studies. Mutation operation plays the most significant role in the performance of a DE algorithm. This paper proposes a new mutant vector based on the concept quadratic interpolation. The proposed algorithm is examined for a set of eleven benchmark, global optimization problems having different dimensions. The numerical results show that the incorporation of the proposed quadratic mutant vector helps in improving the performance of DE in terms of final objective function value and convergence rate.
On the two-dimensional orthogonal drawing of series-parallel graphs
Authors: Satoshi Tayu, Kumiko Nomura, Shuichi Ueno
Venue: Discrete Applied Mathematics (2009)

It has been known that every planar 4-graph has a 2-bend 2-D orthogonal drawing, with the only exception being the octahedron, every planar 3-graph has a 1-bend 2-D orthogonal drawing with the only exception being K"4, and every outerplanar 3-graph with no triangles has a 0-bend 2-D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2-D orthogonal drawing.
General Integral Control
Authors: Bai-Shun Liu, Bing-Li Tian
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper we overcome the restriction of conventional integrators and present a unified framework for general integral control (GIC). The necessary conditions and basic principles for designing a general integrator are proposed. All asymptotically stable controllers in conjunction with the limited conditions described can be directly used as integrators and all techniques for designing these controllers can be used to design a general integrator and analyze its stability. Many control laws can easily be transformed into GIC laws and many control theories can be used to design a GIC controller, analyze its stability and tune its parameters. Theoretical analysis and simulation results demonstrated that the general integrator has stronger capability, faster convergence and better flexibility than previous integrators and the windup phenomenon can be eliminated. Moreover, compared to previous integral control, GIC can remarkably improve transient performance by using the same maximum control action.
Transparent checkpoints of closed distributed systems in Emulab
Authors: Anton Burtsev, Prashanth Radhakrishnan, Mike Hibler, Jay Lepreau
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Emulab is a testbed for networked and distributed systems experimentation. Two guiding principles of its design are realism and control of experimentation. There is an inherent tension between these goals, however, and in some aspects of the testbed's design, Emulab's implementers favored realism over control. Thus, Emulab provides wide-ranging control over an experiment's environment and initial conditions, but relatively little control over its execution--in particular, the ability to suspend, preempt, or replay the experiment. We have extended Emulab with a new means of control over experiment execution: the ability to cleanly checkpoint the execution of the set of nodes and networks that comprise an experiment. Conventional checkpoint mechanisms can easily degrade the fidelity of experiment results as a consequence of checkpoint downtimes, overheads of background state saving, and unintended distributed checkpoint synchronization effects. In this paper we demonstrate a checkpointing technique that is transparent with respect to the execution of the system under test, almost completely concealing the underlying checkpoint activity. Building on our checkpoint mechanism, we have implemented two powerful facilities for experiment execution control: the ability to preemptively swap-out experiments without losing their run-time state, and the ability to time-travel through the run of a system.
Simulation of Seismic Wave Propagation in an Asteroid Based upon an Unstructured MPI Spectral-Element Method: Blocking and Non-blocking Communication Strategies
Authors: Roland Martin, Dimitri Komatitsch, Céline Blitz, Nicolas Goff
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

In order to better understand the internal structure of asteroids orbiting in the Solar system and then the response of such objects to impacts, seismic wave propagation in asteroid 433-Eros is performed numerically based on a spectral-element method at frequencies lying between 2 Hz and 22 Hz. In the year 2000, the NEAR Shoemaker mission to Eros has provided images of the asteroid surface, which contains numerous fractures that likely extend to its interior. Our goal is to be able to propagate seismic waves resulting from an impact in such models. For that purpose we create and mesh both homogeneous and fractured models with a highly-dispersive regolith layer at the surface using the CUBIT mesh generator developed at Sandia National Laboratories (USA). The unstructured meshes are partitioned using the METIS software package in order to minimize edge cuts and therefore optimize load balancing in our parallel blocking or non-blocking MPI implementations. We show the results of several simulations and illustrate the fact that they exhibit good scaling.
Digital Khalimsky Manifolds
Authors: Erik Melin
Venue: Journal of Mathematical Imaging and Vision (2009)

We consider different possibilities to define digital manifolds that are locally homeomorphic to Khalimsky n-space. We prove existence and non-existence of certain types of Khalimsky manifolds. An embedding theorem is proved. We introduce the join operator and use it to analyze the structure of adjacency neighborhoods and of intersections of neighborhoods in ℤ n .
Template Attacks on ECDSA
Authors: Marcel Medwed, Elisabeth Oswald
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Template attacks have been considered exclusively in the context of implementations of symmetric cryptographic algorithms on 8-bit devices. Within these scenarios, they have proven to be the most powerful attacks. In this article we investigate how template attacks can be applied to implementations of an asymmetric cryptographic algorithm on a 32-bit platform. The asymmetric cryptosystem under scrutiny is the elliptic curve digital signature algorithm (ECDSA). ECDSA is particularly suitable for 32-bit platforms. In this article we show that even SPA resistant implementations of ECDSA on a typical 32-bit platform succumb to template-based SPA attacks. The only way to secure such implementations against template-based SPA attacks is to make them resistant against DPA attacks.
Ensuring High Availability of Distributed Multimedia Applications
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Multimedia applications are characterized by QoS (quality of service) requirements which depend on the quality of video and audio transmitted to the client, and the respect of time constraints associated to video and audio data. Much work has been done in order to provide system support that meets these requirements. However, existing proposals do not integrate the consequence of failure occurrence on QoS. In this paper, we address this issue by introducing a resource reservation model that integrates availability requirements. Our design goals for this model were: to allow programmers to reserve resources with respect to various QoS requirements including availability; to preserve the transparency of mechanisms used for availability; This paper details the resulting model together with its integration in a distributed system. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player