ppxscal/embedding_network huggingface dataset:
Fuzzy logic and related methods as a screening tool for detecting gene regulatory networks
Authors: Guy N. Brock, William D. Beavis, Laura Salter Kubatko
Venue: Information Fusion (2009)

The analysis of gene expression microarrays plays an important role in elucidating the functionality of genes, including the discovery of genetic interactions that regulate gene expression. Several methods for modeling such gene regulatory networks exist, including a variety of continuous and discrete models. Methods based on fuzzy logic provide an interesting alternative. However, the guidelines for modeling gene expression with fuzzy logic are fairly open, and the need arises to investigate how adjustments in the modeling scheme will affect the results. In this work, we modify an existing fuzzy logic algorithm to involve an arbitrary number of classification states, and investigate the limiting behavior as the number of states tends to infinity. We also propose a probabilistic model as an alternative to the fuzzy logic model. We investigate the behavior of both models using yeast cell-cycle data and the simulated data of Werhli et al. [A.V. Werhli, M. Grzegorczyk, D. Husmeier, Comparative evaluation of reverse engineering gene regulatory networks with relevance networks, graphical Gaussian models, and Bayesian networks, Bioinformatics 22 (2006) 2523-2531]. We found that altering the number of classification states in both the fuzzy logic and probability models can influence which networks are predicted by both models. As the number of states tends to infinity, the predictions made by both models converge to those of a regression model. Models with a small to moderate number of classification states produced better results from a biological standpoint, compared to models with higher numbers of states. In simulated data, models with differing numbers of classification states produced similar overall results. Thus, increasing the complexity of the models has no apparent benefit, and models with smaller numbers of classification states are therefore preferred based on their ease of linguistic interpretation. The software used in this paper is freely available for non-commercial use at http://louisville.edu/~g0broc01.
MMX-Based DCT and MC Algorithms for Real-Time Pure Software MPEG Decoding
Authors: Yi-Shin Tung, Chia-Chiang Ho, Ja-Ling Wu
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

To overcome the difficulties of computation-intensive multimedia applications, the development groups of major CPU manufactories, such as Intel(TM) and Digital(TM), have decided to include new instruction sets into their CPU families to increase their multimedia handling ability. The newly introduced instruction set is basically in a Single Instruction Multiple Data (SIMD) Stream operation type. For the practical purpose (e.g. the trade off between the complexity of hardware implementation and the so-obtained performance improvement), they use a reduced SIMD instruction set instead of the full one. Taking Intel as an example, the new instruction set is composed of 57 operations called the MultiMedia eXtension (MMX) instruction set. Nowadays, how to fully utilize the power of the embedded instruction set for providing various multimedia applications becomes an interesting and important issue. In this paper, we demonstrate an efficient realization, based on the new MMX instruction set, of the block Inverse Discrete Cosine Transform (IDCT) and Motion Compensation (MC) which are kernel components of the block-based decoding standards, such as MPEG-1, MPEG-2, H.261 and H.263. The convincing results show that: with the add of proper SIMD instruction set, the pure software solution for complicated multimedia applications (such as real-time MPEG video decoding) becomes feasible.
Algorithms for rendering depth of field effects in computer graphics
Authors: Brian A. Barsky, Todd J. Kosloff
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Computer generated images by default render the entire scene in perfect focus. Both camera optics and the human visual system have limited depth of field, due to the finite aperture or pupil of the optical system. For more realistic computer graphics as well as to enable artistic control over what is and what is not in focus, it is desirable to add depth of field blurring. Starting with the work of Potmesil and Chakravarty[33][34], there have been numerous approaches to adding depth of field effects to computer graphics. Published work in depth of field for computer graphics has been previously surveyed by Barsky [2][3]. Later, interactive depth of field techniques were surveyed by Demers [12]. Subsequent to these surveys, however, there have been important developments. This paper surveys depth of field approaches in computer graphics, from its introduction to the current state of the art.
A smoothed bootstrap test for independence based on mutual information
Authors: Edmond H. C. Wu, Philip L. H. Yu, W. K. Li
Venue: Computational Statistics Data Analysis (2009)

