ppxscal/embedding_network huggingface dataset:
Visualizing the Results of Metabolic Pathway Queries
Authors: Allison P. Heath, George N. Bennett, Lydia E. Kavraki
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Biology contains a wealth of network data, such as metabolic, transcription, signaling and protein-protein interaction networks. Our research currently focuses on metabolic networks, although similar ideas may be applied to other biological networks. Metabolic networks consist of the chemical compounds and reactions necessary to support life. Traditionally, series of successive metabolic reactions have been organized into simple metabolic pathways and manually drawn. However, as we move into the era of systems biology, it is becoming apparent that automated ways of processing and visualizing metabolic networks must be developed.
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
Authors: Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. In this paper a structural description for unigraphs is introduced: vertex set is partitioned into three disjoint sets while edge set is divided into two different classes. This characterization allows us to design a linear time recognition algorithm that works recursively pruning the degree sequence of the graph. The algorithm detects two particular graphs whose superposition generates the given unigraph.
BALDR-1: a solar thermal system simulation
Authors: Joseph G. Finegold, F. Ann Herlevich
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

A system simulation, BALDR-1, was written to model the performance of solar thermal systems. The original application was to model the performance and economics of 0.1--10 MWe solar thermal electric power plants. It has subsequently been used in receiver selective surface value analysis and in thermal storage value analysis, and is being adapted currently to model industrial process heat systems.
Reducing memory requirements of resource-constrained applications
Authors: P. Unnikrishnan, G. Chen, M. Kandemir, M. Karakoy, I. Kolcu
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

Embedded computing platforms are often resource constrained, requiring great design and implementation attention to memory-power-, and heat-related parameters. An important task for a compiler in such platforms is to simplify the process of developing applications for limited memory devices and resource-constrained clients. Focusing on array-intensive embedded applications to be executed on single CPU-based architectures, this work explores how loop-based compiler optimizations can be used for increasing memory location reuse. Our goal is to transform a given application in such a way that the resulting code has fewer cases (as compared to the original code), where the lifetimes of array elements overlap. The reduction in lifetimes of array elements can then be exploited by reusing memory locations as much as possible. Our experimental results indicate that the proposed strategy reduces data space requirements of 15 resource constrained applications by more than 40&percnt;, on average. We also demonstrate how this strategy can be combined with data locality (cache behavior)--enhancing techniques so that a compiler can take advantage of both, that is, reduce data memory requirements and improve data locality at the same time.
Priority mix planning for cycle time-differentiated semiconductor manufacturing services
Authors: Shi-Chung Chang, Shin-Shyu Su, Ke-Ju Chen
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. This paper studies a priority mix planning (PMP) problem that determines the wafer release rates of individual priorities to maximize fab profit subject to XFT and capacity constraints. It is formulated as a nonlinear programming problem, where the constraints integrate an extended M/G/m:PR queue approximation with contribution theory-based network for modeling how X-factors of individual priorities are affected by priority mix and fab capacity utilization. It is then demonstrated over a realistic fab example that PMP problem can be solved for effectively planning priority mix and machine tool capacity utilization to provide cycle-time differentiated manufacturing services.
Estimation of current-induced scour depth around pile groups using neural network and adaptive neuro-fuzzy inference system
Authors: Mohammad Zounemat-Kermani, Ali-Asghar Beheshti, Behzad Ataie-Ashtiani, Saeed-Reza Sabbagh-Yazdi
Venue: Applied Soft Computing (2009)

