ppxscal/embedding_network huggingface dataset:
Systemstarter and the Mac OS X startup process
Authors: Wilfredo Sánchez, Kevin Van Vechten
Venue: Proceedings of the BSD Conference 2002 on BSD Conference (2002)

This paper documents a program in Mac OS X called SystemStarter. SystemStarter brings the system from its initial state up to a state where basic services are running and a user may log in. It replaces the previous /etc/rc startup sequence employed by Mac OS X's predecessors in order to address some additional goals set forth by the Mac OS X project. SystemStarter is part of the BSD subsystem in Mac OS X, now known as Darwin, though it's creation predates Darwin as an open source project; it was therefore created by a single author, though it now enjoys several contributors.
Shotgun optical mapping: a comprehensive statistical and computational analysis
Authors: Michael Waterman
Venue:  (2006)

Shotgun Optical Mapping is a whole-genome high-throughput restriction mapping technology in which restriction maps of single DNA molecules are collected using high-magnification digital microscopy. Optical Mapping has a wide spectrum of genomic applications and thus is important subject for analysis. This thesis concerns statistical and computational aspects of Optical Mapping data. Specifically, we address optical map alignments, whole-genome de novo assembly of optical maps, and application to analysis of genomic differences. We start by statistical modelling of Optical Mapping measurements, and validate that our models provide accurate fit to real data. The measurement distributions are then used to derive a probabilistic alignment score which we use to calculate optical-to-optical map alignments and optical-to-reference map alignments. The advantage of our approach is that it guarantees the maximal discrimination between the spurious and true alignments and also does not require ad hoc choice for the scoring parameters. Then, we present an efficient method for the whole-genome assembly of optical maps that allows to produce accurate restriction maps of the relevant genomes in feasible time. Our assembly method follows Overlap-Layout-Consensus approach that was demonstrated to be very effective in sequence assembly problems. We also present a special error correction method that we use to eliminate spurious overlaps and chimeric maps. Application of our assembler to several optical map datasets demonstrates that it is capable to handle mammalian-sized genomes and yield accurate restriction maps provided sufficient genomic coverage. We also demonstrate how Optical Mapping data can be used for identification of certain class of differences between genomes, specifically, insertions and deletions exceeding 5000 base pairs, and restriction fragment length polymorphisms. We develop statistical framework for analysis of these differences based on hypothesis testing approach and demonstrate how the differences can be assessed statistically.
Piecewise Volterra filters based on the threshold decomposition operator
Authors: E. A. Heredia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We report our results concerning the study of multivariate functions of threshold-decomposed signals. In particular we show that multilinear tensor forms of the decomposed signal yield a class of filters that we propose to call piecewise Volterra filters (PWV). A filter can be viewed as a transformation of /spl Rscr//sup N//spl rarr//spl Rscr/, where N is the number of filter taps. PWV filters partition /spl Rscr//sup N/ using a hyper-rectangular lattice, and assign a Volterra filter to each of the partition regions. At the partition boundaries continuity between the multivariate polynomials is preserved resulting in class /spl Cscr//sup 0/ piecewise polynomials. PWV filters constitute an efficient alternative for describing some systems rich in hard nonlinear structures, especially since parameter estimation remains a linear problem for PWVs.
Voronoi Diagrams in CGAL, the Computational Geometry Algorithms Library
Authors: Andreas Fabri
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

CGAL, the Computational Geometry Algorithms Library, is a C++ library of geometric algorithms and data structures which is developed in the framework of the CGAL open source project. This talk gives an overview on the various types of Voronoi diagrams which are in the CGAL library or under developement.
Providing High Data Availability in MedioGRID
Authors: Adrian Colesa, Iosif Ignat, Radu Opris
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

High data availability is an important requirement for any data provider system. Replication is the main approach used to improve data availability, which is an inherent method for any distributed infrastructure including Grids. The Globus Toolkit provides specialized tools and services for data replication in Grid, though it is not so simple to know how to deploy, configure and make them work efficiently together in order to obtain the desired level of data availability. Based on our experiments with these tools, we designed an architecture of a data replication management system for the MedioGrid project[10]. Our solution automates the replication process between data storage nodes in the system. We implemented and tested a prototype of our architecture.
Acquisition of manipulation skills from a haptic rendered virtual environment
Authors: Y. Chen, F. Naghdy
Venue: Integrated Computer-Aided Engineering (2004)

