ppxscal/embedding_network huggingface dataset:
Adaptive transaction scheduling for transactional memory systems
Authors: Richard M. Yoo, Hsien-Hsin S. Lee
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Transactional memory systems are expected to enable parallel programming at lower programming complexity, while delivering improved performance over traditional lock-based systems. Nonetheless, there are certain situations where transactional memory systems could actually perform worse. Transactional memory systems can outperform locks only when the executing workloads contain sufficient parallelism. When the workload lacks inherent parallelism, launching excessive transactions can adversely degrade performance. These situations are likely to become dominant in future workloads when large-scale transactions are frequently executed. In this paper, we propose a new paradigm called adaptive transaction scheduling to address this issue. Based on the parallelism feedback from applications, our adaptive transaction scheduler dynamically dispatches and controls the number of concurrently executing transactions. In our case study, we show that our low-cost mechanism not only guarantees that hardware transactional memory systems perform no worse than a single global lock, but also significantly improves performance for both hardware and software transactional memory systems.
Proceedings of the 2008 international symposium on Software testing and analysis
Venue: International Symposium on Software Testing and Analysis (2008)

It is our great pleasure to welcome you to Seattle for the 2008 ACM International Symposium on Software Testing and Analysis -- ISSTA 2008. This year's symposium continues the tradition of ISSTA being the premier forum for presentation of research results on leading edge issues related to software testing and analysis. The call for papers attracted 101 submissions to ISSTA 2008, the same number as the year before, which shows the significant ongoing interest in the field. The program committee accepted 26 papers that cover a variety of topics, including static analysis, fault localization, and various hybrid testing and analysis approaches. Additionally, we invited a number of student authors to present their ideas as posters at the conference. The program includes two distinguished keynote speakers: Jim Larus on "The Real Value of Testing" and Ben Liblit on "Cooperative Debugging With Five Hundred Million Test Cases". Five satellite workshops (Defects, PADTAD, TAV-WEB, WODA, and SSEAT) offer attendees the chance to present work and exchange ideas on focused topics of shared interest. Further program details are available on the ISSTA 2008 Web site at http://issta08.rutgers.edu/.
Design and realization of sensor system for flow measurement
Authors: Miroslav Husak
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The article describes design and realization of an airflow structure for measurement. There are structure and electronic circuits design in the paper are described The principle of a flowmeter sensor operation is based on the mechanism of a fluidic oscillator. It uses fluidic paths in feedback. Oscillator samples have been made using different technologies and materials. Micromechanical shaping, etching and sticking as basic operations have been used. Further there is described design, construction and measured results of the developed flowmeter with a fluidic oscillator for measurement of fluid flow. Measured fluid flow is displayed on a digital or analog measuring device calibrated in values of immediate flow amount or flow velocity. A CoventorWare software was used for design of mechanical behaviour and CADENCE software was used for electronic circuits design.
Modernization of one criterion for absolute stability
Authors: A. I. Barkin, D. N. Rokin
Venue: Automation and Remote Control (2008)

A new form of a partial frequency criterion of absolute stability for nonlinear automatic control systems is obtained basing on a quadratic transformation of the state vector. As is shown, the obtained criterion is stronger than V.M. Popov's one. An alternative formulation of the criterion is given in terms excluding the notions of quadratic transformation.
Developing an Aerospace System Software Using PBL and MDA
Authors: João Carlos Silva Nobre, Denis Silva Loubach, Emilia Colonese
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper reports a Problem-Based Learning - PBL approach for the development of real time embedded software for the aerospace sector, employing a commercial suite of tools that supports Model-Driven Architecture - MDA projects. Using this approach, graduate and last-year undergraduate students in computer engineering of the Brazilian Aeronautical Institute of Technology (ITA) have developed an aerospace system prototype during an academic semester.
GDB: A tool to build deductive rules using a fuzzy relational database with scientific data
Authors: R. Morales, I. Blanco, O. Pons, J. Rodríguez
Venue: Fuzzy Sets and Systems (2008)

This paper presents GDB, a system to build, debug and test rules in a Fuzzy Relational Deductive Database System (FRDDS) in a visual way avoiding the associated syntax which could be quite complex for a non-expert user. The rules will be used to compute a Measure of Quality (MoQ) of the scientific data generated by the GIADA instrument (ROSETTA space mission). The MoQ will be defined and assigned taking into account the knowledge of the engineers who built the instrument and the formal documentation. Together with this MoQ, the tool will provide a semantic explanation about how the measure has been assigned. With GDB is possible to work with imprecise data, to store knowledge using rules and also to deduce new information. The MoQ and the explanation will provide to the scientists and engineers a better understanding about the instrument behavior and, therefore, about physical phenomena under study.
Explicit solution for the incommensurable frequency oscillation control problem under limited resource control
Authors: A. Yu. Popov
Venue: Automation and Remote Control (2008)

