ppxscal/embedding_network huggingface dataset:
Extending a Cluster SSI OS for Transparently Checkpointing Message-Passing Parallel Application
Authors: Matthieu Fertre, Christine Morin
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Nowadays, clusters are widely used to execute scientific applications. These applications are often messagepassing parallel applications with long execution times. Since the number of nodes in clusters is growing, faults are more frequent. Thus the application execution time may be greater than the mean time before failure (MTBF) of the cluster. To avoid restarting application from the beginning, it is desirable that cluster systems provide some fault tolerant mechanisms such as checkpoint/restart. An approach to implement efficiently this mechanism is to implement it directly in the application or in the communication library. Another approach is to implement it in an operating system dedicated to clusters. This is more complex but let you checkpoint/restart any message-passing application whatever the communication library. This paper presents basic mechanisms for system initiated checkpoint of message-passing parallel applications running on top of a cluster. Performance results obtained from a prototype implemented in KERRIGHED Single Sytem Image cluster Operating System based on LINUX are presented.
The design of a fast and flexible internet subscription system using content graphs
Authors: Joanna L. Kulik
Venue:  (2004)

This dissertation describes the design and evaluation of the Fast, Flexible Forwarding system (F3), a distributed system for disseminating information to networked subscribers. It examines existing subscription approaches, proposes F3 as an alternative to these approaches, and presents results from comparisons of F3 and other subscription approaches. Four studies compared performance of F3 and competing subscription systems. In the four studies, subscription systems handled such tasks as disseminating baseball scores, distributing traffic alerts, and disseminating generic subscriptions formatted as attribute-value pairs. The four studies examined system performance in both simulated network environments and on a working router. Performance characteristics examined in the studies included size of forwarding tables and processing speeds at routers. Results from these experiments showed that F3 does not overproduce messages, as do unicast systems. F3 also outperformed single-identifier multicast systems in such areas as message production, table size, and subscription overhead. The most significant finding of the studies, however, was that F3 processing speed surpassed the speed of a state-of-the-art content-based system by orders of magnitude in scenarios with large numbers of subscribers. Overall, these results suggest that F3 is a promising development in the area of Internet subscription systems. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) (Abstract shortened by UMI.)
Statistical analysis to evaluate generated distributions in simulation modeling to conserve computer time
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1972)

One of the pitfalls in simulation modeling is the modeler's assumption that the computer generated distributions to be used in the simulation run are sacrosanct. In many models subjected to simulation analysis, it is necessary for the modeler to 'create' various statistical distributions as part of the endogenous and/or expogenous data in the model - turn-around time in a time-sharing environment, rainfall distribution in a specific area, run times for student programs at a computer center. Two methods are usually used to develop these distributions. On the one hand, the modeler might have historic data (company records, experimenter observations) and he therefore can create an empircal distribution which he will use in simulating the model. On the other hand, the modeler might have to rely upon previous studies to estimate a possible distribution; for example, he might assume a Poisson distribution for the timing of machine breakdowns but has to make some estimate of &lambda;. 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
Probabilistic neural network playing and learning tic-tac-toe
Authors: Jiří Grim, Petr Somol, Pavel Pudil
Venue: Pattern Recognition Letters (2005)

A probabilistic neural network is applied as a tool to approximate the statistical evaluation function for a simple version of the game Tic-Tac-Toe. We solve the problem by a sequential estimation of the underlying discrete distribution mixture of product components.
Finite Volume Methods on Spheres and Spherical Centroidal Voronoi Meshes
Authors: Qiang Du, Lili Ju
Venue: SIAM Journal on Numerical Analysis (2005)

We study in this paper a finite volume approximation of linear convection-diffusion equations defined on a sphere using the spherical Voronoi meshes, in particular the spherical centroidal Voronoi meshes. The high quality of spherical centroidal Voronoi meshes is illustrated through both theoretical analysis and computational experiments. In particular, we show that the L2 error of the approximate solution is of quadratic order when the underlying mesh is given by a spherical centroidal Voronoi mesh. We also demonstrate numerically the high accuracy and the superconvergence of the approximate solutions.
Regression analysis for complex longitudinal survey data
Authors: Zhiying Pan
Venue:  (2005)

