ppxscal/embedding_network huggingface dataset:
3D silicon turning micromirror
Authors: Chen Shi-Hao, Chien Chao-Heng
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The concept of designing a 3D silicon turning mirror is combine the two of 2D comb drivers. The turning mirror is driven by electrostatic force with vertical comb fingers. The upper comb driver is composed of a turning mirror plate, two pairs of torsion beams, a supporting frame and vertical comb fingers. The lower comb driver is composed of vertical comb fingers, and a supporting frame, signal lines and pads is based on the Pyrex glass substrate. The both comb drivers could be assembled by flip chip bonding. This turning mirror can be used for laser display, scanner, barcode reader, optical switch etc. The 3D turning micromirror is designed by MEMS Designer. The fabrication processes are mainly composed of comb fabrication and assembling process. The Deep RIE applied to etch the depth of finger layer of comb driver, and MEMS surface micromachine applied to deposit the signal lines and pads on the Pyrex glass substrate. Then, the flip chip bonding technique is applied to bond two comb drivers.
Narrowband interference suppression in CDMA systems using non-uniform sampling
Authors: G. Mandyam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A low-complexity and iterative receiver is proposed for the CDMA uplink, consisting of a low-complexity equalizer and single-user decoders. Iterations are used to feed the equalizer with more reliable data, which improves performance. This receiver called turbo-CDMA is aimed to eliminate MUI almost completely in the presence of multipath and to be robust to the near-far effect. Simulation results show that the performance approaches single-user performance at moderate and also low signal-to-noise ratios, even for a severe distortion channel. 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
Proactive communication in multi-agent teamwork
Authors: Richard A. Volz
Venue:  (2005)

Sharing common goals and acting cooperatively are critical issues in multiagent teamwork. Traditionally, agents cooperate with each other by inferring others' actions implicitly or explicitly, based on established norms for behavior or on knowledge about the preferences or interests of others. This kind of cooperation either requires that agents share a large amount of knowledge about the teamwork, which is unrealistic in a distributed team, or requires high-frequency message exchange, which weakens teamwork efficiency, especially for a team that may involve human members. In this research, we designed and developed a new approach called Proactive Communication, which helps to produce realistic behavior and interactions for multi-agent teamwork. We emphasize that multi-agent teamwork is governed by the same principles that underlie human cooperation. Psychological studies of human teamwork have shown that members of an effective team often anticipate the needs of other members and choose to assist them proactively. Human team members are also naturally capable of observing the environment and others so they can establish certain parameters for performing actions without communicating with others. Proactive Communication endows agents with observabilities and enables agents use them to track others' mental states. Additionally, Proactive Communication uses statistical analysis of the information production and need of team members and uses these data to capture the complex, interdependent decision processes between information needer and provider. Since not all these data are known, we use their expected values with respect to a dynamic estimation of distributions. The approach was evaluated by running several sets of experiments on a Multi-Agent Wumpus World application. The results showed that endowing agents with observability decreased communication load as well as enhanced team performance. The results also showed that with the support of dynamic distributions, estimation, and decision-theoretic modeling, teamwork efficiency were improved.
Robust independent component analysis for cognitive informatics
Authors: N. Gadhok, W. Kinsner
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

This paper evaluates the outlier sensitivity of five independent component analysis (ICA) algorithms (FastICA, extended-Infomax, JADE, radical, and /spl beta/-divergence) using: (i) the Amari separation performance index, (ii) the optimum angle of rotation error, and (iii) the contrast function difference, in an outlier-contaminated mixture simulation. The Amari separation performance index has revealed a strong sensitivity of JADE and FastICA, using 3rd- and 4th- order nonlinearities, to outliers. However, the two contrast measures demonstrated conclusively that /spl beta/-divergence is the least outlier-sensitive algorithm, followed by Radical, FastICA (exponential and hyperbolic-tangent nonlinearities), extended-Infomax, JADE, and FastICA (3rd-and 4th-order nonlinearities) in an outlier-contaminated mixture of two uniformly distributed signals. The novelty of this paper is the development of an unbiased optimization-landscape environment for assessing outlier sensitivity, as well as the optimum angle of rotation error and the contrast function difference as promising new measures for assessing the outlier sensitivity of ICA algorithms.
Framework for Bloom's Knowledge Placement in Computer Games
Authors: Cheng-Su Wang, Yeu-Ruey Tzeng
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

