ppxscal/embedding_network huggingface dataset:
Systematic design of microstructures by topology optimization
Authors: O. Sigmund
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The topology optimization method can be used to determine the material distribution in a design domain such that an objective function is maximized and constraints are fulfilled. The method which is based on Finite Element Analysis may be applied to all kinds of material distribution problems like extremal material design, sensor and actuator design and MEMS synthesis. The state-of-the-art in topology optimization will be reviewed and older as well as new applications in phononic and photonic crystals design will be presented.
Parallel Branch and Bound on P2P Systems
Authors: El-Ghazali Talbi, Ahcene Bendjoudi, Noredine Melab
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Real or academic combinatorial optimization problems are in the majority Np-hard. For large dimensions, an exact resolution is often impractical due to a limited amount of resources. The use of large scale deployment on distributed systems such as Peer-to-Peer (P2P) systems, based on exploiting free CPU cycles, provides an efficient way to reach high computing performance by distributing the computation to solve these problems. In this paper, we are interested in solving exactly optimization problems using parallel Branch-and-Bound algorithm on large scale distributed systems. We propose ParallelBB, which is a parallelization of the Branch-and-Bound algorithm and apply it to a monocriterion permutation flow-shop problem. Furthermore, we develop P2PBB, which is the Peer-to-Peer implementation of our algorithm using ProActive.
WinHIPE: an IDE for functional programming based on rewriting and visualization
Authors: Cristóbal Pareja-Flores, Jamie Urquiza-Fuentes, J. Ángel Velázquez-Iturbide
Venue: ACM SIGPLAN Notices (2007)

The article describes an IDE for functional programming, called WinHIPE. It provides an interactive and flexible tracer, as well as a powerful visualization and animation system. The former tool is based on the rewriting model of evaluation, and the latter provides automatic generation of visualizations and animations, friendly support for customization, maintenance and exportation of animations to the Web, and facilities to cope with large scale. Its main advantage over other visualization systems is an effortless approach to animation creation and maintenance, based on generating visualizations and animations automatically, as a side effect of program execution. Finally, we briefly describe our experience using the system during several years in educational settings.
Tomographic reconstruction using heuristic Monte Carlo methods
Authors: R. Barbuzza, M. Vénere, A. Clausse
Venue: Journal of Heuristics (2007)

A tomographic reconstruction method based on Monte Carlo random searching guided by the information contained in the projections of radiographed objects is presented. In order to solve the optimization problem, a multiscale algorithm is proposed to reduce computation. The reconstruction is performed in a coarse-to-fine multigrid scale that initializes each resolution level with the reconstruction of the previous coarser level, which substantially improves the performance. The method was applied to a real case reconstructing the internal structure of a small metallic object with internal components, showing excellent results.
The Haar Wavelet Transform of a Dendrogram
Authors: Fionn Murtagh
Venue: Journal of Classification (2007)

We describe a new wavelet transform, for use on hierarchies or binary rooted trees. The theoretical framework of this approach to data analysis is described. Case studies are used to further exemplify this approach. A first set of application studies deals with data array smoothing, or filtering. A second set of application studies relates to hierarchical tree condensation. Finally, a third study explores the wavelet decomposition, and the reproducibility of data sets such as text, including a new perspective on the generation or computability of such data objects.
A High Performance Multicast Scheme Based on Virtual 2D Torus Topology
Authors: I-Shyan Hwang, San-Nan Lee, Kuo-Chang Chien
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Wavelength Division Multiplexing (WDM) not only can increase the bandwidth of backbone transmission network significantly, but can also decrease the network cost and make the controlling and maintaining of transmission easy. A new algorithm, Torus Topology Conversion Algorithm (TTCA), is proposed in this paper. It is made up of three parts: (1) the conversion algorithm, developed from Ring-Tree-based RWA (RTRWA), is employed to change topologies from real networks into torus networks; (2) the Earliest Available Channel (EAC) algorithm is utilized for wavelength assignment; and (3) Time Division Multiplexing (TDM) is used for the scheduling algorithm to proceed on transmission of packets. The system performance of the TTCA is compared with both the RTRWA and Steiner minimal tree (SMT). The simulation results show that the call blocking probability of the TTCA can be reduced 10% to 20% more than that of the RTRWA and the channel utilization of the TTCA can be increased 40% to 50% more than that of the RTRWA.
Supermon: high-performance monitoring for Linux clusters
Authors: Ronald G. Minnich
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

