ppxscal/embedding_network huggingface dataset:
Strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space
Authors: Somyot Plubtieng, Kasamsuk Ungchittrakool
Venue: Journal of Approximation Theory (2007)

In this paper, we establish strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space by using the hybrid method in mathematical programming. Our results extend and improve the recent ones announced by Matsushita and Takahashi [A strong convergence theorem for relatively nonexpansive mappings in a Banach space, J. Approx. Theory 134 (2005) 257-266], Matinez-yanes and Xu [Strong convergence of the CQ method for fixed point iteration processes, Nonlinear Anal. 64 (2006) 2400-2411], and many others.
Enhancing Relocatability of Partial Bitstreams for Run-Time Reconfiguration
Authors: Tobias Becker, Wayne Luk, Peter Y. K. Cheung
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper introduces a method that enhances the relocatability of partial bitstreams for FPGA run-time reconfiguration. Reconfigurable applications usually employ partial bitstreams which are specific to one target region on the FPGA. Previously, techniques have been proposed that allow relocation between identical regions on the FPGA. However, as FPGAs are becoming increasingly heterogeneous, this approach is often too restrictive. We introduce a method that circumvents the problem of having to find fully identical regions based on compatible subsets of resources, enabling flexible placement of relocatable modules. In a software defined radio prototype with two reconfigurable regions, the number of partial bitstreams is reduced by 50% and the compile time is shortened by 43%.
MBDD versus MMDD for Multistate Systems Analysis
Authors: Akhilesh Shrestha, Liudong Xing, Yuanshun Dai
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

Many combinatorial reliability models assume binary designation of states for both systems and their components. In many real applications, however, systems and their components may have more than two states (or levels of performance) varying from perfect operation to complete failure. In this paper, we present two combinatorial decision diagram based models that have been proposed for the analysis of multistate systems: multistate binary decision diagrams (MBDD) based approach and multistate multivalued decision diagrams (MMDD) based approach. And we conduct an empirical performance comparison between those two methods in terms of model size and computational complexity via two illustrative examples.
A Rapid Grouping Aggregation Algorithm Based on the Multi-Dimension Hierarchical Encoding
Authors: Kong-fa Hu, Zhen-zhi Gong, Qing-li Da
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

On-Line Analytical Processing(OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision support purposes. Data warehouses tend to be extremely large. Queries tend to be complex and ad hoc, often requiring computationally expensive operations such as multi-table joins and aggregation. To solve this problem, a novel pre-aggregation algorithm, MDHEGA (Grouping Aggregation based on the Multi-dimension Hierarchical Encoding), is proposed in this paper. By using the small multi-dimension hierarchical encoding and their prefix path, MDHEGA can rapidly retrieve the matching dimension hierarchical encoding and evaluate the set of query ranges for each dimension. As a result, the algorithm can greatly reduce the disk I/Os and highly improve the efficiency of OLAP queries. The analytical and experimental results show that the MDHEGA algorithm proposed in this paper is more efficient than other existed ones.
An Effective Error Concealment Framework For H.264 Decoder Based on Video Scene Change Detection
Authors: Ji Zhang, Feng Liu, Hui Shao, Gang Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we propose an effective error concealment framework for H.264 decoder based on the scene change detection. The proposed framework quickly and accurately detects whether scene change occurs in the decoding frame, based on the detection result, both corrupted intra frames and damaged inter frames can be reconstructed by spatial or improved temporal EC (Error Concealment) algorithm. The experiment shows that, compared with the traditional error concealment method in the H.264/A VC non-normative decoder, the proposed framework has better robustness and can efficiently improve the visual quality and PSNR of the decoded video.
Technical Section: O-Buffer based IFT watershed from markers for large medical datasets
Authors: Ernesto Coto, Sören Grimm, David Williams
Venue: Computers and Graphics (2007)

The watershed transform from markers is a very popular image segmentation operator. The image foresting transform (IFT) watershed is a common method to compute the watershed transform from markers using a priority queue, but which can consume too much memory when applied to three-dimensional medical datasets. This is a considerable limitation on the applicability of the IFT watershed, as the size of medical datasets keeps increasing at a faster pace than physical memory technologies develop. This paper presents the O-IFT watershed, a new type of IFT watershed based on the O-Buffer framework, and introduces an efficient data representation which considerably reduces the memory consumption of the algorithm. In addition, this paper introduces the O-Buckets, a new implementation of the priority queue which further reduces the memory consumption of the algorithm. The new O-IFT watershed with O-Buckets allows the application of the watershed transform from markers to large medical datasets.
Production Systems: A Notation for Defining Syntax and Translation
Authors: H. F. Ledgard
Venue: IEEE Transactions on Software Engineering (1977)

This paper presents the formalism of Production Systems and investigates its applcation to defe the Syntax and trlation of programming languages. Several properties appear well-suited to this task: 1) the formalism can be used to specify exactly the syntax of a computer language, including context-sensitive requirements; 2) the specification of the context-sensitive requirements on syntax can be isolated from the context-free requirements; 3) the same formalism can be used to specify more general structural properties, including the translation of one language into another. The notation has been developed with readabifity as a prime designissue. The following examples are given:1) aspecificationofthesyntaxofasmallbutdifflcultsubset of PL/I;2) a specification of the rules for translating lambda-culus expressions into, normal form.
Energy Efficient Routing in Multiple Sink Sensor Networks
Authors: Min Meng, Xiaoling Wu, Hui Xu, Byeong-Soo Jeong, Sungyoung Lee, Young-Koo Lee
Venue: ICCSA (2007)

