ppxscal/embedding_network huggingface dataset:
Automatic Generation of Device User-Interfaces?
Authors: Olufisayo Omojokun, Prasun Dewan
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

One of the visions of pervasive computing is using mobile computers to interact with networked devices. A question raised by this vision is: Should the user-interfaces of these devices be handcrafted manually or generated automatically? Based on experience within the domain of desktop computing, the answer seems to be that automatic generation is not flexible enough to support a significant number of useful interfaces but requires substantially less coding effort for the interfaces it can create. We show that the answer is much more complicated when we consider networking of traditional appliances such as stereos and TVs. Using qualitative arguments and quantitative experimental data, we show that the manual vs. generated issue must be resolved based on: (a) not only user-interface programming and flexibility but also several other metrics such as space and time costs, binding time, and reliability (b) whether it is a graphical or speech based user-interface, (c) the size of the device user-interface, (d) whether the manually written user-interface code is available at the mobile computer or at a remote machine, and (e) the network bandwidth between the mobile computer and remote factory.
Recursive least-squares algorithms with good numerical stability for multichannel active noise control
Authors: F. Yu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Some recursive least-squares algorithms for multichannel active noise control have recently been introduced, including computationally efficient (i.e. "fast") versions. However, these previously published algorithms suffer from numerical instability due to finite precision computations. Numerically robust recursive least-squares algorithms for multichannel active noise control systems are introduced, using QR decompositions and lattice structures. It is shown through simulations of broadband multichannel active noise control that the recursive least-squares algorithms introduced are indeed more numerically robust than the previously published algorithms, while keeping the same convergence behavior, and therefore they are more suitable for practical implementations.
Teaching object-oriented programming on top of functional programming
Authors: J. T. Kristensen
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

In the Informatics Programme at the Technical University of Denmark, the authors base the first course in object-oriented programming (using the Java language) on a preceding course in functional programming (using the SML language). The students may hence exploit concepts from functional programming in the construction of OO programs. This is done following a method where the program design is expressed in SML and afterwards implemented in Java. The use of different languages in design and implementation is an advantage as it makes the distinction between these two stages very clear. They give examples showing that SML designs allow them to develop and compare OO implementations with different class structures for the same programming problem. A discussion of this kind is not supported in traditional OO methodology. The program design in SML has also shown to be useful for the students when documenting the program.
COTS Selection: Past, Present, and Future
Authors: Abdallah Mohamed, Guenther Ruhe, Armin Eberlein
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Commercial Off-The-Shelf (COTS) products are increasingly being used in software development. In COTS-based development, selecting appropriate COTS is the most crucial phase. This paper explores the evolution of COTS selection practices, and surveys eighteen of the most significant COTS selection approaches. The paper traces how each approach contributed to the improvement of current COTS selection practices, and then compares them .The paper also highlights some open research issues relevant to the selection process, and concludes with a discussion of possible future directions to address these issues.
Co-evolutionary algorithm approach to a university timetable system
Authors: C. K. Chan, H. B. Gooi, M. H. Lim
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper describes an automated curriculum timetabling system based on a stochastic search methodology, namely a co-evolutionary algorithm. The application timetable is taken from the undergraduate courses of the School of Electrical and Electronic Engineering (EEE), Nanyang Technological University (NTU). A co-evolutionary algorithm approach is found to be well suited. Practical courses have duration greater than one hour. A schedule can be generated separately and its population, which consists of a set of practical schedules, is termed as the practical population. Lecture and tutorial schedules can also be generated separately. These are of one-hour duration and they are termed collectively as lecture/tutorial schedule. A set of lecture/tutorial schedules could be generated to form the lecture/tutorial population. These two populations use the same set of resources and have constraining effects upon one another. Since the placement of practical courses have a more constraining effect, the schedules in the practical population are first generated and are then used to guide the generation of the set of lecture/tutorial schedules. For every lecture/tutorial schedule generated, it is combined with its corresponding practical schedule to form a combined schedule. The average fitness of all the combined schedules is then computed and used as a measure of the fitness of the practical schedule that drives them. The practical population is then evolved progressively to obtain the best practical schedule. It is then used as a base configuration for the rest of the courses to populate and evolve. The resultant system compares favorably to the current manual system.
A Conceptual Data Model Language for the Molecular Biology Domain
Authors: Jose Antonio Fernandes de Macedo, Fabio Porto, Sergio Lifschitz, Philippe Picouet
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In-silico experiments require molecular biological knowledge to be mapped into a data model. In a previous work, we have elicited a list of requirements to be attended by a conceptual language for the molecular biology domain. In this paper, we present the evolution of this research by introducing a such language that encompasses most of the identified biological domain requirements. The language offers logical constraints expressions that augments the semantics of data and relationships types, as well as monotonic inheritance. Those aspects address the uncertainty and variability of biological knowledge shortening the gap between scientists mental model and traditional conceptual models.
Distributed Slicing in Dynamic Systems
Authors: Antonio Fernandez, Vincent Gramoli, Ernesto Jimenez, Anne-Marie Kermarrec, Michel Raynal
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services capable of dealing with resource assignment and management in a large-scale, heterogeneous and unreliable environment. The slicing service, has been proposed to allow for an automatic partitioning of P2P networks into groups (slices) that represent a controllable amount of some resource and that are also relatively homogeneous with respect to that resource. In this paper we propose two gossip-based algorithms to solve the distributed slicing problem. The first algorithm speeds up an existing algorithm sorting a set of uniform random numbers. The second algorithm statistically approximates the rank of nodes in the ordering. The scalability, efficiency and resilience to dynamics of both algorithms rely on their gossip-based models. These algorithms are proved viable theoretically and experimentally.
Bracket Producing Rows and Columns of the Dixon Determinant
Authors: Wei Xiao, Eng-Wee Chionh
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The Dixon resultant for a bivariate polynomial system has many interesting properties. When the unmixed canonical bidegree monomial support of the polynomial system undergoes corner cutting, some monomial points become distinguished by being exposed. When a corner has exactly three exposed monomial points, certain rows and columns of the Dixon matrix, called almost-exposed rows and columns, will produce a factor which is a power of the bracket corresponding to the three exposed points. The power is determined by the relative positions of these three exposed points. This observation is very useful when constructing quotient Dixon resultants.
Berkeley DB
Authors: Michael A. Olson, Keith Bostic, Margo Seltzer
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

