ppxscal/embedding_network huggingface dataset:
Exploring recursion with fibonacci numbers
Authors: Manuel Rubio-Sánchez, Isidoro Hernán-Losada
Venue: ACM SIGCSE Bulletin (2007)

This paper addresses the relationship between recursion and combinatorial problems, which may benefit teaching recursion in CS1/2 courses. Problems whose solutions are related to Fibonacci numbers are particularly interesting, since some can be decomposed by using different strategies, which may be based on the numerous Fibonacci identities or even on the concept of mutual recursion.
One approach to multidisciplinary senior design projects
Authors: B. S. Goda
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

At the U.S. Military Academy, the Department of Electrical Engineering and Computer Science was formed in 1989. Since that time, efforts have been underway to tap the synergism that can be derived from having the complementary disciplines under one directorship. HO scale model trains have become a focal point for a series of three senior design projects over a three year period. The first project was completed by a computer engineering major who was tasked to design and build a model train turntable. The turntable was PC controlled, used optical interrupts for sensing, and required C language text programming. The second project was completed by a team of three electrical engineering majors, two computer science majors, and one engineering management major. Their task was to design and build a rotating crane system that would automatically place the correct load on a designated train car according to selections made via a PC windows interface. The third project incorporated lessons learned from the first two. Five electrical engineering majors, two computer science majors, and two mechanical engineering majors were required to design and build a more complex gantry crane system that performed the same functions as the rotating crane. This series of projects serves as a basis for examining a variety of issues associated with multidisciplinary design projects.
Hidden Markov tree modeling of complex wavelet transforms
Authors: Hyeokho Choi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Multiresolution signal and image models such as the hidden Markov tree aim to capture the statistical structure of smooth and singular (edgy) regions. Unfortunately, models based on the orthogonal wavelet transform suffer from shift-variance, making them less accurate and realistic. We extend the HMT modeling framework to the complex wavelet transform, which features near shift-invariance and improved angular resolution compared to the standard wavelet transform. The model is computationally efficient (with linear-time computation and processing algorithms) and applicable to general Bayesian inference problems as a prior density for the data. In a simple estimation experiment, the complex wavelet HMT model outperforms a number of high-performance denoising algorithms, including redundant wavelet thresholding (cycle spinning) and the redundant HMT.
How to Solve a Cubic Equation, Part 5: Back to Numerics
Authors: James F. Blinn
Venue: IEEE Computer Graphics and Applications (2007)

Jim Blinn continues his discussion on cubic equations.
Dynamic Two-Cell Incorrect Read Fault Due to Resistive-Open Defects in the Sense Amplifiers of SRAMs
Authors: A. Ney, P. Girard, C. Landrault, S. Pravossoudovitch, A. Virazel, M. Bastian
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

In this paper, we present an analysis of resistive-open defects in the sense amplifier of SRAMs designed with the Infineon 65nm technology. From manufacturing data, we show that in some cases, a resistive-open defect may lead to a new type of dynamic behavior which has never been published in the past. This faulty behavior can be modeled as a dynamic two-cell Incorrect Read Fault (d2cIRF). Such d2cIRF is the consequence of a failure in the sense amplifier which prevents it to perform any read operations. We show that it requires a specific sequence of read operations to be detected. Results of electrical simulations are presented to give a complete understanding of such a faulty behavior. Finally, a possible March test solution is presented to allow the detection of d2cIRFs in all sense amplifiers of an SRAM.
A multi-layer IPsec protocol
Authors: Yongguang Zhang, Bikramjit Singh
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

IPsec [KA98c] is a suite of standard protocols that provides security services for Internet communications. It protects the entire IP datagram in an "end-to-end" fashion; no intermediate network node in the public Internet can access or modify any information above the IP layer in an IPsec-protected packet. However, recent advances in internet technology introduce a rich new set of services and applications, like traffic engineering, TCP performance enhancements, or transparent proxying and caching, all of which require intermediate network nodes to access a certain part of an IP datagram, usually the upper layer protocol information, to perform flow classification, constraint-based routing, or other customized processing. This is in direct conflict with the IPsec mechanisms. In this research, we propose a multi-layer security protection scheme for IPsec, which uses a finer-grain access control to allow trusted intermediate routers to read and write selected portions of IP datagrams (usually the headers) in a secure and controlled manner.
Improving software security with precise static and runtime analysis
Authors: Monica Lam
Venue:  (2006)

