ppxscal/embedding_network huggingface dataset:
RBF neural networks for solving the inverse problem of backscattering spectra
Authors: Michael M. Li, Brijesh Verma, Xiaolong Fan, Kevin Tickle
Venue: Neural Computing and Applications (2008)

This paper investigates a new method to solve the inverse problem of Rutherford backscattering (RBS) data. The inverse problem is to determine the sample structure information from measured spectra, which can be defined as a function approximation problem. We propose using radial basis function (RBF) neural networks to approximate an inverse function. Each RBS spectrum, which may contain up to 128 data points, is compressed by the principal component analysis, so that the dimensionality of input data and complexity of the network are reduced significantly. Our theoretical consideration is tested by numerical experiments with the example of the SiGe thin film sample and corresponding backscattering spectra. A comparison of the RBF method with multilayer perceptrons reveals that the former has better performance in extracting structural information from spectra. Furthermore, the proposed method can handle redundancies properly, which are caused by the constraint of output variables. This study is the first method based on RBF to deal with the inverse RBS data analysis problem.
Error control in Adomian's decomposition method applied to the time-dependent Gross-Pitaevskii equation
Authors: U. Al Khawaja, Kamel Al-Khaled
Venue: International Journal of Computer Mathematics (2007)

We apply the Adomian decomposition method to the one-dimensional time-dependent Gross-Pitaevskii equation, which describes the evolution of bright solitons. We investigate the behaviour of the error in the solutions obtained by the Adominan method and make a comparison with the exact solution. We obtain a formula for the error as a function of time and the number of Adomian polynomials used.
Recursive protocol for group-oriented authentication with key distribution
Authors: Tzong-Chen Wu, Thsia-Tzu Huang, Chien-Lung Hsu, Kuo-Yu Tsai
Venue: Journal of Systems and Software (2008)

The authors propose a recursive protocol for group-oriented authentication with key exchange, in which a group of n entities can authenticate with each other and share a group session key. The proposed protocol has the following characteristics: First, it requires O(n) rounds of messages, O(logn) completion time, O(logn) waiting time, and O(nlogn) communication overhead in average for the completion of the recursion. Second, it not only meets the five principles suggested by Diffie et al. [Diffie, W., van Oorschot, P.C., Wiener, M.J., 1992. Authentication and authenticated key exchange. Designs, Codes, and Cryptography 2 (2), 107-125] on the design of a secure key exchange protocol, but also achieves the properties of nondisclosure, independency, and integrity addressed by Janson and Tsudik [Janson, P., Tsudik, G., 1995. Secure and minimal protocols for authenticated key distribution. Computer Communications 18 (9), 645-653] for the authentication of the group session key. Third, we describe the beliefs of trustworthy entities involved in our authentication protocol and the evolution of these beliefs as a consequence of communication by using BAN logic. Finally, it is practical and efficient, because only one-way hash function and exclusive-or (XOR) operations are used in implementation.
Delay-dependent robust stability and l2-gain analysis of a class of nonlinear time-delay systems
Authors: Daniel F. Coutinho, Carlos E. de Souza
Venue: Automatica (Journal of IFAC) (2008)

A convex approach to robust regional stability analysis of a class of nonlinear state-delayed systems subject to convex-bounded parameter uncertainty is proposed. Delay-dependent conditions are developed to ensure system robust local stability and obtain an estimate of a domain of attraction of the origin inside a given polytopic region of the state-space. This approach is then extended to provide a delay-dependent solution to the problem of @?"2-gain analysis. The proposed approach is based on a Lyapunov-Krasovskii functional with polynomial dependence on the system state and uncertain parameters and is formulated in terms of linear matrix inequalities. Numerical examples illustrate the potentials of the derived results.
Online secondary path modeling in multichannel active noise control systems using variable step size
Authors: Muhammad Tahir Akhtar, Masahide Abe, Masayuki Kawamata, Akinori Nishihara
Venue: Signal Processing (2008)

In single-channel feedforward active noise control (ANC) systems, additive random noise based methods are often applied to achieve secondary path modeling (SPM) during online operation. This paper investigates the issue of online SPM in multichannel ANC systems. It is shown that the application of existing methods for online SPM in multichannel ANC systems greatly increases the computational complexity. Here we extend our previous work on single-channel variable step-size online SPM to multichannel ANC systems. It is shown that the proposed method has reduced computational complexity as compared with other methods. Computer simulations are carried out that demonstrate the effectiveness of the proposed method.
Narrow paths beyond limits of lithography
Authors: Michał Zaborowski, Piotr Grabiec
Venue: Microelectronic Engineering (2008)

