ppxscal/embedding_network huggingface dataset:
Exception Handling in CLU
Authors: B. H. Liskov
Venue: IEEE Transactions on Software Engineering (1979)

For programs to be reliable and fault tolerant, each program module must be defined to behave reasonably under a wide variety of circumstances. An exception handling mechanism supports the construction of such modules. This paper descnbes an exception handling mechanism developed as part of the CLU programming language. The CLU mechanism is based on a simple model of exception handling that leads to well-structured programs. It is engineered for ease of use and enhanced program readability. This paper discusses the various models of exception handUlng, the syntax and semantics of the CLU mechanism, and methods of implementing the mechanism and integrating it in debugging and production environments.
Faster than Smoke? More Blinding than Mirrors?
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

Version 3.0 of the cable television industry's data transport standard, Data over Cable Service Interface Specifications (DOCSIS), might speed the time to download anything from a text file to a movie to 160 megabits per second. Even if the technology's theoretical maximum speed isn't commercially realistic, its demonstration at the May 2007 annual Cable Show in Las Vegas has network strategists and analysts wondering how users and competitors will react.
A Coarse-Grained Pessimistic Message Logging Scheme for Improving Rollback Recovery Efficiency
Authors: Jin-Min Yang, Kin Fun Li, Da-Fang Zhang, Jing Cheng
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

As a common technology for fault tolerance and load balance, rollback-recovery faces the challenges of scalability and inherent variability in those long-running large-scale applications with grids as the computing infrastructure. Among the rollback recovery schemes, pessimistic message logging protocols (PMLPs) and coordinated checkpointing protocols (CCPs) are the most popular in practice. Although PMLPs are good in scalability, their fault-free overhead sometimes is prohibitive. CCPs introduce relatively lower overhead, but they are poor in scalability. This work employs partition strategy and introduces the concept of pessimism grain to rollback recovery, striking a balance between good scalability and acceptable overhead. For a partitioned system, a coarse-grained pessimistic message-logging protocol is proposed to achieve scalability and asynchrony both in fault-free execution and in fault recovery. The impact of pessimism grain on the performance is evaluated theoretically. Experimental results show that the pessimism grain is one of the key configuration parameters to reach a desired performance level.
Architecture of a SCORM-Compliant Assessment Authoring Tool
Authors: Kiran Parmar, Rachid Anane, Robert J. Hendley
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Compliance with standards is often put forward as a fundamental requirement for the widespread adoption of e-learning frameworks. Among the advantages that accrue from the conformance to standards interoperability and reuse have acquired special significance. This paper is concerned with the presentation of a SCORM-compliant assessmentauthoring tool. The tool is designed and implemented as a stand-alone system, which can be integrated into a SCORM-compliant learning management system as a plug-in. A layered approach to system design was adopted as a way of satisfying a hierarchy of requirements. Convenience and usability in creating assessment content are enhanced by hiding the complexity of the underlying system, making transparent the conformance to e-learning standards and minimising user interaction. The system is put into perspective through a comparison with the QTI approach to assessment creation.
A method for multiple attribute decision making with incomplete weight information in linguistic setting
Authors: Zeshui Xu
Venue: Knowledge-Based Systems (2007)

The aim of this paper is to investigate the multiple attribute decision making problems with linguistic information, in which the information about attribute weights is incompletely known, and the attribute values take the form of linguistic variables. We first introduce some approaches to obtaining the weight information of attributes, and then establish an optimization model based on the ideal point of attribute values, by which the attribute weights can be determined. For the special situations where the information about attribute weights is completely unknown, we establish another optimization model. By solving this model, we get a simple and exact formula, which can be used to determine the attribute weights. We utilize the numerical weighting linguistic average (NWLA) operator to aggregate the linguistic variables corresponding to each alternative, and then rank the alternatives by means of the aggregated linguistic information. Finally, the developed method is applied to the ranking and selection of propulsion/manoeuvring system of a double-ended passenger ferry.
A Novel Story Unit Segmentation Algorithm Avoiding Voice Cutting
Authors: Longchuan Yan, Jun Du, Qingming Huang, Shuqiang Jiang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Automatic story unit segmentation is an essential technique for content based video retrieval and summarization. A good video story unit has natural boundary in visual and acoustic perception, respectively. For audio boundary, voice cutting problem affects acoustic perception of story unit. In this paper, a novel story unit segmentation algorithm is proposed to avoid the voice cutting problem. The algorithm combines replay detection, view pattern matching and non-speech detection to segment story units. Firstly, a replay detection method is implemented to find highlight events in soccer video. Secondly, based on positions of replay clips, a Fine State Machine (FSM) is used to obtain rough starting points of story units. Finally, audio boundary alignment is employed to locate natural audio boundaries for acoustic perception. The algorithm is tested on several broadcast soccer videos and the story units segmented by algorithms with and without audio alignment are compared in acoustic perception. The experimental results indicate the proposed algorithm can improve the acoustic perception of story unit by reducing the voice cutting problem.
Synthesis of Asynchronous Machines Using Mixed-Operation Mode
Authors: O. Yenersoy
Venue: IEEE Transactions on Computers (1979)