Berkeley DB is an Open Source embedded database system with a number of key advantages over comparable systems. It is simple to use, supports concurrent access by multiple users, and provides industrial-strength transaction support, including surviving system and disk crashes. This paper describes the design and technical features of Berkeley DB, the distribution, and its license.
A Graduate Program on Embedded Software Engineering in China
Authors: Kang Yimei
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Software has become a key component of embedded systems as more and more complex embedded systems have been developed. Currently most embedded system developers in China are graduated from Electronics, Mechanics, Automatic control and other majors. These developers are familiar with the application fields, but unfamiliar with systematic development process, method and management of software project. Moreover, the embedded software development is different from general software development. To provide more qualified software developers for embedded systems, we have founded a graduate program in embedded software engineering (ESE), which combines the embedded system development and software engineering (SE), with emphasis in state-of-art embedded software development methods and techniques. In this program, we teach students complex software analysis and design, construction and test. To name a few, students enrolled in this program learn (1) how to apply software architectures and software design patterns to embedded systems, (2) how to manage a large and complex software project, (3) Co-develop hardware and software, etc. This program includes a series of courses and a multilevel practice model. Some courses are provided by industries. The practice model includes four levels. In the fourth practice level, students will finish a complete project in industries under the project manager's instruction. They not only learn techniques and put into practice on embedded software development, but also experience the industry cultures. This 2-5 years graduate program is to train graduates to be well qualified for embedded software development positions in software industry.
Robust method of measurement of fundamental frequency by ACLOS: autocorrelation of log spectrum
Authors: N. Kunieda, T. Shimamura, J. Suzuki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Correct and robust measurement of fundamental frequency F/sub 0/ is requested in the analysis of speech sound, speech enhancement systems and analysis synthesis telephony employing F/sub 0/. This article proposes a new method to estimate F/sub 0/ utilizing the autocorrelation function of the log spectrum. This method is named ACLOS (autocorrelation of log spectrum). In this method, the fundamental frequency is estimated from the peak of the autocorrelation function along the frequency axis of the spectral pattern. It means that F/sub 0/ is measured by enhancing the periodic feature of harmonics on the spectrum. Experimental results indicate that ACLOS gives more robust and reasonable pitch information than other methods give.
Hardware Support for Fast Reconfigurability in Progress Arrays
Authors: M. Maresca, H. Li, P. Baglietto
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Massively parallel computers are implemented by means of modules at different packaging levels. This paper discusses a hierarchical node clustering scheme (HNC) for packaging a class of reconfigurable processor arrays called Polymorphic Processor Array (PPA) which uses circuit-switchingbased routers at each node to deliver a different topology at every instruction. The PPA family suffers from an unknown signal delay between arbitrary two nodes connected by the circuited-switched paths. This either forces the hardware clock to compromise to the worst signal delay or makes the software dependent on the system size. The use of the HNC scheme allows to obtain communication speed-up and automatic control, at the compiler level, over signal propagation delay.
Recent experiments in large vocabulary conversational speech recognition
Authors: J. Billa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes the improvements that resulted in the 1998 Byblos large vocabulary conversational speech recognition (LVCSR) system. Salient among these improvements are: improved signal processing, improved hidden Markov model (HMM) topology, use of quinphone context, introduction of diagonal speaker adapted training (DSAT), incorporation of variance adaptation in the MLLR framework, improvements in language modeling, increase in lexicon size and combination of multiple systems. These changes resulted in about a 7% absolute reduction in word error rates on a balanced Switchboard/Callhome English test set.
Qos-Aware Automatic Composition of Web Services Using AI Planners
Authors: Mahsa Naseri, Ahmad Towhidi
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Web Services provide a new way of distributed computing that achieve the interoperability between heterogeneous applications through platform and language independent interfaces. As the number of available Web Services in a system increases, it becomes more difficult to find the specific service that can perform the task at hand. There may also be no single service capable of performing that task, but a combination of existing services may provide the capability. One of the main focuses of Web Services is the ability to easily combine existing components to create compositions that provide novel functionalities which were not directly available from the existing services. In this paper a new approach for composing Web Services based on requested Quality of Services is provided. The presented procedure exploits numeric function supporting planners to build the composition. It also provides the facility to generate compositions of Web Services by using existing PDDL based planners.
Accurate and efficient replaying of file system traces
Authors: Nikolai Joukov, Timothy Wong, Erez Zadok
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Replaying traces is a time-honored method for benchmarking, stress-testing, and debugging systems--and more recently--forensic analysis. One benefit to replaying traces is the reproducibility of the exact set of operations that were captured during a specific workload. Existing trace capture and replay systems operate at different levels: network packets, disk device drivers, network file systems, or system calls. System call replayers miss memory-mapped operations and cannot replay I/O-intensive workloads at original speeds. Traces captured at other levels miss vital information that is available only at the file system level. We designed and implemented Replayfs, the first system for replaying file system traces at the VFS level. The VFS is the most appropriate level for replaying file system traces because all operations are reproduced in a manner that is most relevant to file-system developers. Thanks to the uniform VFS API, traces can be replayed transparently onto any existing file system, even a different one than the one originally traced, without modifying existing file systems. Replayfs's user-level compiler prepares a trace to be replayed efficiently in the kernel where multiple kernel threads prefetch and schedule the replay of file system operations precisely and efficiently. These techniques allow us to replay I/O-intensive traces at different speeds, and even accelerate them on the same hardware that the trace was captured on originally.
A new approach to the decomposition of Boolean functions by the method of q-partitions. III. Joint decomposition of a function system
Authors: B. E. Rytsar
Venue: Cybernetics and Systems Analysis (2007)

