ppxscal/embedding_network huggingface dataset:
The use of sub-band cepstrum in speaker verification
Authors: P. Sivakumaran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper focuses on the spectral representation of the sub-band cepstrum in relation to that of the full-band cepstrum. Through theoretical analysis it is shown that the net spectral information content of the cepstral coefficients with the same index in different sub-bands is only comparable to that of a full-band cepstral parameter whose quefrency is given by the product of that specific index with the number of sub-bands. A new method is proposed to tackle this deficiency of the sub-band cepstrum when it is used in the context of text-dependent speaker verification. The experimental investigations have clearly demonstrated the effectiveness of this method in speaker verification.
Minitrack: E-Government Emerging Topics
Authors: Theresa A. Pardo, Jeremy Millard, Hans J. (Jochen) Scholl
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Emerging Topics Mini-Track provides the opportunity to share new ideas and perspectives. The seven papers presented this year across two sessions represent a diverse mix of questions, research and practice domains, technologies, and methodologies. Topics range from architectures for mobile computing to egovernment in post-communist transitioning countries. The papers illustrate the breadth of the field of digital government research.
A new approach for continuing engineering education on information and communication technology in Flanders
Authors: W. Van Petegem
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. The sector of Information and Communication Technology (ICT) is facing a turbulent evolution in Flanders (Belgium). Innovative product development and the corresponding job opportunities largely depend on the availability of highly qualified personnel. It is hence indispensable that the knowledge of people working in this sector is regularly updated. Due to the rapid evolution in scientific developments and their multidisciplinarity, no single company and no single university may be considered as the center of expertise. This paper details how, at the request of large companies in the sector, grouped in FABIT/FABRIMETAL, all Flemish universities and several technical colleges collaborate in the organisation of two postacademic courses (one on telecommunications and one on information technology) to share the available expertise regionally spread throughout Flanders.
Blind knowledge based algorithms based on second order statistics
Authors: L. Perros-Meilhac
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Most second order single input multiple output (SIMO) identification algorithms identify the global impulse channel response, convolution of an emission filter and a propagation channel. This paper makes an explicit use of this channel structure in a second order algorithm. We present several structured methods exploiting more or less prior information on the emission filter. Proofs of convergence are provided, and simulations show that some knowledge based algorithms greatly improve over classical blind algorithms, even in the case where the knowledge is partial.
Signal modelling in wireless fading channels using spherically invariant processes
Authors: A. Abdi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We propose the application of spherically invariant random processes for joint modeling of the fluctuations of the signal envelope and phase in narrowband wireless fading channels. In this model, the phase has a uniform distribution (which is very common in fading channels), while the envelope can be distributed according to an arbitrary distribution law (which includes Rayleigh as a special case). The great utility of the spherically invariant random processes, as a large family of non-Gaussian random processes, lies on their many Gaussian-like properties, which make them very flexible for multivariate statistical analysis, optimal estimation, simulation, and other signal processing issues. Empirical justifications are also given, which strongly support the acceptability of the model.
Joint estimation of time delays and directions of arrival of multiple reflections of a known signal
Authors: M. Wax
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

An efficient algorithm for estimating the time delays and the directions-of-arrival of multiple reflections of a known signal is presented. The algorithm is based on an iterative scheme that transforms the multidimensional maximum likelihood criterion into two sets of simple one dimensional maximisations. Simulation results illustrating the performance of the algorithm in comparison with the Cramer-Rao bound are included.
A synergetic neural network-genetic scheme for optimal transformer construction
Authors: Nikolaos D. Doulamis, Anastasios D. Doulamis, Pavlos S. Georgilakis, Stefanos D. Kollias, Nikos D. Hatziargyriou
Venue: Integrated Computer-Aided Engineering (2002)