The landscape of security vulnerabilities has changed dramatically in the last several years. While buffer overruns and format string violations accounted for a large fraction of all security exploits in the 1990s, recently the picture started to change. As Web-based applications became more prominent, familiar buffer overruns are now far outnumbered by Web application vulnerabilities such as SQL injections and cross-site scripting attacks. These vulnerabilities have lead to a multitude of attacks against e-commerce sites, financial institutions, etc., leading to millions of dollars in damages. In this thesis, we describe the Griffin project, which provides a comprehensive static and runtime compiler-based solution to a wide range of Web application vulnerabilities. Our approach targets large real-life Web-based Java applications. To make our approach to both extensible and user-friendly, vulnerability specifications are expressed in PQL, a Program Query Language. The static checker generated based on the PQL, specification finds vulnerabilities by analyzing the Web-based applications. We evaluate analysis features such as context-, object- and map sensitivity that help keep the number of false positives low. As an alternative to static analysis, secured application executables can be generated based on the same PQL vulnerability specification. Moreover, runtime vulnerability recovery rules may be provided. Our experimental results show that Griffin provides effective and practical tools for finding and preventing security vulnerabilities. We were able to find a total of 98 security errors, and all but one of our 11 large real-life benchmark applications were vulnerable. Two vulnerabilities were located in commonly used libraries, thus subjecting applications using the libraries to potential vulnerabilities. Most of the security errors we reported were confirmed as exploitable vulnerabilities by their maintainers, resulting in more than a dozen code fixes. The static analysis reported false positives for only one of 11 applications we have analyzed. While the runtime overhead can be quite high for our runtime protection, information we compute statically reduces the number of necessary instrumentation points dramatically, causing the overhead to drop below 10% in most cases. Finally, our runtime system was able to recover from all exploits we performed against it in practice.
Multi-hop probing asymptotics in available bandwidth estimation: stochastic analysis
Authors: Xiliang Liu, Kaliappa Ravindran, Dmitri Loguinov
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path P carrying arbitrarily routed bursty cross-traffic flows. We examine the statistical mean of the packet-train output dispersions and its relationship to the input dispersion. We call this relationship the response curve of path P. We show that the real response curve Z is tightly lower-bounded by its multi-hop fluid counterpart F, obtained when every cross-traffic flow on P is hypothetically replaced with a constant-rate fluid flow of the same average intensity and routing pattern. The real curve Z asymptotically approaches its fluid counterpart F as probing packet size or packet train length increases. Most existing measurement techniques are based upon the single-hop fluid curve S associated with the bottleneck link in P. We note that the curve S coincides with F in a certain large-dispersion input range, but falls below F in the remaining small-dispersion input ranges. As an implication of these findings, we show that bursty cross-traffic in multi-hop paths causes negative bias (asymptotic underestimation) to most existing techniques. This bias can be mitigated by reducing the deviation of Z from S using large packet size or long packet-trains. However, the bias is not completely removable for the techniques that use the portion of S that falls below F.
From WAP Services to Mobile Video: Trends in Mobile Services in Finland
Authors: Harry Bouwman, Christer Carlsson, Francisco J. Molina-Castillo
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

For a long time Finland was seen as the most successful country in Europe in terms of the adoption and use of advanced mobile services. This paper discusses trends in service adoption. We discuss the development in the Finnish telecommunication market and trends in actual and future user behaviour with regard to three groups of mobile services. Based on survey's from 2004, 2005 and 2006, in which the same concepts were measured, we test models in which concepts as innovativeness, flexibility, status and entertainment benefits are related to mobile travel service, traditional entertainment and mobile Internet services. Our analysis based on the data we collected over three years show that we cannot understand the actual and future use unless we take the subtleties and usability of specific services, i.e. the characteristics and user values of the services involved, into account.
Sorting-based localization and stable computation of zeros of a polynomial. II
Authors: Ya. E. Romm
Venue: Cybernetics and Systems Analysis (2007)

The stability of a sorting-based scheme for identifying polynomial zeros under coefficient perturbation is discussed. A method is proposed for simultaneous reconstruction (with a logarithmic estimate of time complexity) of the coefficients of an arbitrary polynomial from the values of its zeros. The method of identification of polynomial zeros is based on the operator of localization of extremal elements of a numerical sequence after its preliminary sorting. The method is extended to pattern recognition.
The effect of text in storyboards for video navigation
Authors: M. G. Christel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A storyboard is a presentation scheme for abstracting information in a digital video clip based on imagery. This paper describes a series of storyboard interfaces with added transcript text features. These interfaces are used in a controlled experiment focusing on the utility of transcript text in storyboards for news video navigation. We wished to explore whether such text resulted in improvements in video navigation, and, if so, whether the amount of text and its synchronization with video imagery affected the navigation task. The text-augmented storyboards performed significantly better than storyboards with no text. Full transcript text produced benefits when presented as a block, whereas reduced contextual text descriptions produced benefits when aligned with storyboard image rows.
Thickness measurement and crease detection of wheat grains using stereo vision
Authors: Changming Sun, Mark Berman, David Coward, Brian Osborne
Venue: Pattern Recognition Letters (2007)

