ppxscal/embedding_network huggingface dataset:
A modified Tikhonov regularization method for a spherically symmetric three-dimensional inverse heat conduction problem
Authors: Wei Cheng, Chu-Li Fu, Zhi Qian
Venue: Mathematics and Computers in Simulation (2007)

This paper deals with a spherically symmetric three-dimensional inverse heat conduction problem of determining the internal surface temperature distribution of a hollow sphere from the measured data at a fixed location inside it. This is an ill-posed problem, i.e., the solution (if it exists) does not depend continuously on the data. A modified Tikhonov regularization method is given and an order optimal stability estimate is obtained.
Sylvester Tikhonov-regularization methods in image restoration
Authors: A. Bouhamidi, K. Jbilou
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we consider large-scale linear discrete ill-posed problems where the right-hand side contains noise. Regularization techniques such as Tikhonov regularization are needed to control the effect of the noise on the solution. In many applications such as in image restoration the coefficient matrix is given as a Kronecker product of two matrices and then Tikhonov regularization problem leads to the generalized Sylvester matrix equation. For large-scale problems, we use the global-GMRES method which is an orthogonal projection method onto a matrix Krylov subspace. We present some theoretical results and give numerical tests in image restoration.
Performance of the optimal nonlinear detector/tracker in clutter
Authors: M. G. S. Bruno
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We propose an optimal nonlinear Bayesian algorithm for joint detection and tracking of targets that move randomly in cluttered environments. We review the derivation of the optimal Bayesian detector/tracker and present Monte Carlo simulations that benchmark the detection and tracking performances in both spatially correlated and non-Gaussian clutter.
An adaptive motion estimation based on the temporal subband analysis
Authors: M. Kunt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A new motion estimation scheme for an MPEG like video coder is suggested. The proposed 'adaptive motion estimation' scheme consists of five functional blocks: temporal subband analysis (TSBA), extraction of temporal activity distribution (TAD), scene change detection (SCD), picture type replacement (PTR), and a temporally adapted block matching algorithm (TABMA). All five functional blocks are developed primarily based on temporal subband analysis. According to the significance of the TAD, the TABMA adjusts its nonuniform motion vector search area. Also, a newly proposed SCD and PTR integrated method can prevent poor motion prediction for a video sequence containing abruptly changing scenes. Computer simulation results show that the proposed motion estimation scheme is superior to that of typical MPEG like video coders: it requires far less computations, and it shows much better performance. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analysis of slow traps centres in submicron MOSFETs by random telegraph signal technique
Authors: N. Sghaier, L. Militaru, M. Trabelsi, N. Yacoubi, A. Souifi
Venue: Microelectronics Journal (2007)