Computer games are an excellent e-learning platform for constructing student cognizance. The integrations of computer game and e-learning are a common and popular trend. However, most of these integrations focus on the transfer of knowledge (the e-learning content) as a "game-like" content based within a computer game. This is ineffective and meaningless due to the fact that students should be learning knowledge via the cognizance process. Computer games are merely a platform, a channel, and a tool. We should address and focus on the cognizance process. Computer games are an experience-based media which feasibly constructs player (student) knowledge through game playing. Thus, based on the problem solving theory, we proposed a framework which intends to replicate the revised bloom's cognitive processes in a computer game. Our depicted scenario is a computer game named Food Force, which will illustrate our proposed framework.
Context-dependent acoustic models for Chinese speech recognition
Authors: Bin Ma, Taiyi Huang, Bo Xu, Xijun Zhang, Fei Qu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Selecting good speech units and building precise acoustic models on these units are basic problems for HMM speech recognition systems. In this paper, we review some distinguished phonetic features of the Chinese language and show how these features could be considered for getting a better solution of speech units selection and acoustic model building. The initials and finals are suggested to be the recognition units. Several experiments have been carried out to find those proper acoustic models which can represent the co-articulation among initials and finals more accurately and give a higher recognition rate. Results of recognition error rate under different acoustic models are given and some comparisons are made. Experiments show that not only the intra-syllable context-dependent acoustic models but also the inter-syllable acoustic models are necessary for reducing recognition error rate of words and continuous speech recognition. Experiments also show the tone-pattern information is important for accurate syllable recognition.
Integrating the Personal Software Process (PSP) across the undergraduate curriculum
Authors: M. Towhidnejad
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper summaries some Embry-Riddle University activities on the incorporation of Watts Humphrey's Personal Software Process (PSP) throughout the undergraduate computer science curriculum. This paper includes a description of the project's objectives, a discussion of the activities engaged in by students, an explanation of how the activities were integrated into the curriculum, a description of the data collected and an assessment of the impact and value of the project. Finally ideas about modification and extension of the project's concepts are presented.
How to Consider Requester's Preferences to Enhance Web Service Discovery?
Authors: Nomane Ould Ahmed M'Bareck, Samir Tata
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Web services provide standard means to promote interoperability and extensibility among software applications, as well as to allow them to be combined in order to perform more complex operations. Therefore web services have to be described, published, discovered, invoked and composed. Within this process describing Web services using ontology will enhance service discovery. The "quality" of that discovery depends on the used algorithms and techniques. In this paper we propose a novel approach to enhance web service discovery based on, among others, requesters' preferences. First of all, we propose a way to express preferences of request elements. Then we introduce a matching algorithm that takes into account theses preferences in the discovery process.
Adaptive two-band spectral subtraction with multi-window spectral estimation
Authors: Chuang He
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

An improved spectral subtraction algorithm for enhancing speech corrupted by additive wideband noise is described. The artifactual noise introduced by spectral subtraction that is perceived as musical noise is 7 dB less than that introduced by the classical spectral subtraction algorithm of Berouti et al. (1979). Speech is decomposed into voiced and unvoiced sections. Since voiced speech is primarily stochastic at high frequencies, the voiced speech is high-pass filtered to extract its stochastic component. The cut-off frequency is estimated adaptively. Multi-window spectral estimation is used to estimate the spectrum of stochastically voiced and unvoiced speech, thereby reducing the spectral variance. A low-pass filter is used to extract the deterministic component of voiced speech. Its spectrum is estimated with a single window. Spectral subtraction is performed with the classical algorithm using the estimated spectra. Informal listening tests confirm that the new algorithm creates significantly less musical noise than the classical algorithm.
Toward a cost model for system administration
Authors: Alva L. Couch, Ning Wu, Hengky Susanto
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

