ppxscal/embedding_network huggingface dataset:
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Venue: ACM Symposium on Solid and Physical Modeling (2005)

The ACM Symposium on Solid and Physical Modeling and Applications is an annual international forum for the exchange of recent research results and applications of spatial modeling and computations in design, analysis and manufacturing, as well as in emerging biomedical, geophysical and other areas. Previous symposia in this series were held in Austin, Texas, 1991; Montreal, Canada, 1993; Salt Lake City, Utah, 1995; Atlanta, Georgia, 1997; Ann Arbor, Michigan in 1999 and 2001; Saarbrucken, Germany, 2002; and Seattle, Washington, 2003, and Genova, Italy, 2004. For additional information, visit www.solidmodeling.org, the home page of the Solid Modeling Association that oversees this symposia series.Since its inception in 1991, the ACM Symposium on Solid Modeling and Applications has been the primary venue for disseminating research results in the design, representation, analysis, visualization, and use of digital models of real or planned solid objects and of their bounding surfaces. At the same time, modeling solids entails not only handling their geometric shape, but also their physical properties and behaviors. To emphasize this broader mission, we have expanded the name of the 2005 Symposium to Solid and Physical Modeling (abbreviated SPM). SPM-05 was held on the MIT campus, in Cambridge, Massachusetts, in plenary sessions (no parallel tracks) from Monday June 13 to Wednesday June 15, and was followed by the <u>Shape Modeling International</u> (SMI) conference. Both SPM and SMI events are part of the <u>2005 Joint Convention on Solids and Shapes</u>, (S&S'05) hosted at MIT and chaired by Nick Patrikalakis. The <u>2004 Joint Convention on Shapes and Solids</u> took place in Genoa Italy.Some sixty technical papers have been submitted and were reviewed by the international program committee and expert reviewers from around the world. At least three to four external reviewers and members of the program committee reviewed and discussed each submission. A total of 22 refereed papers have been selected for plenary presentation and full paper publication in the proceedings. In addition, 6 more papers have been selected as technical sketches for shorter publication and presentation at the conference. The symposium program also includes two keynote presentations invited from leading authorities in their fields: Bruce Donald and James O'Brien. Another new feature in the symposium program was that we had three panel session where recent trends and challenges are discussed. The panel sessions were organized by Dimitris Metaxas (Biomedical Modeling), Michael Wang (Physical Modeling and Simulation), and Jan Vandenbrande (Design, Analysis, and Manufacturing).
HIClass: hyper-interactive text classification by interactive supervision of document and term labels
Authors: Shantanu Godbole, Abhay Harpale, Sunita Sarawagi, Soumen Chakrabarti
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

We present the HIClass (Hyper Interactive text Classification) system, an interactive text classification system which combines the cognitive power of humans with the power of automated learners to make statistically sound classification decisions. HIClass is based on active learning principles and has aids for detailed analysis and fine tuning of text classifiers while exerting a low cognitive load on the user.
Application of Deterministic Low-Discrepancy Sequences in Global Optimization
Authors: Sergei Kucherenko, Yury Sytsko
Venue: Computational Optimization and Applications (2005)

It has been recognized through theory and practice that uniformly distributed deterministic sequences provide more accurate results than purely random sequences. A quasi Monte Carlo (QMC) variant of a multi level single linkage (MLSL) algorithm for global optimization is compared with an original stochastic MLSL algorithm for a number of test problems of various complexities. An emphasis is made on high dimensional problems. Two different low-discrepancy sequences (LDS) are used and their efficiency is analysed. It is shown that application of LDS can significantly increase the efficiency of MLSL. The dependence of the sample size required for locating global minima on the number of variables is examined. It is found that higher confidence in the obtained solution and possibly a reduction in the computational time can be achieved by the increase of the total sample size N. N should also be increased as the dimensionality of problems grows. For high dimensional problems clustering methods become inefficient. For such problems a multistart method can be more computationally expedient.
Silver bullet or fool's gold: supporting usability in open source software development
Authors: Michael Twidale
Venue: Proceedings of the 27th international conference on Software engineering (2005)

At first glance it can look like Open Source Software development violates many, if not all, of the precepts of decades of careful research and teaching in Software Engineering. One could take a classic SE textbook and compare the activities elaborated and advocated in the various chapters with what is actually done in plain sight in the public logs of an OSS project in say SourceForge. For a Professor of Software Engineering this might make for rather depressing reading. Are the principles of SE being rendered obsolete? Has OSS really discovered Brooks' Silver Bullet? Or is it just a flash in the pan or Fool's Gold.In this talk I will mainly look at one aspect of Open Source Development, the 'problem' of creating usable interfaces, particularly for non-technical end-users. Any approach involves the challenge of how to coordinate distributed collaborative interface analysis and design, given that in conventional software development this is usually done in small teams and almost always face to face. Indeed all the methods in any HCI text just assume same-time same-place work and don't map to distributed work, let alone the looser mechanisms of OSS development. Instead what is needed is a form of participatory usability involving the coordination of end users and developers in a constantly evolving redesign process.
A directed cycle-based column-and-cut generation method for capacitated survivable network design
Venue: Networks (2004)

A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here, we present a polyhedral approach for designing survivable networks. We describe a mixed-integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of a failure, flow is rerouted along the slacks reserved on directed cycles. We give strong valid inequalities that use the survivability requirements. We present a computational study with a column-and-cut generation algorithm for designing capacitated survivable networks. &copy; 2004 Wiley Periodicals, Inc.
Multicast cloud with integrated multicast and unicast content distribution routing
Authors: Dan Li, Arun Desai, Zheng Yang, Kenneth Mueller, Stephen Morris, Dmitry Stavisky
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

In this paper, we describe the concept and design of "application-layer multicast cloud," the first overlay network design that provides integrated content distribution routing between IP multicast and unicast via a user-configured group of multicast senders and receivers for content distribution across different layer-3 IP multicast groups, content distribution channels, and unicast distribution relay trees, that for the first time allows for application-layer (as opposed to layer-3 or layer-4) control of multicast security, failover, QoS, and bandwidth utilization. None of these were possible before and yet the need for such capabilities is great in Content Distribution Network (CDN) deployments.Note that here "multicast cloud" refers to an "application-layer" user configured entity with (1) a number of properties that govern the IP multicast flow and the interaction between multicast and unicast content distribution, and (2) a set of hosts that can participate in multicast content replication that happens on multiple layer-3 IP multicast groups and across multiple layer-3 IP multicast islands.
On Feeling Secure in an Unsafe World
Authors: Randy Harr
Venue: Queue (2005)

Security has always been a loaded word&mdash;all the more so since 9/11. Webster&rsquo;s defines it as &ldquo;freedom from fear, anxiety, danger, and doubt.&rdquo; Within Maslow&rsquo;s famous hierarchy of needs, meanwhile, we can find it just above our most basic physiological needs, such as food, water, and shelter. So it seems, no matter how you slice it, security comes down to some fundamental sense of well-being or safety. As we all know, that&rsquo;s no small feat in a world that is not particularly safe.
A New Scheduling Algorithm: Jumping Virtual Clock
Authors: Lain-Chyr Hwang, San-Yuan Wang, Steen J. Hsu, Yong-Hua Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The scheduling algorithm is useful in providing Quality of Service (QoS). In this paper, a new scheduling algorithm, Jumping Virtual Clock (JVC), is developed to has O(1) complexity of calculating virtual time.
Intelligent Fixture Design through a Hybrid System of Artificial Neural Network and Genetic Algorithm
Authors: Mohsen Hamedi
Venue: Artificial Intelligence Review (2005)

In designing fixtures for machining operations, clamping scheme is a complex and highly nonlinear problem that entails the frictional contact between the workpiece and the clamps. Such parameters as contact area, state of contact, clamping force, wear and damage in the contact area and deformation of the component are of special interest. A viable fixture plan must include the optimum values of clamping forces. Along research efforts carried out in this area, this comprehensive problem in fixture design needs further investigation. In this study, a hybrid learning system that uses nonlinear finite element analysis (FEA) with a supportive combination of artificial neural network (ANN) and genetic algorithm (GA) is discussed. A frictional model of workpart--fixture system under cutting and clamping forces is solved through FEA. Training and querying an ANN takes advantage of the results of FEA. The ANN is required to recognize a pattern between the clamping forces and state of contact in the workpiece--fixture system and the workpiece maximum elastic deformation. Using the identified pattern, a GA-based program determines the optimum values for clamping forces that do not cause excessive deformation/stress in the component. The advantage of this work against similar studies is manifestation of exact state of contact between clamp elements and workpart. The results contribute to automation of fixture design task and computer aided process planning (CAPP).
A Framework for Key Management in Mobile Ad Hoc Networks
Authors: George C. Hadjichristofi, William J. Adams, Nathaniel J. Davis IV
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Recently proposed key management systems (KMSs) provide limited functionality in highly partitioned mobile ad hoc networks. In this paper we present a framework for key management that provides redundancy and robustness for Security Association (SA) establishment between pairs of nodes in mobile ad hoc networks. Our KMS uses a modified hierarchical trust Public Key Infrastructure (PKI) model in which nodes can dynamically assume management roles. The system ensures high service availability for the network members through a number of schemes. A novel behavior grading mechanism provides security criteria for the network nodes and aids the management functions of the KMS to revoke or reissue certificates for nodes. This mechanism is based on the notion of trust, and more specifically on SAs among nodes in the entire network. In this paper we give an overview of the framework of the system and present a performance analysis of the system based on certificate issuance and acquisition. Finally, we compare our KMS with threshold cryptography schemes.
Parallel Hybrid Multi-Objective Island Model in Peer-to-Peer Environment
Authors: N. Melab, M. Mezmaz, E-G. Talbi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Solving large size and time-intensive combinatorial optimization problems with parallel hybrid multi-objective evolutionary algorithms (MO-EAs) requires a large amount of computational resources. Peer-to-Peer (P2P) computing is recently revealed as a powerful way to harness these resources and efficiently deal with such problems. In this paper, we focus on the parallel hybrid multi-objective island model for P2P systems. We address its design, implementation, and fault-tolerant deployment in a P2P context. The proposed model have been experimented on the Bi-criterion Permutation Flow-Shop Problem (BPFSP) on a network of 120 heterogeneous PCs. The preliminary results demonstrate the effectiveness of this model and its capabilities to fully exploit the hybridization.
Drama in the computer science classroom
Authors: James W. McGuffee
Venue: Journal of Computing Sciences in Colleges (2004)

This paper discusses the benefits of using participatory teaching methods in the computer science classroom. Specifically, the author describes the experience of using student led theatrical productions to teach the concepts of reliable data transfer in a computer networks course. This paper also provides computer science educators with information on how to use student led drama in their own classroom.
The software engineering of agent-based intelligent adaptive systems
Authors: Leon Sterling, Thomas Juan
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Future software systems will be intelligent and adaptive. They will have the ability to seamlessly integrate with smart applications that have not been explicitly designed to work together. Traditional software engineering approaches offer limited support for the development of intelligent systems. To handle the tremendous complexity and the new engineering challenges presented by intelligence, adaptiveness and seamless integration, developers need higher-level development constructs. Agent concepts are natural to describe intelligent adaptive systems. Agent-based technologies have been incorporating software engineering practices, and have matured to offer useful insights and concrete practices to mainstream software engineers.This tutorial presents the state of the art in agent development from a software engineering perspective, focusing on practices that are applicable today. We will walk the audience through analysis, design and verification of a portion of a real-world problem: a Smart Home Network. We show how agent concepts more naturally match the engineering challenges of such systems like trust between adaptive components. The audience will have hands-on experience with analyzing and designing parts of the Smart Home Network and learn how to incorporate agent technologies into their current projects.
Efficient computation of the discrete autocorrelation wavelet inner product matrix
Authors: Idris A. Eckley, Guy P. Nason
Venue: Statistics and Computing (2005)

Discrete autocorrelation (a.c.) wavelets have recently been applied in the statistical analysis of locally stationary time series for local spectral modelling and estimation. This article proposes a fast recursive construction of the inner product matrix of discrete a.c. wavelets which is required by the statistical analysis. The recursion connects neighbouring elements on diagonals of the inner product matrix using a two-scale property of the a.c. wavelets. The recursive method is an ¿(log (N)3) operation which compares favourably with the ¿(N log N) operations required by the brute force approach. We conclude by describing an efficient construction of the inner product matrix in the (separable) two-dimensional case.
Detecting multiple change-points in the mean of Gaussian process by model selection
Authors: E. Lebarbier
Venue: Signal Processing (2005)

This paper deals with the problem of detecting change-points in the mean of a signal corrupted by an additive Gaussian noise. The number of changes and their position are unknown. From a nonasymptotic point of view, we propose to estimate them with a method based on a penalized least-squares criterion. We choose the penalty function such that the resulting estimator minimizes the quadratic risk according to the results of Birgé and Massart. This penalty depends on unknown constants and we propose a calibration to obtain an automatic method. The performance of the method is assessed through simulation experiments. An application to real data is shown.
Evaluation of the Hybrid Multithreading Programming Model using Image Processing Transforms
Authors: Razali Jidin, David Andrews, Wesley Peck, Dan Chirpich, Kevin Stout, John Gauch
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Hybrid chips containing both CPU's and FPGA components promise the potential of providing a unified platform for seamless implementation of hardware and software co-designed components. Realizing the potential of these new hybrid chips requires new high level programming model capabilities that support a far more integrated view of the CPU and FPGA components than is achievable with current methods. The KU Hybrid Threads project has been investigating extending the familiar multithreaded programming model across this CPU/FPGA boundary to support both FPGA based hardware and CPU based software threads. Adopting this generalized multithreaded model can lead to programming productivity improvement, while at the same time providing the benefit of customized hardware from within a familiar software programming model. In this paper we present an application study of our hybrid multithreaded model. We have implemented several image-processing functions in both hardware and software, but from within the common multithreaded programming model on a XILINX V2P7 FPGA. This example demonstrates hardware and software threads executing concurrently using standard multithreaded synchronization primitives transforming real-time images captured by a camera and display it on a workstation.
To Unify Structured and Unstructured P2P Systems
Authors: Honghao Wang, Yingwu Zhu, Yiming Hu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Most of current peer-to-peer designs build their own system overlays independent of the physical one. Nodes within unstructured systems form a random overlay, on the contrary, structured designs normally organize peers into an elegant identifier ring. However, all of those overlays are far from the physical one. Noticed that the system overlay is crucial for building a distributed system, this paper proposes to build system overlays based on the physical overlay. By making full use of physical network characteristics and taking advantages of both structured and unstructured protocols, a network-based peerto-peer system is built in this paper. Not only the system is highly efficient (the stretch is equal to one), but also it can adapt extremely system churning. The most important is that the maintenance overhead is very low, even under highly dynamic environment.
Sequential consistency and the lazy caching algorithm
Authors: Rob Gerth
Venue: Distributed Computing (1999)

I introduce and discuss sequential consistency, a relaxed memory model, and define what it means for a protocol to implement sequential consistency. Then, I introduce the lazy caching protocol of Afek, Brown and Merrit [ABM93] and formalize it as a labeled transition system.
Current awareness on comparative and functional genomics: Current Awareness
Authors: Staff
Venue: Comparative and Functional Genomics (2004)

In order to keep subscribers up-to-date with the latest developments in their field, this current awareness service is provided by John Wiley & Sons and contains newly-published material on comparative and functional genomics. Each bibliography is divided into 16 sections. 1 Reviews & symposia; 2 General; 3 Large-scale sequencing and mapping; 4 Genome evolution; 5 Comparative genomics; 6 Gene families and regulons; 7 Pharmacogenomics; 8 Large-scale mutagenesis programmes; 9 Functional complementation; 10 Transcriptomics; 11 Proteomics; 12 Protein structural genomics; 13 Metabolomics; 14 Genomic approaches to development; 15 Technological advances; 16 Bioinformatics. Within each section, articles are listed in alphabetical order with respect to author. If, in the preceding period, no publications are located relevant to any one of these headings, that section will be omitted. 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
Peer-to-peer access control architecture using trusted computing technology
Authors: Ravi Sandhu, Xinwen Zhang
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

It has been recognized for some time that software alone does not provide an adequate foundation for building a high-assurance trusted platform. The emergence of industry-standard trusted computing technologies promises a revolution in this respect by providing roots of trust upon which secure applications can be developed. These technologies offer a particularly attractive platform for security in peer-to-peer environments. In this paper we propose a trusted computing architecture to enforce access control policies in such applications. Our architecture is based on an abstract layer of trusted hardware which can be constructed with emerging trusted computing technologies. A trusted reference monitor (TRM) is introduced beyond the trusted hardware. By monitoring and verifying the integrity and properties of running applications in a platform using the functions of trusted computing, the TRM can enforce various policies on behalf of object owners. We further extend this platform-based architecture to support user-based control policies, cooperating with existing services for user identity and attributes. This architecture and its refinements can be extended in future work to support general access control models such as lattice-based access control, role-based access control, and usage control.
Better Branch Prediction Through Prophet/Critic Hybrids
Authors: Ayose Falcon, Jared Stark, Alex Ramirez, Konrad Lai, Mateo Valero
Venue: IEEE Micro (2005)

The prophet/critic hybrid conditional branch predictor has two component predictors. The prophet uses a branch's history to predict its direction. We call this prediction and the ones for branches following it the branch future.The critic uses the branch's history and future to critique the prophet's prediction. The hybrid combines the prophet's prediction with the critique, either agree or disagree, forming the branch's overall prediction. Results show these hybrids can reduce mispredicts by 39 percent and improve processor performance by 7.8 percent.