A test for independence of multivariate time series based on the mutual information measure is proposed. First of all, a test for independence between two variables based on i.i.d. (time-independent) data is constructed and is then extended to incorporate higher dimensions and strictly stationary time series data. The smoothed bootstrap method is used to estimate the null distribution of mutual information. The experimental results reveal that the proposed smoothed bootstrap test performs better than the existing tests and can achieve high powers even for moderate dependence structures. Finally, the proposed test is applied to assess the actual independence of components obtained from independent component analysis (ICA).
Future Ada environments
Authors: Sabina H. Saib
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The current Ada environments are oriented toward traditional code production tools such as editors, compilers, loaders, and program library managers. Future Ada environments will add to the initial capabilities to provide support from the initiation of requirements to the enhancement of existing operational software. In addition to software development facilities, future Ada environments will support management activities. The future will also see applications of current tools and techniques across the entire life cycle.
Mitigating attacks on open functionality in SMS-capable cellular networks
Authors: Patrick Traynor, William Enck, Patrick McDaniel, Thomas La Porta
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

The transformation of telecommunications networks from homogeneous closed systems providing only voice services to Internet-connected open networks that provide voice and data services presents significant security challenges. For example, recent research illustrated that a carefully crafted DoS attack via text messaging could incapacitate all voice communications in a metropolitan area with little more than a cable modem. This attack highlights a growing threat to these systems; namely, cellular networks are increasingly exposed to adversaries both in and outside the network. In this paper, we use a combination of modeling and simulation to demonstrate the feasibility of targeted text messaging attacks. Under realistic network conditions, we show that adversaries can achieve blocking rates of more than 70% with only limited resources. We then develop and characterize five techniques from within two broad classes of countermeasures--queue management and resource provisioning. Our analysis demonstrates that these techniques can eliminate or extensively mitigate even the most intense targeted text messaging attacks. We conclude by considering the tradeoffs inherent to the application of these techniques in current and next generation telecommunications networks.
READ: Reliability-Guaranteed Data Forwarding Protocol of Correlated Data in Wireless Sensor Networks
Authors: Zengjun Zhang, Hong Luo
Venue: International Journal of Distributed Sensor Networks (2009)

Advances in microelectronic mechanical systems (MEMS) and wireless communication technologies have enabled wireless sensor networks (WSNs) to do a wide range of tasks, such as environmental detection, traffic monitoring, and control. WSNs are composed of hundreds or even thousands of sensor nodes. They are designed and implemented for monitoring the physical world, gathering sensed information, and transmitting the generated data packets to interested end users. In emergent event reporting applications, such as forest fire detection and toxic gas leak detection, sensor nodes detect events or phenomena respectively and report sensed data to sink node as soon as possible. WSNs are aiming at gathering integrated information rather than collecting individual data packets. Although each sensor node may seem to be lacking in capability and reliability, a collective effort of the sensor nodes may provide sensing capabilities that satisfy the end users' needs. Since generated data packets at nodes are not independent, data correlation should be taken into consideration. Instead of reporting the raw data at 100% probability, sensor nodes in READ utilize their processing abilities to carry out simple computations locally and report it at the minimal probability. It uses combined methods of multi-point coverage and multi-path forwarding but not doing in-network data aggregation. READ uses ReInforM for multi-path data packets forwarding and controls the number of copies by exploiting the data correlation among neighbor nodes with Data Correlation Processing (DCP) algorithm. To suppress data transmission, READ subtracts redundancy from data packets only using local knowledge of neighbor information and topology. Such suppression of data packets transmissions enables information gathering with the lowest traffic without compromising on the integrated information. Our simulation witnessed the fact that READ ensured the integrated information in event area was gathered and transferred to sink node at a desired level of reliability. The total data transmissions were tremendously cut down and the power consumption was dramatically economized compared with protocols not using DCP (N-DCP).
Design and implementation of the performance test system for battery-powered motorcycles
Authors: Ding-Tsair Su, Ying-Shing Shiao, Jui-Liang Yang
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The purpose of this paper is to design and implement a dynamic test platform for testing dynamic characteristics of battery-powered motorcycles (BPMs). A roller of the test platform is connected to a DC motor through a torque sensor, and a controller is designed to control the DC motor to simulate driving resistance produced when the BPM runs on various roads. The test platform can simulate each drag force when the BPM is in acceleration or in constant-speed drive, and also can simulate kinetic energy gained by the BPM when braking, deceleration and running downhill. A computer not only controls the test platform but also collects signals from sensors on the test platform and the BPM, and can analyze related data such as driving resistance, driving range, speed, kinetic energy recycle and so on. From experiment results, the BPM performance test platform can simulate various road patterns and complete automatic testing process.
Dual-Mode Blind Equalization Algorithm for High-Order QAM
Authors: Xiao Yan, Qian Wang, Kaiyu Qin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