Wireless sensor networks have been widely used in many fields with the developments of the related techniques. But there are many problems in traditional single sink sensor networks. The energy of the sensors near the sink or on the critical paths consumes too fast causing unbalanced energy consumption. The routing algorithms mainly focus on the nearest path or minimum hops. The invalidation of the single sink node causes the breakdown of the whole sensor network. In this paper, through the analysis of the disadvantages of single-sink sensor networks, we propose the system architecture of multi-sink sensor networks and new routing algorithms ELBR (Energy Level Based Routing) and PBR (Primary Based Routing) in multi-sink sensor networks. Experiment results show ELBR and PBR have better performances than traditional methods and balance the energy consumption in sensor networks.
Extended abstract: formal verification of architectural patterns in support of dependable distributed systems
Authors: R. Jeffords, R. Bharadwaj
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

Building robust, secure distributed systems in the presence of transient faults, node failures, and changes in network topology poses a multitude of challenges. To meet current engineering challenges such as pervasive and ubiquitous computing, one must adopt model-driven approaches to build distributed applications. We propose the synchronous paradigm for component integration and coordination: developers use an abstraction that respects the synchrony hypothesis, i.e., each external event is processed by the system completely before the arrival of the next event. Based on the synchronous model, the Secure Operations Language (SOL) is designed as a verifiable language for the integration of high assurance systems.
A Fault Detection Mechanism for Service-Oriented Architecture Based on Queueing Theory
Authors: Hao-peng Chen, Cheng Zhang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

SOA is an ideal solution to application building, since it reuses the existing services as many as possible. The fault tolerance is one important capability to ensure the SOA- based applications are high reliable and available. However, fault tolerance is such a complex issue for most SOA providers that they hardly provide this capability in their products. This paper provides a queuing-theory-based algorithm to fault detection, which can be used to detect the services whose performance becomes unsatisfactory at runtime according to the Qos descriptor. Based on this algorithm, this paper also gives the reference models of the extended service and the architecture of fault-tolerance control center of Enterprise Services Bus for SOA-based applications. Keywords SOA, Fault Detection, Queuing Theory, Fault-Tolerant, Performance Requirement.
Locality management using multiple SPMs on the Multi-Level Computing Architecture
Authors: A. M. Abdelkhalek, T. S. Abdelrahman
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

The multi-level computing architecture (MLCA) is a novel system-on-chip architecture for embedded systems designed to exploit task-level and instruction-level parallelism in multimedia applications. The MLCA provides a unique two-level programming model that simplifies the development of embedded applications. To cope with increasing intra-system communication delays, we introduce a distributed memory version of the MLCA where separate storage is used for global and local application data. Global data is stored on multiple on-chip scratch-pad memories (SPMs) with non-uniform-memory access (NUMA) latencies, while local data is stored on PU-private memories. In such designs, one of the key factors affecting application performance is the locality of access to global data. We introduce programming constructs and run-time support to dynamically manage data stored in the SPMs and to influence run-time task scheduling. Collectively, our techniques improve performance by 6%-40%, compared to simple static memory management and scheduling approaches
The VoodooIO gaming kit: a real-time adaptable gaming controller
Authors: NICOLAS VILLAR, KIEL MARK GILLEADE, DEVINA RAMDUNYELLIS, HANS GELLERSEN
Venue: Computers in Entertainment (CIE) (2007)