In this correspondence, we have introduced the concept of mixed-operation mode (MOM) in asynchronous sequential machines.
Quality of Service of Grid Computing: Resource Sharing
Authors: Xian-He Sun, Ming Wu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Rapid advancement of communication technology has changed the landscape of computing. New models of computing, such as business-on-demand, Web services, peer-to-peer networks, and Grid computing have emerged to harness distributed computing and network resources to provide powerful services. The non-deterministic characteristic of the resource availability in these new computing platforms raises an outstanding challenge: how to support Quality of Service (QoS) to meet a user's demand? In this study, we conduct a thorough study of QoS of distributed computing, especially on Grid computing where the requirement of distributed sharing and coordination goes to the extreme. We start at QoS policies, and then focus on technical issues of the enforcement of the policies and performance optimization under each policy. This study provides a classification of existing software system based on their underlying policies, a systematic understanding of QoS, and a framework for QoS of Grid computing.
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Venue: Data Warehousing and OLAP (2007)

It is our great pleasure to welcome you at the 10th ACM International Workshop on Data Warehousing and OLAP -- DOLAP'07. Continuing the tradition of previous successful DOLAP workshops, the DOLAP 2007 workshop provides an international forum where both researchers and practitioners in the field of Data Warehousing and OLAP can share their findings in theoretical foundations, current methodologies, and practical experiences. The mission of DOLAP is to explore novel research directions and emerging application domains in the areas of data warehousing and OLAP. Although, research in data warehousing and OLAP has produced important technologies for the design, management and use of information systems for decision support, there are still problems and research opportunities in the area. Much of the interest and success in this area can be attributed to the need for software and tools to improve data management and analysis given the large amounts of information that are being accumulated in corporate as well as scientific databases. Nevertheless, the high maturity of these technologies as well as new data needs or applications not only demand more capacity or storing necessities, but also new methods, models, techniques or architectures to satisfy these new needs. Some of the hot topics in data warehouse research include distributed data warehouses, web warehouses, data streams, realtime DWs, GIS/location-based services, and biomedical data. Moreover, there are other aspects developed in other software areas such as security/privacy or quality, which still remain unexplored by current design methods or technologies for data warehouses. The call for papers attracted 28 submissions from Asia, Canada, Europe, and the United States. The program committee accepted 12 papers that can be thematically grouped into data warehouse design, physical data organization, data warehouse processing, and spatio-temporal data warehouses and data mining. The papers in the area of data warehouse design presents novel methods for (semi-)automatic design of DWs and for estimating the size of materialized views. The papers on physical data organization provide new insights into MOLAP storage, probabilistic data management, and bitmap indexing. The papers on data warehouse processing address ETL workflows, real-time DW environments, and the efficient computation of materialized view subsets. Finally, the papers on spatio-temporal data warehouses and data mining expand into new territory by presenting a novel multidimensional model for dynamic spatio-temporal data, a GIS-OLAP system implementation, and a method for discovering unexpected multidimensional sequential rules. Finally, since DOLAP is the premier venue for data warehouse and OLAP research, the program includes a research challenges vision, in the form of a panel with research challenge proposals by four researchers and practitioners.
Research Results in Dynamic Taxonomy and Faceted Search Systems
Authors: Giovanni Maria Sacco
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Metadata access to complex information bases through multidimensional dynamic taxonomies (aka faceted search) is rapidly becoming a hot topic both in research and in industry, where e-commerce applications based on this access paradigm are becoming pervasive. The dynamic taxonomy model was the first model to fully exploit multidimensional classification schemes and to integrate query and exploration into a single visual framework. We review a number of research results in data modeling, implementation, user interaction and emerging application areas of dynamic taxonomies and faceted search, originating from the Department of Informatics, University of Torino.
Emotional states control for on-line game avatars
Authors: Ce Zhan, Wanqing Li, Farzad Safaei, Philip Ogunbona
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Although detailed animation has already been achieved in a number of Multi-player On-line Games (MOGs), players have to use text commands to control emotional states of avatars. Some systems have been proposed to implement a real-time automatic system facial expression recognition of players. Such systems can then be used to control avatars emotional states by driving the MOG's "animation engine" instead of text commands. Some of the challenges of such systems is the ability to detect and recognize facial components from low spatial resolution face images. In this paper a system based on an improved face detection method of Viola and Jones is proposed to serve the MOGs better. In addition a robust coarse-to-fine facial landmark localization method is proposed. The proposed system is evaluated by testing it on a database different from the training database and achieved 83% recognition rate for 4 emotional state expressions. The system is able to operate over a wider range of distance from user to camera.
Digital Image Stabilization Based on Log-Polar Transform
Authors: Fei Yuan, Hong Zhang, Ruiming Jia
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper we present a novel log-polar transform based digital image stabilization algorithm to estimate large global transformations among consecutive frames. In our proposed algorithm, multi-resolution log-polar transform techniques in spatial domain are introduced as an initial motion estimation module to estimate arbitrary rotations, arbitrary translations and moderate scale changes. Then, a gradient-based nonlinear least squares optimization module is used to achieve sub-pixel accuracy. The experimental results show that the proposed algorithm can stabilize 15 frames per second in 320×240 image sequences with large interframe motions on a 3.0-GHZ Pentium 4 machine .
Communication Architecture Synthesis of Cascaded Bus Matrix
Authors: Junhee Yoo, Dongwook Lee
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