A new paradigm for programming a robotics manipulator is developed. It is intended that the teaching of the machine will begin with the necessary skills being demonstrated by the human operator in a virtual environment with tactile sensing (haptics). Position, and contact force and torque data generated in the virtual environment combined with a priori knowledge about the task are used to identify and learn the skills in the newly demonstrated tasks and then to reproduce them in the robotics system. The peg-in-hole insertion problem is used as a case study. The overall concept is described. The methodologies developed to build the virtual environment and to learn the basic skills are explained. The results obtained so far are presented.
Mobile domain name system: an alternative for mobile IP
Authors: Huey-Ing Liu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

/sup M/obile Internet introduced mobility to IP protocol, allowing mobile user to stay in connection with Internet without changing IP address while roaming. In this paper, a mobile domain name system (MDNS) is proposed to provide IP mobility for mobile user. Through bringing virtual domain concept to current domain name service, Mobile Internet is easily realized. Since the traditional IP address contains location information, to provide portability for fixed IP address is difficult. Besides, IP address has no personal significance, thus, we recommend a portable personal domain name instead of an IP address for each Internet user. A symbolic name is more meaningful and convenient for human. Furthermore, the issue of IP address starvation could be simply eased via this personal domain name. Through integrating with current domain name system (DNS), the portable domain name could be dynamically resolved to the current location (i.e.. current IP address) of the corresponding mobile user. No extra agent or additional IP address is required for MDNS system. MDNS is based on current DNS system, thus massive hardware installation cost is reduced.
Improving Transparent Adaptability in Web Service Composition
Authors: Fernando Antonio Aires Lins, Jose Carlos dos Santos Junior, Nelson Souto Rosa
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Web services have played an important role in the development of distributed systems. In particular, the possibility of composing already implemented web services in order to provide a new functionality is an interesting approach for building distributed applications and business processes. The possibility of dynamically composing web services is also apparent. Current approaches address to this point, but they do not adopt established specifications, like WS-BPEL, as they usually propose modifications in the rules of business process specifications by imposing more difficulties to implement the system. This paper proposes a new approach for improving policy-driven web service adaptability through a semantics modification in the invocation primitive, whilst it keeps the syntax unaffected. Hence, programmers may define dynamic web service compositions without changing the source code. The approach was applied to a loan approval system in order to ilustrate it.
Advanced networking services for distributed multimedia streaming applications
Authors: Ada Gavrilovska, Sanjay Kumar, Srikanth Sundaragopalan, Karsten Schwan
Venue: Multimedia Tools and Applications (2007)

Increased network speeds coupled with new services delivered via the Internet have increased the demand for intelligence and flexibility in network systems. This paper argues that both can be provided by new hardware platforms comprised of heterogeneous multi-core systems with specialized communication support. We present and evaluate an experimental network service platform that uses an emergent class of devices--network processors--as its communication support, coupled via a dedicated interconnect to a host processor acting as a computational core. A software infrastructure spanning both enables the dynamic creation of application-specific services on the network processor, mediated by middleware and controlled by kernel-level communication support. Experimental evaluations use a Pentium IV-based computational core coupled with an IXP 2400 network processor. The sample application services run on both include an image manipulation application and application-level multicasting.
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Authors: Hui Li
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Experimental performance studies on computer systems, including Grids, require deep understandings on their work- load characteristics. The need arises from two important and closely related topics in performance evaluation, namely, workload modeling and performance prediction. Both top- ics rely heavily on the representative workload data and have their arsenal from statistics and machine learning. Neverthe- less, their goals and the nature of research differ considerably. Workload modeling aims at building mathematical models to generate workloads that can be used in simulation-based per- formance evaluation studies. It should statistically resem- ble the original real-world data therefore marginal statis- tics and second-order properties such as autocorrelation and power spectrum are important matching criteria. Perfor- mance prediction, on the other hand, intends to provide real- time forecast of important performance metrics (such as ap- plication run time and queue wait time) which can support Grid scheduling decisions. From this perspective prediction accuracy as well as performance should be considered to evaluate candidate techniques. My PhD research focuses primarily on these two topics in space-shared, data-intensive Grid environments. Starting from a comprehensive workload analysis with emphasis on the correlation structures and the scaling behavior, several basic job arrival patterns such as pseudo-periodicity and long range dependence are identified. Models are further proposed to capture these important arrival patterns and a complete workload model including run time is being investigated. The strong autocorrelations present in run time and queue wait time series inspire the research for performance prediction based on learning from historical data. Techniques based on a Instance Based Learning algorithm and several improvements are proposed and empirically evaluated. Research plans are proposed to use the results of workload modeling and perfor- mance prediction in the evaluation of scheduling strategies in data-intensive Grid environments.
Wreath products for image processing
Authors: J. R. Boston
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We present a wreath product approach for matched filtering to detect rotated copies of a template in an image. We view the image as a homogeneous space for a wreath product, a noncommutative symmetry group. The corresponding Fourier analysis has a natural multiresolution structure and accompanying efficient algorithm which we explain and illustrate with an example. The associated matched filter is a new example of the use of a noncommutative convolution for image processing. Numerical experiments are described in which this noncommutative approach outperforms standard Fourier-based methods.
Tura&acute;n&rsquo;s Theorem in the Hypercube
Authors: Noga Alon, Anja Krech, Tibor Szabo´
Venue: SIAM Journal on Discrete Mathematics (2007)

