ppxscal/embedding_network huggingface dataset:
Control-oriented identification and uncertainty estimation for paper machines
Authors: A. Green
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A control-oriented identification and uncertainty estimation approach from input-output data is presented, for use in the design of control systems for paper machines. The application of this approach is demonstrated on a high fidelity simulator. An estimate of the process model along with the uncertainty bounds that describe the confidence limits of the model, consistent with the robust control theory, is obtained. These results can then be used to design a multivariable controller based on loop-shaping principles and guided by the estimated uncertainty bounds. The simulations demonstrate the suitability of the approach and illustrate that the technique can be used to provide high bandwidth performance for both servo and regulatory control.
Mediators in position auctions
Authors: Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

A mediator is a reliable entity, which can play on behalf of agents in a given game. A mediator however can not enforce the use of its services, and each agent is free to participate in the game directly. In this paper we introduce a study of mediators for games with incomplete information, and apply it to the context of position auctions, a central topic in electronic commerce. VCG position auctions, which are currently not used in practice, possess somenice theoretical properties, such as the optimization of social surplus and having dominant strategies. These properties may not be satisfied by current position auctions and their variants. We therefore concentrate on the search for mediators that will allow to transform current position auctions into VCG position auctions. We require that accepting the mediator services, and reporting honestly to the mediator, will form an ex post equilibrium, which satisfiesthe following rationality condition: an agent's payoff can not be negative regardless of the actions taken by the agents who did not choose the mediator's services, or by the agents who report false types to the mediator. We prove the existence of such desired mediators for the next-price (Google-like) position auctions, as well as for a richer class of position auctions, including k-price position auctions, k>1. For k=1, the self-price position auction, we show that the existence of such mediator depends on the tie breaking rule used in the auction.
Automatic construction of polarity-tagged corpus from HTML documents
Authors: Nobuhiro Kaji, Masaru Kitsuregawa
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper proposes a novel method of building polarity-tagged corpus from HTML documents. The characteristics of this method is that it is fully automatic and can be applied to arbitrary HTML documents. The idea behind our method is to utilize certain layout structures and linguistic pattern. By using them, we can automatically extract such sentences that express opinion. In our experiment, the method could construct a corpus consisting of 126,610 sentences.
Automated story capture from internet weblogs
Authors: Andrew S. Gordon, Qun Cao, Reid Swanson
Venue: Proceedings of the 4th international conference on Knowledge capture (2007)

Among the most interesting ways that people share knowledge is through the telling of stories, i.e. first-person narratives about real-life experiences. Millions of these stories appear in Internet weblogs, offering a potentially valuable resource for future knowledge management and training applications. In this paper we describe efforts to automatically capture stories from Internet weblogs by extracting them using statistical text classification techniques. We evaluate the precision and recall performance of competing approaches. We describe the large-scale application of story extraction technology to Internet weblogs, producing a corpus of stories with over a billion words.
Improving Combinability of Petri Nets with Inheritance, Aggregation and Association
Authors: Shengyuan Wang, Yuan Dong
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Many distinguished Petri net languages or models have proved their advantages in modelling concurrent/ distributed object systems in the past decade, however, none of these languages or models exploits the feature that the construction of Petri nets can also benefit from object modelling technology. In this paper, we illustrate that the combinability of Petri Nets can be improved with the inheritance, aggregation and association relations. The approach we employ is to take ordinary Petri nets as usual objects with explicit methods and attributes identified and then integrate them into the object modelling framework.
Characterization of transient wandering tones by dynamic modeling of fractional-Fourier features
Authors: P. L. Ainsleigh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A novel approach is presented for characterizing transient wandering tones. These signals are segmented and approximated as time series with piecewise linear instantaneous frequency and piecewise constant amplitude. Frequency rate, center frequency, and energy features are estimated in each segment of data using chirped autocorrelations and the fractional Fourier transform. These features are tracked across segments using linear dynamical models whose parameters are estimated using an expectation-maximization algorithm. A new cross-covariance estimator for adjacent states of the dynamical model is given. The feature extraction/tracking algorithm is used to characterize a measured marine-mammal vocalization. Application of the representation algorithm to signal classification is discussed.
An Information Visualization Approach to Retail Space Management (VisMT)
Authors: Mikael Jern
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Retail space management is one of the more crucial challenges faced by retailers today with an ever everexpanding volume of data to which they must refer when making decisions. Problems have emerged that are intractable using traditional means but for which interactive information visualization shows much promise. These problems or tasks are exploratory in nature and use temporal multivariate data. Department stores must maximize and optimize return on allocated retail space. Although product sales are readily available, the missing link for most retailers is a precise understanding of each store's layout in relation to its capacity and performance. This paper introduces a novel approach Visual Space Management (VSM) demonstrated with a multiple-linked view application (VisMT) that explores retail data related to space performance. VisMT integrates familiar information visualization representations and a 3D interactive layout of store floor plans with retail data sources. Parallel coordinates plot serves as a multivariate visual control panel in the coordinated system. Seasonally retail data analysis is performed simultaneously in linked views through time. Visual inquiry methods are supported for conditioned temporal multivariate data.
A simulation-based proof technique for dynamic information flow
Authors: Stephen McCamant, Michael D. Ernst
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