The process of local scour around bridge piers is fundamentally complex due to the three-dimensional flow patterns interacting with bed materials. For geotechnical and economical reasons, multiple pile bridge piers have become more and more popular in bridge design. Although many studies have been carried out to develop relationships for the maximum scour depth at pile groups under clear-water scour condition, existing methods do not always produce reasonable results for scour predictions. It is partly due to the complexity of the phenomenon involved and partly because of limitations of the traditional analytical tool of statistical regression. This paper addresses the latter part and presents an alternative to the regression in the form of artificial neural networks, ANNs, and adaptive neuro-fuzzy inference system, ANFIS. Two ANNs model, feed forward back propagation, FFBP, and radial basis function, RBF, were utilized to predict the depth of the scour hole. Two combinations of input data were used for network training; the first input combination contains six-dimensional variables, which are flow depth, mean velocity, critical flow velocity, grain mean diameter, pile diameter, distance between the piles (gap), besides the number of piles normal to the flow and the number of piles in-line with flow, while the second combination contains seven non-dimensional parameters which is a composition of dimensional parameters. The training and testing experimental data on local scour at pile groups are selected from several precious references. Networks' results have been compared with the results of empirical methods that are already considered in this study. Numerical tests indicate that FFBP-NN model provides a better prediction than the other models. Also a sensitivity analysis showed that the pile diameter in dimensional variables and ratio of pile spacing to pile diameter in non-dimensional parameters are the most significant parameters on scour depth.
A New Analysis of Expected Revenue
Authors: Arne Andersson, Jim Wilenius
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We address the fundamental issue of revenue and efficiency in the combinatorial and simultaneous auction using a novel approach. Specifically, upper and lower bounds are constructed for the first-price sealed-bid setting of these two auctions.The question of revenue is important yet very few results can be found in the literature. Only for very small instances with 2 items have comparisons been made. Krishna et al. find that allowing combinatorial bids result in lower revenue compared to a second price simultaneous auction.We formulate a lower bound on the first-price combinatorial auction and an upper bound on the first-price simultaneous auction in a model where bidders have synergies from winning a specific set of items. With these bounds, we can (i) prove that asymptotically as the number of bidders increase, the combinatorial auction will be revenue-superior, and (ii) present a number of concrete examples where combinatorial auctions give higher expected revenue.
Bayesian Image Retrieval in Biometric Databases
Authors: Baback Moghaddam, Alex Pentland
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We demonstrate a Bayesian technique for direct visual matching of biometric images for the purposes of face recognition and retrieval, using a probabilistic measure of facial similarity. This technique differs significantly from simpler methods which are based on standard Euclidean norms on image feature vectors (template matching) or subspace-restricted norms (eigenspace matching). Our similarity measure is based primarily on a statistical analysis of the observed inter-image differences in the database. The performance advantage of this probabilistic matching technique over a standard Euclidean (nearest-neighbor) eigenspace technique has been demonstrated in DARPA's ``FERET'' face recognition competition, in which our probabilistic retrieval algorithm was found to be a top performer.
Reconfigurable receiver approach for future wireless terminals
Authors: Ralf Kakerow, Georg Boeck
Venue: Analog Integrated Circuits and Signal Processing (2009)

An overview on RF-front-end architectures and technologies for future reconfigurable mobile communication is given. A favourable solution for fourth mobile generation is an extension of traditional cellular parameters by OFDM-based systems like WLAN. Therefore, an approach for widely reconfigurable receivers considering a variety of different standards, with the example of combining WCDMA and WLAN front-end into one architecture, is presented in this paper. RF-front-end key components like low noise amplifiers, mixers, and frequency synthesizers, as well as baseband variable gain amplifiers and filters are treated, particularly with regard to reconfigurable systems.
Improved Cross Authentication Model Based on Threshold Method in Wireless Network
Authors: Yatao Yang, Shaoming Pan
Venue: International Journal of Distributed Sensor Networks (2009)

A novel cross authentication model is proposed based on (t, n) threshold method in Layered and Grouped Structure (LGS) wireless multi-hop network, the issues of cross authentication and secure communication between nodes in different trusted domains are settled. With no CA, new scheme of cross certificate being issued and validated is designed, by which, the node identification can be authenticated in different trusted domains.
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Authors: Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Venue: Fundamenta Informaticae (2009)

The aim of this paper is to describe a quadratic algorithm for computing the equation K-automaton of a regular K-expression as defined by Lombardy and Sakarovitch. Our construction is based on an extension to regular K-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton.
The three-sixty illusion: designing for immersion in pervasive games
Authors: Annika Waern, Markus Montola, Jaakko Stenros
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Pervasive games are staged in reality and their main attractiveness is generated by using reality as a resource in the game. Yet, most pervasive games that use mobile and location-based technology use reality only in a weak sense, as the location for a computerized game. In this article we analyze two game practices, Nordic style live action role-playing (larp) and alternate reality games (ARG), that instead use reality as their main game resource. We analyze how they go about creating a believable game world and encourage the players to actively take part in this world. We present two example games that do the same with the support of technology, effectively realizing an immersive game world through a combination of physical play and technology-supported play.
On the relationship between limit spaces, many valued topological spaces, and many valued preorders
Authors: Lingqiang Li, Dexue Zhang
Venue: Fuzzy Sets and Systems (2009)