For high frequency on-chip communication architecture design, we propose cascaded bus matrix-based solutions. Due to the huge design space in cascaded bus matrix design, it is crucial to perform an efficient design space exploration. In our work, we present a simulated annealing-based design space exploration method. For an efficient representation of bus topology, we propose an encoding method called traffic group encoding and apply it to AMBA3 AXI-based bus system design. In addition, we propose a method of two-step simulated annealing to improve the quality of results. Experimental results show that the proposed methods allow designing complex communication architectures (ones with up to 31 masters and 71 slaves) with high frequency constraints to which existing methods could not give solutions.
Conflict-avoiding codes and cyclic triple systems
Authors: V. I. Levenshtein
Venue: Problems of Information Transmission (2007)

The paper deals with the problem of constructing a code of the maximum possible cardinality consisting of binary vectors of length n and Hamming weight 3 and having the following property: any 3 × n matrix whose rows are cyclic shifts of three different code vectors contains a 3 × 3 permutation matrix as a submatrix. This property (in the special case w = 3) characterizes conflict-avoiding codes of length n for w active users, introduced in [1]. Using such codes in channels with asynchronous multiple access allows each of w active users to transmit a data packet successfully in one of w attempts during n time slots without collisions with other active users. An upper bound on the maximum cardinality of a conflict-avoiding code of length n with w = 3 is proved, and constructions of optimal codes achieving this bound are given. In particular, there are found conflict-avoiding codes for w = 3 which have much more vectors than codes of the same length obtained from cyclic Steiner triple systems by choosing a representative in each cyclic class.
Using Software Reliability Growth Models in Practice
Authors: Vincent Almering, Michiel van Genuchten, Ger Cloudt, Peter J. M. Sonnemans
Venue: IEEE Software (2007)

Researchers used four software reliability growth models in the final test phases of three embedded software projects to predict the software's remaining faults. They compared the models' predictions to expert predictions and the actual results. The models outperformed the experts in predicting the total number of faults at 25 percent of the elapsed test-time. The researchers concluded that software reliability growth models are useful for supporting management decisions during a software product's final test phases, provided they're combined with results from other estimation methods.
Some Properties of Minimal Threshold Approximations
Authors: K. J. Breeding
Venue: IEEE Transactions on Computers (1971)

In recent years, considerable interest has been given to the study of threshold logic. This interest stems primarily from the possible economic savings associated with the use of threshold elements in realizing arbitrary switching functions. Such realizations, for the most part, depend on successfully finding threshold functions that closely approximate the given function. Closeness of approximation as defined here means that the approximating threshold function has the smallest set of error vectors with respect to the given function.
Intelligent Prosthetic Devices
Authors: M. A. Rahimi
Venue: Computer (1981)