At the ACL we are building tools that monitor a cluster, anticipate cluster node failure, and take action before the node fails. Actions include migrating the processes away from the failing node, deconfiguring the node, and initiating diagnostics on the node. A key requirement for these tools is that they require efficient, frequent data collection from the nodes. Current tools for monitoring Linux systems do not provide enough information, and what information they do provide comes slowly and at a high cost in CPU resource consumption and network bandwidth. The resource consumption is an even more serious problem in a cluster, where consumption of network bandwidth is multiplied by the number of network nodes. In this paper we describe Supermon, a new monitoring system for Linux clusters. Supermon functions as a server, and hence can supply data over many connections to many clients simultaneously. Supermon also replaces the SunRPC interface used by Linux status daemons with a very simple text-based command and response format. Supermon has proven to be very effective for many different types of clients, including Perl and Java programs. Our new system allows programs to gather cluster performance data at up to 1000 samples/second for all the nodes in a 128-node cluster, with no measureable impact on cluster node performance.
Exploiting local STFT properties
Authors: K. L. Gaston
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We consider the properties of the short time Fourier transform as a representation of the distribution of the analytic signal in time and frequency and use the properties of the surface to remap the surface and reconstruct the analytic representations of signal components. In the remapping, the phase gradient of the surface is used to redistribute the signal on the surface, resting in a more focused image of multicomponent FM signals. In the reconstruction of analytic signal components the STFT surface is summed, resulting in a direct inversion process, which does not involve the use of inverse transforms.
"New software for learner-centered circuits instruction"
Authors: M. D. Ciletti
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. Today's classroom and technologies offer solutions to the challenges that face students and instructors in circuits. Software tools now support several areas of the curriculum (e.g. circuits and electromagnetic fields), and many students learn to use them early in their studies. The availability of powerful personal computers linked to classroom video projection systems creates an opportunity for faculty to broaden the scope of their instruction on-the-fly, with a high level of audience interaction and exploration. With software tools, examples can be explored freely, and students can address "what-if" questions immediately. Students gain valuable reinforcement for their understanding of abstract concepts by seeing physical, practical effects on the screen, under their control. Here, the authors discuss such software for learner-centered circuits instruction.
NT 3.5 / 4.0 domains for UNIX
Authors: Luke Kenneth Casson Leighton
Venue: Proceedings of the 1998 Conference on Large Installation System Administration of Windows NT (1998)