We are motivated by the analogue of Tura&acute;n&rsquo;s theorem in the hypercube $Q_n$: How many edges can a $Q_d$-free subgraph of $Q_n$ have? We study this question through its Ramsey-type variant and obtain asymptotic results. We show that for every odd $d$ it is possible to color the edges of $Q_n$ with $\frac{(d+1)^2}{4}$ colors such that each subcube $Q_d$ is polychromatic, that is, contains an edge of each color. The number of colors is tight up to a constant factor, as it turns out that a similar coloring with ${d+1\choose 2} +1$ colors is not possible. The corresponding question for vertices is also considered. It is not possible to color the vertices of $Q_n$ with $d+2$ colors such that any $Q_d$ is polychromatic, but there is a simple $d+1$ coloring with this property. A relationship to anti-Ramsey colorings is also discussed. We discover much less about the Tura&acute;n-type question which motivated our investigations. Numerous problems and conjectures are raised.
A Parallel Decoder for Lossless Image Compression by Block Matching
Authors: Luigi Cinque, Sergio De Agostino
Venue: Proceedings of the 2007 Data Compression Conference (2007)

A work-optimal O(log n logM) time PRAM-EREW algorithm for lossless image compression by block matching was shown in [1], where n is the size of the image and M is the maximum size of the match. The design of a parallel decoder was left as an open problem. By slightly modifying the parallel encoder, in this paper we show how to implement the decoder in O(log n logM) time with O(n/ log n) processors on the PRAM-EREW. With the realistic assumption that the size of the compressed image is O(n^1/2), the parallel decoder requires O(log2 n) time and O(n/ log n) processors on the mesh of trees.
Improving an introductory course on digital logic
Authors: M. D. Takach, A. T. Moser
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Our department has systematically revised and improved the computer engineering component of our curriculum. This effort included the improvement of our sophomore level course on digital logic. The introductory course on digital logic was improved with hardware and software projects. Hardware projects consist of take home experiments while software projects entail the use of LogicWorks for circuit simulation and OrCAD for programming PLDs. We discuss these projects in detail.
Institutionalizing large scale change
Authors: T. M. Regan
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The ECSEL Coalition of Seven Engineering Schools is sponsored by the National Science Foundation and has as a primary mission the integration of engineering design into the curriculum. We emphasize beginning in the first year with the first course that introduces engineering. The schools are Howard University, MIT: Morgan State University, Penn State University, City College of New York, University of Washington and the University of Maryland. The ECSEL approach to freshman engineering education features new curricular materials and teaching methods and has as its objectives the following: (1) to introduce students to engineering as a discipline and as a process; (2) to introduce engineering skills, including critical thinking, negotiating, engineering graphics, and societal context; (3) to reinforce general skills such as writing and oral presentations; (4) to familiarize students with the teamwork necessary to complete most engineering tasks successfully; (5) to introduce engineering software tools such as word processing, engineering graphics (CAD), and spreadsheet calculations; and (6) to relate subsequent engineering science courses to engineering design. Students complete one or more product realization cycle(s) in a semester. They work in teams and design, manufacture and test an engineering product.
Workshop on Dependable Application Support for Self-Organizing Networks (DASSON 2007)
Authors: Paul Ezhilchelvan, Michel Raynal, Ajoy Datta
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