In this paper, a combined neural network and an evolutionary programming scheme is proposed to improve the quality of wound core distribution transformers in an industrial environment by exploiting information derived from both the construction and transformer design phase. In particular, the neural network architecture is responsible for predicting transformer iron losses prior to their assembly, based on several actual core measurements, transformer design parameters and the specific core assembling. A genetic algorithm is applied to estimate the optimal core arrangement, (i.e. the way of core assembling) that yields a set of three-phase transformers of minimal iron losses. The minimization is performed by exploiting information derived from the neural network model resulting in a synergetic neural network-genetic algorithm scheme. After the transformer construction, the prediction accuracy of the neural network model is evaluated. If accuracy is poor, a weight adaptation algorithm is applied to improve the prediction performance. For the weight updating, both the current and the previous network knowledge are taken into account. Application of the proposed neural network-genetic algorithm scheme to our industrial environment indicates a significant reduction in the variation between the actual and the designed transformer iron losses. This further leads to a reduction of the production cost since a smaller safety margin can be used for the transformer design.
DRIM: a low power dynamically reconfigurable instruction memory hierarchy for embedded systems
Authors: Zhiguo Ge, Weng-Fai Wong, Hock-Beng Lim
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Power consumption is of crucial importance to embedded systems. In such systems, the instruction memory hierarchy consumes a large portion of the total energy consumption. A well designed instruction memory hierarchy can greatly decrease the energy consumption and increase performance. The performance of the instruction memory hierarchy is largely determined by the specific application. Different applications achieve better energy-performance with different configurations of the instruction memory hierarchy. Moreover, applications often exhibit different phases during execution, each exacting different demands on the processor and in particular the instruction memory hierarchy. For a given hardware resource budget, an even better energy-performance may be achievable if the memory hierarchy can be reconfigured before each of these phases. In this paper, we propose a new dynamically reconfigurable instruction memory hierarchy to take advantage of these two characteristics so as to achieve significant energy-performance improvement. Our proposed instruction memory hierarchy, which we called DRIM, consists of four banks of on-chip instruction buffers. Each of these can be configured to function as a cache or as a scratchpad memory (SPM) according to the needs of an application and its execution phases. Our experimental results using six benchmarks from the MediaBench and the MiBench suites show that DRIM can achieve significant energy reduction.
The use and misuse of circuit simulation in electronics courses
Authors: J. Ross
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. It is clear that electrical and computer engineering students need to be able to use circuit simulation (SPICE) effectively upon graduation, but how that tool can best be used to teach the concepts of circuit design and analysis is not as obvious. The authors describe how, at the University of the Pacific, USA, they have grappled with this problem and are developing a solution that integrates the use of SPICE in their electronics courses and laboratories. This solution tries to keep the balance between exposing students to the latest software tools and teaching course concepts. 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
Experience with a process for software engineering Web-course development
Authors: S. A. White
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In 1999 The Software Engineering Program at University of Houston-Clear Lake elected to be one to participate in the development and delivery of official Web-based course offerings. The software engineering program had operated as a distance education program for the past six years via two-way live interactive video broadcast into multiple receiving sites. The new venture into Web-based delivery would prove to be quite different from the live broadcast distance courses since the lecture components and live classroom interactions were not provided. With the live broadcast method heavy use was made of the Web to provide easy access to all assignments, supplementary material, lecture notes, class messages, bulletin boards and an ftp site for assignment submission. This reduced phone and email time with the distance students dramatically and if certainly helped with the transition to the development of strictly Web-based courses. However, the content-related materials that had been provided to support the broadcast courses were found to be inadequate once the live lecture component was removed and the course become strictly Web-based. Fall 2000 will see the completion of the design, development and testing of three strictly Web-based software engineering courses that will form the basis for a certificate in Fundamentals of Software Engineering which will be issued by the School of Natural and Applied Science. The paper presents an overview of the activities that took place during the effort and the basic process used. 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
Robust Loop Detection for Interactively Placing Evenly Spaced Streamlines
Authors: Zhanping Liu, Robert J. Moorhead II
Venue: Computing in Science and Engineering (2007)

The authors present a robust and fast loop-detection strategy to interactively place dense uncluttered evenly spaced streamlines for complex flows.
Edge proximity conditions for extendability in cubic bipartite graphs
Authors: R. E. L. Aldred, Bill Jackson
Venue: Journal of Graph Theory (2007)