A novel dual-mode blind equalization algorithm for high-order Quadrature Amplitude Modulation (QAM) is presented. The proposed algorithm consists of the generalized mult-mudulus algorithm (GMMA) for initial convergence during blind startup, and the decision–directed least mean square algorithm (DDLMS) which is used to enhance the performance. The two operation modes are automatic switched according to the equalizer output error level. Combined with step-size parameter variation online in each mode, the blind equalization solution can converge rapidly with low residual tap fluctuation noise. The simulation results show that the proposed techniques converge quickly and reduce the intersymbol interference (ISI) caused by the propagation channel to -43dB, with about 10dB improvement contrast to the GMMA. On the other hand, the phase rotation introduced by channel is corrected simultaneously.
A Machine Checked Soundness Proof for an Intermediate Verification Language
Authors: Frédéric Vogels, Bart Jacobs, Frank Piessens
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Machine-checked proofs of properties of programming languages have gained in importance significantly over the past few years. This paper contributes to this trend by proposing an approach for doing machine-checked soundness proofs for verification condition (VC) generators. Our approach embraces the multi-phase VC generation common in modern program verifiers. Such verifiers split the generation of VCs in two (or even more) phases, using an intermediate verification language as the bridge between the programming language and logic. In our approach, we define a formal operational semantics of the intermediate verification language, and we prove the soundness of two translations separately: (1) the translation of the intermediate verification language to VCs, and (2) the translation of the source programming language to the intermediate language. This paper presents a fully machine checked proof of step (1) for a prototypical intermediate verification language, and then illustrates step (2) for a very small object oriented programming language.
α-Gaussian mixture modelling for speaker recognition
Authors: Dalei Wu, Ji Li, Haiqing Wu
Venue: Pattern Recognition Letters (2009)

Gaussian mixture model is the conventional approach employed in speaker recognition tasks. Although it is efficient to model specific speaking characteristics of a speaker, especially in quiet environments, its performance in noisy conditions is still far from the human cognitive process. Recently, a new method of @a-integration of stochastic models has been proposed based on psychophysical experiments that suggests @a-integration is used in a human brain. In this paper, we proposed a method to extend the conventional GMM to the @a-integrated GMM (@a-GMM) to model personal speaking traits. Model parameters were re-estimated recursively based on a given data set. The experiments showed that the new approach significantly outperforms the traditional method, especially on telephony speech.
Applications of digital optical disks in library preservation and reference
Authors: William R. Nugent
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A Library of Congress pilot project is described in which digital optical disks will be used to provide high-density storage of textual page images. The configuration of the system is shown and the advantages of optical storage for preservation of library materials is explained. It is further shown that while library preservation is the primary objective of the project, the characteristics of digital optical disk provide simultaneous advantages in online reference retrieval. The project plan is described; it calls for scanning and storing one million pages of text over a two-year period. The new system is compared to the library's existing digital optical disk system for demand printing of catalog cards. The future of digital optical disks in libraries is then discussed.
Collective optical response from quantum dot molecules
Authors: Anna Sitek, Paweł Machnikowski
Venue: Microelectronics Journal (2009)

We study theoretically selected aspects of the collective interaction between two coupled quantum dots (QDs) forming a quantum dot molecule (QDM) and the modes of the electromagnetic field, as manifested in the optical response of QDMs under various experimental conditions. Unlike atomic systems, the artificial QD structures show shape and size inhomogeneity, which has to be included in the theoretical description. Moreover, for tightly spaced QDMs, coupling between the QDs cannot be neglected.
Variance estimation of survey estimates calibrated on estimated control totals-An application to the extended regression estimator and the regression composite estimator
Authors: Yves G. Berger, Juan F. Muñoz, Eric Rancourt
Venue: Computational Statistics Data Analysis (2009)

Calibration on control totals is commonly used for survey weighting. It is usually assumed that these totals are values known without sampling errors. However, they can be estimated from other sources. A variance estimator that takes into account the randomness of control totals is derived. Several situations such as calibration on external sources and calibration with sampling on two occasions are investigated. The methodology proposed is general and can be implemented in various situations when control totals are estimated.
An information hiding scheme by applying the dynamic programming strategy to LSB matching revisited
Authors: Chi-Shiang Chan, Ching-Yun Chang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In 2006, Mielikainen proposed LSB matching revisited to achieve image hiding. This method is able to embed two secret bits into a pair of cover pixels by adding or subtracting one from either of the pixel values of the cover pixels. In this paper we apply a dynamic programming strategy to LSB matching revisited, so as to further reduce the number of modified pixels. First, our method produces an optimal substitution table for LSB matching revisited by using the dynamic programming strategy. The secret data are then transformed according to the substitution table. Finally, the transformed secret data are embedded into a cover image by using LSB matching revisited. As shown in our experimental results, the number of modified pixels in our method is fewer than that in LSB matching revisited.
Learning How To Discover Requirements
Authors: Ljerka Beus-Dukic, Ian Alexander
Venue: Proceedings of the 2008 Requirements Engineering Education and Training (2008)