The core of system administration is to utilize a set of "best practices" that minimize cost and result in maximum value, but very little is known about the true cost of system administration. In this paper, we define the problem of determining the cost of system administration. For support organizations with fixed budgets, the dominant variant cost is the work and value lost due to time spent waiting for services. We study how to measure and analyze this cost through a variety of methods, including white-box and black-box analysis and discrete event simulation. Simple models of cost provide insight into why some practices cost more than expected, and why transitioning from one kind of practice to another is costly.
Quantization of Sparse Representations
Authors: Petros Boufounos, Richard Baraniuk
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Compressive sensing (CS) is a new signal acquisition technique for sparse and com- pressible signals. Rather than uniformly sampling the signal, CS computes inner products with randomized basis functions; the signal is then recovered by a convex optimization. Random CS measurements are universal in the sense that the same acquisition system is sufficient for signals sparse in any representation. This paper examines the quantization of strictly sparse, power-limited signals and concludes that CS with scalar quantization uses its allocated rate inefficiently.
Improved Approach for Snake Model Based on GHough and Dynamic Programming
Authors: Xiaofei Feng
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Snake models are used more and more widely in applications of image analysis and computer vision. There are two challenging issues for the application of snake models: how to select the initial contour of the object automatically and how to obtain good convergence result. This paper introduces an improved approach for snake model that integrates with GHough transformation and dynamic programming algorithm. In the paper GHough transformation is used to help selecting the initial contour without the interference manually, and the dynamic programming is used to improve the convergence precision. The experimental results shows that such approach can not only solve the problem of selecting initial contour automatically, but also get good convergence results.
Parsing in attributed grammars: application to automatic sleep analysis
Authors: A. L. N. Fred
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper addresses the problem of language recognition according to stochastic attributed context-free grammars. Starting with an application as the main motivation-automatic sleep analysis-a heuristic recognizer for attributed grammars is proposed. The algorithm (an extension of a previously developed method for stochastic context-free grammars) is there used both in the process of grammar inference and on the classification of sleep macrostructure. The generality of the method features its application into other areas, namely in natural language and speech understanding.
PtTcl: using Tcl with Pthreads
Authors: D. Richard Hipp, Mike Cruse
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Tcl is not thread-safe. If two or more threads attempt to use Tcl at the same time, internal data structures can be corrupted and the program can crash. This is true even if the threads are using separate Tcl interpreters. PtTcl is a modification to the Tcl core that makes Tcl safe to use with POSIX threads. With PtTcl, each thread can create and use its own Tcl interpreters that will not interfere with interpreters used in other threads. A message-passing mechanism allows Tcl interpreters running in different treads to communicate. However, even with PtTcl, the same interpreter still cannot be accessed by more than one thread. This paper describes the design, implementation and use of PtTcl.
Testing Model-Processing Tools for Embedded Systems
Authors: Prahladavaradan Sampath, A. C. Rajeev, S. Ramesh, K. C. Shashidhar
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

Model-based development is increasingly becoming the method of choice for developing embedded systems for applications in automotive and aerospace industries. It relies on tool-suites consisting of a variety of model-processing tools like simulators, model-translators and code-generators. The correctness of these tools used in the development process is a key requirement for safety critical applications. This paper proposes a novel testing methodology for the rigorous verification of model processing tools. The proposed methodology takes as input the syntactic and semantic meta-model of a modeling language, expressed in the form of inference rules. Using a coverage criteria over this meta-model, it generates test-models, and test-inputs for these test-models. Apart from testing the syntactic aspects of the translation, our method aims at testing subtle semantic interactions of the modeling language that are potentially mistranslated by the model-processing tools. We illustrate the methodology with a simple prototypical process calculus. We also report on the experiments carried out with Stateflow, a variant of hierarchical state-machines implemented in the Matlab/Simulink tool-suite.
Stanford, the IBM 650, and the First Trials of Computer Date Matching
Authors: C. Stewart Gillmor
Venue: IEEE Annals of the History of Computing (2007)