Wheat grain quality assessment is important in meeting market requirements. The thickness of grains can be used for the measurement of the mass proportion of grains that pass through a sieve. This measure is known as ''screenings''. The determination of the presence or absence of the grain crease aids the detection of a stain called blackpoint, which is usually most evident on the non-crease side of the grain. In this paper we investigate the use of stereo vision techniques for measuring the thickness and detecting the presence or absence of the crease of a sample of wheat grains placed on a tray with dimples.
Automated Test Data Generation using Search Based Software Engineering
Authors: Mark Harman
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Generating test data is a demanding process. Without automation, the process is slow, expensive and errorprone. However, techniques to automate test data generation must cater for a bewildering variety of functional and non-functional test adequacy criteria and must either implicitly or explicitly solve problems involving state propagation and constraint satisfaction. This talk will show how optimisation techniques associated with Search Based Software Engineering (SBSE) have been used to automate test data generation. The talk will survey the area and present the results of recent work on characterising, transforming and eliding test data search landscapes.
A Complete Axiomatization of Knowledge and Cryptography
Authors: Mika Cohen, Mads Dam
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

The combination of first-order epistemic logic with formal cryptography offers a potentially powerful framework for security protocol verification. In this paper, cryptography is modelled using private constants and one-way computable operations, as in the Applied Pi-calculus. To give the concept of knowledge a computational justification, we propose a generalized Kripke semantics that uses permutations on the underlying domain of cryptographic messages to reflect agents' limited resources. This interpretation links the logic tightly to static equivalence, another important concept of knowledge that has recently been examined in the security protocol literature, and for which there are strong computational soundness results. We exhibit an axiomatization which is sound and complete relative to the underlying theory of terms, and to an omega-rule for quantifiers. Besides standard axioms and rules, the axiomatization includes novel axioms for the interaction between knowledge and cryptography. As protocol examples we use mixes, a Crowds-style protocol, and electronic payments. Furthermore, we provide embedding results for BAN and SVO.
Distortion equalized fuzzy competitive learning for image data vector quantization
Authors: D. Butler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Vector quantization is a popular approach to image compression as it allows images to be coded at less than one bit per pixel. This paper presents a modified fuzzy competitive learning algorithm and applies it to image data vector quantization. The proposed algorithm overcomes the neuron underutilization problem by applying both fuzzy learning and distortion equalization to the competitive learning algorithm. Experimental results on real image data shows that this approach produces a higher quality codebook than applying fuzzy learning or distortion equalization to the competitive learning algorithm individually.
5G wireless LAN RF transceiver system design: a new optimization approach
Authors: Zheng Yuanjin
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In this paper, the 802.11a specifications for 5 GHz wireless LAN (WLAN) radio frequency transceivers are summarized. Based on the study of recently published results of 0.9-5.8 GHz RF transceiver design, we propose a combined low IF-zero IF architecture to implement the 5 GHz wireless LAN transceivers. Detailed system design results in block level for the architecture are provided, which satisfy the 802.11a specifications very well. Moreover, a new iterative optimization method is proposed which can determine the gain of each stage and maximize the dynamic range of the whole receiver. 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
Context-aware Process Support through Automatic Selection and Invocation of Semantic Web Services
Authors: Stefan Dietze, Alessio Gugliotta, John Domingue
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Current technologies aimed at supporting processes - whether it is a business process or a learning process - are usually based on using a dedicated set of metadata to describe a process which refers to some specific data, used in the process. Process metadata is usually specific to a standard specification - like the Business Process Modeling Notation (BPMN) or the IMS Learning Design Standard - while used process data is specific to a specific process context. These facts limit the re-usability of a process model across different standards and contexts. To overcome these issues, this paper describes an innovative semantic web service-oriented architecture aimed at changing this data- and metadata-based paradigm to a highly dynamic service-oriented approach following the idea of a semantic abstraction from process metadata as well as process data. This approach enables a dynamic adaptation to specific actor needs and objectives and supports the development of abstract semantic process models which are re-usable across different contexts and standards. To illustrate the application of our approach, we describe a prototypical application to the domain of E-Learning.
2007 Special Issue: The cerebellum as a liquid state machine
Authors: Tadashi Yamazaki, Shigeru Tanaka
Venue: Neural Networks (2007)