We show that a set M of m edges in a cyclically (3m&thinsp;-&thinsp;2)-edge-connected cubic bipartite graph is contained in a 1-factor whenever the edges in M are pairwise distance at least f(m) apart, where $$f\left( m \right) = \left\{ {\matrix{{1,} \hfill & {m = 2} \hfill \cr {3,} \hfill & {3 \le m \le 4} \hfill \cr {4,} \hfill & {5 \le m \le 8} \hfill \cr {5,} \hfill & {m \ge 9.} \hfill \cr } } \right.$$ &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 112&ndash;120, 2007
The impact of MEMS and NEMS on biotechnology in the 21st century
Authors: M. Madou
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The combination of natural polymers such as proteins and nucleic acids with MEMS and NEMS promises the advent of a totally new class of devices such as sensors and actuators with applications in diagnostics, responsive drug delivery, biocompatibility, self-assembly etc. This combination has become possible as today both top-down traditional manufacturing (e.g., MEMS and NEMS) and novel bottom-up manufacturing can realize components overlapping in size. Examples to illustrate the tremendous potential of merging top-down and bottom-up manufacturing techniques will be presented. These examples are called from the fields of molecular diagnostics, responsive drug delivery systems, protein and DNA structural elements and sensors and actuators and molecular self-assembly. 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
On line markets for distributed object services: the MAJIC system
Authors: Lior Levy, Liad Blumrosen, Noam Nisan
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

We describe a general-purpose architecture for applying economic mechanisms for resource allocation in distributed systems. Such economic mechanisms are required in settings such as the Internet, where resources belong to different owners. Our architecture is built above standard distributed-object frameworks, and provides a "market" for arbitrary distributed object resources. We first describe the abstract elements and properties of an architecture that can be applied over essentially any distributed object-based platform. We then describe the MAJIC system that we have implemented over Suns' Jini platform. A key novel aspect of our system is that it handles multiple parameters in the allocation and in the specification of utilities and costs for each distributed service. We provide both theoretical and experimental results showing the following three key properties of this system: (1) Efficient resource allocation. (2) Motivation for resource owners to share them with others. (3) Load balancing.
Double dribble: illusionism, mixed reality, and the sports fan experience
Authors: Jeffrey Bardzell, Shaowen Bardzell, Craig Birchler, Will Ryan
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Fans of spectator sports are changing the ways they access sports media faster than major sports leagues and media are changing their delivery approaches. The result is a situation that fails both the marketing and communication needs of the teams/leagues and the fan experience needs of the fans. In this project, we conceptualize a mixed reality platform that connects globally distributed fans to each other and live NBA games in real-time. We ask whether the design direction is even plausible and devise a low-cost experience prototype with which to experiment. We present the findings from two rounds of experimentation. We also see this study as an expansion on the notion of "transformation" in mixed reality including not merely actual changes of states across realities, but also illusory ones, which may contribute to uses of mixed reality in entertainment contexts.
Introduction to Scenario Description Language Q
Authors: Toru Ishida, Shohei Yamane
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

One of the most important attributes of social agents is the ability to fluently interact with human communities. Interaction scenarios are seldom designed by computer professionals, and instead are most often specified by application designers such as sales managers, travel agencies, and school teachers. Our challenge is to extend agent technologies to ensure the social acceptance of agents in various applications. To this end, we have developed Q, a language for designing interaction scenarios among agents and human communities. Q can also act as an interface between computer professionals and application designers. This paper details the specifications of Q, and shows how to design and execute scenarios for social agents.
An introduction to SAINT
Authors: Jane Lemmer
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Vulnerability analysis is an important part of a good security program. While there are many commercial tools available for performing vulnerability analysis, for enterprises with a large number of hosts these tools can be cost prohibitive. There are some free tools that are available, such as SATAN (Security Administrator's Tool for Analyzing Networks), but many are out-of-date. While conducting a vulnerability analysis for a customer with several thousand hosts, we decided to update SATAN and create a new, up-to-date, vulnerability analysis tool called SAINT (Security Administrator's Integrated Network Tool). SAINT includes all the tests performed by SATAN, plus many additional tests for new vulnerabilities, including Back Orifice, NetBus, statd, open SMB shares, and ToolTalk. This presentation will include the origins of SAINT, how SAINT works, what SAINT tests for, and the future of SAINT.
Virtual-join: a query execution technique
Authors: S. Y. Sung
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

Although communication cost is still a major cost for distributed databases, local cost in distributed query processing cannot be neglected. Observing the fact that almost all commercial database products employ plan enumeration with dynamic programming (PEDP) techniques, we find reducing the cost of both communication and local processing in 2-way join has potential benefits. Although many methods for reducing communication cost have been proposed, most of them employ a cost model that neglects local processing cost. This paper proposes a join execution method (called virtual join) that considers both of them. Virtual join has two desirable features: 1) Being adaptive to different values of selectivity. 2) Giving accurate cardinality of join result before it is materialized. Experiment results showed virtual join was both adaptive and efficient.
Expressiveness and complexity of xml publishing transducers
Authors: Wenfei Fan, Floris Geerts, Frank Neven
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