Communication aids with advanced microelectronics, voice synthesis, and artificial intelligence are under development. Some of these devices and their sophisticated human-machine interface strategies are described here.
Automatic exudates detection from diabetic retinopathy retinal image using fuzzy C-means and morphological methods
Authors: Akara Sopharak, Bunyarit Uyyanonvara
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Exudates are the primary signs of diabetic retinopathy which are mainly cause of blindness and could be prevented with an early screening process. Pupil dilation is required in the normal screening process but this affects patients' vision. This paper investigated and proposed automatic methods of exudates detection on low-contrast images taken from non-dilated pupils. The process has two main segmentation steps which are coarse segmentation using Fuzzy C-Means clustering and fine segmentation using morphological reconstruction. Four features, namely intensity, standard deviation on intensity, hue and adapted edge, were selected for coarse segmentation. The detection results are validated by comparing with expert ophthalmologists' hand-drawn ground-truth. The sensitivity and specificity for our exudates detection are 86% and 99% respectively.
Large-scale, standards-based earth observation imagery and web mapping services
Authors: Peter Baumann
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Earth observation (EO) and simulation data share some core characteristics: they resemble raster data of some spatio-temporal dimensionality; the complete objects are extremely large, well into Tera- and Petabyte volumes; data generation and retrieval follow very different access patterns. EO time series additionally share that acquisition/generation happens in time slices. The central standardization body for geo service interfaces is the Open GIS Consortium (OGC). Earlier OGC has issued the Web Map Service (WMS) Interface Specification which addresses 2-D (raster and vector) maps. This year, the Web Coverage Service (WCS) Specification has been added with specific focus on 2-D and 3-D rasters ("coverages"). In this paper we present operational applications offering WMS/WCS services: a 2-D ortho photo maintained by the Bavarian Mapping Agency and a 3-D satellite time series deployed by the German Aerospace Association. All are based on the rasdaman array middleware which extends relational DBMSs with storage and retrieval capabilities for extremely large multidimensional arrays.
Application of Mobile Information System in Vehicle Insurance
Authors: Jin Da Wei, Li Yi Peng
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

This article introduces how to apply mobile information system in the insurance industry. Firstly, it analyses the current status and basic process of insurance business. Then, based on the problem of vehicle insurance business, we offer the solution and implementation of a new mobile information system. The target is that the insurer use smartphone to access the mobile xml data through wireless network. Which can increase the efficiency of insurance company and the satisfaction degree of client.
Software for Hybrid Computation Past,Present,and Future
Authors: H. B. Rigas
Venue: Computer (1976)

To understand and appreciate the various software requirements for a hybrid computer system one must first understand the environment in which the system is used. It may perhaps also be useful to trace the evolution of the analog computer to the hybrid computer-specifically as hardware developments directed software developments.
Dynamic Fuzzy Preference Relations
Authors: Zeshui Xu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, we present a class of new preference relations--dynamic fuzzy preference relations in which all the elements are the variables of time, and study some of their desirable properties. We also give a straightforward method for deriving the priority weights of dynamic fuzzy preference relations, and then develop an approach to constructing dynamic consistent fuzzy preference relations based on the given dynamic fuzzy preference relations.
Confidence intervals for parameters of two diagnostic tests in the absence of a gold standard
Authors: James D. Stamey, Doyle H. Boese, Dean M. Young
Venue: Computational Statistics Data Analysis (2008)

We derive a profile-likelihood confidence interval and a score based confidence interval to estimate the population prevalences, test sensitivities, and test specificities of two conditionally independent diagnostic tests when no gold standard is available. We are motivated by a real-data example on the study of the properties for two fallible diagnostic tests for bovine immunodeficiency virus. We compare the coverage and average width of two new intervals with an interval based on the asymptotic normality of the maximum likelihood estimator and a Bayesian interval estimator via Monte Carlo simulation. We determine that for the parameter configurations considered here, the profile-likelihood, score, and Bayesian intervals all perform adequately in terms of coverage, but overall, the profile-likelihood interval performs best in terms of yielding at least nominal coverage with minimum expected width.
Test and Diagnosis Procedure for Digital Networks
Authors: E. J. McCluskey
Venue: Computer (1971)

Fundamental to the usefulness of any device, instrument or system are the initial verification of its correct functioning and the maintenance of its performance during ing operation. The following discussion is concerned with such problems of initial verification and maintenance for digital systems. Systems can fail to function properly either because of incorrect specification, design, or implementation; or else because of physical deterioration or damage. Problems caused by incorrect specification are extremely difficult to deal with formally. Many cases of faulty design or implementation can be detected either by formal analysis techniques (e.g., logic circuit analysis) or by simulation methods. Of course, actual physical implentations such as integrated circuits must be subjected to measurement before final acceptance. This process of measuring the output response with specified signals applied to the inputs is called testing and is useful both for initial acceptance and also for verification of continued validity during use.