We examined closely the cerebellar circuit model that we have proposed previously. The model granular layer generates a finite but very long sequence of active neuron populations without recurrence, which is able to represent the passage of time. For all the possible binary patterns fed into mossy fibres, the circuit generates the same number of different sequences of active neuron populations. Model Purkinje cells that receive parallel fiber inputs from neurons in the granular layer learn to stop eliciting spikes at the timing instructed by the arrival of signals from the inferior olive. These functional roles of the granular layer and Purkinje cells are regarded as a liquid state generator and readout neurons, respectively. Thus, the cerebellum that has been considered to date as a biological counterpart of a perceptron is reinterpreted to be a liquid state machine that possesses powerful information processing capability more than a perceptron.
On Generating EFSM Models from Use Cases
Authors: Avik Sinha, Amit Paradkar, Clay Williams
Venue: Proceedings of the Sixth International Workshop on Scenarios and State Machines (2007)

Use case-based behavior modeling of applications provides a modeler with an intuitive way of capturing requirements and therefore is considered to be more usable than other conventional behavior modeling techniques. However, such models lack sufficient structure to allow them to be analyzed and processed automatically. In this paper, we demonstrate how a combination of use case diagrams and UML class diagrams can be converted to extended finite state machine model. This algorithm addresses all standard UML 2.0 use case constructs as well as additional concerns such as conditional updates and exceptions.
Deploy and Search Strategy for Multi-agent systems using Voronoi partitions
Authors: Guruprasad K. R., Debasish Ghose
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In this paper we analyze a deploy and search strategy for multi-agent systems. Mobile agents equipped with sensors carry out search operation in the search space. The lack of information about the search space is modeled as an uncertainty density distribution over the space, and is assumed to be known to the agents a priori. In each step, the agents deploy themselves in an optimal way so as to maximize per step reduction in the uncertainty density. We analyze the proposed strategy for convergence and spatial distributedness. The control law moving the agents has been analyzed for stability and convergence using LaSalle's invariance principle, and for spatial distributedness under a few realistic constraints on the control input such as constant speed, limit on maximum speed, and also sensor range limits. The simulation experiments show that the strategy successfully reduces the average uncertainty density below the required level.
Li batteries with porous sol-gel cathodes
Authors: Antonela Dima, Francesco Della Corte, Maurizio Casalino, Ivo Rendina
Venue: Microelectronics Journal (2007)

The structure presented is a high-capacity micro battery, lithium based, consisting of porous cathode, solid electrolyte and silver anode. A spinel LiNi"0"."4La"0"."1Mn"1"."5O"4 sol-gel layer was deposited on a porous ceramic substrate to give high specific surface to the chip-like microbatteries. The anode used was thermally evaporated Ag and the electrolyte a sol-gel hybrid Li"4SiO"4 layer.
Frequency domain multi-channel speech separation and its applications
Authors: M. Handa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

A multi-channel speech separation method for real environments is proposed. The proposed method is based on frequency assignment, namely the magnitude of each channel at the same frequency bin is compared with each other and it is assigned to the channel, to which it originally belongs. This method is a direct consequence of frequency domain interpretation of the eigendecomposition method proposed by Cao et al., (1997). Furthermore, our proposed method does not require eigendecomposition, which consumes the costs of computation. We also present two example applications of the proposed method, that is, voice controlled computers in a multiuser environment and a noise removal in cellular telephony using two microphones.
Reinforcement Learning, Spike-Time-Dependent Plasticity, and the BCM Rule
Authors: Dorit Baras, Ron Meir
Venue: Neural Computation (2007)

Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is influenced by an environmental signal, termed a reward, that directs the changes in appropriate directions. We apply a recently introduced policy learning algorithm from machine learning to networks of spiking neurons and derive a spike-time-dependent plasticity rule that ensures convergence to a local optimum of the expected average reward. The approach is applicable to a broad class of neuronal models, including the Hodgkin-Huxley model. We demonstrate the effectiveness of the derived rule in several toy problems. Finally, through statistical analysis, we show that the synaptic plasticity rule established is closely related to the widely used BCM rule, for which good biological evidence exists.