Well-controlled methods of nanopattern definition in SiO"2 and Si have been developed: Lateral Pattern Definition technique in SiO"2 (LPD) and Pattern Definition by Edge Oxidation technique, suitable for mono-Si and poly-Si paths (PADEOX). SEM examinations of the patterns of width of several tens of nm have been presented. Dependence of width of the pattern on parameters of the process has been discussed. Application of the PADEOX technique in FinFET technology has been described.
Goal graph based performance improvement for self-adaptive modules
Authors: Jeongmin Park, Joonhoon Lee, Eunseok Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Much effort is required to manage complex computing environments. Self-healing systems, adapted to their computing environments, offer a solution to this problem. Additional resources are required to use these systems. In our previous study, we proposed an approach that controls the behaviors of the self-adaptive components. This approach used switches to reduce the amount of resources required and enhance system performance. However, it did not include an abstraction approach to control the behavior of the self-adaptive modules. Specific code needs to be included when designing and implementing self-adaptive modules to utilize abstraction. In this study, we propose a method of 1) analyzing the behavioral levels of the self-adaptive modules through a goal graph 2) generating a behavior level activation switch using the specified levels. Through this approach, we can reduce additional resources required by the self-adaptive modules, and the effort involved in creating the code required for improving their performance. In order to evaluate the proposed approach, we draw a goal graph of a file transfer module used in a video conference system. This approach generates the template code of the behavior switch based on the goal graph that can improve the performance of self-adaptive modules. Through these processes, the generated code is applied to the modules, while verifying that the switches function properly. We compare the number of concurrent active components before and after applying this approach. In this way, we make certain that the code generated from the goal graph improves the performance of self-adaptive modules.
The Semantic Web Services Challenge: Tackling Complexity at the Orchestration Level
Authors: Tiziana Margaria
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