Sample survey is one of the most important methods to collect data about a finite population. Traditionally, surveys are carried out for descriptive purposes; that is, to estimate some measures, such as totals, means or ratios, for the target population. There is an increasing trend in analytic uses of surveys, which relates to making inference about the parameters of models used for analysis. Such stochastic models are often referred to as superpopulation models from which the finite population is a (conceptual) random sample. In this research, we develop inference procedures and model-checking techniques for a broad range of superpopulation models, including generalized linear models (GLIMs) for cross-sectional surveys and generalized linear mixed models (GLMMs) for longitudinal surveys. We propose a unified approach to superpopulation inference for GLIMs with cross-sectional surveys under minimum assumptions for models and sample designs. The derived variance estimators incorporate the total random variation from the finite-population generating process via a superpopulation model and the sample selection process via a complex sample design, and thereby allow one to make analytic inference about the original parameters in the superpopulation model. We provide parallel developments of inference procedures for GLMMs with longitudinal surveys. We develop graphical and numerical procedures for checking the adequacy of GLIMs with cross-section surveys and of GLMMs with longitudinal data in both non-survey and survey settings. Extensive simulation studies show that the proposed superpopulation inference procedures give correct inference, and that the proposed goodness-of-fit tests maintain their sizes near the nominal level and have good power to detect model misspecifications. Several medical studies are provided for illustrations.
Accurate Substrate Noise Analysis Based on Library Module Characterization
Authors: Subodh M. Reddy, Rajeev Murgai
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

As the design complexity increases, a detailed SPICE model cannot be used to study substrate noise injected by the digital logic into the analog circuit in a mixed-signal system. Hence a reduced yet accurate model is needed. Previous work [7] shows that the current drawn by the digital circuit from the power supply has a big impact on the substrate noise and therefore must be modeled accurately in the reduced model. In this paper, we propose an accurate current modeling technique based on pre-characterizing library modules for the current drawn from the power supply as a function of time, load capacitance, input transitions and slews. This technique is then embedded in both pattern-dependent (PDM) [3, 15] and pattern-independent (PIM) [7] substrate noise analysis methodologies. Results on several gate-level benchmarks show that the proposed scheme is, on average, within 4.5% of the detailed BSIM3-based model for PDM and within 12% for PIM. In contrast, the previously proposed scheme of [7] has an average discrepancy of 176% with the detailed model for PIM.
The Research on Real-Time Middleware for Open Architecture Controller
Authors: Dong Yu, Hu Lin, Ruifeng Guo, Jiangang Yang, Pengfei Xiao
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The Adoption of software platform is an effective method to resolve interoperability, portability, scalability and extensibility of Open Architecture Controller. However, there exist problems in now available proprietary software platforms for OAC. Considering the successful application of CORBA, this paper presents the RTCK, a real-time middleware for OAC based on real-time CORBA and minimum CORBA. By the analysis of the feature of RTLinux and structure of OAC, RTCK is composed of user space and real-time space. The user space adopts open source, TAO; while real-time space conform to minimum CORBA, which uses Leader/Followers concurrent model and TLSF dynamic memory allocation algorithm to guarantee the real-time performance. In order to ensure the predictability of RTCK, SFIOP protocol based on Mbuff and real-time FIFO is designed, whose effect is verified by a comparative experiment.
Mailbag
Authors: Ubiquity staff
Venue: Ubiquity (2005)

In his article 'Artificial and Biological Intelligence,' Subhash Kak of Louisiana State University asks if 'humans will eventually create silicon machines with minds that will slowly spread all over the world, and the entire universe will eventually become a conscious machine?' These are some comments on his paper.
Marco: A Middleware Architecture for Distributed Multimedia Collaboration
Authors: Chia-Yen Shih, Jie Hu, Jinhwan Lee, Raymond Klefstad, Doug. Tolbert
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

A distributed, real-time, collaborative visualization (DRCV) system for four dimensional datasets like fMRI images, can be a valuable tool to support scientific and medical research. Software applications supporting DRCV are lagging due to complex challenges, such as real-time rendering, coordinated, real-time navigation, dataset management, data location transparency, heterogeneous node management, data replication policies, and so on. In addition, people using DRCV tools are tightened to computing devices with specific configuration, which lower opportunities for remote visualization collaborations. We present a novel middleware to facilitate development of DRCV applications which guarantee high data availability and scalability in terns of collaborative groups and members, and are adaptable to computing devices with varying display capabilities We also show our prototype implementation of this middleware with performance measurements.
Improving the Data Transmission Throughput over the Home Electrical Wiring
Authors: Miguel Elias M. Campista, Luis Henrique M. K. Costa, Otto Carlos M. B. Duarte
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Powerline communications (PLC) are receiving special attention since they use an already available and ubiquitous infrastructure. The main standard for PLC home networks is HomePlug. This work improves the throughput of HomePlug by modifying the medium access control sub-layer. The key idea is to define a fast collision avoidance mechanism where every station that wants to access the medium increments its contention window after sensing another ongoing transmission. The proposal reduces the number of collisions in the network improving the achievable throughput. We compared our mechanism to the original HomePlug standard through simulation and mathematical analysis. We verified that the improvement is independent from the packet size, the transmission rate and the number of nodes when the network is high loaded.
A model of internal contextual factor relationships affecting technology implementations
Authors: Namchul Shin
Venue:  (2005)