The paper considers the set-theoretical approach to the joint decomposition of systems of Boolean functions of variables specified in different representation forms. The approach is based on the method of q-partitions of conjuncterms and concept of decomposition clones. Theorems on joint decomposition of a system of full and partial functions are formulated. The approach is illustrated by examples.
Teaching electronic devices using projects in lieu of exams
Authors: G. B. Lush
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Summary form only given. Reports changes in the structure and student assessment techniques of a junior-level course in electrical engineering, electronic devices and the fundamentals of diodes and transistors. Two exams have been replaced by design projects of varying complexity. One made extensive use of the Purdue University Network Computing Hub, which makes highly advanced simulation tools for semiconductor processing and devices available for educational use. Students are more attentive, ask more questions in and out of class, and believe they have achieved a better and longer lasting understanding of semiconductor devices. 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
The GAV Toolkit for Multiple Linked Views
Authors: Mikael Jern, Sara Johansson, Jimmy Johansson, Johan Franzen
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

Implementing InfoVis multivariate data tools, timelinked coordinated views and visual dynamic queries with conditioning from scratch is not a simple programming task. Our research objective is to develop a generic GeoAnalytics visualization (GAV) component toolkit, based on the principles behind visual analytics (VA), for dynamically exploring time-varying, geographically referenced and multivariate attributes simultaneously. GAV includes components based on a synergy of technologies from information visualization, geovisualization and scientific visualization. Our research concentrates on improving visual user interfaces (VUI) methods and trying to extend existing visual representation techniques. The effectiveness of our proposed component toolkit and framework is demonstrated in two customized applications GeoWizard analysing multivariate energy usage data for Swedish municipalities and MD-Explorer exploring multivariate data using novel interactive ternary diagrams. We use parallel coordinates with embedded visual inquiry methods that serves as a visual control panel for dynamically linked and coordinated views. Finally, discoveries made during the visual exploration process can be captured and organized in a format for later recall and communication to others.
Integrating streaming and file-transfer Internet traffic: fluid and diffusion approximations
Authors: Sunil Kumar, Laurent Massoulié
Venue: Queueing Systems: Theory and Applications (2007)

