ppxscal/embedding_network huggingface dataset:
Filter bank design for minimum distortion in presence of subband quantization
Authors: K. Gosse
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper presents source coding schemes, based on both parallel and tree-structured filter banks, in which synthesis filters and quantizers are jointly optimized under bit-rate constraint. The design of reconstruction filter banks thus takes into account the amount of subband quantization noise, and minimizes the output mean square error (MSE). All other constraints on the filters, such as perfect reconstruction or maximum selectivity, are relaxed, and noticeable improvements over perfect reconstruction schemes with optimal bit-rate allocation are shown by means of rate-distortion curves, for both synthetic and audio signals.
Recent developments in MEMS-based miniature fuel cells
Authors: Tristan Pichonat, Bernard Gauthier-Manuel
Venue: Microsystem Technologies (2007)

Micro fuel cells (&#x03bc;-FCs) represent promising power sources for portable applications. Today, one of the technological ways to make &#x03bc;-FCs is to have recourse to standard microfabrication techniques used in the fabrication of micro-electro-mechanical systems (MEMS). This paper shows an overview on the applications of MEMS techniques on miniature FCs by presenting several solutions developed throughout the world. It also describes the latest developments of a new porous silicon-based miniature fuel cell. Using a silane grafted on an inorganic porous media as the proton-exchange membrane instead of a common ionomer such as Nafion&#x00ae;, the fuel cell achieved a maximum power density of 58&#x00a0;mW&#x00a0;cm&#x2212;2 at room temperature with hydrogen as fuel.
Credit Risk Assessment with Least Squares Fuzzy Support Vector Machines
Authors: Lean Yu, Kin Keung Lai, Shouyang Wang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this study, we discuss a least squares version of fuzzy support vector machine (FSVM) classifiers for designing a credit risk assessment system to discriminate good creditors from bad ones. Relative to the classical FSVM, the least squares FSVM (LSFSVM) can transform a quadratic programming problem into a linear programming problem thus reducing the computational complexity. For illustration, a real-world credit dataset is used to test the effectiveness of the LS-FSVM.
Consequence Oriented Self-Healing and Hybrid Diagnosis Integrating Decision Diagram, Fuzzy Logic and Neural Network
Authors: Yuan-Shun Dai, Michael Hinchey, Qingpei Hu
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

Computing systems become increasingly large and complex. Their dependability and autonomy are of great concern today, where self-healing is a challenging topic. This paper presented an innovative model and technology to realize the self-healing function under the real-time requirement. This approach, different from the existing technologies, is based on a new concept defined as consequenceoriented diagnosis and healing. Derived from the new concept, a prototype model for proactive self-healing actions is presented. Then, this paper proposes a hybrid tool that combines MDD, Fuzzy Logic and Neural Network, which is efficient, accurate and intelligent. Some examples to help illustrate the concepts are shown across the paper.
Performance Analysis of Location Estimation Algorithm in ZigBee Networks Using Received Signal Strength
Authors: Hyunggi Cho, Myungseok Kang, Jonghyuk Park, Byungsung Park, Hagbae Kim
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents a Maximum Likelihood Estimator (MLE) for the ZigBee networks. We propose a deployment of cluster-tree topology in the ZigBee networks and derive the MLE under the log-normal models for the Received Signal Strength (RSS) measurements. The ZiLA algorithm is also proposed to apply the MLE to ZigBee networks. To validate the RSS measurement model, we have conducted exhaustive experiments. Testbed experiments are also conducted to validate the effectiveness of ZiLA algorithm.
2007 Special Issue: Fast neural network surrogates for very high dimensional physics-based models in computational oceanography
Authors: Rudolph van der Merwe, Todd K. Leen, Zhengdong Lu, Sergey Frolov, Antonio M. Baptista
Venue: Neural Networks (2007)

We present neural network surrogates that provide extremely fast and accurate emulation of a large-scale circulation model for the coupled Columbia River, its estuary and near ocean regions. The circulation model has O(10^7) degrees of freedom, is highly nonlinear and is driven by ocean, atmospheric and river influences at its boundaries. The surrogates provide accurate emulation of the full circulation code and run over 1000 times faster. Such fast dynamic surrogates will enable significant advances in ensemble forecasts in oceanography and weather.
Critical Configurations for 1-View in Projections from ℙk &rarr; ℙ2
Authors: Marina Bertolini, Cristina Turrini
Venue: Journal of Mathematical Imaging and Vision (2007)

In this paper we describe, from a theoretical point of view, critical configurations for the projective reconstruction of a set of points, for a single view, i.e. for calibration of a camera, in the case of projections from ¿k to ¿2 for k ¿ 4. We give first a general result describing these critical loci in ¿k, which, if irreducible, are algebraic varieties of dimension k¿2 and degree 3. If k=4 they can be either a smooth ruled surface or a cone and if k = 5 they can be a smooth three dimensional variety, ruled in planes, or a cone. If k¿ 6, the variety is always a cone, the vertex of which has dimension at least k ¿ 6. The reducible cases are studied in Appendix A.These results are then applied to determine explicitly the critical loci for the projections from ¿k which arise from the dynamic scenes in ¿3 considered in [13].
Influence of electrode characteristics on the performance of organic light-emitting devices
Authors: Zhong Zhi You
Venue: Microelectronics Journal (2007)

Indium-tin oxide (ITO) substrates were treated by oxygen plasma for organic light-emitting devices (OLEDs). Using the ITO substrates aged for various times as hole-injecting electrodes, the double-layered OLEDs were fabricated by the vacuum sublimation technique, and the aging effect of treated ITO anodes on the performance of OLEDs was studied with respect to the electroluminescence efficiency, brightness and driving voltage. Experimental results reveal that the luminescent and electrical characteristics of the OLEDs are strongly dependent on the properties of the ITO anodes, and the ITO anodes aged for various times result in significant differences in device performance, which become worse with the increment of the aging time. The measurements of X-ray photoelectron spectroscopy (XPS) and surface energy show that carbon concentration increases, oxygen concentration reduces and surface energy decreases, and thereby the improved surface properties of ITO tend to decay, as the aging time increases. It indicates that the device performance of the OLEDs is closely related to the surface characteristics of the ITO anodes.
A Feature-Oriented Adaptive Component Model for Dynamic Evolution
Authors: Xin Peng, Yijian Wu, Wenyun Zhao
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Dynamic adaptation has been an essential requirement for more and more business systems. Some research works have focused on the structural or behavioral changes of adaptive programs. There are also some works on adaptive components, with the emphasis on separation between control flow and basic functions of components. In these works, a business model for the domain is always missing, so a comprehensible business view of adaptations is unavailable for the user. In this paper, we propose a feature-oriented adaptive component model, which introduces the ontology-based feature model proposed in our previous work on feature-based domain modeling to provide both the business view for the user and adaptation basis for the system. Furthermore, the ontology-based model provides unambiguous terminology for both the business view and the component specification, which ensures the consistency between them. This feature-oriented adaptive component model has another characteristic of the micro control flow within the component, which enables the adaptation of the component behavior, including interaction sequence and style. The adaptive component model has been applied in our intelligent connector based framework for dynamic architecture, so a case study on the adaptive version of JPS (Java Pet Store) is illustrated to show the advantages of the component model.
Antecedents to Relational and Nonrelational Source Use: An Exploratory Investigation
Authors: J. Christopher Zimmer, Raymond M. Henry
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Drawing a distinction between relational and nonrelational sources, we explore the antecedents to selecting an information source. The antecedents to use have been categorized into job, individual, and source characteristics. Two theoretical models are developed and tested using working professionals. The differences between the models are highlighted and discussed. The results indicate that there are differences in the drivers of source selection which could have direct implications for the design of knowledge management systems.
Emstar: A software environment for developing and deploying heterogeneous sensor-actuator networks
Authors: Lewis Girod, Nithya Ramanathan, Jeremy Elson, Thanos Stathopoulos, Martin Lukac, Deborah Estrin
Venue: ACM Transactions on Sensor Networks (TOSN) (2007)

Recent work in wireless embedded networked systems has followed heterogeneous designs, incorporating a mixture of elements from extremely constrained 8- or 16-bit &ldquo;Motes&rdquo; to less resource-constrained 32-bit embedded &ldquo;Microservers.&rdquo; Emstar is a software environment for developing and deploying complex applications on such heterogeneous networks. Emstar is designed to leverage the additional resources of Microservers by trading off some performance for system robustness in sensor network applications. It enables fault isolation, fault tolerance, system visiblity, in-field debugging, and resource sharing across multiple applications. In order to accomplish these objectives, Emstar is designed to run as a multiprocess system and consists of libraries that implement message-passing IPC primitives, services that support networking, sensing, and time synchronization, and tools that support simulation, emulation, and visualization of live systems, both real and simulated. We evaluate this work by discussing the Acoustic ENSBox, a platform for distributed acoustic sensing that we built using Emstar. We show that by leveraging existing Emstar services, we are able to significantly reduce development time while achieving a high degree of robustness. We also show that a sample application was developed much more quickly on this platform than it would have been otherwise.
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
Authors: Ankit Patel, Julius Degesys, Radhika Nagpal
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of firefies flashing in unison in biology. The inverse problem of desynchronization, however, has received little notice. Desynchronization is a powerful primitive: given a set of identical oscillators, applying a desynchronization primitive spreads them throughout the period, resulting in a round-robin schedule. This can be useful in several applications: medium access control in wireless sensor networks, designing fast analogto- digital converters, and achieving high-throughput traf- fic intersections. Here we present two biologically-inspired algorithms for achieving desynchronization: DESYNC and INVERSE-MS. Both algorithms are simple and decentralized and are able to self-adjust to the addition and removal of agents. Furthermore, neither requires a global clock or explicit fault detection. We prove convergence, compute bounds for the running time, and assess the various tradeoffs. To our knowledge, the theory of self-organizing desynchronization algorithms is presented here for the first time.
Adapting the course "quality of information systems" to E.H.E.A guidelines
Authors: Mario Piattini, Félix García
Venue: ACM SIGCSE Bulletin (2007)

Currently, organizations depend increasingly on the quality of information systems (IS) for the achieving of their main strategic goals. This is the driving force behind providing Computer engineers with the necessary training. We present some ideas and experiences about how the teaching of the course Information System Quality, which belongs to the 5th year of MSc degree in Computer Science, has been adjusted and adapted so as to comply with the directives of the European Higher Education Area (EHEA). Important lessons and points to consider in the future have come about from the above.
From Template to Image: Reconstructing Fingerprints from Minutiae Points
Authors: Arun Ross, Jidnya Shah Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Most fingerprint-based biometric systems store the minutiae template of a user in the database. It has been traditionally assumed that the minutiae template of a user does not reveal any information about the original fingerprint. In this paper, we challenge this notion and show that three levels of information about the parent fingerprint can be elicited from the minutiae template alone, viz., 1) the orientation field information, 2) the class or type information, and 3) the friction ridge structure. The orientation estimation algorithm determines the direction of local ridges using the evidence of minutiae triplets. The estimated orientation field, along with the given minutiae distribution, is then used to predict the class of the fingerprint. Finally, the ridge structure of the parent fingerprint is generated using streamlines that are based on the estimated orientation field. Line Integral Convolution is used to impart texture to the ensuing ridges, resulting in a ridge map resembling the parent fingerprint. The salient feature of this noniterative method to generate ridges is its ability to preserve the minutiae at specified locations in the reconstructed ridge map. Experiments using a commercial fingerprint matcher suggest that the reconstructed ridge structure bears close resemblance to the parent fingerprint.
Evolutionary swarm traffic: if ant roads had traffic lights
Authors: R. Hoar, J. Penner, C. Jacob
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Traffic congestion has become a major concern for many cities throughout the world. Consequently, simulations can provide helpful tools for engineers to plan traffic systems. We present SuRJE, a swarm-based traffic simulation system. All interactions among individual drivers are implemented through the dropping and sniffing of pheromones on a 2-dimensional map. Furthermore, SuRJE optimizes traffic light turn and time sequences using an evolutionary algorithm and swarm voting, which helps to speed up the adaptation process for the traffic light settings.
Writing a Tcl extension in only 7 years
Authors: Don Libes
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Expect is a tool for automating interactive applications. Expect was constructed using Tcl, a language library designed to be embedded into applications. This paper describes experiences with Expect and Tcl over a seven year period. These experiences may help other extension designers as well as the Tcl developers or developers of any other extension language see some of the challenges that a single extension had to deal with while evolving at the same time as Tcl. Tcl and Expect users may also use these 'war stories' to gain insight into why Expect works and looks the way it does today.
Outposts
Authors: David Alan Grier
Venue: Computer (2007)

