ppxscal/embedding_network huggingface dataset:
Harmonic-stochastic excitation (HSX) speech coding below 4 kbit/s
Authors: C. Laflamme, R. Salami, R. Matmti, J.-P. Adoul
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents an algorithm for encoding speech signals at bit rates below 4 kbit/s based on a mixed harmonic and stochastic modeling of the excitation signal. The algorithm uses robust pitch tracking and efficient voicing analysis to determine the ratios of the harmonic and stochastic components. The harmonic component is synthesized using a bank of bandpass filters while the stochastic component is synthesized using inverse STFT with overlap-and-add. Postfiltering is utilized at the decoder to enhance the quality of synthesized speech. A 2.4 kbit/s version of the algorithm was formally tested and the DAM and DRT scores showed that the coder performance is comparable to that of DoD 4.8 kbit/s Federal Standard FS-1016.
Routing algorithms for ad hoc wireless networks with a realistic physical layer
Authors: Johnson Kuruvila
Venue:  (2006)

The design and evaluation of existing routing protocols for ad hoc wireless networks normally assume an ideal physical layer model, where the message is received if and only if two nodes are within the transmission range. Routing protocols designed for this model show poor performance in simulators implementing more realistic models. In this thesis, we introduce a model that simplifies the realistic log-normal shadowing model by approximating the probability of packet reception based on distance between nodes. We then design several localized, position based routing algorithms with and without acknowledgements, with fixed message sizes. An appropriate MAC protocol for acknowledging the message is described. Localized position and acknowledgement based protocols are based on calculating ideal hop count, and optimizing expected progress. Improved, iterative versions of these protocols are also presented. These algorithms strive to optimize the expected hop count (EHC) measure in delivering the message from the source to the destination, where EHC takes into account all acknowledgements and retransmissions. We also propose several localized non acknowledgement-based algorithms. These protocols aim to maximize the probability of delivery of a packet from the source node to the destination node. Our, performance evaluation shows that newly proposed localized protocols are competitive with global shortest weighted path based protocols, and superior to threshold based localized protocols that were also proposed in this thesis. We also studied the impact of imprecise location information on the performance of the suggested protocols.
The Formation and Management of a Software Outsourcing Partnership Process
Authors: Marianne Kinnula, Veikko Seppanen, Juhani Warsta, Sari Vilminko
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The focus of this research is on outsourcing partnerships -- what is the process involved in the formation and management of a software research and development (R&D) outsourcing partnership. A complete picture of a software outsourcing partnership life cycle cannot be found in the literature. Because of that a synthesis outsourcing partnership life cycle model has been created based on the models found in other studies. Empirical data from a software R&D outsourcing partnership case is analysed based on the synthesis model, and a new, improved model is created. The new model gives a more in-depth insight into the formation and management process of an outsourcing partnership. Even though the model is created and presented mainly from the customer company viewpoint, it has been affected by the partner company viewpoint as well, as the case data was collected from both companies.
Fast Arithmetic on Reconfigurable Meshes
Authors: Heonchul Park, Viktor K. Prasanna, Ju-wook Jang
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We show an O(1) time algorithm for computing the N-point Discrete Fourier Transform (DFT) on an NlogN x NlogN reconfigurable mesh, where each poitn is represented using \Theta(logN) bits. Based on the DFT algorithm, we derive O(1) time algorithms for N-bit multiplication, N-bit modular operations, and computing the quotient of two N-bit numbers on an N x N bit model of the reconfigurable mesh. The proposed algorithms lead to AT^2 optimal designs in the bit model of VLSI for 1 \leqslant T \leqslant \sqrt N. All these algorithms run on the MRN, RMESH, and PARBUS models of the reconfigurable mesh, and employ optimal size of the mesh.
The information regularization framework for semi-supervised learning
Authors: Tommi Jaakkola
Venue:  (2006)