Let (L,*,1) be a residuated complete lattice with the underlying lattice L a meet continuous lattice. This paper presents a systematic investigation of the interrelationship between the categories of limit spaces, L-topological spaces, and L-preorders. The results exhibit a close connection between these different mathematical structures.
A Novel Motion-Based Active Video Indexing Method
Authors: Jie Wei, Izidor Gertner, Ze-Nian Li
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, a novel motion-based active video indexing scheme is proposed for videos acquired from active visual systems. With the Foveate Wavelet Transform as the representation of active videos, the description for the object of primary interest during smooth pursuit can be generated in the foveal area based on the behavior of the motion field estimated by a two-pass motion estimation MRF-MAP algorithm. Afterwards, a vector of 36 numbers is generated as the index for the object. Furthermore, the attention shift camera motion can be detected by use of this motion field, which is employed as another important indicator of the video contents. The efficacy of this active object-based video indexing scheme is demonstrated through extensive experiments.
Technical Note: Combined approximation for reanalysis of complex eigenvalues
Authors: Liang Ma, Su Huan Chen, Guang Wei Meng
Venue: Computers and Structures (2009)

Based on the Kirsch combined approximation and the second order perturbations, a new reanalysis method for complex eigenvalues of modified structures is given. The accuracy of the results obtained by the proposed method is improved compared with those obtained only by the second order perturbations. Two numerical examples are presented to illustrate the validity and improvements of the proposed method and the results show that the new method is effective even if large modifications of structural parameters are made.
A stochastic analysis of an iterative semi-blind beamformer for TDMA systems
Authors: Myung-Hoon Yeon, John J. Shynk
Venue: Signal Processing (2009)

We describe an iterative semi-blind (SB) beamforming algorithm for time-division multiple-access (TDMA) systems and analyze its performance using a stochastic model. A least-squares approximation for constant modulus signals leads to a relatively simple and practical SB algorithm. The beamformer weights are calculated using a two-step procedure: initial weights are computed using training data and these are refined by the SB algorithm. The main goal of this paper is to analyze the beamforming algorithm using Wiener filter theory. In one approach, we develop a stochastic model using a Gaussian approximation that simplifies a fourth-order moment of the array data. We also provide an exact analysis and compare the results with that of the Gaussian approximation. Furthermore, we compare the proposed SB algorithm with the regularized semi-blind (RSB) technique using simulated and real TDMA data. The performance of the SB algorithm is also analyzed with short as well as long training data sequences in asynchronous interference scenarios. Experimental results show that the proposed SB beamforming algorithm suppresses cochannel interference affecting the coded data, and outperforms the RSB algorithm.
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
Authors: Reynold Cheng, Lei Chen, Jinchuan Chen, Xike Xie
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these uncertain databases, an important query is the Probabilistic k-Nearest-Neighbor Query (k-PNN), which computes the probabilities of sets of k objects for being the closest to a given query point. The evaluation of this query can be both computationally- and I/O-expensive, since there is an exponentially large number of k object-sets, and numerical integration is required. Often a user may not be concerned about the exact probability values. For example, he may only need answers that have sufficiently high confidence. We thus propose the Probabilistic Threshold k-Nearest-Neighbor Query (T-k-PNN), which returns sets of k objects that satisfy the query with probabilities higher than some threshold T. Three steps are proposed to handle this query efficiently. In the first stage, objects that cannot constitute an answer are filtered with the aid of a spatial index. The second step, called probabilistic candidate selection, significantly prunes a number of candidate sets to be examined. The remaining sets are sent for verification, which derives the lower and upper bounds of answer probabilities, so that a candidate set can be quickly decided on whether it should be included in the answer. We also examine spatially-efficient data structures that support these methods. Our solution can be applied to uncertain data with arbitrary probability density functions. We have also performed extensive experiments to examine the effectiveness of our methods.
On the path to building a community of programs
Authors: E. Z. Lyubimskii
Venue: Programming and Computing Software (2009)