Existing gaming controllers are limited in their end-user configurability. As a complement to current game control technology, we present the VoodooIO Gaming Kit, a real-time adaptable gaming controller. We introduce the concept of appropriable gaming devices, which allow players to define and actively reconfigure their gaming space, making it appropriate to their personal preference and gaming needs. The technology and its conceived usage are illustrated through its application to two commercially available computer games, as well as through the results of a formal user study.
Merging frameworks for interaction: DEL and ETL
Authors: Johan van Benthem, Jelle Gerbrandy, Eric Pacuit
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Many logical systems today describe intelligent interacting agents over time. Frameworks include Interpreted Systems (IS, Fagin et al. [5]), Epistemic-Temporal Logic (ETL, Parikh & Ramanujam [13]), STIT (Belnap et al. [4]), Process Algebra and Game Semantics (Abramsky [1]). This variety is an asset, as different modeling tools can be fine-tuned to specific applications. But it may also be an obstacle, when barriers between paradigms and schools go up.
CGHcall
Authors: Mark A. van de Wiel, Kyung In Kim, Sjoerd J. Vosse, Wessel N. van Wieringen, Saskia M. Wilting, Bauke Ylstra
Venue: Bioinformatics (2007)

Summary: CGHcall achieves high calling accuracy for array CGH data by effective use of breakpoint information from segmentation and by inclusion of several biological concepts that are ignored by existing algorithms. The algorithm is validated for simulated and verified real array CGH data. By incorporating more than three classes, CGHcall improves detection of single copy gains and amplifications. Moreover, it allows effective inclusion of chromosome arm information. Availability: An R-package (GUI), a manual and an example data set are available at http://www.few.vu.nl/~mavdwiel/CGHcall.html. Contact: mark.vdwiel@vumc.nl Supplementary information: Supplementary data are available at Bioinformatics online.
Antecedents to End Users' Success in Learning to Program in an Introductory Programming Course
Authors: Susan Wiedenbeck, Xiaoning Sun, Thippaya Chintakovid
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Multiple factors combine to affect end users' success in learning to program. The goal of this research is to empirically investigate several factors that may predict learning to program in an introductory programming course for end users. The findings showed that software self-efficacy, programming self-efficacy, and computer playfulness were not direct predictors of successful programming; however, together they influenced computer interest, which in turn affected performance. The contribution of this paper is a model of the joint effects of a set of factors for end-user success in learning to program in a formal course setting.
Design of networks for real-time tele-education
Authors: G. Graschew, T. A. Roelofs, S. Rakowsky, P. M. Schlag
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The rapid development of information and communication technologies has enabled the creation of networks for e-learning and telemedicine. The EMISPHER network has been dedicated to bridge the digital divide in the Euro-Mediterranean healthcare area. In the project an integrated Internet-Satellite platform has been set up on which a Virtual Medical University has been realized, thus establishing a permanent medical and scientific link, Real-Time Telemedicine applications for remote expertise and second opinion, as well as the fostering of cross-Mediterranean cooperation at expert level. Using the real-time communication capabilities of EMISPHER for tele-education it will be possible to learn from live participation in the "point of action" with the possibility of interaction.
A Fuzzy Clustering Method Based on Domain Knowledge
Authors: Junli Lu, Lizhen Wang, Yaobo Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Clustering is an important task in data mining, and fuzzy clustering is on the significant status in clustering, which can deal with all types of datasets, has been at the center of research interest in recent years. The clustering method in this paper is based on domain knowledge, from which we can obtain the tuples' semantic proximity matrix, then two clustering methods are introduced, which both started from semantic proximity matrix, so the results of clustering can be instructed by domain knowledge. The two clustering methods are Natural Method (NM) and Graph-Based Method (GBM), which are both controlled by a threshold that is confirmed by polynomial recession. Theoretical analysis testify the corrective of our approach, the extensive experiments on synthetic datasets compare the performance of our approach with that of Modified MM approach in literature [1] and highlight the benefits of our approach, and the experimental results on real datasets discover some rules which are useful to domain experts.
Detecting communication errors from visual cues during the system's conversational turn
Authors: Sy Bor Wang, David Demirdjian, Trevor Darrell
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Automatic detection of communication errors in conversational systems has been explored extensively in the speech community. However, most previous studies have used only acoustic cues. Visual information has also been used by the speech community to improve speech recognition in dialogue systems, but this visual information is only used when the speaker is communicating vocally. A recent perceptual study indicated that human observers can detect communication problems when they see the visual footage of the speaker during the system's reply. In this paper, we present work in progress towards the development of a communication error detector that exploits this visual cue. In datasets we collected or acquired, facial motion features and head poses were estimated while users were listening to the system response and passed to a classifier for detecting a communication error. Preliminary experiments have demonstrated that the speaker's visual information during the system's reply is potentially useful and accuracy of automatic detection is close to human performance.
A Method for the Syntax Directed Design of Multiprograms
Authors: D. Coleman
Venue: IEEE Transactions on Software Engineering (1981)

