ppxscal/embedding_network huggingface dataset:
Providing Quality of Service Support in Object-Based File System
Authors: Joel C. Wu, Scott A. Brandt
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Bourbon is a quality of service framework designed to work with the Ceph object-based storage system. Ceph is a highly scalable distributed file system that can scale up to tens of thousands of object-based storage devices (OSDs). The Bourbon framework enables Ceph to become QoS-aware by providing the capability to isolate performance between different classes of workloads. The Bourbon framework is enabled by Q-EBOFS, a QoS-aware enhancement of the EBOFS object-based file system. QEBOFS allows individual OSDs to become QoS-aware, and by leveraging on the random element of the CRUSH data distribution algorithm employed by Ceph, it is possible for a collection of independent QoS-aware OSDs to provide class-based performance isolation at the global level. This preserves the highly scalable nature of Ceph by avoiding the introduction of any centralized components or the need to collect and propagate global state information. This paper presents the Bourbon framework by first describing Q-EBOFS, and then examines how a collection of OSDs running Q-EBOFS can work together to provide global-level QoS.
Educational Pascal compiler into MMIX code
Authors: Evgeny A. Eremin
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

The pedagogical software tool, visualizing translation from Pascal into machine codes, is described. The basic aim of the present work was to create software, distinctly demonstrating students the close unity of the contents of two fundamental CS courses --- programming and computer architecture.
Comparative Research of Portfolio Model Using Fuzzy Theory
Authors: Yan-chun Liu, Liang Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

By discussing both linear and nonlinear fuzzy situations, we give the relevant model and the solution method. First of all, regarding the target level of investment return and investment risk as the half trapezoidal fuzzy number, we give the fuzzy portfolio selection model of linear satisfaction degree. Then, to describe the investor satisfaction degree of investment return and investment risk better, a logarithmic membership function has been imported. Following, we give the fuzzy portfolio selection model of nonlinear satisfaction degree. Nonlinear optimize model can be transferred to linear programming model, so that model calculation has been simplified significantly. Finally, according as the actual data of Chinese securities market, both of models have been compared by using genetic algorithm. Result indicates that portfolio selection model based on linear and nonlinear membership function includes not only historical data, but also investors' expectation. That accords with human psychology and fact. Moreover, the nonlinear membership function adopted and parameter adjusted, it can furthest get portfolio that accords with one's expectation. Therefore, nonlinear membership function is better than linear membership function.
Towards an Assembly Language Stanldard
Authors: Geoff Baldwin
Venue: IEEE Micro (1984)

The world does not need another assembly language syntax, but it does need a standard for one-and now. Comments are invited on this analysis of the proposed draft standard. 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
Protocol Conformance Testing a SIP Registrar: an Industrial Application of Formal Methods
Authors: Bernhard K. Aichernig, Bernhard Peischl, Martin Weiglhofer, Franz Wotawa
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Various research prototypes and a well-founded theory of model based testing (MBT) suggests the application of MBT to real-world problems. In this article we report on applying the well-known TGV tool for protocol conformance testing of a Session Initiation Protocol (SIP) server. Particularly, we discuss the performed abstractions along with corresponding rationales. Furthermore, we show how to use structural and fault-based techniques for test purpose design. We present first empirical results obtained from applying our test cases to a commercial implementation and to a popular open source implementation of a SIP Registrar. Notably, in both implementations our input output labeled transition system model proved successful in revealing severe violations of the protocol.
Image Spam Filtering Using Visual Information
Authors: Battista Biggio, Giorgio Fumera, Ignazio Pillai, Fabio Roli
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We address the problem of recognizing the so-called image spam, which consists in embedding the spam message into attached images to defeat techniques based on the analysis of e-mails' body text, and in using content obscuring techniques to defeat OCR tools. We propose an approach to recognize image spam based on detecting the presence of content obscuring techniques, and describe a possible implementation based on two low-level image features aimed at detecting obscuring techniques whose consequence is to compromise the OCR effectiveness resulting in character breaking or merging, or in the presence of noise interfering with characters in the binarized image. A preliminary experimental investigation of this approach is reported on a personal data set of spam images.
Optimal Constant-Window Backoff Scheme for IEEE 802.11 DCF in Single-Hop Wireless Networks Under Finite Load Conditions
Authors: Hicham Anouar, Christian Bonnet
Venue: Wireless Personal Communications: An International Journal (2007)