In recent years, the study of classification shifted to algorithms for training the classifier from data that may be missing the class label. While traditional supervised classifiers already have the ability to cope with some incomplete data, the new type of classifiers do not view unlabeled data as an anomaly, and can learn from data sets in which the large majority of training points are unlabeled. Classification with labeled and unlabeled data, or semi-supervised classification, has important practical significance, as training sets with a mix of labeled an unlabeled data are commonplace. In many domains, such as categorization of web pages, it is easier to collect unlabeled data, than to annotate the training points with labels. This thesis is a study of the information regularization method for semi-supervised classification, a unified framework that encompasses many of the common approaches to semi-supervised learning, including parametric models of incomplete data, harmonic graph regularization, redundancy of sufficient features (co-training), and combinations of these principles in a single algorithm. We discuss the framework in both parametric and non-parametric settings, as a transductive or inductive classifier, considered as a stand-alone classifier, or applied as post-processing to standard supervised classifiers. We study theoretical properties of the framework, and illustrate it on categorization of web pages, and named-entity recognition. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Empirical selection of nlp-driven document representations for text categorization
Authors: Can Isik
Venue:  (2006)

Text Categorization is the task of assigning predefined labels to textual documents. Current research in this field has been focused on using word based document representations called bag-of-words (BOW) with strong statistical learners. Few studies have explored the use of more complex Natural Language Processing (NLP) driven representations based on phrases, proper names and word senses. None of these had definitive results on these features' benefits for text categorization problems. This dissertation extensively studies the use of NLP-driven document representations captured at many different levels of language processing for text categorization, and shows that NLP-driven document representations improve text categorization. A methodology, called "Empirical Selection Methodology for NLP-driven document representations", was developed to select document representations for each category in the categorization problem. A highly configurable software system was developed to create document representations and carry out experiments. The methodology has been tested on two widely used text categorization evaluation datasets, and showed that statistical learners generalize better with the help of NLP-driven document representations.
Integrity Checking and Maintenance with Active Rules in XML Databases
Authors: Henning Christiansen, Maria Rekouts
Venue: Proceedings of the 24th British National Conference on Databases (2007)

While specification languages for integrity constraints for XML data have been considered in the literature, actual technologies and methodologies for checking and maintaining integrity are still in their infancy. Triggers, or active rules, which are widely used in previous technologies for the purpose are still rather untested in XML databases. We present the first steps towards a methodology for design and verification of triggers that maintain integrity in XML databases. Starting from a specification of the integrity constraints plus a collection of XPath expressions describing the possible updates, the method indicates trigger conditions and correctness criteria to be met by the trigger code supplied by a developer or possibly automatic methods. We show examples developed in the Sedna XML database system which provides a running implementation of XML triggers.
Joint Measurements on Qubits and Cloning of Observables
Authors: Alessandro Ferraro, Matteo G. Paris
Venue: Open Systems Information Dynamics (2007)

Cloning of observables, unlike standard cloning of states, aims at copying the information encoded in the statistics of a class of observables rather then on quantum states themselves. In such a process the emphasis is on the quantum operation (evolution plus measurement) necessary to retrieve the original information. We analyze, for qubit systems, the cloning of a class generated by two noncommuting observables, elucidating the relationship between such a process and joint measurements. This helps in establishing an optimality criterion for cloning of observables. We see that, even if the cloning machine is designed to act on the whole class generated by two noncommuting observables, the same optimal performances of a joint measurement can be attained. Finally, the connection with state dependent cloning is enlightened.
Open source group calendaring: GCTP and openflock
Authors: David L. Sifry
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

