ppxscal/embedding_network huggingface dataset:
Evolving Web Search Expressions
Authors: Vaclav Sna_el, Pavel Kromer, Suhail Owais, H. O. Nyongesa, S. Maleki-dizaji
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

As the volume and variety of information sources, especially on the World Wide Web (WWW), continues to grow, the requirements imposed on search applications are steadily increasing. The amount of available data is growing and so do user demands. Search application should provide the users with accurate, sensible responses to their requests. It is difficult to provide information that accurately matches user information needs. Search effectiveness can be seen as the accuracy of matching user information needs against the retrieved information. There are problems emerging: users often do not present search queries in the form that optimally represents their information need, the measure of a document's relevance is often highly subjective between different users and information sources might contain heterogeneous documents, in multiple formats and the representation of documents is not unified. This contribution presents a proposal to improve web search effectiveness via evolutionary optimization of Boolean and vector search queries based on individual user models.
On the Evaluation of Finite Hilbert Transforms
Authors: Mohankumar Nandagopal, Natarajan Arunajadai
Venue: Computing in Science and Engineering (2007)

The authors give a simple, efficient, and easy-to-implement prescription for numerically evaluating finite Hilbert transforms.
A Fast SAR Target Recognition Approach Using PCA Features
Authors: Zhiguo He, Jun Lu, Gangyao Kuang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The real-time ability and recognition rate are two primary goals for evaluating the performance of an SAR image target recognition system. This paper concentrates on the analysis of key factors which influence these two goals. According to the analysis, a fast SAR target recognition approach is proposed, which utilizes a self-organizing neural network trained with the Hebbian rule to extract the principal component features and a multi-layer neural perceptron network as the classifier. The experimental results show that it consumes little memory and runs very fast with a considerable recognition rate, thus can be used in a real-time application.
A low power fully CMOS integrated RF transceiver IC for wireless sensor networks
Authors: Hae-Moon Seo, YeonKug Moon, Yong-Kuk Park, Dongsu Kim, Dong-Sun Kim, Youn-Sung Lee, Kwang-Ho Won, Seong-Dong Kim, Pyung Choi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A fully CMOS integrated RF transceiver for ubiquitous sensor networks in sub-gigahertz industrial, scientific, and medical (ISM)-band applications is implemented and measured. The integrated circuit is fabricated in 0.18-µm CMOS technology and packaged in leadless plastic chip carrier (LPCC) package. The fully monolithic transceiver consists of a receiver, a transmitter, and an RF synthesizer with on-chip voltage-controlled oscillator. The chip fully complies with the IEEE 802.15.4 wireless personal area network in sub-gigahertz mode. The cascaded noise figure of the overall receiver is 9.5 dB and the overall transmitter achieves less than 6.3% error vector magnitude for 40 kb/s mode. The chip uses 1.8-V power supply and the power consumption is 25 mW for reception mode and 29 mW for transmission mode.
Robust Binarization for Video Text Recognition
Authors: Z. Saidane, C. Garcia
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents an automatic binarization method for color text areas in images or videos, which is robust to complex background, low resolution or video coding arte- facts. Based on a specific architecture of convolutional neu- ral networks, the proposed system automatically learns how to perform binarization, from a training set of synthesized text images and their corresponding desired binary images, without making any assumptions or using tunable parame- ters. The proposed method is compared to state-of-the-art binarization techniques, with respect to Gaussian noise and contrast variations, demonstrating the robustness and the efficiency of our method. Text recognition experiments on a database of images extracted from video frames and web pages, with two classical OCRs applied on the obtained bi- nary images show a strong enhancement of the recognition rate by more than 40%.
A Statistical Model for Estimating the Effect of Process Variations on Delay and Slew Metrics for VLSI Interconnects
Authors: J. V. R. Ravindra, M. B. Srinivas
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

For optimizations like placement, interconnect synthesis and static timing analysis, efficient interconnect delay computation is critical for RC networks. Because of its simple closed form and fast evaluation, the Elmore delay model has been widely used. The other delay metrics PRIMO and H-gamma match the first three circuit moments to the probability density function (PDF) of a Gamma statistical distribution. Although these methods demonstrate impressive accuracy compared to other delay metrics, their implementations tend to be challenging. In this paper simple and efficient two-parameter analytic expressions for both delay and slew, based on Erlang distribution (ERD) function, are presented under process variations. The effectiveness of the proposed metrics for RC trees is proved through experimental results.
RPDE3: A Framework for Integrating Tool Fragments
Authors: W. Harrison
Venue: IEEE Software (1987)

Monolithic tools that can't be extended to handle new kinds of input, not just new function, are hampering development. This model seeks to change that.
Vibroacoustic FE analysis of an adaptive plate with PZT actuator/sensor pairs connected to a multiple-mode, electric shunt system
Authors: C. H. Nguyen, S. J. Pietrzko
Venue: Finite Elements in Analysis and Design (2007)