Information-flow analysis can prevent programs from improperly revealing secret information, and a dynamic approach can make such analysis more practical, but there has been relatively little work verifying that such analyses are sound (account for all flows in a given execution). We describe a new technique for proving the soundness of dynamic information-flow analyses for policies such as end-to-end confidentiality. The proof technique simulates the behavior of the analyzed program with a pair of copies of the program: one has access to the secret information, and the other is responsible for output. The two copies are connected by a limited-bandwidth communication channel, and the amount of information passed on the channel bounds the amount of information disclosed, allowing it to be quantified. We illustrate the technique by application to a model of a practical checking tool based on binary instrumentation, which had not previously been shown to be sound
Non-Archimedean Valued Sequent Logic
Authors: Andrew Schumann
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In this paper I propose non-Archimedean multiple-validity and construct the logical language with the related semantics. Further I build non-Archimedean valued sequent logic. Notice that non-Archimedean valued logical system is considered for the first time. The Polish logician Jan Lukasiewicz began to create systems of many-valued logic, using a third value "possible" to deal with Aristotle's paradox of the sea battle. Now many-valued logic has applications in diverse fields. In the earlier years of development of multiple-validity idea, the most promising field of its application is artificial intelligence. This application concerns vague notions and commonsense reasoning, e.g. in expert systems. In this context fuzzy logic is also interesting, because multiple-validity is modeled in artificial intelligence via fuzzy sets and fuzzy logic. There exist various many-valued logical systems. However non-Archimedean valued logic isn't yet constructed. The idea of non-Archimedean multiple-validity is that (1) the set of truth values is uncountable infinite and (2) this set isn't well-ordered. This idea can have a lot of applications in probabilistic reasoning (see [4, 1]).
Resource management for dynamic, distributed real-time systems
Authors: Lonnie R. Welch
Venue:  (2006)

A current challenge facing resource management is the need to deploy real-time systems in dynamic operational environments. The systems are often affected by unpredictable environmental factors that cannot be known a priori and have no meaningful worst-case estimates. As a result, traditional resource allocation techniques do not apply. Current attempts to address these systems have been limited. This research addresses the resource management problem for dynamic, distributed real-time systems (DDRTSs). A resource allocation approach is developed for these systems that offers explicit real-time guarantees with maximized tolerance (robustness) of unpredictable environment changes. This work has developed (1) a real-time computing model that incorporates environmental factors, (2) metrics that characterize robustness, and (3) resource allocation algorithms that find feasible, robust allocations. The approach is validated by both theoretical analysis and experimentation. The main contribution of the work is a reliable resource management solution for DDRTSs, which allows real-time applications to be versatile in real world environments.
GRE encapsulated multicast probing: a scalable technique for measuring one-way loss
Authors: Yu Gu, Lee Breslau, Nick G. Duffield, Subhabrata Sen
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