This paper describes a new protocol and open-source system that is designed to solve a significant problem -- how to manage and organize individual and group schedules in a cross-platform manner. In addition, the design was created to allow for interoperability and extensibility in the protocol and functionality of the system, and discussion is given on how to create an extensible protocol while maintaining backwards compatability.
Comparison of Four Freely Available Frameworks for Image Processing and Visualization That Use ITK
Authors: Ingmar Bitter, Robert Van Uitert, Ivo Wolf Luis Ibanez
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Most image processing and visualization applications allow users to configure computation parameters and manipulate the resulting visualizations. SCIRun, VolView, MeVisLab, and the Medical Interaction Toolkit (MITK) are four image processing and visualization frameworks that were built for these purposes. All frameworks are freely available and all allow the use of the ITK C++ library. In this paper, the benefits and limitations of each visualization framework are presented to aid both application developers and users in the decision of which framework may be best to use for their application. The analysis is based on more than 50 evaluation criteria, functionalities, and example applications. We report implementation times for various steps in the creation of a reference application in each of the compared frameworks. The data-flow programming frameworks, SCIRun and MeVisLab, were determined to be best for developing application prototypes, while VolView was advantageous for nonautomatic end-user applications based on existing ITK functionalities, and MITK was preferable for automated end-user applications that might include new ITK classes specifically designed for the application.
Scaffolding knowledge integration through designing multimedia case studies of engineering design
Authors: S. Hsi, A. M. Agogino
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The paper describes our experiences teaching a freshman design course ME39C using multimedia case studies of engineering design, multimedia tools, and the Internet. Students, in mixed-ability groups, learn design process and practice through reviewing engineering cases on CD-ROM and using software tools to develop a multimedia case of their own. The curriculum, although having theoretical bases in education research, is highly governed by practical concerns such as rapidly changing technologies, different background experiences of students, and the grading of open-ended work. The course is also driven by new developments in technology and the changing demands of students. In three years, a five person seminar course has evolved into a laboratory of thirty, changing the nature of learning, teaching style, and quality of student work in both positive and negative ways. We describe this course as it progressed from an experimental course to an institutionalized one. Our experiences confirm our belief that curricula should be designed to promote scaffolded knowledge integration by encouraging students to become more independent learners while capitalizing on collaboration and social aspects of learning. Moreover, curricula should be continuously refined and updated to meet the needs of students and reflect advances in technological development toward better preparation in engineering.
Synchronization state buffer: supporting efficient fine-grain synchronization on many-core architectures
Authors: Weirong Zhu, Vugranam C Sreedhar, Ziang Hu, Guang R. Gao
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Efficient fine-grain synchronization is extremely important to effectively harness the computational power of many-core architectures. However, designing and implementing finegrain synchronization in such architectures presents several challenges, including issues of synchronization induced overhead, storage cost, scalability, and the level of granularity to which synchronization is applicable. This paper proposes the Synchronization State Buffer (SSB), a scalable architectural design for fine-grain synchronization that efficiently performs synchronizations between concurrent threads. The design of SSB is motivated by the following observation: at any instance during the parallel execution only a small fraction of memory locations are actively participating in synchronization. Based on this observation we present a fine-grain synchronization design that records and manages the states of frequently synchronized data using modest hardware support. We have implemented the SSB design in the context of the 160-core IBM Cyclops-64 architecture. Using detailed simulation, we present our experience for a set of benchmarks with different workload characteristics.
Creativity and categorisation
Authors: Ben Short
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Preliminary findings suggest that the creativity of conceptual inventions based upon items taken from physical user interface kits, as assessed by independent judges, may be affected by the categorical level given to participants at the task outset. However this effect is only seen when judges assess the inventions using an ordering task rather than the commonly adopted originality/practicality model of creativity. Further research into the nature of this phenomenon and the effects of different judging paradigms is underway.
A theory of explicit rate-based flow control: maxmin rate allocation protocols
Authors: Wei Kang Tsai
Venue:  (2006)

This dissertation presents a theory of explicit rate-based flow control scheme based on Maxmin fairness. The objective is to decide the transmission rates of users to achieve the optimal utilization of network resources. The optimality is defined in the sense of maximizing transmission rates as well as fairness between users. We prove the bottleneck optimality condition theorem to solve the discrete-constrained maxmin rate allocation problem. Finding the lexicographic optimal solution in the discrete cases is an NP-complete problem. We propose a heuristic and prove that the distance between the heuristic outputs rates and the lexicographic optimal solution can be bounded. Then we convey the theory of order programming and apply it to solve the multi-path maxmin rate allocation problem. Two optimality conditions are proved which allow us to derive an algorithm to solve the multi-path problem. Finally we discuss to apply maxmin fairness criterion to the routing field and propose a maxmin routing algorithm.
Learning the "write" way in science and engineering
Authors: T. Larkin-Hein
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The educational benefits of adapting a writing approach in the classroom have been widely documented. Writing can serve as a tool to improve the quality of teaching as well as to promote deeper and more meaningful student learning. In this paper we explore strategies in which writing can be used to enhance student understanding in introductory physics and engineering classrooms. In particular, strategies employed within an introductory physics course for nonmajors at American University as well as strategies employed within a freshman introduction to engineering course at the University of Pittsburgh are described. In both courses, students were asked to prepare and present a professional research paper for a "conference". Highlights of the curriculum developed in each course are discussed. Through a description of the curricula and strategies developed for use in two very different courses, we hope to provide other science and engineering educators with useful tools to assist them in developing and/or enhancing the use of writing within their own classrooms. Results from feedback questionnaires given to students are also shared.
Switching remote robot manipulation in Internet TeleCare systems
Authors: Chunhai Hou, Songmin Jia, Gang Ye, Kunikatsu Takase
Venue: Integrated Computer-Aided Engineering (2004)