A number of languages have been developed for specifying XML publishing, i.e., transformations of relational data into XML trees. These languages generally describe the behaviors of a middleware controller that builds an output tree iteratively, issuing queries to a relational source and expanding the tree with the query results at each step. To study the complexity and expressive power of XML publishing languages, this paper proposes a notion of publishing transducers. Unlike automata for querying XML data, a publishing transducer generates a new XML tree rather than performing a query on an existing tree. We study a variety of publishing transducers based on what relational queries a transducer can issue, what temporary stores a transducer can use during tree generation, and whether or not some tree nodes are allowed to be virtual, i.e., excluded from the output tree. We first show how existing XML publishing languages can be characterized by such transducers. We then study the members ip, emptiness and equivalence problems for various classes of transducers and existing publishing languages. We establish lower and upper bounds, all matching except one, ranging from PTIME to undecidable. Finally, we investigate the expressive power of these transducers and existing languages. We show that when treated as relational query languages, different classes of transducers capture either complexity classes (e.g., PSPACE) or fragments of datalog (e.g., linear datalog). For tree generation, we establish connections between publishing transducers and logical transductions.
Guest Editors' Introduction: Managing Organizational Security
Authors: Shari Lawrence Pfleeger, Roland L. Trope, Charles C. Palmer
Venue: IEEE Security and Privacy (2007)

In this special issue, we focus on the challenges of managing organizational security, examining some of the nontechnical aspects of security that assure that the technology is chosen, implemented, and used appropriately and well.
Energy and qos aware routing protocols for wireless sensor networks
Authors: Mohamed Younis
Venue:  (2005)

Recent years have witnessed a growing interest in the application of wireless sensor networks (WSN). Examples of such applications include environmental monitoring, disaster management, target tracking and border control. Typically sensors in such applications collect data about their surrounding and forward that data to a gateway (sink). Due to the limitation of the energy supply that these miniaturized sensors have, almost all of the proposed routing protocols aimed at energy efficiency as the ultimate objective and considered relaying data to a stationary gateway.However, with the increasing interest in WSN applications, new protocols that can provide other performance guarantees such as end-to-end delay are needed. In this dissertation, we present a novel energy-aware mechanism for routing of delay-constrained data. The end-to-end delay bound is achieved by employing the Weighted Fair Queuing (WFQ) based packet scheduling technique in each sensor node. We have further extended the protocol to provide on-time delivery of delay-constrained data even when in-network data aggregation is performed at intermediate sensor nodes. In order to further improve the performance of our proposed protocol, we exploited the gateway's ability of moving to a new location. The aim is to enhance timeliness of real-time packets for the cases where it starts to diminish due to high volume of traffic. We have developed a novel relocation protocol for the gateway which periodically checks the deadline miss rate for packets and triggers a relocation stimulus for the gateway if the gateway miss rate exceeds a certain threshold. In addition to demanding certain performance guarantees, numerous WSN applications desire the mobility of the gateway node. We present a novel routing protocol, for efficient and continual data delivery to a mobile gateway. The same mechanism for handling gateway mobility is then utilized and combined with WFQ-based scheduling in order to provide certain end-to-end delay bounds with a mobile gateway. The performance of all the proposed protocols has been verified through extensive simulations.
Process Modelling Approach for Collaboration Networks
Authors: D. Vanderhaeghen, P. Loos
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

In the article, the approach towards an integrative process modelling for collaboration networks is presented. The authors depict a possibility for global modelling of business processes with a module-based modelling language in combination with established Event-driven Process Chains for local modelling. The approach helps to create and to distinguish model knowledge for its collaborative application.