We study the behavior of a communication link that divides its capacity fairly among file transfers and streaming flows. We identify appropriate asymptotic regimes and obtain fluid and diffusion limits. The non-trivial, yet tractable, limits can be used for performance analysis and policy design. Furthermore, the scalings used to obtain these limits are themselves of interest and help explain phenomena observed in previous simulation studies.
An FPGA implementation of Walsh-Hadamard transforms for signal processing
Authors: A. Amira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper describes two approaches suitable for an FPGA implementation of Walsh-Hadamard transforms. These transforms are important in many signal processing applications including speech compression, filtering and coding. Two novel architectures for the fast Hadamard transforms using both systolic architecture and distributed arithmetic techniques are presented. The first approach uses the Baugh-Wooley multiplication algorithm for a systolic architecture implementation. The second approach is based on both distributed arithmetic ROM and accumulator structure, and a sparse matrix factorisation technique. Implementations of the algorithms on a Xilinx FPGA board are described. Distributed arithmetic approach exhibits better performances when compared with the systolic architecture approach.
Breadth-first CS 1 for scientists
Authors: Zachary Dodds, Christine Alvarado, Geoff Kuenning, Ran Libeskind-Hadas
Venue: ACM SIGCSE Bulletin (2007)

This paper describes an introductory CS course designed to provide future scientists with a one-semester overview of the discipline. The course takes a breadth-first approach that leverages its students' interest and experience in science, mathematics, and engineering. In contrast to many other styles of CS 1, this course does not presume that its students will study more computer science, but it does seek to prepare them should they choose to do so. In addition to describing the curriculum and resources, we summarize our preliminary assessments of this course and a comparison with the more traditional, imperative-first introduction it replaced. The data thus far suggest that this CS for Scientists course improves our students' understanding of CS, its applications, and practice.
Advanced technological education in semiconductor manufacturing: preparing for the 21st century
Authors: D. M. Hata
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Expansion in the semiconductor industry is creating a large demand for technicians. Community colleges are hard-pressed to meet this demand through existing programs and courses. This paper presents a new curriculum model for associate of applied science degree programs in semiconductor manufacturing and suggests a model for precursor programs at the high school level. Implementations of new curricula in semiconductor manufacturing are presented.