Existing backoff scheme's optimization of IEEE 802.11 DCF MAC protocol consider only saturated networks or asymptotic conditions. In real situations, traffic is bursty or streamed at low rates so that stations do not operate usually in saturated regime. In this work, we propose and analyze a backoff enhancement for IEEE 802.11 DCF that requires information only about the network size and that is quasi-optimal under all traffic loads. We first analyze the performance of DCF multiple access scheme under general load conditions in single-hop configuration and we provide an accurate delay statistics model that consider the self-loop probability in every backoff state. We prove then the short-term unfairness of the binary exponential backoff used in IEEE 802.11 by defining channel capture probability as fairness metric. Motivated by the results on fairness, we introduce the constant-window backoff scheme and we compare its performance to IEEE 802.11 DCF with Binary exponential backoff. The quasi-optimality of the proposed scheme is proved analytically and numerical results show that it increases, both the throughput and fairness, of IEEE 802.11 DCF while remaining insensitive to traffic intensity. The analysis is then extended to consider the finite queuing capacity at nodes buffers using results from the delay analysis. NS2 simulations validate the obtained results.
Tiered Algorithm for Distributed Process Quiescence and Termination Detection
Authors: Ronald F. DeMara, Yili Tseng, Abdel Ejnioui
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

The Tiered Algorithm is presented for time-efficient and message-efficient detection of process termination. It employs a global invariant of equality between process production and consumption at each level of process nesting to detect termination regardless of execution interleaving order and network transit time. Correctness is validated for arbitrary process launching hierarchies, including launch-in-transit hazards where processes are created dynamically based on run-time conditions for remote execution. The performance of the Tiered Algorithm is compared to three existing schemes with comparable capabilities, namely the CV, LTD, and Credit termination detection algorithms. For synchronization of T tasks terminating in E epochs of idle processing, the Tiered Algorithm is shown to incur O(E) message count complexity and O(T lg T) message bit complexity while incurring detection latency corresponding to only integer addition and comparison. The synchronization performance in terms of messaging overhead, detection operations, and storage requirements are evaluated and compared across numerous task creation and termination hierarchies.
Illumination and view dependent progressive transmission of semi-regular meshes with subdivision connectivity
Authors: Wei Guan, Juyong Zhang, Jianfei Cai, Jianmin Zheng
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

For wireless network based graphics applications, a key challenge is how to efficiently transmit complex 3D models over bandwidth-limited wireless channels. Recently, several view-dependent 3D progressive mesh transmission schemes have been proposed, which save the transmission bandwidth through only delivering the visible portions of a mesh model. In this paper, we propose to incorporate the illumination effects into the existing view-depend progressive mesh transmission system to further improve the performance. In particular, we propose a novel distortion model, which consists of both illumination distortion and geometry distortion. We further simplify the distortion model in order to compute the rate-distortion function for each segment of a mesh model in a fast manner. Based on our proposed simplified distortion model, given the viewing and lighting parameters, we are able to optimally allocate bits among different segments in real time. Experimental results show that significant quality improvement can be achieved by taking into account the illumination effects.
Hybrid rule interval variation (HRIV) method for stabilizing a class of nonlinear systems
Authors: H. C. Myung, Z. Zenn Bien, Kaoru Hirota
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

HRIV (Hybrid Rule Interval Variation) method is presented, as a means of stabilizing a class of fuzzy control-based nonlinear systems. The HRIV method consists of two modes: I-mode (Minimum Approximation Error-based control) and R-mode (Rule Interval Variation-based control). In I-mode, sliding mode control is used to compensate for the minimum approximation error caused by heuristic characteristics of fuzzy logic control. In R-mode, RIV (Rule Interval Variation) method reduces the interval lengths of rules as the states converge to an equilibrium point. The HRIV method considers the analytic upper bound of the minimum approximation error and reduces its effect in the control input, which is considered to be advantageous compared with the previous results. To show effectiveness of the proposed method, a simulation experiment is conducted to stabilize a simple nonlinear system and a modified inverted pendulum system.
Boolean Filters and Prime Filters of Residual Lattices
Authors: Yong-quan Wang, Xiao-hong Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Residual lattice play an important role in the study of fuzzy logic based on t-norm. In this paper, we introduce the notions of Boolean filter in residual lattices, and therefore generalize the corresponding results which shown in BL-algebras by E. Turunen to residual lattices. We completely solve an open problem on filters of BL- algebras posed by M. Haveshki et al. Moreover, we investigate prime filters of residuated lattices, and by using the software MATHEMATICA, we also give a counterexample to show the distinction between prime filters of residual lattices and one of MTL-algebras.
Software Solutions for Biomedical Decision Making
Authors: Donna L. Hudson, Maurice E. Cohen
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Software development in biomedicine continues to face challenges due to many factors including the complexity of the field, communication difficulties between healthcare professionals and software developers, and lack of standards that would facilitate communication among multiple institutions. In this work, approaches to dealing with biomedical decision making are discussed with implications in modeling the status of each patient on an individual basis. The software is based on an intelligent agent structure that incorporates a number of reasoning paradigms and a variety of input parameters ranging from text description to numerical data. The methods are illustrated in an application for cardiac diagnosis.
Bibliography on Techniques of Computer Performance Analysis
Authors: E. F. Miller
Venue: Computer (1972)