Early Internet users occasionally encountered lone outposts that were not quite blogs nor even personal Web pages, though they pointed in the direction of both.
A Research Collaboratory for Open Source Software Research
Authors: Yongqin Gao, Matthew Van Antwerp, Scott Christley, Greg Madey
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Various research approaches have been proposed to study the OSS movement. To facilitate this OSS related research, we designed and implemented an online research collaboratory. It is not only a repository including over two years of monthly database dumps from SourceForge.net, but also an online community supporting OSS related research. We describe the design and implementation of the research collaboratory and usage statistics for the year 2006.
STORM: A Secure Overlay for P2P Reputation Management
Authors: Aina Ravoaja, Emmanuelle Anceaume
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite malicious peers, and particularly collusion. This paper presents STORM (for Secure sTructured Overlay for Reputation Management), a P2P protocol which addresses this issue. STORM provides support for gathering peers reputation information safely by self-organizing peers into clusters of peers of common interests. To mitigate the effect of malicious peers, STORM relies on a randomized decision algorithm aiming at securing the routing table maintenance, and on constrained redundant routing focusing on securing information lookup. We show STORM efficiency and robustness through a formal analysis. Specifically, we prove a lower bound on the number of malicious peers that can be inserted in routing tables and we show that our solution is very close to optimal. Finally, we show that our constrained redundant routing approach succeeds at countering collusive behavior.
The minimum length of a base for the symmetric group acting on partitions
Authors: Carmit Benbenishty, Jonathan A. Cohen, Alice C. Niemeyer
Venue: European Journal of Combinatorics (2007)