As the debate regarding how to value the output of technology investments continues, there is also a growing interest in understanding what elements improve the probability of a successful technology implementation. The high cost and risk of implementing new technology projects reflects the economic expense, the cost of the human resources involved with the project and the reputational risk associated with a failed project. The stakes are high and business enterprises are anxious to understand the means to mitigate the risks of failure. The technical aspect of technology projects is only one element, or factor, among many which influence how well the implementation will convert the investment into value. The internal business environment consists of a complex relationship of factors such as the culture, experience, or management capabilities which impact the implementation's level of success or its degree of failure. Since these factors combine to form the environment, or context, of the business, they are referred to as contextual factors. Much of the research in IT is quantitative in nature and looks at individual factors in specific environments. This emphasis on the positivist approach leaves a question as to the overall context created by a group of factors and the relationship between individual factors. While factor research has provided a great deal of information, a gap in the research exists when it comes to a holistic view of the overall internal contextual factors and their relationships. Given that little historical research exists at a holistic level, the choice of research methodology for this dissertation needed to be one that will provide a basis for exploration in a qualitative approach. In addition to the exploratory nature of this research, the concept of contextual factors within an organization is well suited to methodologies that have been used to study social situations since an organization is elementally a social structure. Therefore focused ethnography was chosen as the method to explore a small-scope project. This dissertation aggregates previously identified internal contextual factors into a holistic perspective and develops a conceptual model of the relationships among those factors.
Adapting the Cognitive Walkthrough Method to Assess the Usability of a Knowledge Domain Visualization
Authors: Kenneth Allendoerfer, Serge Aluker, Gulshan Panjwani, Jason Proctor, David Sturtz, Mirjana Vukovic, Chaomei Chen
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

The usability of knowledge domain visualization (KDViz) tools can be assessed at several levels. Cognitive Walkthrough (CW) is a well-known usability inspection method that focuses on how easily users can learn software through exploration. Typical applications of CW follow structured tasks where user goals and action sequences that lead to achievement of the goals are welldefined. KDViz and other information visualization tools, however, are typically designed for users to explore data and user goals and actions are less well understood. In this paper, we describe how the traditional CW method may be adapted for assessing the usability of these systems. We apply the adapted version of CW to CiteSpace, a KDViz tool that uses bibliometric analyses to create visualizations of scientific literatures. We describe usability issues identified by the adapted CW and discuss how CiteSpace supported the completion of tasks, such as identifying research fronts, and the achievement of goals. Finally, we discuss improvements to the adapted CW and issues to be addressed before applying it to a wider range of KDViz tools.
Trends in Access Networks and their Implementation in DSLAMs
Authors: Christian Sauer, Matthias Gries, Soren Sonntag, Dietmar Tolle, Bo Wu, Rudi Knorr
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

We identify deployment trends and primary tasks a future DSL Access Multiplexer (DSLAM) has to offer. We reveal two corner cases: IP-based (high-end) versus Ethernetbased (cost-optimized) access networks. We derive the need for flexible hardware platforms to support fast customization and adaptation to new protocol standards. To accomplish efficiency and ease-of-use we employ programmable multiprocessor platforms and use our tool flow CRACC that takes a modular application description and generates code for various embedded processors.
Enhancing GSS-based Requirements Negotiation with Distributed and Mobile Tools
Authors: Norbert Seyff, Christoph Hoyer, Erich Kroiher, Paul Grunbacher
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Conventional team processes in software engineering are typically designed to support face-toface interactions among stakeholders. This paradigm has changed and distributed software development (DSE) becomes a dominant approach in many settings. Despite the fact that distributed software engineering is inevitable in today's software engineering practice there are still many unsolved issues. This paper reports our research in distributed and mobile requirement negotiation. We describe the EasyWinWin (EWW) negotiation approach and identify issues in face-to-face negotiations and discuss how we aim to overcome these with distributed and mobile tools. We also report the results of an empirical exploration study examining the usability of our tools.
Preemptive RANSAC for live structure and motion estimation
Authors: David Nistér
Venue: Machine Vision and Applications (2005)