In this paper, a Java and common object request broker architecture (CORBA) based management server is presented to switch the robot manipulating rights among the authorized caregivers in Internet TeleCare systems. A software switch, chat room and media control center (MCC), which connect to database by Java database connectivity (JDBC), are developed as server software. The client software is programmed as two applets, robot remote manipulation and chat client, and embedded into a web page in the management server. CORBA IIOP is employed as communication platform between the robot control server program of C++ and the software switch of Java. The whole TeleCare system with image and video monitor is verified in campus networks. The developed robot manipulating management system will improve the Internet robot TeleCare system topology, and adapt to the mass application in the future.
Performance Debugging of Real-Time Systems Using Multicriteria Schedulability Analysis
Authors: Unmesh D. Bordoloi, Samarjit Chakraborty
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

Most of today's real-time embedded systems consist of a heterogeneous mix of fully-programmable processors, fixed-function components or hardware accelerators, and partially-programmable engines. Hence, system designers are faced with an array of implementation possibilities for an application at hand. Such possibilities typically come with different tradeoffs involving cost, power consumption and packaging constraints. As a result, a designer is no longer interested in one implementation that meets the specified real-time constraints (i.e. is schedulable), but would rather like to identify all schedulable implementations that expose the different possible performance tradeoffs. In this paper we formally define this multicriteria schedulability analysis problem and derive a polynomial-time approximation algorithm for solving it. This result is interesting because the problem of optimally computing even one schedulable solution in our setup (and in most common setups) is computationally intractable (NP-hard). Further, our algorithm is reasonably easy to implement, returns good quality (approximate) solutions, and offers significant speedups over optimally computing all schedulable tradeoffs.
A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
Authors: Chen Degang, Wang Changzhong, Hu Qinghua
Venue: Information Sciences: an International Journal (2007)

Traditional rough set theory is mainly used to extract rules from and reduce attributes in databases in which attributes are characterized by partitions, while the covering rough set theory, a generalization of traditional rough set theory, does the same yet characterizes attributes by covers. In this paper, we propose a way to reduce the attributes of covering decision systems, which are databases characterized by covers. First, we define consistent and inconsistent covering decision systems and their attribute reductions. Then, we state the sufficient and the necessary conditions for reduction. Finally, we use a discernibility matrix to design algorithms that compute all the reducts of consistent and inconsistent covering decision systems. Numerical tests on four public data sets show that the proposed attribute reductions of covering decision systems accomplish better classification performance than those of traditional rough sets.
Grammatical Processing without Semantics? An Event-related Brain Potential Study of Preschoolers using Jabberwocky Sentences
Authors: Juan Silva-Pereyra, Barbara T. Conboy, Lindsay Klarman, Patricia K. Kuhl
Venue: Journal of Cognitive Neuroscience (2007)

Behavioral studies have demonstrated that children develop a nearly adult-like grammar between 36 and 42 months, but few studies have addressed how the child's brain processes semantic versus syntactic information. In previous research, Silva-Pereyra and colleagues showed that distinct event-related potentials (ERPs) are elicited by semantic and syntactic violations in sentences in children as young as 30, 36, and 48 months, following the patterns displayed by adults. In the current study, we examined ERPs to syntactic phrase structure violations in real and jabberwocky sentences in 36-month-old children. Jabberwocky sentences are sentences in which content (open-class) words are replaced by pseudowords while function (closed-class) words are retained. Results showed that syntactically anomalous real sentences elicited two positive ERP effects: left-distributed effects from 500 to 750 msec and 1050 to 1300 msec, whereas syntactically anomalous jabberwocky sentences elicited two negative ERP effects: a left-distributed effect from 750 to 900 msec and a later broadly distributed effect from 950 to 1150 msec. The results indicate that when preschoolers process real English sentences, ERPs resembling the positive effects previously reported for adults are noted, although at longer latencies and with broader scalp distributions. However, when preschoolers process jabberwocky sentences with altered lexical-semantic content, a negative-going ERP component similar to one typically associated with the extraction of meaning is noted.