An oscillation process described by the system of linear differential equations with a constant matrix is considered. The matrix is supposed to have negative linearly independent, over the field of rational numbers, eigenvalues. For this system the explicit form of the minimum resource control is found. In the cases of the system dimension 1 and 2, the controls close to optimal are presented.
Optimal mechanism design and money burning
Authors: Jason D. Hartline, Tim Roughgarden
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Mechanism design is now a standard tool in computer science for aligning the incentives of self-interested agents with the objectives of a system designer. There is, however, a fundamental disconnect between the traditional application domains of mechanism design (such as auctions) and those arising in computer science (such as networks): while monetary "transfers" (i.e., payments) are essential for most of the known positive results in mechanism design, they are undesirable or even technologically infeasible in many computer systems. Classical impossibility results imply that the reach of mechanisms without transfers is severely limited. Computer systems typically do have the ability to reduce service quality--routing systems can drop or delay traffic, scheduling protocols can delay the release of jobs, and computational payment schemes can require computational payments from users (e.g., in spam-fighting systems). Service degradation is tantamount to requiring that users "burn money", and such "payments" can be used to influence the preferences of the agents at a cost of degrading the social surplus. We develop a framework for the design and analysis of "money-burning mechanisms" to maximize the residual surplus-the total value of the chosen outcome minus the payments required. Our primary contributions are the following. * We define a general template for prior-free optimal mechanism design that explicitly connects Bayesian optimal mechanism design, the dominant paradigm in economics, with worst-case analysis. In particular, we establish a general and principled way to identify appropriate performance benchmarks in prior-free mechanism design. * For general single-parameter agent settings, we characterize the Bayesian optimal money-burning mechanism. * For multi-unit auctions, we design a near-optimal prior-free money-burning mechanism: for every valuation profile, its expected residual surplus is within a constant factor of our benchmark, the residual surplus of the best Bayesian optimal mechanism for this profile. * For multi-unit auctions, we quantify the benefit of general transfers over money-burning: optimal money-burning mechanisms always obtain a logarithmic fraction of the full social surplus, and this bound is tight.
Microsoft Visio 2007 Introduction Quick Reference Guide
Authors: Beezix Inc.
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Microsoft Office Visio 2007. The following topics are covered: Creating a New Document, Adding Shapes to a Drawing, Selecting Multiple Shapes, Adding/Editing Text on a Shape, Formatting Shapes, Using Themes, 1-D vs 2-D Objects Moving, Copying, and Resizing Shapes, Rotating, Flipping, Aligning Shapes, Distributing Shapes Stencils: Opening, Closing, Creating, Saving, Adding Shapes to a Stencil, Copying Master Shapes to a Stencil, Using a Connector from a Stencil, Using the Connector Tool, Using AutoConnect, Applying Static or Dynamic Glue, Gluing 2-D Shapes, Adding your Own Connection Points, Changing Connection Point Types, Creating/Modifying Layers, Assigning Shapes to Layers, Creating Groups Using Guides, Setup: Printer Paper vs. Drawing Page, Shortcut to Working with Pages: Adding, Deleting, Reordering, Renaming. Drawing Windows for Quick Editing: Pan and Zoom, Drawing Explorer, Shape Data, Size and Position. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
ROWLBAC: representing role based access control in OWL
Authors: T. Finin, A. Joshi, L. Kagal, J. Niu, R. Sandhu, W. Winsborough, B. Thuraisingham
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

There have been two parallel themes in access control research in recent years. On the one hand there are efforts to develop new access control models to meet the policy needs of real world application domains. In parallel, and almost separately, researchers have developed policy languages for access control. This paper is motivated by the consideration that these two parallel efforts need to develop synergy. A policy language in the abstract without ties to a model gives the designer little guidance. Conversely a model may not have the machinery to express all the policy details of a given system or may deliberately leave important aspects unspecified. Our vision for the future is a world where advanced access control concepts are embodied in models that are supported by policy languages in a natural intuitive manner, while allowing for details beyond the models to be further specified in the policy language. This paper studies the relationship between the Web Ontology Language (OWL) and the Role Based Access Control (RBAC) model. Although OWL is a web ontology language and not specifically designed for expressing authorization policies, it has been used successfully for this purpose in previous work. OWL is a leading specification language for the Semantic Web, making it a natural vehicle for providing access control in that context. In this paper we show two different ways to support the NIST Standard RBAC model in OWL and then discuss how the OWL constructions can be extended to model attribute-based RBAC or more generally attribute-based access control. We further examine and assess OWL's suitability for two other access control problems: supporting attribute based access control and performing security analysis in a trust-management framework.
Architectures for enterprise integration and interoperability: Past, present and future
Authors: David Chen, Guy Doumeingts, François Vernadat
Venue: Computers in Industry (2008)