The Semantic Web Services Challenge addresses since 2006 the issue of finding adequate domain modelling formalisms that help taming the complexity of service orchestration and service discovery. In this paper we examine the concrete settings, the dimensions of complexity that appear in the Challenge, and reflect on the essence of the observations so far.
Fault tolerant sorting network
Authors: S. Assaf, E. Upfal
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A general technique for enhancing the reliability of sorting networks and other comparator-based networks is presented. The technique converts any network that uses unreliable comparators to a fault-tolerant network that produces the correct output with overwhelming probability, even if each comparator is faulty with some probability smaller than 1/2, independently of other comparators. The depth of the fault-tolerant network is only a constant times the depth of the original network, and the width of the network is increased by a logarithmic factor.
Effect of connectivity in associative memory models
Authors: J. Komlos, R. Paturi
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The authors investigate how good connectivity properties translate into good error-correcting behavior in sparse networks of threshold elements. They determine how the eigenvalues of the interconnection graph (which in turn reflect connectivity properties) relate to the quantities, number of items stored, amount of error-correction, radius of attraction, and rate of convergence in an associative memory model consisting of a sparse network of threshold elements or neurons.
A conceptual approach to teaching induction for computer science
Authors: Irene Polycarpou, Ana Pasztor, Malek Adjouadi
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In this paper, we present an approach to teaching induction that we call the "conceptual route" of teaching induction. Proofs by induction are central to the study of computer science and students come across them in many courses of their curricula. It is documented in the literature that in general students have difficulties with proofs by induction. Even though through the years some solutions were proposed to improve the situation, recent studies show that students are still having difficulties. Currently, proofs by induction take up too little of the computer science curriculum, and they are taught as a step-by-step procedure to be followed, which is not sufficient for students to gain conceptual understanding. In contrast, our approach aims at students' conceptual understanding by shifting their focus from the syntactic form of proofs by induction to their substance. The theoretical underpinning of our approach is an operationalization of the Induction Principle.
Epistemic privacy
Authors: Alexandre Evfimievski, Ronald Fagin, David P. Woodruff
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, and assumptions about users' prior knowledge, our goal is to determine if answering a past user's query could have led to a privacy breach. According to our definition, an audited property A is private, given the disclosure of property B, if no user can gain confidence in A by learning B, subject to prior knowledge constraints. Privacy is not violated if the disclosure of B causes a loss of confidence in A. The new notion of privacy is formalized using the well-known semantics for reasoning about knowledge, where logical properties correspond to sets of possible worlds (databases) that satisfy these properties. Database users are modelled as either possibilistic agents whose knowledge is a set of possible worlds, or as probabilistic agents whose knowledge is a probability distribution on possible worlds. We analyze the new privacy notion, show its relationship with the conventional approach, and derive criteria that allow the auditor to test privacy efficiently in some important cases. In particular, we prove characterization theorems for the possibilistic case, and study in depth the probabilistic case under the assumption that all database records are considered a-priori independent by the user, as well as under more relaxed (or absent) prior-knowledge assumptions. In the probabilistic case we show that for certain families of distributions there is no efficient algorithm to test whether an audited property A is private given the disclosure of a property B, assuming P ` NP. Nevertheless, for many interesting families, such as the family of product distributions, we obtain algorithms that are efficient both in theory and in practice.
Towards Energy Efficient Design of Multi-radio Platforms for Wireless Sensor Networks
Authors: Dimitrios Lymberopoulos, Nissanka B. Priyantha, Michel Goraczko, Feng Zhao
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We study the problem of concurrently supporting multiple radios with different capabilities and interfaces on a single sensor node platform. Through a detailed experimental study on hardware multi-radio platforms, using the two representative radio technologies 802.15.4 and 802.11, we identify bottlenecks and design tradeoffs that are usually overlooked and that, as we show, have a significant impact on the sensor network's performance and energy efficiency. Our findings are threefold. We show that a proper pairing of processor and radio is crucial for taking the full advantage of the energy efficiency of higher bandwidth radios. The processor/radio pairing affects the energy balance of a sensor node, thus making the design of dynamic switching among multiple radios more challenging. Second, we demonstrate and quantify the impact of network traffic on energy consumption of a sensor node while varying network parameters, and illustrate the deficiency of existing energy-optimizing protocols. Our results indicate that by properly adjusting network parameters, such as packet size and transmission period, energy savings of upto 50\% can be achieved under heavy network traffic conditions when a CSMA-based MAC is used. Weconclude by presenting a set of guidelines for designing and implementing energy efficientmulti-radio platforms.
Using wavelet-base HAS model for robust audio watermarking
Authors: Mostafa Ghannadrezaii
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Wavelet transform is a well know method in video and image watermarking. During these years many method has been presented on audio watermarking but wavelet was not successful in audio watermarking as it used to be in image. This paper presents new wavelet-base approach for audio application.
A secure and resilient WSN roadside architecture for intelligent transport systems
Authors: Jens-Matthias Bohli, Alban Hessler, Osman Ugus, Dirk Westhoff
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

We propose a secure and resilient WSN roadside architecture for intelligent transport systems which supports the two complementary services accident prevention and post-accident investigation. Our WSN security architecture is stimulated by the understanding that WSN roadside islands will only be rolled-out and used when hardware costs are close to the minimum. We provide a purely software based security solution which does not rely on costly HW components like road side units (RSU) or tamper resistant modules on sensor nodes. We use existing components, but also describe protocols that may be of independent interest.
Proceedings of the 2008 workshop on Static analysis
Venue: Conference on Programming Language Design and Implementation (2008)

Static Analysis Workshop (SAW 2008) was held on June 12, 2008 in Tucson, Arizona and was co-located with ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI 2008). This workshop followed Static Analysis Summit, held in 2006, and Static Analysis Summit II, held in 2007. This year's edition featured participants of the Static Analysis Tool Exposition (SATE) reporting their experience and interesting observations. The Call for Papers solicited contributions describing basic research, applications, experience, or proposals relevant to static analysis tools, techniques, and their evaluation. Questions and topics of interest included but were not limited to: &bull; Contribution of static analysis to software security assurance &bull; Issues in applying static analysis to binaries &bull; Static analysis at the design or requirements level &bull; Issues in scaling static analysis to deal with large systems &bull; Integration of, or tradeoffs between, different analysis techniques &bull; Flaw catching vs. sound analysis &bull; Benchmarks or reference datasets &bull; Formal pattern languages to describe vulnerabilities &bull; User experience drawing useful lessons or comparisons &bull; Case studies on real applications Arnaud Venet, formerly of Kestrel Technologies, was originally the chair of the workshop. He issued the call for papers, recruited the program committee, and began the review process for submitted papers. Because of health and employment issues, Paul Black stepped in and completed the workshop process.
Universal emulations with sublogarithmic slowdown
Authors: C. Kaklamanis
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area with logarithmic slowdown. His results imply the existence of an N-node network with layout area O(N log/sup 2/ N) which can emulate any N-node planar network with O(log N) slowdown. The main results of this paper are: There exists an N-node network with layout area O(N log/sup 2/ N) which can emulate any N-node planar network with O(loglogN) slowdown. The N-node butterfly (and hypercube) can emulate any network with VLSI layout area N/sup 2-/spl epsiv// (/spl epsiv/>0) with O(loglogN) slowdown. We also discuss sublogarithmic bounds for the slowdown of emulations of arbitrary bounded degree networks.
'A TV in the pocket': an experimentation of mobile TV delivery technologies: DVB-H, 3G and podcasting
Authors: Virpi Oksman, Antti Tammela, Tuomo Kivinen
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Recent studies show that being able to view news and other media contents on the move from the mobile phone has a value in many situations. [11, 14] Users' preferences for the different uses of mobile TV are being studied from various viewpoints. Mobile TV has been studied, for example, by users' content choices [11, 14], viewing context and viewing times [12, 14, 11] and video quality requirements [6, 8]. However, one of the biggest problems in the mobile TV use is the quality of reception. In the long run, it will be crucial to discover what kind of distribution technologies will best suit mobile media and different use contexts. Are there any significant quality differences between certain distribution methods? And if so, how does this affect to mobile TV use? This paper examines different mobile delivery technologies based on a series of experimentation. The data is based on ongoing empirical research in Finland in 2006--2007. The tested mobile TV services included both news and entertainment contents, and were tested in 3G, DVB-H and W-Lan networks.
High Complexity Control Gates with Advanced RFID Features for Production Process Monitoring
Authors: Vasile Gaitan, Cornel Turcu, Alexandru Goloca
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In nowadays manufacturing plants there is a certain degree in which the RFID technology has been adopted. This degree may vary from marking the components of a final product (for example a car) using RFID tags in order to verify if they are all in place at the end of the production line, to the production flow monitoring and finally to the supply chain management. The presented system contains advanced high complexity RFID-based control gates and smart connections to an OPC server that acts as central dispatcher. The system is able to satisfy a large number of customer requirements for process monitoring and control.
Course experiences of computing students with disabilities: four case studies
Authors: Katherine Deibel
Venue: ACM SIGCSE Bulletin (2008)

Inclusive education is the practice of making sure that all students of all abilities have positive learning experiences. The study presented in this paper explores the current state of inclusive practices in computing education by presenting four case studies of students with disabilities taking their first computing courses. Their experiences share many common themes that reveal insights into their college experiences and connect with current theories as to how to achieve inclusive education. New technologies, such as podcasting, for promoting inclusion are also suggested.
Bi-level path following for cross validated solution of kernel quantile regression
Authors: Saharon Rosset
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Modeling of conditional quantiles requires specification of the quantile being estimated and can thus be viewed as a parameterized predictive modeling problem. Quantile loss is typically used, and it is indeed parameterized by a quantile parameter. In this paper we show how to follow the path of cross validated solutions to regularized kernel quantile regression. Even though the bi-level optimization problem we encounter for every quantile is non-convex, the manner in which the optimal cross-validated solution evolves with the parameter of the loss function allows tracking of this solution. We prove this property, construct the resulting algorithm, and demonstrate it on data. This algorithm allows us to efficiently solve the whole family of bi-level problems.
A discontinuous Galerkin method for the Rosenau equation
Authors: S. M. Choo, S. K. Chung, K. I. Kim
Venue: Applied Numerical Mathematics (2008)

A priori error estimates for the Rosenau equation, which is a K-dV like Rosenau equation modelled to describe the dynamics of dense discrete systems, have been studied by one of the authors. But since a priori error bounds contain the unknown solution and its derivatives, it is not effective to control error bounds with only a given step size. Thus we need to estimate a posteriori errors in order to control accuracy of approximate solutions using variable step sizes. A posteriori error estimates of the Rosenau equation are obtained by a discontinuous Galerkin method and the stability analysis is discussed for the dual problem. Numerical results on a posteriori error and wave propagation are given, which are obtained by using various spatial and temporal meshes controlled automatically by a posteriori error.