The measurement of computer performance is a topic of resurgent interest both within and outside the computer community. Both the designers and users of computer systems have a continuing interest in those techniques which attempt to quantify the performance of the machines they build and program. Wherever performance measurement is applied in the design-use-evaluate cycle, it is important that the latest and most effective tools be brought to bear.
On the Automated Generation of Program Test Data
Authors: C. V. Ramamoorthy
Venue: IEEE Transactions on Software Engineering (1976)

Software validation through testing will continue to be a very important tool for ensuring correctness of large scale software systems. Automation of testing tools can greatly enhance their power and reduce testing cost. In this paper, techniques for automated test data generation are discussed. Given a program graph, a set of paths are identified to satisfy some given testing criteria. When a path or a program segment is specified, symbolic execution is used for generating input constraints which define a set of inputs for executing this path or segment. Problems encountered in symbolic execution are discussed. A new approach for resolving array reference ambiguities and a procedure for generating test inputs satisfying input constraints are proposed. References to arrays are recorded in a table. during symbolic execution and ambiguities are resolved when test data are generated to evaluate the subscript expressions. The implementation of a test data generator for Fortran programs incorporating these techniques is also described.
Integration of machine-vision inspection information for best-matching of distributed components and suppliers
Authors: Juan D. Velasquez, Shimon Y. Nof
Venue: Computers in Industry (2008)

Supply networks can benefit from the development of effective exchange protocols to harmonize the integration of distributed machine-vision inspection information. By enabling local inspection information to be used beyond local supplier decisions and by integrating it with other suppliers' inspection information, an enterprise can garner better sub-assembly and supplier-matching decisions. An inspection information exchange architecture that enables best-matching has been developed. A parallel computer-based simulation using the teamwork integration evaluator (TIE 1.1) showed that a multiple-file-input logic had a relatively shorter processing time, exchange and handling time, than the pairwise-file-input logic for best-matching processes. The information exchange architecture enabled the comparison of suppliers based on quality of parts and cost to manufacture and aided in selecting the supplier, which better meets the needs of the customer. An Information Exchange Protocol: (1) enables better information exchange among manufacturing functions and (2) provides a decision-making tool for part dimensionality control.
Virtual context based services for support of interaction in virtual worlds
Authors: Sonja Bergsträsser, Tomas Hildebrandt, Lasse Lehmann, Christoph Rensing, Ralf Steinmetz
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

A wide variety of virtual worlds exists today. They embed the user into a virtual reality allowing interaction with the virtual environment and, in case of multiplayer worlds, other users. Our goal is to support these interactions. Therefore we are using virtual parameters to describe the user's virtual context and provide additional services depending on this context. These services can either be included into the virtual world or can be realized using a community portal. In this paper we will introduce the concept of virtual context based services and its fundamentals like the classification of interaction in virtual worlds, a generic interaction model and an extended model including additional services.
Leveraging Single-user OpenOffice Writer for Collaboration by Transparent Adaptation
Authors: Haifeng Shen, Chengzheng Sun, Suiping Zhou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Collaborative authoring of shared office documents becomes increasingly desirable for integrating collective efforts from multiple contributors. We propose to plug a generic collaborative engine into existing office applications so that advanced collaboration capabilities can be seamlessly integrated without compromising or modifying their conventional capabilities. This engine lies on application-independent data addressing and operation models to be reusable for a wide range of applications without being modified. As such, an application-dependent adaptor is required to bridge the gap between the data and operation models used by the application and engine. In this paper, we present the data addressing and operation adaptation techniques for OpenOffice Writer. These techniques have been implemented in the Writer's adaptor for evaluation, demonstration, and usability study.
A Monospectral Approach for fMRI Analysis using Kohonen Self-Organized Networks
Authors: Wellington P. dos Santos, Ricardo E. de Souza, Ana Cristina T. Albuquerque, Maria Lucia B. Simas
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