The paper defines and clarifies basic concepts of enterprise architectures. Then an overview on architectures for enterprise integration developed since the middle of the 1980s is presented. The main part of the paper focuses on the recent developments on architectures for enterprise interoperability. The main initiatives and existing works are presented. Future trends and some research issues are discussed and conclusions are given at the end of the paper.
New Products
Venue: IEEE MultiMedia (2008)

This article features some of the latest advances in multimedia technology.
A model function method for determining the regularizing parameter in potential approach for the recovery of scattered wave
Authors: Jijun Liu, Ming Ni
Venue: Applied Numerical Mathematics (2008)

Consider the reconstruction of scattered wave from its erroneous far-field pattern data in acoustic wave scattering. The potential scheme proposed by Kirsch and Kress converts this problem into the determination of some density function from a linear integral equation of the first kind. For this ill-posed problem, we apply the model function method to determine the regularizing parameter approximately in the potential scheme. Compared with the standard method which solves the regularizing parameter from the exact discrepancy equation, this paper proposes an implementable numerical approach to determining the regularizing parameter from the equation satisfied by the model function. Applying the proposed scheme to determine the regularizing parameter approximately, we reconstruct the scattered wave with relatively small amount of computation.
Towards software configuration management for unified models
Authors: Maximilian Kögel
Venue: Proceedings of the 2008 international workshop on Comparison and versioning of software models (2008)

Change occurs throughout the software lifecycle. Software Configuration Management tools and techniques provide the foundation to effectively control change. With a growing number of approaches combining models from different domains into one unified, integrated model, ([15], [12]), there is also an emerging demand for SCM techniques and methods that are able to support these unified models. Traditional SCM systems operating on the abstraction of a filesystem and managing change at the granularity of textual lines are not adequate for these requirements. We propose a novel approach to SCM for unified models combining product versioning, operation-based deltas and change packages. To demonstrate feasibility we have implemented our approach in Sysiphus a suite of tools for collaborating over Software Engineering artifacts represented in a unified model.
Designing modular architectures in the framework AKIRA
Authors: Giovanni Pezzulo, Gianguglielmo Calvi
Venue: Multiagent and Grid Systems (2007)

AKIRA is an open source framework designed for parallel, asynchronous and distributed computation, on the basis of some general architectural principles which are inspired by modular organization in biological systems. We introduce the motivation behind its design, the components of the framework and some examples of use: 1) a case study in a simple number domain, in which its capabilities such as context sensitiveness are highlighted; 2) an architecture for visual search tasks, in which a goal oriented behavior emerges from the cooperation and competition of many feature-specific modules, organized hierarchically; 3) a schema-based agent architecture, inspired by an ethological model of the praying mantis, including drives, schemas, routines and realizing visual and motor behavior in a realistic simulated environment.
A perfect load balancing algorithm on cube-connected cycles
Authors: Gene Eu Jan, Shao-Wei Leu, Cheng-Hung Li, Xiaoshe Dong
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

A simple yet efficient algorithm was presented by Jan and Huang recently to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. That algorithm was developed based on the well-known dimension exchange method. However, the error accumulation suffered by other algorithms based on the dimension exchange method is avoided by exploiting the notion of regular distributions, which are commonly deployed for data distributions in parallel programming. The cube-connected cycles (CCC) proposed by Preparata and Vuillemin are very similar in structure to the hypercube as an efficient general-purpose parallel system for its fixed-degree, and compact and regular layout. In this article, we propose a simple algorithm based on our previous work to distribute loads evenly on cube-connected cycles. This algorithm achieves perfect load balance over P processors with error of 1 and the worst-case time complexity of O(M log2 P), where M is the maximum load assigned to each processor initially. More importantly, it could achieve perfect load balance over subcubes as well --.if the cube is decomposed into two subcubes by bit 0, then the difference between the numbers of the total tasks in the subcubes is at most 1.
Distributed Information Retrieval Service for Ubiquitous Services
Authors: Takeshi Tsuchiya, Marc Lihan, Hirokazu Yoshinaga, Keiichi Koyanagi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper, we propose and clarify distributed Information Retrieval (IR) manner use of Peer-to-Peer (P2P) technology, which has the same accuracy approximately at current index-integrated search engine use of statistical information calculated from the contents. Realizing Decentralized IR systems which uses of statistic information, we need to solve following three problems. First is the calculation manner of the statistic information from all content and generating indices manner by the collaboration among distributed peers (nodes). Second problem is the efficiency of index distribution on logical space collaborated by peers named Multiple-Ring. And the last problem is efficient IR strategies with high accuracy. As for the result of the evaluation, we discuss the relationship between the propagation time for generating the statistics information and the system scalability by simulation and emulation. And our proposed system is suitable for the flexible IR service which adapts contents environment from small scale network to middle scale network such as an office.
Automated Ciphertext-Only Cryptanalysis of the Bifid Cipher
Authors: António Machiavelo, Rogério Reis
Venue: Cryptologia (2007)