In 1959, two Stanford undergraduate electrical engineering students enrolled in Math 139, Theory and Operation of Computing Machines, and as a final class project, devised the "Happy Families Planning Service." They used the IBM model 650 computer, pairing up 49 men and 49 women, for the first known computer-date-matched party.
Multicoloring for Fast Sparse Matrix-Vector Multiplication in Solving PDE Problems
Authors: H. C. Wang, Kai Hwang
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

A new multicoloring technique is proposed for parallel sparse matrix-vector multiplication, which dominates the computing cost of iterative PDE (partial differential equation) solvers. The new technique enables parallel solution of grid-structured nonsymmetric PDE problems on shared-memory multiprocessors through resolving memory access conflicts by multiple processors. The coloring scheme is formulated as an algebraic mapping which can be implemented with low overhead.
Unsupervised induction of modern standard Arabic verb classes using syntactic frames and LSA
Authors: Neal Snider, Mona Diab
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We exploit the resources in the Arabic Treebank (ATB) and Arabic Gigaword (AG) to determine the best features for the novel task of automatically creating lexical semantic verb classes for Modern Standard Arabic (MSA). The verbs are classified into groups that share semantic elements of meaning as they exhibit similar syntactic behavior. The results of the clustering experiments are compared with a gold standard set of classes, which is approximated by using the noisy English translations provided in the ATB to create Levin-like classes for MSA. The quality of the clusters is found to be sensitive to the inclusion of syntactic frames, LSA vectors, morphological pattern, and subject animacy. The best set of parameters yields an F&beta;=1 score of 0.456, compared to a random baseline of an F&beta;=1 score of 0.205.
On the Practical Application of a Quantitative Model of System Reconfiguration Due to a Fault
Authors: Gene Saghi, Howard Jay Siegel, Jose A. B. Fortes
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

If a processor develops a permanent fault during the execution of a task on a dynamically reconfigurable parallel machine, three recovery options are task migration to a fault-free subdivision, task migration to another submachine, and task redistribution. Quantitative models of these three reconfiguration schemes are analyzed, together with the cost of making the wrong choice, to develop guidelines for selecting among these methods in a practical dynamic reconfiguration implementation. A multistage cube or hypercube inter-processor network is assumed. The PASM and nCUBE 2 parallel machines are used as vehicles for studying the model parameters.
Complexity of Ring Morphism Problems
Authors: Neeraj Kayal, Nitin Saxena
Venue: Computational Complexity (2006)

We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of a ring. This counting problem is shown to be in the functional version of the complexity class AM ¿ coAM and hence is not NP-complete unless the polynomial hierarchy collapses. As a "positive" result we show that deciding whether a given ring has a non-trivial automorphism can be done in deterministic polynomial time. Finding such an automorphism is, however, shown to be randomly equivalent to integer factorization.
Segmentation and motion estimation
Authors: H. Naseri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We present an algorithm that combines image segmentation and motion field estimation. The segmentation includes the occluded and uncovered background regions, the self-occluded and uncovered object regions, and the common moving regions of the objects.
Fault Detection in Multi-Threaded C++ Server Applications
Authors: Arndt Mühlenfeld, Franz Wotawa
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Due to increasing demands in processing power on the one hand, but the physical limit on CPU clock speed on the other hand, multi-threaded programming is becoming more important in current applications. Unfortunately, multi-threaded programs are prone to programming mistakes that result in hard to find defects, mainly race-conditions and deadlocks. The need for tools that help finding these faults is immanent, but currently available tools are either difficult to use because of the need for annotations, unable to cope with more than a few 10 kLOC, or issue too many false warnings. This paper describes experiments with the freely available tool Helgrind and results obtained by using it for debugging a server application comprising 500 kLOC. We present improvements to the runtime analysis of C++ programs that result in a dramatic reduction of false warnings.
Managing the human processes in curriculum reform
Authors: N. T. Middleton
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Institution-wide reform of the curriculum at the Colorado School of Mines, USA, has called for the participation of many constituencies, demanding an on-going process of evolution, negotiation, communication and action. This paper describes how these processes have been managed in CSM's move from a visionary statement of educational goals to the implementation of a new curriculum, and it describes how these processes are becoming institutionalized for a future of continuous curriculum renewal.