In this paper, we present a comprehensive study of slow single traps, situated inside the gate oxide of small area (WxL=0.5x0.1@mm^2) metal-oxide-semiconductor (MOS) transistors. The gate oxide of the analyzed transistors, which have been used for memory-cell applications, is composed of two SiO"2 layers-a deposited high-temperature oxide (HTO) and the thermal oxide. The interface between the two gate oxides is shown to play a significant role in the channel conduction: we observed that the presence of individual traps situated inside the gate oxide, at some angstroms from the interface with the channel, is inducing discrete variations in the drain current. Using random telegraph signal (RTS) analysis, for various temperatures and gate bias, we have determined the characteristics of these single traps: the energy position within the silicon bandgap, capture cross section and the position within the gate oxide.
Analysis of Activity in the Open Source Software Development Community
Authors: Scott Christley, Greg Madey
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Open Source Software is computer software for which the source code is publicly open for inspection, modification, and redistribution. While research of a few, large, successful projects have provided insights into the nature and practices of the open source software community; it still leaves open the question about the thousands of other open source projects which are neither large or highly successful. In this paper, we describe a data set of SourceForge.net, the world's largest open source software development site, which is available for research purposes; we discuss various data mining techniques that can be applied to the data and the type of research questions that can be answered. We apply a few of these techniques and provide analysis of the results.
The IFE: integration of multiple disciplines in a multi-lingual environment
Authors: D. M. Litynski, B. Bobinska, J. Grudziecki
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The central philosophy of the International Faculty of Engineering (IFE) at the Technical University of Lodz (Politechnika Lodzka) in Poland is to educate international, technology-based leaders for the world economy of the 21st Century using the English language as the basis for instruction. Such leaders can expect a rapidly evolving, interrelated, global society. The faculty was established under the direction of an international advisory committee, including academicians from many countries. A broad curriculum was recommended to deal effectively with human and technological issues which span international boundaries. Faculty members include visiting professors who are native English speakers. The IFE has established a multidisciplinary program around a common core. This core includes a computer theme based upon a two-semester introductory computer science course in the first year. The first undergraduate degree program leading to a Bachelor of Engineering degree in electromechanical engineering began in Academic Year (AY) 93-94. Another program in business and technology which commenced in AY 94-95 is to be joined by the programs of (i) telecommunications and computer science and (ii) textile engineering in AY 95-96. A program leading to a Master of Engineering degree is now in preparation. Details of this expanding, integrated program and the methodology for computer science are presented.
Experimental validation of a tuning algorithm for high-speed filters
Authors: G. Matarrese, C. Marzocca, F. Corsi, S. D'Amico, A. Baschirotto
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We report here the results of some laboratory experiments performed to validate the effectiveness of a technique for the self tuning of integrated continuous-time, high-speed active filters. The tuning algorithm is based on the application of a pseudo-random input sequence of rectangular pulses to the device to be tuned and on the evaluation of a few samples of the input-output cross-correlation function which constitute the filter signature. The key advantages of this technique are the ease of the input test pattern generation and the simplicity of the output circuitry which consists of a digital cross-correlator. The technique allows to achieve a tuning error mainly dominated by the value of the elementary capacitors employed in the tuning circuitry. The time required to perform the tuning is kept within a few microseconds. This appears particularly interesting for applications to telecommunication multi-standard terminals. The experiments regarding the application of the proposed tuning algorithm to a baseband multi-standard filter confirm most of the simulation results and show the robustness of the technique against practical operating conditions and noise.
Interpreting semantic relations in noun compounds via verb semantics
Authors: Su Nam Kim, Timothy Baldwin
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We propose a novel method for automatically interpreting compound nouns based on a predefined set of semantic relations. First we map verb tokens in sentential contexts to a fixed set of seed verbs using WordNet::Similarity and Moby's Thesaurus. We then match the sentences with semantic relations based on the semantics of the seed verbs and grammatical roles of the head noun and modifier. Based on the semantics of the matched sentences, we then build a classifier using TiMBL. The performance of our final system at interpreting NCs is 52.6%.
Self-reference beamforming for DS-CDMA communication systems
Authors: D. P. Palomar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A self-reference beamforming algorithm, based on the inherent temporal redundancy structure presented by the spreading codes of direct sequence code division multiple access (DS-CDMA) systems, is proposed. It is derived from a novel perspective of chip level cross-correlation properties. The algorithm is shown to give the optimal solution in the sense of maximum signal to interference plus noise ratio (SINR). Block and adaptive approaches to solve the problem are given. The method is tested against the well-known temporal reference beamformer (TRB) combined with a decision-directed approach, showing a performance similar to it, despite no side information is being used.
Methods and Guidelines for the Design and Development of Domestic Ubiquitous Computing Applications
Authors: Albrecht Schmidt, Lucia Terrenghi
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Bringing ubiquitous computing applications to home environments is a great challenge. In our research we investigate how applications can be conceived, designed, and implemented that fit into people's lives. In particular we describe our experiments on how methods of user centered design and participatory design can be appropriated to find users' requirements and design ideas for ubiquitous computing applications for the home. In particular we focus in the study reported on information presentation using display appliances. In a participatory design process, enhanced with technology probes, we discussed potential solutions for a specific home with 14 participants individually. Based on these individual solutions, fitting a single persona each, we specified the prototypes that would accommodate the user's needs and that are generic in its applicability. This allows drawing a first set of guidelines for the design of display appliances in the home environment.
Participant-driven GSS: Quality of Brainstorming and Allocation of Participant Resources
Authors: Joel H. Helquist, Eric L. Santanen, John Kruse
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper examines the relationship between time duration and the quality of brainstorming output. Quality of brainstorming output is operationalized using creativity and feasibility measures. Results indicate that brainstorming quality does decrease over the duration of the brainstorming session. Results also indicate the number of off-topic and nonsolution brainstorming output increases significantly over time. These findings are discussed in light of participant-driven group support systems.
JDiff: A differencing technique and tool for object-oriented programs
Authors: Taweesup Apiwattanapong, Alessandro Orso, Mary Jean Harrold
Venue: Automated Software Engineering (2007)