A system capable of performing robust live ego-motion estimation for perspective cameras is presented. The system is powered by random sample consensus with preemptive scoring of the motion hypotheses. A general statement of the problem of efficient preemptive scoring is given. Then a theoretical investigation of preemptive scoring under a simple inlier&#x2013;outlier model is performed. A practical preemption scheme is proposed and it is shown that the preemption is powerful enough to enable robust live structure and motion estimation.
Semi-supervised learning with an imperfect supervisor
Authors: R. Amini, Patrick Gallinari
Venue: Knowledge and Information Systems (2005)

Real-life applications may involve huge data sets with misclassified or partially classified training data. Semi-supervised learning and learning in the presence of label noise have recently emerged as new paradigms in the machine learning community to cope with this kind of problems. This paper describes a new discriminant algorithm for semi-supervised learning. This algorithm optimizes the classification maximum likelihood (CML) of a set of labeled&#x2013;unlabeled data, using a discriminant extension of the Classification Expectation Maximization algorithm. We further propose to extend this algorithm by modeling imperfections in the estimated class labels for unlabeled data. The parameters of this label-error model are learned together with the semi-supervised classifier parameters. We demonstrate the effectiveness of the approach using extensive experiments on different datasets.
Study on Rounding Errors of INTMDCT in Perceptual Audio Coding
Authors: Te Li, Rongshan Yu, SooNgee Koh
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

With the proliferation of broadband access and continuous decline of storage prize per gigabyte, there has been an increasing demand of audio solution that provides high sampling rate and high resolution. Lossless audio is undoubtedly the ultimate solution. In response to this demand, MPEG issued a call for proposal soliciting technology contributions that provides a state-of-art solution. At the technology end, lossless compression requires the usage of integer transform. The Integer Modified Discrete Cosine Transform (IntMDCT) has been adopted in MPEG-4 Scalable to Lossless (SLS) coding to enable this efficient lossless operation. Because of rounding operations, rounding errors introduced by IntMDCT exist during the whole coding process. With the SLS having capability of using operations that spreads over the bitrate spectrum which ranges from lossy to lossless, it is of interest to study the effect of rounding errors in IntMDCT for operation of SLS in lossy mode. This paper analyzes the contributions of noise due to these errors. It is found that the noise introduced by rounding operations of IntMDCT does not affect the perceptual quality of the coded audio under any circumstances. As such, it concludes that the MDCT and IntMDCT filterbanks are interchangeable at lossy bitrate. With the fact that SLS uses both MDCT and IntMDCT, the finding in this paper suggests the possibility of using only IntMDCT filterbank.
Adaptive MLSE Equalizer with Per-Survivor QR Decomposition for Trellis-Coded MIMO Transmission
Authors: Toshiaki Koike, Hidekazu Murata, Susumu Yoshida
Venue: Wireless Personal Communications: An International Journal (2005)

A trellis-coded multiple-input multiple-output (MIMO) transmission technique, which exploits multiple-antenna elements at both transmitter and receiver sides and employs trellis-coded modulations (TCMs), has potential to significantly increase spectral efficiency in wireless communications. At the receiver, an adaptive equalizer based on maximum-likelihood sequence estimation (MLSE) deals with intersymbol interference (ISI) incurred in wideband transmissions and jointly decodes multiplexed TCM signals. Recently, a sphere-constrained maximum-likelihood detection, so-called sphere decoding, has drawn much attention for reducing the computational burden in MIMO transmission systems. This paper describes the super-trellis structured Viterbi algorithm applying per-survivor sphere decoding, and evaluates the effect of the complexity reduction in branch metric computations.
Simulation abstracts from the Computer Science conference 1973
Venue: ACM SIGSIM Simulation Digest (1973)

The Computer Science Conference was held at Neil House in Columbus, Ohio, February 20 - 22, 1973 under the chairmanship of Dr. Marshall C. Yovits. The major objective of the Conference was to provide a forum for current research in all areas of the computer and information sciences. Your editor attended this Conference, which preceeded a two-day meeting by SIGCSE. 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