In this article, we describe a fully automated ciphertext-only cryptanalysis attack on the Bifid cipher, for which the original text language is known. We have implemented this attack using Python. We use an easily computable statistical function to find the period of the cipher, and then the key-table is generated in a fairly efficient way. The process is directed in a way that strongly narrows the search space of possible solutions. This results in a feasible attack to a Bifid cryptogram, provided that its length is sufficient for accurate statistical analysis.
Speckle Noise Reduction of Ultrasound Images Using M-band Wavelet Transform and Wiener Filter in a Homomorphic Framework
Authors: Arash Vosoughi, Mohammad Bagher Shamsollahi
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper we make use of M-band discrete wavelet transform (MDWT) and Wiener filter for speckle noise suppression of ultrasound images. Assuming multiplicative model for speckle noise, by applying logarithmic transform to noisy observation we convert multiplicative noise to additive one. Then, speckle noise can be reduced by taking the M-band wavelet transform of log-transformed observation and employing an adaptive thresholding technique. In order to improve the performance of this denosing approach, we propose a preprocessing stage which exploits Wiener filtering. Through this stage log-transformed observation is separated into two images and then each of these two images is denoised individually in M-band wavelet transform domain. The summation of these two images constructs the despeckled image. We have tested our method on realistic ultrasound images and compared the results with results of other speckle suppression methods.
Counting positive solutions for polynomial systems with real coefficients
Authors: Yisheng Lai
Venue: Computers Mathematics with Applications (2008)

Based on the subresultant polynomial chain and the method presented by Hongguang Fu and Lu Yang et al., we propose a practical algorithm for computing the number of sign changes of the leading coefficients and the constant terms of a generalized Sturm sequence (GSS). With the principal minors sequence of the discrimination matrix of the polynomial and the number of sign changes of the GSS, a formula determining the number of positive solutions of a given bivariate polynomial systems with real coefficients (with a finite number of complex solutions) and its algorithm are presented. Using the techniques of the B-net form of bivariate splines function, this algorithm can be used for computing the number of real intersection points of two piecewise algebraic curves and its distributions in all cells when common points are finite. A piecewise algebraic curve is defined by a bivariate spline function.
Wireless Sensor Networks for Cultural Property Protection
Authors: Jongwoo Sung, Sungjin Ahn, Taesoo Park, Seonghun Jang, Dongheui Yun, Jonggu Kang, Seong-eun Yoo, Pohkit Chong, Daeyoung Kim
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Wireless sensor network technology has been proven to have a strong impact on our daily life from many real applications. In this paper wireless sensor networks for cultural property protection are introduced. We deployed wireless sensor networks in Bul-guk-sa Temple, which is one of the most important UNESCO cultural property sites in Korea. This paper presents our wireless sensor network system for monitoring and protecting cultural property from the aspect of application design to network system management.
A Cost-effective VLD Architecture for MPEG-2 and AVS
Authors: Yanmei Qu, Shunliang Mei, Yun He
Venue: Journal of Signal Processing Systems (2008)

In this paper, we propose a cost-effective architecture of variable length decoder (VLD) for MPEG-2 and AVS. In order to save the buffer memory between VLD and IDCT and accelerate decoding speed, block-based pipeline buffers are adopted. Inverse scan (IScan) and inverse quantisation (IQ) are also merged into this architecture for cost-effective implementation and for easier system integration. A novel group-based architecture with the optimized look-up table is used for MPEG-2 and a new memory-efficient architecture with mixed memory organization is used for AVS. We use shared modules in both MPEG-2 and AVS as much as possible, such as the flush unit, the buffer controller and the buffers. Moreover, we propose merged IQ scheme and merged RAMs scheme. Based on 0.18 μm CMOS technology, the proposed design consumes about 11.5 K gates at a clock constrain of 125 MHz. The simulation results show that it can achieve real-time decoding, such as HD1080i (1,920¿×¿1,088 at 30 MHz) format video of AVS and MPEG-2. Furthermore, we propose an effective design of the buffers between VLD and IDCT according to the IDCT architecture, a cost-efficient IQ architecture with full flexibility and an efficient scheme for accelerating VLC decoding.