NT domain logins, and some experimental administrative capabilities, have been added to a development branch of SAMBA, the publicly available file/print share program that makes UNIX servers look like Microsoft windows NT server. Further work is needed, but the goal is to make UNIX look like windows NT, over a network. This will include full UNIX command-line administrative capability as well. The implications of this are that UNIX will be fully adminsterable by the standard NT server tools (e.g "user manager for domains"; "server manager for domains"), and both UNIX and NT will be fully administerable using HTML (cgi-bin wrappers around the smbclient program). Some of this functionality (both client and server) is already available. The latest version can be obtained by following the instructions in http://samba.anu.edu/au/cvs.html. At present, SAMBA and smbclient can only provide or obtain information using DCE/RPC: no capability has been added to administer domain servers. This can (should) only be possible to do by administrators. Adding or changing SAM user accounts or domain groups is encrypted. The "backup domain controller" and "inter-domain trust relationships" also needs to be researched. Final point: anyone running windows NT who allows SMB access through their firewall (ports 137-139) is strongly advised to look up and enable the "RestrictAnonymous" registry key in the microsoft KB articles, and to look for information on the "red button" bug in NT.
GeoDDupe: A Novel Interface for Interactive Entity Resolution in Geospatial Data
Authors: Hyunmo Kang, Vivek Sehgal, Lise Getoor
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Due to the growing interest in geospatial data mining and analysis, data cleaning and integration in geospatial data is becoming an important issue. Geospatial entity resolution is the process of reconciling multiple location references to the same real world location within a single data source (deduplication) or across multiple data sources (integration). In this paper, we introduce an interactive tool called GeoDDupe which effectively combines automatic data mining algorithms for geospatial entity resolution with a novel network visualization supporting users' resolution analysis and decisions. We illustrate the GeoDDupe interface with an example geospatial dataset and show how users can efficiently and accurately resolve location entities. Finally, the case study with two real-world geospatial datasets demonstrates the potential of GeoDDupe.
Automated generation of N-best pronunciations of proper nouns
Authors: N. Deshmukh, M. Weber, J. Picone
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The problem of proper noun recognition is key to developing pervasive voice interfaces in applications such as directory assistance and data entry for telecommunications. Recognition of such words requires an ability to generate reasonably accurate pronunciation networks. This is a very challenging problem because a large percentage of proper nouns, such as personal names, appear to have no obvious (or simple) letter to mapping rules that can be used to generate the pronunciations. It appears to be an open-ended problem that is constantly evolving as a function of numerous sociological factors. Yet humans do amazingly well at generating and recognizing the pronunciation of a name never encountered before. We present an algorithm based on a Boltzmann machine type of neural network that generates the most likely pronunciations of a proper noun from the text-only spellings of the name. This method does not require voice data containing the spelling or nominal pronunciation.
Testing as a Mental Discipline: Practical Methods for Affecting Developer Behavior
Authors: Stephen Frezza, Mei-Huei Tang
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Testing is traditionally defined as "the execution of a program with the intent of finding errors."[1] This core definition, though useful, does not provide educators with an effective means to communicate either the goals or the value of software testing. "Testing and test design, as part of quality assurance, should also focus on bug prevention." [2] Similarly, the related mantra to "test, then code' has found a resonant home in the agile software development community (e.g., TDD: Test-Driven Development). [3]
MMSE parameter estimation of multiple chirp signals
Authors: Hsiang-Tsun Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We propose an iterative algorithm for minimum mean square error (MMSE) estimation of the parameters of multiple superimposed linear chirp signals in white Gaussian noise. The parameter estimation of each chirp component is carried out by two dimensional integration. The integrals are derived with the assumption that the remaining chirp signals have parameters whose values are fixed at their current estimates. The necessary parameter initializations are obtained by tracking the Choi-Williams (1989) time-frequency distribution and applying the least-squares method. Computer simulations provide a comparison between our scheme and the alternating projection (AP) method.
Reparallelization and Migration of OpenMP Programs
Authors: Michael Klemm, Matthias Bezold, Stefan Gabriel, Ronald Veldema, Michael Philippsen
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system utilization. If the user underestimates the runtime, premature termination causes computation loss; overestimation is penalized by long queue times. As a solution, we present an automatic reparallelization and migration of OpenMP applications. A reparallelization is dynamically computed for an OpenMP work distribution when the number of CPUs changes. The application can be migrated between clusters when an allocated time slice is exceeded. Migration is based on a coordinated, heterogeneous checkpointing algorithm. Both reparallelization and migration enable the user to freely use computing time at more than a single point of the grid. Our demo applications successfully adapt to the changed CPU setting and smoothly migrate between, for example, clusters in Erlangen, Germany, and Amsterdam, the Netherlands, that use different processors. Benchmarks show that reparallelization and migration impose average overheads of about 4% and 2%.
Undergraduate student retention strategies for urban engineering colleges
Authors: B. Flores
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

With the exception of two flagship institutions in Texas, the graduation rate at urban public universities in the state is lower than 40%. New Mexico public universities hold a similar record. A theory for college departure argues that this graduation rate could be increased significantly by reducing the attrition rate during the first years of college. We discuss a multi-component implementation of this theory in a commuter engineering college in west Texas. First, we address the transition between high school and college as an anomic situation that can be corrected by means of a university seminar that incorporates survival skills into the academic content of the course. We explain how academic performance of entering students can be improved via the implementation of learning communities. We also explain how the incorporation of entering students into the college society can be achieved through an academic center for student development. Next, we discuss the advantage of developing a strong undergraduate research program. Finally, we discuss the importance of faculty, and curriculum development in promoting a culture change that focuses on student learning through active participation in the classroom.
Analyzing computer simulation experiments using process convolutions
Authors: Bruno Sanso, Herbert K. Lee
Venue:  (2006)