The present work aims to simulate, using the finite element method (FEM), the piezo-shunting of a PZT actuated vibrating plate, i.e. the connection to a collocated PZT sensor of a multiple-mode electric shunt system to damp the plate vibration. The simulation is further extended to some vibroacoustical aspects, to show the piezoelectric-vibrational-acoustic frequency response, and also the free sound radiation of the plate into air. The FEM analytical basis of the piezo-shunted vibrating plate and its sound radiation are reviewed together with the description and FE formulation of the electric shunt system. The piezo-shunting effect in the damping of the plate vibration is smaller than in the case of a beam, because not all the eigenmodes can be actuated or damped. This effect, which is more apparent at higher frequencies, depends strongly on the position of the plate, but not on the thickness, of the PZT sensor. The acoustic radiation peaks results are good in the same eigenfrequencies as the mechanical vibration peaks of the plate, but with a much larger damping width.
An accurate closed-form formula for the throughput of long-lived TCP connections in IEEE 802.11 WLANs
Authors: Raffaele Bruno, Marco Conti, Enrico Gregori
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

There is a vast literature on the performance modeling of the 802.11 MAC protocol, but the interplay between the TCP dynamics and the self-regulating behavior of the 802.11 CSMA/CA access method has not been sufficiently investigated. In addition, it has been observed that TCP stations in a WLAN are sporadically active due to the TCP flow control mechanisms. This makes traditional saturated models of the network capacity of 802.11 WLANs not very accurate. We presented a rigorous analytical model to calculate the distribution of the number of active TCP stations in a WLAN with multiple long-lived TCP flows [R. Bruno, M. Conti, E. Gregori, Performance modelling and measurements of TCP transfer throughput in 802.11-based WLAN, in: Proceedings of the IEEE MsWiM 2006, Torremolinos, Malaga, Spain, 2006, pp. 4-11, [1]]. Starting from this analysis, in this paper we derive a simple but accurate closed-form expression of the per-connection TCP throughout as a function of the average duration of collisions, the average backoff period and the TCP packet size. We validate this formula through performance tests carried out on a real WLAN. Then, we use our model to mathematically study the optimal minimum contention window size to maximize the TCP throughput. Our analytical results indicate that the initial window size specified in the 802.11b standard is about two times larger than the optimal one. However, we also show that the TCP throughput performance is not very sensitive to changes of the minimum contention window size, and that the TCP flows significantly underutilize the channel bandwidth also in the optimal MAC operating state.
The Digital Logic Subject Area
Authors: W. Fletcher
Venue: Computer (1977)

As discussed in A Curriculum in Computer Science and Engineering-and shown in Figure 1, the digital logic course area includes the following four components:
Testing Strategy and Technique for Macro-Based Circuits
Authors: F. Somenzi
Venue: IEEE Transactions on Computers (1985)

The increasing complexity of VLSI systems demands structured approaches to reduce both design time and test generation effort. PLA's and scan paths have both been widely reported to be efficient in this sense. This correspondence presents an easily testable structure and its related testing strategies. The circuits are assumed to be based on the interconnection of combinatorial macros, mostly implemented by PLA's; tests are generated locally, considering the involved macro as an isolated item, and then are expressed in terms of primary inputs and outputs using a topological approach as general strategy and algebraic techniques for the propagation of signals through macros. Propagation is dealt with by new algorithms. Since the problem of test generation is NP-hard, a set of heuristics is introduced to keep the amount of computation reasonable; several implementation issues are finally investigated.
Improved application of the oscillating method for the isoelectric point determination of protein: Potential connection with protein data banks
Authors: Andrés Maldonado, Francisco Vara, Antonio Sillero
Venue: Computers in Biology and Medicine (2008)

The oscillating method (OM) for the theoretical determination of the pI values, one by one, of proteins and other macromolecules has been previously published [Sillero and Maldonado, Comput. Biol. Med 36 (2006) 157-166]. An improved application of the method, here named as improved oscillating method (IOM), allows the pI determination of group of proteins. This characteristic may be useful to explore the pI value and electric charge of family of enzymes. As an example the pI values of 1630 enzymes collected in a Swiss-Prot data bank (www.expasy.org), as belonging to the enzymes ligases (EC 6. 2. 1. *) is presented. The method also permits the determination of the pI value of any group of proteins stored in data banks provided that they can be supplied to the program in a FASTA format. Free access to IOM can be reached at http://www.bq.uam.es/otros/pical3.zip.
Improve retrieval accuracy for difficult queries using negative feedback
Authors: Xuanhui Wang, Hui Fang, ChengXiang Zhai
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