Requirements Engineering (RE) is traditionally taught in academia using an RE process which starts from a well-defined problem. Our approach focuses on the early stages of requirements discovery where students have to learn both about the application domain and about what stakeholders feel is the problem. The approach comprises all the basic elements of requirements, and ways to discover them using many small discovery cycles. In this position paper we outline the rationale for our approach and reflect on our initial experiences with teaching undergraduate RE module using this approach.
Multimedia Features in the Correspondents' Interface of MALL2000 Systems
Authors: Hans-Jurgen Hoffmann
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

MALL2000 systems are intended to support businessmen, the correspondents, in their day-to-day tasks for establishing business relations on an international level. Tasks considerd are based on handling "multimedia documents" allowing flexible group activities. All services offered by a correspondent to the partners are provided in an uniform fashion in a peer-to-peer structure, realized on the World Wide Web.The paper covers principal aspects and design approaches for correspondents' interfaces. They are "document-centred", relying on an advanced concept of what "multimedia" features offer for business-to-business applications. Previous work (Hot...-framework) is starting point for work under the MALL-2000 project and is discussed in the context of a broader approach of an electronic commerce approach. The Hot...-framework allows easy inclusion of hierarchically structured and possibly self-active multimedia parts into a business document.
A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides' primal-dual simplex-type algorithm
Authors: Pablo Guerrero-Garcia, Angel Santos-Palomo
Venue: Optimization Methods Software (2009)

In a recent primal-dual simplex-type algorithm (K. Paparrizos, N. Samaras and G. Stephanides, A new efficient primal dual simplex algorithm, Computers & Operations Research 30 (2003), pp. 1383-1399), its authors show how to take advantage of the knowledge of a primal feasible point and they work with a square basis during the whole process. In this paper we address what could be thought of as its deficient-basis dual counterpart by showing how to take advantage of the knowledge of a dual feasible point in a deficient-basis simplex-type environment. Three small examples are given to illustrate how the specific pivoting rules designed for the proposed algorithm deal with non-unique dual solutions, unbounded dual objectives and a classical exponential example by Goldfarb, thus avoiding some caveats of the dual simplex method. Practical experiments with a new collection of difficult problems for the dual simplex method are reported to justify iteration decrease, and we sketch some details of a sparse projected-gradient implementation in terms of Davis and Hager's CHOLMOD sparse Cholesky factorization (which is row updatable/downdatable) to solve the underlying least-squares subproblems, namely linear least-squares problems and projections onto linear manifolds.
Subcarrier Allocation for Multiuser OFDM System Based on Throughput
Authors: Po-Hao Chang, Chia-Hong Jhang, Kuo-Hsiang Kuo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Orthogonal Frequency Division Multiple Access (OFDMA) becomes one of the high data rate wireless communication systems in recent years, and is a multi-user technique derived from Orthogonal Frequency Division Multiplexing (OFDM). Each user has different channel response due to the propagation path, and uses the proper modulation and allocation on subcarriers to get higher transmission rate. Subcarrier allocation and adaptive modulation techniques are subject to multi-user diversity and feedback channel state information. In this paper, we propose a throughput-based subcarrier allocation, and compare three referred algorithms with the proposed method to those without the proposed method, in different channel states. We propose two algorithms to compare with those algorithms, and the simulation results show that the proposed method achieves better performance than that of the referred algorithms with the maximum data rate.
Software model checking is a rich research field
Authors: Antti Valmari
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2009)

This introductory paper has been written for readers who know nothing about model checking but do know about software. Its aim is to present, almost without mathematical terms, the fundamental general approaches on which the papers in this Special Section build, and give an idea of what kind of contribution each paper makes. The main issues discussed are motivation for model checking, state spaces, and bounded model checking with sat solvers. Individual papers lead to discuss the following ideas: exploiting a distributed computing environment for model checking, constructing those states first that look most promising for eventually finding errors, only constructing a representative subset of states, the representation of contents of variables in an abstract way with approximation from below, and the use of more general solvers than sat solvers in bounded model checking.