ppxscal/embedding_network huggingface dataset:
Evolutionary algorithm determining defuzzyfication operators
Authors: Witold Kosiński
Venue: Engineering Applications of Artificial Intelligence (2007)

The space of ordered fuzzy numbers (OFN) that make possible to deal with fuzzy inputs quantitatively, exactly in the same way as with real numbers, is shortly presented. For defuzzyfication operators which play the main role in dealing with fuzzy controllers and fuzzy inference systems, an approximation formula is given and then a dedicated evolutionary algorithm is presented.
Boosting statistical word alignment using labeled and unlabeled data
Authors: Hua Wu, Haifeng Wang, Zhanyi Liu
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper proposes a semi-supervised boosting approach to improve statistical word alignment with limited labeled data and large amounts of unlabeled data. The proposed approach modifies the supervised boosting algorithm to a semi-supervised learning algorithm by incorporating the unlabeled data. In this algorithm, we build a word aligner by using both the labeled data and the unlabeled data. Then we build a pseudo reference set for the unlabeled data, and calculate the error rate of each word aligner using only the labeled data. Based on this semi-supervised boosting algorithm, we investigate two boosting methods for word alignment. In addition, we improve the word alignment results by combining the results of the two semi-supervised boosting methods. Experimental results on word alignment indicate that semi-supervised boosting achieves relative error reductions of 28.29% and 19.52% as compared with supervised boosting and unsupervised boosting, respectively.
Students connecting engineering fundamentals and hardware design: observations and implications for the design of curriculum and assessment methods
Authors: M. Brereton, S. Sheppard, L. Leifer
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The paper explores how engineering students use fundamental concepts studied in analysis classes as they undertake experiences in hardware design and dissection. Examples are drawn from videotape studies and in situ observations of students. We observed that students learn by reflecting on their experiences and by linking and contextualizing theoretical and practical knowledge. Curriculum design and assessment methods that help foster these skills are discussed.
Interactive presentation: Functional and timing validation of partially bypassed processor pipelines
Authors: Qiang Zhu, Aviral Shrivastava, Nikil Dutt
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Customizing the bypasses in pipelined processors is an effective and popular means to perform power, performance and complexity trade-offs in embedded systems. However existing techniques are unable to automatically generate test patterns to functionally validate a partially bypassed processor. Manually specifying directed test sequences to validate a partially bypassed processor is not only a complex and cumbersome task, but is also highly error-prone. In this paper we present an automatic directed test generation technique to verify a partially bypassed processor pipeline using a high-level processor description. We define a fault model and coverage metric for a partially bypassed processor pipeline and demonstrate that our technique can fully cover all the faults using 107, 074 tests for the Intel XScale processor within 40 minutes. In contrast, randomly generated tests can achieve 100% coverage with 2 million tests after half day. Furthermore, we demonstrate that our technique is able to generate tests for all possible bypass configurations of the Intel XScale processor.
How to Determine Output Schemas of XQuery Queries
Authors: Sven Groppe, Jinghua Groppe, Volker Linnemann
Venue: Proceedings of the 24th British National Conference on Databases (2007)

The XQuery language is the standard query language for XML. The result of XQuery queries are typically XML documents in other formats. We introduce the term output schemas of an XQuery query, which represents those schemas, to which the resultant XML documents of the considered XQuery query conform to. Output schemas of XQuery queries can be used to automatically detect the XQuery query, which has been used for querying, of target XML documents or to reason on the output schema without access to the resultant XML documents for a static analysis of the used XQuery query. In this paper, we describe the automatic determination of an output schema of a given XQuery query. The input of our proposed output schema generator is the used XQuery query and the schema of the input XML documents.
Minitrack: Persistent Conversation 8: Design and Analysis of CMC Systems
Authors: Thomas Erickson, Susan C. Herring
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Persistent conversation is human-to-human interaction carried out over computer networks; it is produced by typing, speaking, or other means. Unlike face-to-face conversation, however, it leaves a trace-in the form of text on a computer screen, sound files, etc. that persists for varying amounts of time. Examples of persistent conversation include interactions carried out via group chat, IM, texting, MUDs, email, newsgroups, web boards, blogs, wikis, 3-D virtual environments, and other digital media.
Biomechanical study of lumbar spine with dynamic stabilization device using finite element method
Authors: Dong Suk Shin, Kunwoo Lee, Daniel Kim
Venue: Computer-Aided Design (2007)