During software evolution, information about changes between different versions of a program is useful for a number of software engineering tasks. For example, configuration-management systems can use change information to assess possible conflicts among updates from different users. For another example, in regression testing, knowledge about which parts of a program are unchanged can help in identifying test cases that need not be rerun. For many of these tasks, a purely syntactic differencing may not provide enough information for the task to be performed effectively. This problem is especially relevant in the case of object-oriented software, for which a syntactic change can have subtle and unforeseen effects. In this paper, we present a technique for comparing object-oriented programs that identifies both differences and correspondences between two versions of a program. The technique is based on a representation that handles object-oriented features and, thus, can capture the behavior of object-oriented programs. We also present JDiff, a tool that implements the technique for Java programs. Finally, we present the results of four empirical studies, performed on many versions of two medium-sized subjects, that show the efficiency and effectiveness of the technique when used on real programs.
Performance bounds for LPC spectrum quantization
Authors: P. Hedelin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents a method for obtaining numerical estimates of high rate vector quantization (VQ) performance suitable for sources for which the PDF is not analytically available. In the proposed method, the VQ point density is described from a Gaussian mixture model optimized for the data. Employing this method for LPC spectrum quantization, we obtain high rate expressions for both the average spectral distortion (SD) and the distribution function of the SD. We estimate the minimum bits required for a quantizer to obtain an average SD of 1 dB and the outlier statistics for that quantizer. We find that approximately 3 bits can be saved as compared to a 2-split LSF-based vector quantizer.
Improving Search in Peer-to-Peer Literature Sharing Systems via Semantic Small World
Authors: Hai Jin, Xiaomin Ning
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Efficient search for unstructured peer-to-peer information retrieval systems is a challenging problem. This paper proposes a semantic overlay based on the small world phenomenon that facilitates efficient search for information retrieval in unstructured P2P systems. In the semantic overlay, each node maintains a number of short-range links which are semantically similar to the node, together with a small collection of long-range links that help increase recall rate of information retrieval as well as reduce network traffic. In this paper we present how to construct and maintain a semantic small world overly, and the search strategy utilizing the above semantic overlay. Experimental results show that our model can improve performance by 150% compared to Gnutella and by up to 50% compared to the Interest-based model, a similar shortcut-based search technique.
An Asset-Based Architecture Design Methodology for Rapid Telecom Service Delivery Platform Development
Authors: Jun Shen, Qiming Tian, Xiaoyan Chen, Chun Ying, Ken Chen
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

In the telecom industry, it becomes increasingly important for operators to provide a service delivery platform (SDP) quickly to improve time-to-revenue cycle of new innovative value-added services at lower cost. A rapid architecture solution design method based on SDP capability model and SDP architecture blueprint is proposed to deal with this problem in this paper. SDP capability model and the corresponding SDP architecture blueprint are designed as two reusable assets for business requirement analysis and IT architecture design in telecom service delivery problem domain to reduce cost and improve quality. Furthermore, the linkage between SDP capability model and SDP architecture blueprint is built as the corner stone to speed up the solution design process. The approach on how to use capability model, architecture blueprint, and their linkage to perform customer requirement analysis and quick solution design throughout SDP engagements is introduced. This approach can facilitate developers to adopt asset-based service model in the rapidly growing telecom industry.
Compile-time optimization and runtime flexibility in tiered sensor networks
Authors: Deborah Estrin
Venue:  (2006)