We develop techniques for estimating one-way loss from a measurement host to network routers which exploit commonly implemented features on commercial routers and do not require any new router capabilities. The work addressesthe problem of scalably performing one-way loss measurements across specific network paths.
ChinaGrid: One Step forward to Services Computing
Authors: Hai Jin
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Hai Jin is a Professor of Computer Science and Engineering at the Huazhong University of Science and Technology (HUST) in China. He is now the Dean of School of Computer Science and Technology at HUST. He received his Ph.D. in computer engineering from HUST in 1994. In 1996, he was awarded German Academic Exchange Service (DAAD) fellowship for visiting the Technical University of Chemnitz in Germany. He worked for the University of Hong Kong between 1998 and 2000 and participated in the HKU Cluster project. He worked as a visiting scholar at the University of Southern California between 1999 and 2000. He is the chief scientist of the largest grid computing project, ChinaGrid, in China.
Surface-mounted acoustic vector-sensor array processing
Authors: M. Hawkes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We consider the passive direction-of-arrival (DOA) estimation problem using arrays of acoustic vector-sensors located in a fluid, at or near a plane boundary. We formulate a general measurement model applicable to most surfaces, and derive an expression for the Cramer-Rao bound (CRB) of a single source. The CRB is used to analyze the practically important cases of ideal rigid and pressure-release surfaces in detail. An important quantitative comparison is made between a stand-off array of pressure sensors and a surface-mounted array of velocity sensors for the latter surface. In particular, we define and find an expression for the critical distance, at which the arrays have an equivalent performance.
Fully digital strategy for fast calibration and test of ΣΔ ADCs
Authors: Daniela De Venuto, Leonardo Reyneri
Venue: Microelectronics Journal (2007)