One of the major challenges at the field of cognitive sci- ences is mapping the regions of the brain responsible for the motor and behavioral functions. The acquisition of functional magnetic resonance images is an important non- invasive technique to study the neural activity in the human brain. This work presents a new approach for the detection of activated brain regions: the composition and analysis of synthetic multi and monospectral images using statistical methods and proposing non-parametrical methods based on Kohonen self-organized networks.
Microarray blob-defect removal improves array analysis
Authors: Jun S. Song, Kaveh Maghsoudi, Wei Li, Edward Fox, John Quackenbush, X. Shirley Liu
Venue: Bioinformatics (2007)

Motivation: New generation Affymetrix oligonucleotide microarrays often have blob-like image defects that will require investigators to either repeat their hybridization assays or analyze their data with the defects left in place. We investigated the effect of analyzing a spike-in experiment on Affymetrix ENCODE tiling arrays in the presence of simulated blobs covering between 1 and 9% of the array area. Using two different ChIP-chip tiling array analysis programs (Affymetrix tiling array software, TAS, and model-based analysis of tiling arrays, MAT), we found that even the smallest blob defects significantly decreased the sensitivity and increased the false discovery rate (FDR) of the spike-in target prediction. Results: We introduced a new software tool, the microarray blob remover (MBR), which allows rapid visualization, detection and removal of various blob defects from the.CEL files of different types of Affymetrix microarrays. It is shown that using MBR significantly improves the sensitivity and FDR of a tiling array analysis compared to leaving the affected probes in the analysis. Availability: The MBR software and the sample array.CEL files used in this article are available at: http://liulab.dfci.harvard.edu/Software/MBR/MBR.htm Contact: xsliu@jimmy.harvard.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Adaptive Artifact Suppression in Ultrasound Image
Authors: Yuan Zhu, Dong C. Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The aim of this report is to present artifact suppression algorithms for reducing the reverberation artifacts in ultrasonic imaging. These reverberation patterns always occurred as signals among specular reflectors. In ultrasound applications, we need to reduce the artifacts but at the same time to preserve other useful information. Because of the periodic pattern of the artifacts, we will apply a 2-D FFT in unoverlap blocks of the image to extract and remove the peaks which are corresponding to artifacts in the frequency domain. The 2-D FFT can provide the information in one more dimension compared with the 1-D FFT from which we could differentiate the real artifacts and some useful information, for example, the vessel boundary. Test results from several in vivo images show that this new technique can suppress artifact effectively and preserve useful information at the same time.
Applying Concept Analysis to User-Session-Based Testing of Web Applications
Authors: Sreedevi Sampath, Sara Sprenkle Emily Gibson Lori Pollock, Amie Souter Greenwald
Venue: IEEE Transactions on Software Engineering (2007)

The continuous use of the web for daily operations by businesses, consumers, and the government has created a great demand for reliable web applications. One promising approach to testing the functionality of web applications leverages user-session data collected by web servers. User-session-based testing automatically generates test cases based on real user profiles. The key contribution of this paper is the application of concept analysis for clustering user sessions and a set of heuristics for test case selection. Existing incremental concept analysis algorithms are exploited to avoid collecting and maintaining large user-session data sets and thus to provide scalability. We have completely automated the process from user session collection and test suite reduction through test case replay. Our incremental test suite update algorithm coupled with our experimental study indicate that concept analysis provides a promising means for incrementally updating reduced test suites in response to newly captured user sessions with little loss in fault detection capability and program coverage.
Architectural Efficiency Measures: An Overview of Three Studies
Authors: W. B. Dietz
Venue: Computer (1979)

Some computer architectures are inherently more efficient than others, and three parameters help system specifiers and designers pick the best-independent of hardware. The winners are likely to become military standards.
A New Algorithm for Weighted Proportional Fairness Based Spectrum Allocation of Cognitive Radios
Authors: Tian Feng, Yang Zhen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Cognitive Radio can achieve dynamic spectrum access by spectrum sensing. The paper proposes a new scheme to share spectrum employing OFDMA-based Cognitive Radio. To show efficiency and fairness, the paper builds an Asymmetric-Nash-Bargain-Solution- Based utility function and implement a new spectrum sharing algorithm based on sensing contribution weighted proportional fairness through two-user bargaining. The simulation results show that the proposed approach is not only to achieve a fair and efficient allocation of spectrum resources but also to help maximizing the spectrum sensing.