A base for a permutation group, G, is a sequence of elements of its permutation domain whose stabiliser in G is trivial. Using purely elementary and constructive methods, we obtain bounds on the minimum length of a base for the action of the symmetric group on partitions of a set into blocks of equal size. This upper bound is a constant when the size of each block is at most equal to the number of blocks and logarithmic in the size of a block otherwise. These bounds are asymptotically best possible.
Parameterised floating-point arithmetic on FPGAs
Authors: J. Allan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper describes the parameterisation, implementation and evaluation of floating-point adders and multipliers for FPGAs. We have developed a method, based on the Handel-C language, for producing technology-independent pipelined designs that allow compile-time parameterisation of design precision and range, and optional inclusion of features such as overflow protection, gradual underflow and rounding modes of the IEEE floating-point format. The resulting designs, when implemented in a Xilinx XCV1000 device, achieve 28 MFLOPs with IEEE single precision floating-point numbers. These designs are used in an optimised implementation for computing the two-dimensional fast Hartley transform. Preliminary results suggest that our implementation is faster than many programmable DSP processors and supercomputers.
Experiences with undergraduate honors theses in the computer engineering program at Brown University
Authors: S. Ghosh
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper is the result of a seven-year long experiment by the author that was initiated in 1989 as an attempt to integrate the tradition of undergraduate honors research at Brown University with the emerging ABET requirement of engineering design in the computer engineering program. The paper presents the philosophical principles, the underlying assumptions and goals of the experiment, and the character of the experiences learned at the conclusion of the experiment. 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
Strategies for reducing the complexity of a RNN based speech recognizer
Authors: K. Kasper
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Recurrent neural networks (RNN) provide a solution for low cost speech recognition systems (SRS) in mass products or in products with energetic constraints if their inherent parallelism could be exploited in a hardware realization. Actually, the computational complexity of SRS based on fully recurrent neural networks (FRNN), e.g. the large number of connections, prevents a hardware realization. We introduce locally recurrent neural networks (LRNN) in order to keep the properties of RNN on the one hand and to reduce the connectivity density of the network on the other hand. By simulation experiments it is shown that the recognition capability of LRNN is equivalent to that of FRNN and superior to other proposed network architectures. Furthermore, it is shown that with an appropriate representation of the network parameters and a retraining of the network 5 Bit quantization of the weights and activities is possible without significant loss in recognition performance.
A new paradigm for engineering education
Authors: K. D. Hurst
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Engineering educators today must teach academic fields which encompass a greater range and depth of technology than ever before. Engineering graduates, on the other hand, are expected to combine detailed understanding of a sub-specialty with the flexibility to adapt to new technologies, interdisciplinary challenges and a changing marketplace. A solution to this apparent dilemma can be found by considering a new paradigm for education which places specific engineering fields within the context of scientific progress. This paper recommends incorporating same scientific history at the individual course level. An understanding of scientific history allows students to connect their particular field of study to the underlying sciences, to other fields of engineering and to a larger historical and intellectual context. Additionally, incorporating the historical context lends insight into the human element inherent in engineering. By presenting engineering knowledge in this framework, educators could provide students with a more flexible, relevant and permanent understanding of engineering. 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