A finite element model of the human lumbar spine was developed for the parametric study of the stiffness of a dynamic stabilization device. Spinal segments (L2-L5) were used to investigate the effect of dynamic stabilization and the influence on the mobility of adjacent intervertebral segments. Three spines were analysed and compared: (1) a lumbar spine with intact discs, used as a reference; (2) a fused spine with a fixation device after the the facetectomy and the total laminectomy; and (3) a spine stabilized with a dynamic stabilization device after the facetectomy and the total laminectomy. The Range of Motion (ROM) and the intervertebral disc pressure of L3-L4 and the ROM and disc pressure of the adjacent segments were examined to determine the influence of the implant on the adjacent segments. In the case of the dynamically stabilized spine, the total ROM was greater than that of the fused spine but similar to that of the intact spine. Furthermore, the disc pressure on the adjacent segments in the fused spine was greater than that of the intact spine, but the disc pressure of the dynamically stabilized spine was similar to the intact spine. In particular, the dynamic stabilization device having a stiffness of 10-15 N/mm made the destabilized spine more similar to the intact spine. Results indicated that the use of dynamic stabilization devices restored functionality closer to that of the intact spine as compared to the fused spine. The stiffness value utilized in the device was determined to be an important design parameter in manufacturing the dynamic stabilization device.
Multiple-prediction-horizon recursive identification of hidden Markov models
Authors: I. B. Collings
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper considers on-line identification of hidden Markov models via multiple-prediction-horizon recursive prediction error (RPE) methods. Working with multiple-prediction-horizons ensures that there is consistent parameter estimation, under appropriate excitation conditions. Simulation studies are included to illustrate the advantages of the proposed approach when compared to standard methods (which do not ensure consistent parameter estimation).
Fitting the Mel scale
Authors: S. Umesh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We show that there are many qualitatively different equations, each with few parameters, that fit the experimentally obtained Mel scale. We investigate the often made remark that there are two regions to the Mel scale, the first region (
A Fuzzy Ontology Generation Framework for Handling Uncertainties and Nonuniformity in Domain Knowledge Description
Authors: Muhammad Abulaish, Lipika Dey
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Since web documents are not fully structured sources of information and in Internet almost everything, especially in the realm of search, is approximate in nature, it is not possible to utilize the benefits of a domain ontology straight away to extract information from such a document. One way of overcoming this problem is the postulation of a "fuzzy ontology" by adding a value for degree of membership to each term that is imprecise in nature. In this paper, we propose a fuzzy ontology generation framework in which a concept descriptor is represented as a fuzzy relation which encodes the degree of a property value using a fuzzy membership function. The fuzzy ontology framework provides appropriate support for application integration by identifying the most likely location of a particular term in the ontology. The applicability of the fuzzy ontology structure in retrieving and curating information from text documents to answer imprecise queries has been thoroughly experimented.
Scheduling and admission control
Authors: Jeff Erickson
Venue:  (2006)

We present algorithms and hardness results for three resource allocation problems. The first is an abstract admission control problem where the system receives a series of requests and wants to satisfy as many as possible, but has bounded resources. Algorithms can have performance guarantees for this problem with respect to either acceptances or rejections. These types of guarantees are incomparable and algorithms having different types of guarantee can have nearly opposite behavior. We give two procedures for combining one algorithm of each type into a single algorithm having both types of guarantee simultaneously. The second problem we consider is scheduling with rejections, a combination of scheduling and admission control. For this problem, each job comes with a rejection cost in addition to the standard scheduling parameters. The system schedules a subset of the jobs and schedule quality is total flow plus the cost of rejected jobs. We give lower bounds on the competitive ratio that can be achieved by any deterministic algorithm. We also give an optimal offline algorithm for unit-length jobs with arbitrary rejection costs and two 2-competitive online algorithms for unit-length jobs. Finally, we show that the offline problem is NP-hard even when each job's rejection cost is proportional to its processing time. Our third problem is power-aware scheduling, where the processor can run at different speeds, with its energy consumption depending on the speeds selected. If schedule quality is measured with makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same amount of work. We also show that the multiprocessor problem becomes NP-hard when jobs can require different amounts of work. If schedule quality is measured with total flow time, we show that finding the optimal schedule for a particular energy budget is impossible. We do, however, give an arbitrarily-good approximation for scheduling equal-work jobs on a multiprocessor.
Interactive Image Repair with Assisted Structure and Texture Completion
Authors: Teryl Arnold, Bryan S. Morse
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Removing image defects in an undetectable manner has been studied for its many useful and varied applications. In many cases the desired result may be ambiguous from the image data alone and needs to be guided by a user's knowledge of the intended result. This paper presents a framework for interactively incorporating user guidance into the filling-in process, more effectively using user input to fill in damaged regions in an image. This framework contains five main steps: first, the scratch or defect is detected; second, the edges outside the defect are detected; third, curves are fit to the detected edges; fourth, the structure is completed across the damaged region; and finally, texture synthesis constrained by the previously computed curves is used to fill in the intensities in the damaged region. Scratch detection, structure completion, and texture synthesis are influenced or guided by user input when given. Results include removal of defects from images that contain structure, texture, or both structure and texture. Users can complete images with ambiguous structure in multiple ways by gesturing the cursor in the direction of the desired structure completion.
Working with process variation aware caches
Authors: Madhu Mutyam, Vijaykrishnan Narayanan
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Deep-submicron designs have to take care of process variation effects as variations in critical process parameters result in large variations in access latencies of hardware components. This is severe in the case of memory components as minimum sized transistors are used in their design. In this work, by considering on-chip data caches, we study the effect of access latency variations on performance. We discuss performance losses due to the worst-case design, wherein the entire cache operates with the worst-case process variation delay, followed by process variation aware cache designs which work at set-level granularity. We then propose a technique called block rearrangement to minimize performance loss incurred by a process variation aware cache which works at set-level granularity. Using block rearrangement technique, we rearrange the physical locations of cache blocks such that a cache set can have its "n" blocks (assuming a n-way set-associative cache) in multiple rows instead of a single row as in the case of a cache with conventional addressing scheme. By distributing blocks of a cache set over multiple sets, we minimize the number of sets being affected by process variation. We evaluate our technique using SPEC2000 CPU benchmarks and show that our technique achieves significant performance benefits over caches with conventional addressing scheme.
Tangible interaction in tabletop games: studying iconic and symbolic play pieces
Authors: Saskia Bakker, Debby Vorstenbosch, Elise van den Hoven, Gerard Hollemans, Tom Bergman
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this paper, a study is described which investigates differences in game experience between the use of iconic and symbolic tangibles in digital tabletop interaction. To enable this study, a new game together with two sets of play pieces (iconic and symbolic) was developed and used in an experiment with 30 participants. In this experiment, the understanding of the game, the understanding of the play pieces and the fun experience were tested. Both the group who played with iconic play pieces and the group who played with symbolic play pieces were proven to have a comparable fun experience and understanding of the game. However, the understanding of the play pieces was higher in the iconic group and a large majority of both groups preferred to play with iconic play pieces rather then symbolic play pieces.
Evolved fault tolerance in evolvable hardware
Authors: R. O. Canham, A. M. Tyrrell
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper considers the ability of an evolved circuit to acquire fault tolerance by including fault conditions within the fitness measure of the evolutionary process. A simple oscillator circuit, implemented on a Xilinx FPGA, showed a 12 fold increase in fault-tolerance when compared to a control oscillator using realistic faults.
Modeling and Simulation of Global Synchronization Processes for Large-Scale-of Two-Dimensional Cellular Arrays
Authors: Hiroshi Umeo, Takuya Yamawaki, Naoki Shimizu, Hiroki Uchino
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

In recent years cellular automata (CA) have been establishing increasing interests in the study of modeling and simulating non-linear phenomena occurring in biology, chemistry, ecology, economy, geology, mechanical engineering, medicine, physics, sociology, public traffic, etc. Cellular automata are considered to be a nice model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform local rule. The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we propose a completely new optimum-time synchronization algorithm for laarge-scale- of two-dimensional cellular automata. The algorithm can synchronize any two-dimensional array of size m× n in optimum m + n + max(m, n) - 3 steps. A simulation result is also given.
Polynomial-time subgraph enumeration for automated instruction set extension
Authors: Paolo Bonzini, Laura Pozzi
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time with respect to the size of the graph. These subgraphs have been shown to represent efficient Instruction Set Extensions for customizable processors. The search space for this problem is inherently polynomial but, to our knowledge, this is the first paper to prove this and to present a practical algorithm for this problem with polynomial complexity. Our algorithm is based on properties of convex subgraphs that link them to the concept of multiple-vertex dominators. We discuss several pruning techniques that, without sacrificing the optimality of the algorithm, make it practical for data-flow graphs of a thousands nodes or more.
FLAIM: a multi-level anonymization framework for computer and network logs
Authors: Adam Slagell, Kiran Lakkaraju, Katherine Luo
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

FLAIM (Framework for Log Anonymization and Information Management) addresses two important needs not well addressed by current log anonymizers. First, it is extremely modular and not tied to the specific log being anonymized. Second, it supports multi-level anonymization, allowing system administrators to make fine-grained trade-offs between information loss and privacy/security concerns. In this paper, we examine anonymization solutions to date and note the above limitations in each. We further describe how FLAIM addresses these problems, and we describe FLAIM's architecture and features in detail.
A Robust Video Foreground Segmentation by Using Generalized Gaussian Mixture Modeling
Authors: Mohand Said Allili, Nizar Bouguila, Djemel Ziou
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper, we propose a robust video foreground modeling by using a finite mixture model of generalized Gaussian distributions (GDD). The model has a flexibility to model the video background in the presence of sudden illumination changes and shadows, allowing for an efficient foreground segmentation. In a first part of the present work, we propose a derivation of the online estimation of the parameters of the mixture of GDDS and we propose a Bayesian approach for the selection of the number of classes. In a second part, we show experiments of video foreground segmentation demonstrating the performance of the proposed model.
Personalized Home-Networks
Authors: Jose Soler, Michael Gandy
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The paper provides details of a home-networking architecture based on an enhanced residential gateway. Initially the need for mechanisms allowing user-dependent network behavior is described and afterwards details of an initial implementation are provided in terms of architectural description, enabling technical components and interaction.
MPEG-4 Based Virtual Scenes on Embedded System
Authors: Hui Xu, Jianren Lou, Yu Ren
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper presents how to design virtual stereoscopic scenes in the embedded system. It also introduces some important multimedia technologies, which are used in the embedded system. In addition, some professional terms and concepts of MPEG-4 are well expounded. This paper shows the process about how to build virtual stereoscopic scenes in the embedded system. Finally, it gives the effect of the virtual stereoscopic scenes, which is shown in the embedded system.
VCenter: a digital video management system with mobile search service
Authors: Jen-Hao Hsiao, Yu-Zheng Wang
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Digital video data have proliferated in recent years due to the rapid development of multimedia computing and computer technologies. Management of video data is thus becoming an indispensable part in digital library. However, currently most digital video library systems are lack of the support of content-based video search and an easy-to-use query interface. In this work, we develop a digital video management system called VCenter, which provides lightweight mobile search functionality based on image taken from camera phone. By the proposed framework, both end user and content owner are easier to enjoy the multimedia contents in digital video libraries.
Characterizing and Classifying Desktop Grid
Authors: SungJin Choi, HongSoo Kim, EunJoung Byun, MaengSoon Baik, SungSuk Kim, ChanYeol Park, ChongSun Hwang
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Desktop Grid has recently received the strong attraction for executing high throughput applications as CPU, storage and network capacities improve and become cheaper. Desktop Grid is different from Grid in many respects, but there is no general survey or taxonomy for Desktop Grid. Therefore, we propose a new comprehensive taxonomy and survey of Desktop Grid in order to characterize and categorize Desktop Grid.
Finding a Needle in a Haystack: From Baldwin Effect to Quantum Computation
Authors: Akira Imada
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

If we want to break someone else's PIN (Personal Identification Number) of, say, an ATM (Automated Teller Machine), how many trials would be necessary when we want to be efficient? This is a sort of what we call a-needle- in-a-hay-stack problem. In 1987, in their wonderful paper, Hinton & Nowlan proposed a Genetic Algorithm with a needle being a unique configuration of 20-bit binary string while all other configurations being a haystack. What they proposed was to exploit a lifetime learning of individuals in their Genetic Algorithm, calling it the Baldwin effect in a computer. Since then there has been a fair amount of exploration of this effect, claiming, "This is a-needle-in-a-hay-stack problem, and we've found a more efficient algorithm than a random search." Some of them, however, were found to be the results of an effect of like-to-hear-what-we-would-like-to-hear. In this talk, we will try a bird's eye view on a few examples we have had so far, and how they were explored, including the approach by means of quantum computation which claims, "The steps to find a needle are O(\sqrt N) while those of exhaustive search by a traditional computer are O(N) where N is the number of search points."