The grid project is the next step on the path to the creation of a worldwide artificial mind. For example, the Internet made it possible for people not to care about the place where the information is stored and how it is delivered. The grid allows people not to care about where and which resources are used to execute their programs. The next step will make it possible not to care about what programs are used to perform the desired tasks. It will be sufficient to set a task and programs will find and organize themselves so as to perform it. Even this step will not be the last one. All these features define the process of creating the universal mind from outside, that is, from the viewpoint of users. It is also important to see the internal substance of this process. From the inside, this is the process of creating a global community of programs.In the first decades of software development, the key problem was creating increasingly complicated and clever programs. Beginning in the 1990s, the main problem changed: now, it is to ensure the coexistence and cooperative operation of programs. This is a quite objective process, and it is governed by certain laws of which we mention two. First, the structure of the community of programs and the means of their interaction are largely similar to the structure and means of interaction in human society. Second, the human society becomes increasingly dependent on the community of programs, while the community of programs gradually becomes less dependent on the participation of people in its activity. Some day, the community of programs will become all-sufficient. It is a very important and many-sided question how the relationship between the human society and the community of programs will develop, and we must start studying this problem now.As the first step, I propose to build a model of the future community of programs involving researchers of various specialities. The study of this model will enable us to correctly guide the construction of the community of programs.
Multigrid method for solving convection-diffusion problems with dominant convection
Authors: Galina V. Muratova, Evgeniya M. Andreeva
Venue: Journal of Computational and Applied Mathematics (2009)

A modification of the multigrid method for the solution of linear algebraic equation systems with a strongly nonsymmetric matrix obtained after difference approximation of the convection-diffusion equation with dominant convection is proposed. Specially created triangular iterative methods have been used as the smoothers of the multigrid method. Some theoretical and numerical results are presented.
Reduced Memory Zerotree Coding Algorithm for Hardware Implementation
Authors: Wen-Kuo Lin, Brian Wai-Him Ng, Neil Burgess, Abdesselam Bouzerdoum
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a color image zerotree coding algorithm with a significantly reduced memory requirement, thus making it hardware implementation friendly. The memory reduction was achieved by using the lifted wavelet transform and Listless Zerotree Coding (LZC).The lifted wavelet transform has a lower memory requirement and lower implementation complexity than the traditional filter bank implementation. Unlike other zerotree coding algorithms such as Said and Pearlman's SPIHT, our LZC algorithm uses no lists during encoding and decoding. Without the lists, the memory requirement for the VLSI implementation is reduced significantly. PSNR values for LZC are only slightly lower than SPIHT's. Our approach illustrates well the trade-off between memory requirement and compressed image quality.
Flexible forward error correction codes with application to partial media data recovery
Authors: Jari Korhonen, Pascal Frossard
Venue: Image Communication (2009)

Conventionally, linear block codes designed for packet erasure correction are targeted to recover all the lost source packets per block, when the fraction of lost data is smaller than the redundancy overhead. However, these codes fail to recover any lost packets, if the number of erasures just exceeds the limit for full recovery capability, while it can still be beneficial to recover part of the symbols. In addition, common linear block codes are not well suited for unequal error protection, since different block codes with different rates must be allocated for each priority class separately. These two problems motivate the design of more flexible forward error correction (FEC) codes for media streaming applications. We first review the performance of short and long linear block codes. Long block codes generally offer better error correction capabilities, but at the price of higher complexity and larger coding delay. Short block codes can be more appropriate in media streaming applications that require smooth performance degradation when the channel loss rate increases. We study a new class of linear block codes using sparse generator matrices that permit to optimize the performance of short block codes for partial recovery of the lost packets. In addition, the proposed codes are extended to the design of unequal erasure protection solutions. Simulations of practical video streaming scenarios demonstrate that the flexible sparse codes offer a promising solution with interesting error correction capabilities and small variance in the residual loss rate. They typically represent an effective trade-off between short block codes with limited flexibility, and long block codes with delay penalties.
A Procedure to Develop Metrics for Currency and its Application in CRM
Authors: B. Heinrich, M. Klier, M. Kaiser
Venue: Journal of Data and Information Quality (JDIQ) (2009)

Due to the importance of using up-to-date data in information systems, this article analyzes how the data-quality dimension currency can be quantified. Based on several requirements (e.g., normalization and interpretability) and a literature review, we design a procedure to develop probability-based metrics for currency which can be adjusted to the specific characteristics of data attribute values. We evaluate the presented procedure with regard to the requirements and illustrate the applicability as well as its practical benefit. In cooperation with a major German mobile services provider, the procedure was applied in the field of campaign management in order to improve both success rates and profits.