A method of program design is described which leads naturally to the expression of a program as a pipeline network of simple processes. Starting from the problem statement the valid inputs and outputs are specified by grammars, which can be combined to define the requisite translation. A notation for translation grammars is described informally which allows a translation to take into account semantic as well as syntactic information. Terminal symbols may be attributed by data types and may be qualified by Boolean expressions. The notation is capable of direct compilation but in this paper we show how it may be used to derive a program in a conventional high level language such as Pascal or Cobol. It is shown that more complex problems can be solved by simple pipeline structures of simple translations. Provided that nonbacktracking grammars are used to specify translations, the pipeline structure is well-suited to concurrent execution on a multiprocessor. The method is illustrated by examples from data processing.
Robust tracking control of mobile robot formation with obstacle avoidance
Authors: Tiantian Yang, Zhiyuan Liu, Hong Chen, Run Pei
Venue: Journal of Control Science and Engineering (2007)

We consider the formation control problem of multiple wheeled mobile robots with parametric uncertainties and actuator saturations in the environment with obstacles. First, a nonconvex optimization problem is introduced to generate the collision-free trajectory. If the robots tracking along the reference trajectory find themselves moving close to the obstacles, a new collision-free trajectory is generated automatically by solving the optimization problem. Then, a distributed control scheme is proposed to keep the robots tracking the reference trajectory. For each interacting robot, optimal control problem is generated. And in the framework of LMI optimization, a distributed moving horizon control scheme is formulated as online solving each optimal control problem at each sampling time. Moreover, closed-loop properties inclusive of stability and H∞ performance are discussed. Finally, simulation is performed to highlight the effectiveness of the proposed control law.
P959 I/O Expansion Bus Proposed Standard
Venue: IEEE Micro (1984)

This proposed standard allows small increments of I/O to be added or modified in an easy, cost-effective way. It is offered here for public comment before submission to the IEEE Standards Board. 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 seven valleys
Authors: Chris Nelson
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

The paper gives a brief description of the interactive 3D artwork The Seven Valleys.
A Neural-fuzzy Pattern recognition Algorithm based Cutting Tool Condition Monitoring Procedure
Authors: Pan Fu, A. D. Hope, Hongli Gao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Cutting tool condition monitoring is the key technique for realizing automatic and "un-manned" manufacturing processes. This project applies cutting force and acoustic emission transducers to monitor metal cutting processes. A B-spline neurofuzzy networks based tool wear state monitoring model has been presented. The model can accurately describe the nonlinear relation between the tool wear value and signal features. Compared with the normal neural networks, such as BP type ANNs, this model has the advantages of fast convergence and having local learning capabilities. Large amounts of monitoring experiments show that the application of B-spline neurofuzzy networks can improve the accuracy and reliability of the tool wear condition monitoring processes.
A Hybrid System Approach of Case-Based Reasoning and Knowledge-Based for Product Form Design
Authors: Chen Xiantao, Zhao Jianghong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Product form design is a typical complex problem- solving process which is an ill-structured domain in terms of the design knowledge. This design problem often lacks the exact formula for representation, and highly depends upon human designers' past experiences. This paper presents a hybrid system approach of case-based reasoning and knowledge-based for developing new product that can effectively support all the steps in the design process from storing past cases, through retrieving similar cases, to adapting the retrieved case for the new product. Within this approach, a pattern of product form design with CBR is presented, and the method for the case representation and structure is described and the key arithmetic for evaluating the similarity between and the past case and new situation are introduced. Then, a knowledge-based adaptation method is presented for the specific problem situation and structure of domain knowledge support is introduced. On the basis of the approach, a computer aided product design system----CBID is developed to improve the ability and quality of product form design of 7 Chinese corporations.