This report gives an overview of the workshop on ""Dependable Application Support for Self-Organising Networks" held in conjunction with DSN 2007. The principal objective of the workshop is to facilitate a forum for researchers to explore, examine and address dependability related challenges in hosting distributed applications in self-organised networks such as MANETs, sensor and P2P networks.
Properties of a hand-printed Chinese character recognizer based on contextual vector quantization
Authors: Ping-Chong Chee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A hand-printed Chinese character recognizer based on contextual vector quantization (CVQ) has been built previously. In this paper, several properties of the recognizer are discussed. The recognition of 4516 Chinese characters has a successful rate of 91.0%. The output of the recognizer is passed to a language model which when applied to recognize a passage of about 1200 characters raises the rate from 91.5% to 97.5%.
Phantom: an interpreted language for distributed programming
Authors: Antony Courtney
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

The emerging trend in writing distributed applications is to use an object-based RPC system with a statically compiled, object-oriented language. While such a programming environment is adequate for many tasks, object-based RPC systems and statically compiled languages also have certain intrinsic limitations. These limitations become significant when writing applications which are both distributed and interactive (e.g. network information browsers, distributed conferencing systems and collaborative work tools). This paper discusses these limitations, and presents the design of Phantom, a new intepreted language for distributed programming. Phantom provides many features found in object-based RPC systems and statically compiled languages, including automatic marshalling, transparent remote procedure call, secure authentication and concurrency support. In addition to these traditional features, Phantom's interpreted nature permits the use of certain programming techniques, such as true object migration, remote evaluation, and dynamic extensibility, which are of increasing importance for distributed programming, but which are not available in statically compiled languages and RPC systems. The integration of these features in a single, coherent programming language makes whole new classes of distributed, interactive applications possible.
Decision making in fuzzy discrete event systems
Authors: F. Lin, H. Ying, R. D. MacArthur, J. A. Cohn, D. Barth-Jones, L. R. Crane
Venue: Information Sciences: an International Journal (2007)

The primary goal of the study presented in this paper is to develop a novel and comprehensive approach to decision making using fuzzy discrete event systems (FDES) and to apply such an approach to real-world problems. At the theoretical front, we develop a new control architecture of FDES as a way of decision making, which includes a FDES decision model, a fuzzy objective generator for generating optimal control objectives, and a control scheme using both disablement and enforcement. We develop an online approach to dealing with the optimal control problem efficiently. As an application, we apply the approach to HIV/AIDS treatment planning, a technical challenge since AIDS is one of the most complex diseases to treat. We build a FDES decision model for HIV/AIDS treatment based on expert's knowledge, treatment guidelines, clinic trials, patient database statistics, and other available information. Our preliminary retrospective evaluation shows that the approach is capable of generating optimal control objectives for real patients in our AIDS clinic database and is able to apply our online approach to deciding an optimal treatment regimen for each patient. In the process, we have developed methods to resolve the following two new theoretical issues that have not been addressed in the literature: (1) the optimal control problem has state dependent performance index and hence it is not monotonic, (2) the state space of a FDES is infinite.
On analytic signals with nonnegative instantaneous frequencies
Authors: Xiang-Gen Xia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper, we characterize all analytic signals with band-limited amplitudes and polynomial phases. We show that a signal with band-limited amplitude and polynomial phase is analytic if and only if it has nonnegative constant instantaneous frequency, i.e., the derivative of the phase is a nonnegative constant, and the constant is greater than or equal to the minimum bandwidth of the amplitude.
A Framework to Support QoS for Multimedia Applications in IEEE 802.11 Wireless LAN
Authors: Andrea Palmieri, Francesco Sigona
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Wireless networks are becoming increasingly popular in professional environments as well as in the home. The success of IEEE 802.11 has cut down equipment costs and people are now building their own residential wireless networks, connecting PCs, MP3 players, broadband gateways and Hi-Fi systems. However, such dramatic growth is creating problems in crowded areas, as the Wi-Fi bandwidth is limited and interference effects start to limit the technology usability. This paper describes a framework for managing the quality of the overall home wireless network, so that interference or bulk noise effects can be alleviated allowing users to enjoy digital content with the reliability they expect. By means of Universal Plug "n Play, events that may deteriorate the quality of existing services can be propagated to all interested devices so that a smart allocation of network resources can be applied. A simple Admission Control scheme is also used to regulate the admission of real-time streams.