This work describes a novel test strategy that uses digital stimuli for cheap, fast, though accurate, testing of high resolution @S@D ADCs. Simulation results showed a detection sensitivity on specifications parameters of up to -100dB. The proposed method can also help to reduce the cost of ADC production test, to extend test coverage and to enable built-in self-test and test-based self-calibration.
Improving Routing Security Using a Decentralized Public Key Distribution Algorithm
Authors: Jeremy Goold, Mark Clement
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Today's society has developed a reliance on networking infrastructures. Health, financial, and many other institutions deploy mission critical and even life critical applications on local networks and the global Internet. The security of this infrastructure has been called into question over the last decade. In particular, the protocols directing traffic through the network have been found to be vulnerable. One such protocol is the Open Shortest Path First (OSPF) protocol. This paper proposes a security extension to OSPF containing a decentralized certificate authentication scheme (DecentCA) that eliminates the single point of failure/attack present in current OSPF security extensions. An analysis of the security of the DecentCA is performed.
Machine Extraction of Landforms from Multispectral Images Using Texture and Neural Methods
Authors: Pinaki Roy Chowdhury, Benidhar Deshmukh, Anil Goswami
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This study makes an attempt towards machine generation of landform maps from optical remote sensing data. The automation in our approach is to the extent that the training of multilayer perceptrons (MLP) used as a classifier is carried out offline, and subsequently the trained MLP is used to identify the landform classes in a given unknown satellite image. Emphasis of this paper is on exploring potential of gray level co-occurrence (GLC) texture statistics computed from a reasonably extensive database created using multispectral images for landform discrimination. GLC texture statistics form the feature of the pattern vector used for training the MLP. Generalization results are assessed using the cross validation mechanism. Our results for aeolian landforms suggest the textural method to be promising in machine extraction of landforms.
Improving Performance of Composite Web Services
Authors: Dmytro Dyachuk, Ralph Deters
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Composite Web Services (CWS) aggregate multiple Web Services in one logical unit in order to accomplish a complex task (e.g. business process). This orchestration is typically achieved by use of a workflow language. Workflows facilitate the process of aggregating existing atomic and other CWS into new service layers. However due to numerous consumers and possible fluctuations in their arrivals the services performance under various loads becomes an important issue. Service compositions exposed to transient overloads expose problematic behaviour due to complex interactions of the underlying services. This in its turn usually results in the performance degradation. This paper proposes employing scheduling service requests in order to improve the overall CWS performance in overload situations. Different scheduling policies are evaluated for the CWS workflow patterns sequence and split-synchronization. In addition the paper presents scheduling policy called Augmented Least Work Reaming (ALWKR), that extends LWKR by taking advantage of existing workflow topology information.
Mining and Predicting Duplication over Peer-to-Peer Query Streams
Authors: Shicong Meng, Yifeng Shao, Cong Shi, Dingyi Han, Yong Yu
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models(Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction.
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
Authors: Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, Shuzhong Zhang
Venue: SIAM Journal on Optimization (2007)

We consider the NP-hard problem of finding a minimum norm vector in $n$-dimensional real or complex Euclidean space, subject to $m$ concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an $O(m^2)$ approximation in the real case and an $O(m)$ approximation in the complex case. Moreover, we show that these bounds are tight up to a constant factor. When the Hessian of each constraint function is of rank $1$ (namely, outer products of some given so-called steering vectors) and the phase spread of the entries of these steering vectors are bounded away from $\pi/2$, we establish a certain &ldquo;constant factor&rdquo; approximation (depending on the phase spread but independent of $m$ and $n$) for both the SDP relaxation and a convex QP restriction of the original NP-hard problem. Finally, we consider a related problem of finding a maximum norm vector subject to $m$ convex homogeneous quadratic constraints. We show that an SDP relaxation for this nonconvex QP provides an $O(1/\ln(m))$ approximation, which is analogous to a result of Nemirovski &etal; [Math. Program., 86 (1999), pp. 463-473] for the real case.
Lightweight encryption for email
Authors: Ben Adida, Susan Hohenberger, Ronald L. Rivest
Venue: Proceedings of the Steps to Reducing Unwanted Traffic on the Internet on Steps to Reducing Unwanted Traffic on the Internet Workshop (2005)

Email encryption techniques have been available for more than a decade, yet none has been widely deployed. The problems of key generation, certification, and distribution have not been pragmatically addressed. We recently proposed a method for implementing a Lightweight Public Key Infrastructure (PKI) for email authentication using recent developments in identity-based cryptography and today's existing Internet infrastructure. While this solution works well for email authentication, email encryption exhibits a different threat model that requires special treatment. In this work, we discuss how to achieve email encryption and present a realistic deployment and adoption process, while respecting the current functionality and expectations of email.
Evolutionary ARMA modelling of time-varying impulse response
Authors: J. Bakkoury
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper is concerned with evolutionary ARMA modelling of randomly time-variant impulse responses. This modelling is applied to mobile radio channels subjected to multipaths and characterized by a time-variant impulse response. We present the principle of evolutionary ARMA models and derive a parameter estimator based upon an eigenformulation for the optimization condition of a chosen criterion.
New rule-based and data-driven strategy to incorporate Fujisaki's F/sub 0/ model to a text-to-speech system in Castillian Spanish
Authors: J. M. Gutierrez-Arriola
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present the analysis of a Spanish prosody database by estimating the parameters of Fujisaki's (1981) model for F/sub 0/ contours. These parameters are classified attending to linguistic features and they form the analysis database. When synthesizing F/sub 0/ contours we extract the linguistic features from the text and perform a k-nearest neighbour search. Linguistic feature comparison distance is trained using data from the prosody database. To avoid artifacts we perform a rule-base filtering on synthesis parameters. The results of our evaluation test show that the proposed system is significantly better than the previous neural network approach. This evaluation confirms the ability of Fujisaki's model to represent prosody information based on linguistic features.
Oversampled FIR and IIR DFT filter banks and Weyl-Heisenberg frames
Authors: H. Bolcskei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We apply the theory of Weyl-Heisenberg frames (WHFs) to oversampled FIR and IIR DFT filter banks (FBs). We show that the polyphase matrices provide a matrix representation of the frame operator and we find conditions on a DFT FB to provide a WHF expansion. We also show that paraunitary and biorthogonal DFT FBs correspond to tight and exact WHFs, respectively, and that the same bounds can be obtained by an eigenanalysis of the polyphase matrices. Simulation results demonstrate the importance of the frame bounds for the design of DFT FBs.