Distributed sensing applications can be complicated and inflexible. This thesis investigates three concrete ways to make sensor-application programming more accessible. We produce the first flexible system for the collection of high-rate data, such as acoustics, on motes; the key was designing a unified filter architecture allowing easy adaptation to environmental conditions and user interest. VANGo, our software system, provides filters to reduce high-rate data at its source, lessening communication and power overhead. Microservers, with their greater resources, calibrate and configure data reduction software running on motes. Filter adaptation, in our experiments, improves the yield of interesting data by a factor of two over standard techniques and results in a 78% decrease in radio transmissions. Using these insights, we designed a more general task library for all mote applications and implemented it for TENET, an architecture for tiered sensor networks developed in collaboration with Govindan et al. at USC. This library allows for the dynamic composition of applications from simple pieces. As tasks are issued by capable microservers in a tiered network, they remove the responsibility of interpreting complex application logic from mote devices; the mote tier thus becomes flexible and generic, supporting a wide range of application services. The management of tasks is fairly lightweight; mote-resident task descriptions usually require fewer than 200 bytes of RAM. Therefore, our mote runtime can support the concurrent execution of up to 26 of our most complicated tasks. In those cases when very high efficiency is required, the SNACK component library and composition language compiles high-level specifications of applications into statically minimal code. SNACK makes it easy to write and use application-level sensor network services (e.g., routing trees and periodic sensing;) and to express them in ways that improve efficiency by sharing substructure. In our analysis, we present a simple SNACK-based multi-hop data collection application. It uses SNACK language features to provide both simplicity (excluding reusable service definitions, its description is three lines long) and efficiency (it performs comparably to the well-known Surge application). These contributions separately tackle three important areas of sensor network system design: providing flexible node-local processing, dynamic application composition and control, and efficient execution. In all cases, these efforts focus on a single goal, that of simplifying application development.
Highly accurate higher order statistics based neural network classifier of specific abnormality in electrocardiogram signals
Authors: M. Sabry-Rizk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The paper describes a simple yet highly accurate multilayer feed-forward neural network classifier (based on the backpropagation algorithm) specifically designed to successfully distinguish between normal and abnormal higher-order statistics features of electrocardiogram (EGG) signals. The concerned abnormality in ECG is associated with ventricular late potentials (LPs) indicative of life threatening heart diseases. The LPs are defined as signals from areas of delayed conduction which outlast the normal QRS period (80-100 msec). The QRS along with the P and T waves constitute the heart beat cycle. This classifier incorporates both preprocessing and adaptive weight adjustments across the input layer during the training phase of the network to enhance extraction of features pertinent to LPs found in 1-D cumulants. The latter is deemed necessary to offset the low S/N ratio in the cumulant domains concomitant to performing short data segmentation in order to capture the LPs transient appearance. We summarize the procedures of feature selection for neural network training, modification to the backpropagation algorithm to speed its rate of conversion, and the pilot trial results of the neural ECG classifier.
Improved vocal tract model for the analysis of nasal speech sounds
Authors: Minsheng Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents the extended tube model for the vocal and nasal tract, in which the velum is described by means of a three-port-adaptor, which can be reduced to a two-port-adaptor. In this way the transfer function is derived, then its properties are investigated, so that this model can be used for the speech analysis of the nasal and non-nasal sounds and can be simply implemented by the inverse filtering method. Moreover the losses in the vocal and nasal tract are analysed and the shape of the nasal tract is also estimated.
Computing the spectrum of non-self-adjoint Sturm-Liouville problems with parameter-dependent boundary conditions
Authors: B. Chanane
Venue: Journal of Computational and Applied Mathematics (2007)

This paper deals with the computation of the eigenvalues of non-self-adjoint Sturm-Liouville problems with parameter-dependent boundary conditions using the regularized sampling method. A few numerical examples among which singular ones will be presented to illustrate the merit of the method and comparison made with the exact eigenvalues when they are available.
Mathematical models and properties of games
Authors: Yingxu Wang
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Games are a decision process under competition where opponent players compete for the maximum gain or a success state in the same environment according to the same rules of the game. Games are conventionally dealt with payoff tables based on random strategies that are found inadequate to describe the dynamic behaviors of games and to rigorously predict the outcomes of games. This paper presents a formal treatment of games by a set of mathematical models for both the layouts and behaviors of games. A formal model of games is introduced, based on which the properties of games in terms of decision strategies and serial matches are described. A wide range of generic zero-sum and nonzero-sum games are formally modeled and analyzed using the mathematical models of games.