How to improve search accuracy for difficult topics is an under-addressed, yet important research question. In this paper, we consider a scenario when the search results are so poor that none of the top-ranked documents is relevant to a user's query, and propose to exploit negative feedback to improve retrieval accuracy for such difficult queries. Specifically, we propose to learn from a certain number of top-ranked non-relevant documents to rerank the rest unseen documents. We propose several approaches to penalizing the documents that are similar to the known non-relevant documents in the language modeling framework. To evaluate the proposed methods, we adapt standard TREC collections to construct a test collection containing only difficult queries. Experiment results show that the proposed approaches are effective for improving retrieval accuracy of difficult queries.
Locating sensors in paths and cycles: The case of 2-identifying codes
Authors: David L. Roberts, Fred S. Roberts
Venue: European Journal of Combinatorics (2008)

For a graph G and a set D@?V(G), define N"r[x]={x"i@?V(G):d(x,x"i)@?r} (where d(x,y) is graph theoretic distance) and D"r(x)=N"r[x]@?D. D is known as an r-identifying code if for every vertex x,D"r(x)y@?D"r(x)
Opinion retrieval from blogs
Authors: Wei Zhang, Clement Yu, Weiyi Meng
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Opinion retrieval is a document retrieval process, which requires documents to be retrieved and ranked according to their opinions about a query topic. A relevant document must satisfy two criteria: relevant to the query topic, and contains opinions about the query, no matter if they are positive or negative. In this paper, we describe an opinion retrieval algorithm. It has a traditional information retrieval (IR) component to find topic relevant documents from a document set, an opinion classification component to find documents having opinions from the results of the IR step, and a component to rank the documents based on their relevance to the query, and their degrees of having opinions about the query. We implemented the algorithm as a working system and tested it using TREC 2006 Blog Track data in automatic title-only runs. Our result showed 28% to 32% improvements in MAP score over the best automatic runs in this 2006 track. Our result is also 13% higher than a state-of-art opinion retrieval system, which is tested on the same data set.
Ink Annotations and their Anchoring in Heterogeneous Digital Documents
Authors: X. Wang, S. Raghupathy
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

The analysis, especially the anchoring, of free form ink annotations on mixed content digital documents is more difficult than that of documents containing only text. In this paper, first, we present our work on analyzing the common user scenarios of ink annotations and their anchoring in such an environment, and we also present a unified way to define and analyze the anchoring of different types of an- notations. Then we describe how our ink parsing system integrates the anchoring of and annotation with the recog- nition of its type. The method can be used in a real time heterogeneous document analysis system.
Next Generation Test, Diagnostics and Yield Challenges for EDA, ATE, IP and Fab - A Perspective from All Sides
Authors: Yasuharu Kohiyama, C. P. Ravikumar, Yasuo Sato, Laung-Terng Wang, Yervant Zorian
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The Test industry has come a long way over the past few decades. As a whole we have made great strides in the areas of:
Who wants to terminate the game? The role of vested interests and metaplayers in the ATOLLGAME experience
Authors: Anne Dray, Pascal Perez, Christophe Le Page, Patrick D'Aquino, Ian White
Venue: Simulation and Gaming (2007)

Low coral islands are heavily dependent on groundwater for freshwater supplies. The declaration by the government of Kiribati of water reserves over privately owned land has led to conflicts, illegal settlements, and vandalism. Also, the water consumption tends to increase toward Western-like standards, and human pollution has already contaminated most freshwater lenses. This project aims to provide relevant information to local stakeholders to facilitate dialogue and devise sustainable water management practices. A computer-assisted role-playing game is implemented to fulfill this aim. The following three-stage methodology is applied: collecting local and expert knowledge, blending the di ferent viewpoints into a game-based model, and playing the game with the di ferent stakeholders to explore di ferent scenarios. Although game sessions delivered successful outcomes, the final stage of the project is characterized by the upheaval of contradictory government stands that undermine the whole process. It is argued that heterogeneous viewpoints may be handled in a satisfactory manner during the gaming sessions but that long-term hidden agendas may override the outcomes. Beyond the inherent question of legitimacy attached to such approaches, some players clearly must deal with constraints that are often genuinely considered external to the ongoing negotiation process.
Faster ARMA maximum likelihood estimation
Authors: A. I. McLeod, Y. Zhang
Venue: Computational Statistics Data Analysis (2008)

A new likelihood based AR approximation is given for ARMA models. The usual algorithms for the computation of the likelihood of an ARMA model require O(n) flops per function evaluation. Using our new approximation, an algorithm is developed which requires only O(1) flops in repeated likelihood evaluations. In most cases, the new algorithm gives results identical to or very close to the exact maximum likelihood estimate (MLE). This algorithm is easily implemented in high level quantitative programming environments (QPEs) such as Mathematica, MatLab and R. In order to obtain reasonable speed, previous ARMA maximum likelihood algorithms are usually implemented in C or some other machine efficient language. With our algorithm it is easy to do maximum likelihood estimation for long time series directly in the QPE of your choice. The new algorithm is extended to obtain the MLE for the mean parameter. Simulation experiments which illustrate the effectiveness of the new algorithm are discussed. Mathematica and R packages which implement the algorithm discussed in this paper are available [McLeod, A.I., Zhang, Y., 2007. Online supplements to ''Faster ARMA Maximum Likelihood Estimation'', ]. Based on these package implementations, it is expected that the interested researcher would be able to implement this algorithm in other QPEs.
Segmenting Moving Objects in MPEG Videos in the Presence of Camera Motion
Authors: Ralph Ewerth, Martin Schwalb, Paul Tessmann, Bernd Freisleben
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The distinction of translational and rotational camera motion and the recognition of moving objects is an important topic for scientific film studies. In this paper, we present an approach to distinguish between camera and object motion in MPEG videos and provide a pixel-accurate segmentation of moving objects. Compressed domain features are used as far as possible in order to reduce computation time. First, camera motion parameters are estimated and translational movements are distinguished from rotational movements based on a three-dimensional (3D) camera model. Then, motion vectors which do not fit to the camera motion estimate are assigned to object clusters. The moving object information is utilized to refine the camera motion estimate, and a novel compressed domain tracking algorithm is applied to verify the temporal consistency of detected objects. In contrast to previous approaches, the tracking of both moving objects and background allows to perform their separation iteratively only once per shot. The object boundary is estimated with pixel accuracy via active contour models. Experimental results demonstrate the feasibility of the proposed algorithm.
Detecting and Preventing Type flaws: a Control Flow Analysis with Tags
Authors: Chiara Bodei, Pierpaolo Degano, Han Gao, Linda Brodo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

A type flaw attack on a security protocol is an attack where an honest principal is cheated on interpreting a field in a message as the one with a type other than the intended one. In this paper, we shall present an extension of the LySa calculus with tags attached to each field, indicating the intended types. We developed a control flow analysis for analysing the extended LySa, which over-approximates all the possible behaviour of a protocol and hence is able to capture any type confusion that may happen during the protocol execution. The control flow analysis has been applied to a number of security protocols, either subject to type flaw attacks or not. The results show that it is able to capture type flaw attacks on those security protocols.
Building high performance DVR via HLA, scene graph and parallel rendering
Authors: Hua Xiong, Zonghui Wang, Xiaohong Jiang, Jiaoying Shi
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Distributed simulation and parallel rendering based on PC cluster have seen great success in recent years. To improve the overall performance, there is a trend to integrate modeling, simulation and visualization into a common distributed environment. In this paper, we propose a unified framework of building high performance distributed virtual reality (DVR) applications. The core components of this framework include the High Level Architecture (HLA), scene graphs and parallel rendering. The HLA supports interactive distributed simulation. Scene graphs are efficient to organize and manipulate scene data. And parallel rendering provides powerful rendering ability. This paper presents the in-depth architectural analysis of each components and derives a design that integrates them into a unified framework. Two DVR applications, including a remote navigation of massive virtual scenes and a multi-player video game, have been developed to evaluate the framework performance.
Global Optimization under Nonlinear Constraints Based on Apollonius Fill
Authors: Julong Song, Xiangjian He, Zhenxian Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Making use of Apollonius Fill, an algorithm is presented, which is for finding solutions of global optimization problems nonlinearly constrained by a circular region in the plane. Using this algorithm, global optimum can be computed fast and precisely. We request no more than first order derivatives of objective functions for the optimization algorithm. If we do not care about the processing time taken, for any given objective function, the global optimum can be obtained as precisely as requested. The proof of convergence of this algorithm is also given in this paper. We use a few numerical examples to show that this algorithm is effective, reliable, and hence is valuable in practice.
Weighted Processor Sharing-Results for Hyperexponential Servers
Authors: M. J. Ferguson
Venue: IEEE Transactions on Software Engineering (1983)

In a recent paper by Fayolle, Mitrani, and Iasnogorodski [2], some general multidimensional integral equations were derived in order to solve for the mean response time of each of several classes in a queue whose service discipline was weighted processor sharing. The arrival processes were Poisson. The weighting means that each job within a class k is given an amount of processing proportional to the priority weight gk associated with that class. For exponential service times, the general equations were solved. In this note, a simple observation allows use of the exponential solution directly for the case of hyperexponential servers. As a result, it is possible to state the following. Characterization of a server in terms of its mean and coefficient of variation is not sufficient to predict even the mean response time for a class using weighted processor sharing. In unweighted or egalitarian processor sharing, only the mean is sufficient. The Kleinrock conservation law [4] does not hold for nonexponential servers. Fayolie et al. [2] had showed that it did hold for exponential servers.