This work is mainly focused on developing Bayesian statistical methodology for computer simulation experiments, including a proton accelerator experiment and an atmospheric transport experiment. The common theme that connects these two very different applications is process convolutions. For the particle accelerator application, the goal is to infer the initial distributions of the particles emitting from a particular particle accelerator. The beam of the particles is gradually controlled in both dimensions after a series of focusing magnets to eliminate radioactivity hazards. The focusing techniques require a good understanding of the initial configurations of the particles. Wire scans are set up along the path of the beam to collect the information of particle positions. A computer simulator is provided by scientists at the Los Alamos National Laboratory, which predicts the evolution of a beam given its initial distributions. Thus we have a classic inverse problem, where we are to infer the initial distributions of the particles from highly simplified and transformed histograms of particle positions created by the wirescans, with the computer simulator providing the link. Inverse problems are usually challenging. We manage to solve this challenging problem by using process convolutions. The nonparametric approach provides flexibility yet can be fit by the scarce data available. For the atmospheric transport application, there are two primary goals. Scientists found a correlation between the observed ozone concentrations and AO (Arctic Oscillation) index at eight observational sites in America and Europe. They further used MOZART, a global chemical transport computer simulator developed at NCAR to simulate the distribution of tropospheric ozone, its precursors and other chemical tracers, to study ozone global concentrations and transport. The first statistical goal is to determine whether the correlation between ozone and AO index is significant throughout the northern hemisphere. MOZART's output is driven by wind fields obtained from general circulation model (GCM) or reanalysis data set. Peter Hess and Natalie Mahowald, atmospheric scientists at NCAR, performed the runs with both forcings. The second goal is to examine if the variability observed in ozone concentrations obtained from GCM forcings is comparable to the one produced by reanalysis winds. The huge amount of data and very large spatial scales raise challenging statistical analysis problems. Thus instead of traditional spatial modeling methods, we use process convolutions to model a Gaussian process for both GCM-based and NCEP-based simulation data sets. For the purpose of comparison, we apply model comparison methods, which include posterior predictive loss, Deviance Information Criterion (DIC), overlapping of posterior intervals, and Bhattacharyya distance.
A variational formulation for segmenting desired objects in color images
Authors: Ling Pi, Chaomin Shen, Fang Li, Jinsong Fan
Venue: Image and Vision Computing (2007)

This paper presents a new variational formulation for detecting interior and exterior boundaries of desired object(s) in color images. The classical level set methods can handle changes in topology, but can not detect interior boundaries. The Chan-Vese model can detect the interior and exterior boundaries of all objects, but cannot detect the boundaries of desired object(s) only. Our method combines the advantages of both methods. In our algorithm, a discrimination function on whether a pixel belongs to the desired object(s) is given. We define a modified Chan-Vese functional and give the corresponding evolution equation. Our method also improves the classical level set method by adding a penalizing term in the energy functional so that the calculation of the signed distance function and re-initialization can be avoided. The initial curve and the stopping function are constructed based on that discrimination function. The initial curve locates near the boundaries of the desired object(s), and converges to the boundaries efficiently. In addition, our algorithm can be implemented by using only simple central difference scheme, and no upwind scheme is needed. This algorithm has been applied to real images with a fast and accurate result. The existence of the minimizer to the energy functional is proved in the Appendix A.
Automating algorithms for the identification of fault-prone files
Authors: Thomas J. Ostrand, Elaine J. Weyuker, Robert M. Bell
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

This research investigates ways of predicting which files would be most likely to contain large numbers of faults in the next release of a large industrial software system. Previous work involved making predictions using several different models ranging from a simple, fully-automatable model (the LOC model) to several different variants of a negative binomial regression model that were customized for the particular software system under study. Not surprisingly, the custom models invariably predicted faults more accurately than the simple model. However, development of customized models requires substantial time and analytic effort, as well as statistical expertise. We now introduce new, more sophisticated models that yield more accurate predictions than the earlier LOC model, but which nonetheless can be fully automated. We also extend our earlier research by presenting another large-scale empirical study of the value of these prediction models, using a new industrial software system over a nine year period.
Performance Analysis of Distributed Software Systems: Approaches Based on Queueing Theory
Authors: Varsha Apte
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

A distributed software system uses a complex system of resources which work together to process a request. A typical web-based request flows through various servers including Web servers, database servers, Java application servers, etc, deployed on various hardware platforms. Such a request encounters various forms of delays at and between these servers: communication delay, processing delay and queueing delay.
Type-Based Static and Dynamic Website Verification
Authors: Jorge Coelho, Mario Florido
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Maintaining large websites and verifying their semantic content is a difficult task. In this paper we propose a framework for syntactic validation, semantic verification and automatic correction of websites based on the logic programming language XCentric. Here we purpose a new approach conciliating the highly declarative model of XCentric with compile and run time verification techniques, mainly based on type checking to automatically repair and audit websites. The result is an easy to follow model to improve and audit website content.