ppxscal/embedding_network huggingface dataset:
Separate/joint optimization of error feedback and realization for roundoff noise minimization in a class of 2-D state-space digital filters
Authors: Takao Hinamoto, Toru Oumi, Wu-Sheng Lu
Venue: Multidimensional Systems and Signal Processing (2007)

Techniques for the separate/joint optimization of error-feedback and realization are developed to minimize the roundoff noise subject to l 2-norm dynamic-range scaling constraints for a class of 2-D state-space digital filters. In the joint optimization, the problem at hand is converted into an unconstrained optimization problem by using linear-algebraic techniques. The unconstrained problem obtained is then solved by applying an efficient quasi-Newton algorithm. A numerical example is presented to illustrate the utility of the proposed techniques.
A New Task Graph Model for Mapping Message Passing Applications
Authors: Concepcio Roig, Ana Ripoll, Fernando Guirado
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

The exploitation of parallelism in a message-passing platform implies a previous modelling phase of the parallel application as a task graph, which properly reflects its temporal behaviour. In this paper, we analyse the classical task graph models of the literature and their drawbacks when modelling message-passing programs with arbitrary task structure. We define a new task graph model called TTIG (Temporal Task Interaction Graph) that integrates the classical models used in the literature. The TTIG allows to explicitly capture the ability of concurrency of adjacent tasks for applications where adjacent tasks can communicate at any point inside them. A mapping strategy is developed from this model, that minimizes the expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proved in different experimentation scopes for a wide range of message-passing applications.
Towards fault tolerance in web services compositions
Authors: Nuno Laranjeiro, Marco Vieira
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

Many businesses are now moving towards the use of composite web services that are based on a collection of web services working together to achieve an objective. Although they are becoming business-critical elements, current development support tools do not provide a practical way to include fault tolerance characteristics in web services compositions. This paper proposes a mechanism that allows programmers to easily develop fault tolerant compositions using diverse web services. The mechanism allows programmers to specify alternative web services for each operation and offers a set of artifacts that simplify the coding process, by automatically dealing with all the aspects related to the redundant web services invocation and responses voting. The mechanism is also able to perform a continuous evaluation of the services based on their behavior during operation. The approach is illustrated using compositions based on web services publicly available in the Internet and on the web services specified by the standard TPC-App performance benchmark.
A Multiobjective Approach to Phylogenetic Trees: Selecting the Most Promising Solutions from the Pareto Front
Authors: Guilherme P. Coelho, Fernando J. Von Zuben
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work presents the application of the omni-aiNet al- gorithm - an immune-inspired algorithm originally devel- oped to solve single and multiobjective optimization prob- lems - to the reconstruction of phylogenetic trees. The main goal of this work is to automatically evolve a population of phylogenetic unrooted trees, possibly with distinct topolo- gies, by minimizing at the same time the minimal evolution and the mean-squared error criteria. The obtained set of phylogenetic trees contains non-dominated individuals that form the Pareto front and that represent the trade-off of the two conflicting objectives. Given this set of phylogenetic trees, two multicriterion decision-making techniques were applied in order to try to select the best solution within the Pareto front.
Feature Selection based on QFT
Authors: Rigui Zhou, Nan Jiang, Shuqun Yang, Qiulin Ding
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Employing the powerful tool of the Quantum Fourier Transform,This paper presents an algorithm of pattern feature selection.Moreover,the proposed algorithm can perform feature selection tasks exponentially faster than its classical counterpart due to quantum parallelism.The features extracted by this algorithm are helpful to the pattern recognition or image recognition.And this paper proved the feasibility of the algorithm through theory deduction and validate serviceability by a simple pattern figure.
Driving the selection of cots components on the basis of system requirements
Authors: Vittorio Cortellessa, Ivica Crnkovic, Fabrizio Marinelli, Pasqualina Potena
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

In a component-based development process the selection of components is an activity that takes place over multiple lifecycle phases that span from requirement specifications through design to implementation-integration. Automated tool support for component selection would be very helpful in each phase. In this paper we introduce a framework that supports the selection of COTS components in the requirements phase. The framework lays on a tool that builds and solves an optimization model, whose solution provides the optimal COTS component selection. The selection criterion is based on cost minimization of the whole system while assuring a certain degree of satisfaction of the system requirements. The output of the model solution indicates the optimal combination of single COTS components and assemblies of COTS that satisfy the requirements while minimizing costs
A Service Scheduling Model in the Service Grid Environment
Authors: Zhan Gao, Siwei Luo, Ding Ding
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Grid computing is a kind of important information technology, which enables resource sharing in a wide area and system integration. Resource management and scheduling in a grid environment is a challenging problem worth researching. A Mobile Agent-based service scheduling model (MASSM) in the service grid is presented, which aims at maximizing the user's benefit. The Most Benefit Travelling Salesman Problem (MBTSP) is introduced to describe how the Agent acts in this model and a routing algorithm is also proposed. MASSM is adaptable to the dynamic environment in service grid and able to maximize the user's benefit as well as assure different QoS requirements.
An Efficient Coordinate Rotation Algorithm
Authors: R. F. Eschenbach
Venue: IEEE Transactions on Computers (1978)

The rotation of a graphic display through an angle d requires a large number of multiplies by sin d and cos d. The time required for these multiplies can be reduced an order of magnitude or more by the appropriate choice of d. The values chosen depend upon the base r and the digits of accuracy d.
Harnessing the Expertise of 70,000 Human Editors: Knowledge-Based Feature Generation for Text Categorization
Authors: Evgeniy Gabrilovich, Shaul Markovitch
Venue: The Journal of Machine Learning Research (2007)

Most existing methods for text categorization employ induction algorithms that use the words appearing in the training documents as features. While they perform well in many categorization tasks, these methods are inherently limited when faced with more complicated tasks where external knowledge is essential. Recently, there have been efforts to augment these basic features with external knowledge, including semi-supervised learning and transfer learning. In this work, we present a new framework for automatic acquisition of world knowledge and methods for incorporating it into the text categorization process. Our approach enhances machine learning algorithms with features generated from domain-specific and common-sense knowledge. This knowledge is represented by ontologies that contain hundreds of thousands of concepts, further enriched through controlled Web crawling. Prior to text categorization, a feature generator analyzes the documents and maps them onto appropriate ontology concepts that augment the bag of words used in simple supervised learning. Feature generation is accomplished through contextual analysis of document text, thus implicitly performing word sense disambiguation. Coupled with the ability to generalize concepts using the ontology, this approach addresses two significant problems in natural language processing---synonymy and polysemy. Categorizing documents with the aid of knowledge-based features leverages information that cannot be deduced from the training documents alone. We applied our methodology using the Open Directory Project, the largest existing Web directory built by over 70,000 human editors. Experimental results over a range of data sets confirm improved performance compared to the bag of words document representation.
A Space-efficient On-disk Prefetching Algorithm
Authors: Junseok Park, Kern Koh
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

With the increased computational capability and memory space of modern hard disk drives, it became possible to employ smarter on-disk prefetching algorithms. In this paper, we propose a novel on-disk prefetching algorithm which estimates whether the blocks are worth prefetching based on history, and decides to do read-ahead or not for each read request. Our work does not require modifying the standard I/O interface such as SCSI interface. Through trace-driven simulations, we show that our algorithm exhibits superior performance in terms of prefetch efficiency than the existing on-disk prefetching algorithm under mixed-media workload.
Advances in Computing Technologies: An Insight
Authors: Y. Mohamadi Begum, M. A. Maluk Mohamed
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Mobile computing and pervasive computing represent major evolutionary steps in a line of research dating back to the mid-1970s. Ubiquitous computing is another type of computing, next to mainframes and PCs. Although interchangeably used, these technologies have inherent differences in them. This paper attempts to bring out such differences so as to enable better understanding and thereby facing various issues and challenges of the same.
Real-Time Control and Scheduling Co-Design for Efficient Jitter Handling
Authors: Moris Behnam, Damir Isovic
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper we propose an integrated approach for control design and real-time scheduling, suitable for both discrete-time and continuous-time controllers. It guarantees system performance by accepting a certain minimum value of jitter for control tasks and feasibly schedules them together with other tasks in the system. Results from comparison with other approaches from real-time and control theory domains underline the effectiveness of our method.
Software-based self-testing with multiple-level abstractions for soft processor cores
Authors: Chung-Ho Chen, Chih-Kai Wei, Tai-Hua Lu, Hsun-Wei Gao
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Software-based self-test (SBST) is a promising approach for testing a processor core embedded in a system-on-chip (SoC) system. Test routine development for SBST can be based on information of different abstraction levels. Multilevel abstraction-based SBST develops the test program for a pipeline processor using the information abstracted from its architecture model, register transfer level (RTL) descriptions, and gate-level netlist for different types of processor circuits. The proposed methodology uses gate-level and architecture information to improve coverage for structural faults. This SBST methodology uses an automatic test pattern generation tool to generate the constrained test patterns to effectively test the combinational fundamental intellectual properties used in the processor. The approach refers to the RTL code and processor architecture for the rest of the control and steering logic for test routine development. The effectiveness of this SBST methodology is demonstrated by the achieved fault coverage, test program size, and testing cycle count on a complex pipeline processor core. Comparisons with previous works are also made.
Near-Circular Corner and Edge Detection Operators
Authors: Dermot Kerr, Sonya Coleman, Bryan Scotney
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

To enable fast reliable feature matching or tracking in scenes, features need to be discrete and meaningful, and hence corner detection is often used for this purpose. However, to obtain a higher level description of an image, such as identification of objects, additional information such as edges is required, and more recently detectors have been proposed that find both edges and corners. Recently, finite-element based methods have been used to develop gradient operators for edge detection that have improved angular accuracy over standard techniques. We extend this work to corner detection, enabling edge and corner detection to be integrated. In addition we present a combined operator, enabling edge and corner detection to be achieved concurrently, and we demonstrate that accuracy is comparable to well-known existing corner detectors and edge detectors, and, as standard post-smoothing of the corner map is not required, significantly reduced computation time can be achieved.
On the temperature dependence of series resistance and interface states in Al/SiO2/p-Si (MIS) Schottky diodes
Authors: D. E. Yıldız, Ş. Altındal
Venue: Microelectronic Engineering (2008)

The capacitance-voltage-temperature (C-V-T) and conductance-voltage-temperature (G/w-V-T) characteristics of metal-semiconductor (Al/p-Si) Schottky diodes with thermal growth interfacial layer were investigated by considering series resistance effect in the wide temperature range (80-400K). It is found that in the presence of series resistance, the forward bias C-V plots exhibit a peak, and experimentally shows that the peak positions shift towards higher positive voltages with increasing temperature, and the peak value of the capacitance has a maximum at 80K. The C-V and (G/w-V) characteristics confirm that the N"s"s and R"s of the diode are important parameters that strongly influence the electric parameters in (Al/SiO"2/p-Si) MIS Schottky diodes. The crossing of the G/w-V curves appears as an abnormality when seen with respect to the conventional behaviour of the ideal MS or MIS Schottky diode. It is thought that the presence of a series resistance keeps this intersection hidden and unobservable in homogeneous Schottky diodes, but it appears in the case of inhomogeneous Schottky diode. In addition, the high frequency (C"m) and conductance (G"m/w) values measured under both reverse and forward bias were corrected for the effect of series resistance to obtain the real diode capacitance.
Unrestricted Coreference: Identifying Entities and Events in OntoNotes
Authors: Sameer S. Pradhan, Lance Ramshaw, Ralph Weischedel, Jessica MacBride, Linnea Micciulla
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Most research in the field of anaphora or coreference detection has been limited to noun phrase coreference, usually on a restricted set of entities, such as ACE entities. In part, this has been due to the lack of corpus resources tagged with general anaphoric coreference. The OntoNotes project is creating a large-scale, accurate corpus for general anaphoric coreference that covers entities and events not limited to noun phrases or a limited set of entity types. The coreference layer in OntoNotes constitutes one part of a multi-layer, integrated annotation of shallow semantic structure in text. This paper presents an initial model for unrestricted coreference based on this data that uses a machine learning architecture with state-of-the-art features. Significant improvements can be expected from using such cross-layer information for training predictive models. This paper describes the coreference annotation in OntoNotes, presents the baseline model, and provides an analysis of the contribution of this new resource in the context of recent MUC and ACE results.
On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments
Authors: Ruchir Shah, Bhardwaj Veeravalli, Manoj Misra
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In this paper, we address several issues that are imperative to Grid environments such as, handling resource heterogeneity and sharing, communication latency, job migration from one site to other, and load balancing.We address these issues by proposing two job migration algorithms, which are MELISA (Modified ELISA) and LBA (Load Balancing on Arrival). The algorithms differ in the way load balancing is carried out and is shown to be efficient in minimizing the response time on large and small scale heterogeneous Grid environments, respectively. MELISA, applicable to large scale systems (i.e., interGrid [1]), is a modified version of ELISA [2] in which we consider job migration cost, resource heterogeneity and network heterogeneity when load balancing is considered. LBA algorithm, applicable for small scale systems (i.e., intraGrid [1]), performs load balancing by estimating expected finish time of job on buddy processors on each job arrival. Both algorithms estimate system parameters such as job arrival rate, CPU processing rate, load at processor and balance the load by migrating jobs to buddy processors by taking into account job transfer cost, resource heterogeneity and network heterogeneity. We quantify the performance of our algorithms using several influencing parameters such as, job size, data transfer rate, status exchange period, migration limit, and we discuss the implications of the performance and choice of our approaches.
The Criteria of Functional Delay Test Quality Assessment
Authors: E. Bareisa, V. Jusas, K. Motiejunas, R. Seinauskas
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

The test can be developed at the functional level of the circuit. Such an approach allows developing the test at the early stages of the design process in parallel with other activities of this process. The main problem is the quality assessment of the functional test because the implementation of the circuit is not available yet. The paper presents the criteria of the quality assessment of the functional delay test consisting of the pairs of patterns with multiple signal transition. The introduced criteria of the quality assessment of the functional delay test are based solely on the primary input values and the primary output values of the software prototype. The use of the indirect impact of the inputs to the outputs in the criteria of the quality assessment is introduced for the first time. The presented experimental results explore the relationship between the value of the presented criterion and the transition fault coverage at the gate level.
Complex queries over web repositories
Authors: Sriram Raghavan, Hector Garcia-Molina
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Web repositories, such as the Stanford WebBase repository, manage large heterogeneous collections of Web pages and associated indexes. For effective analysis and mining, these repositories must provide a declarative query interface that supports complex expressive Web queries. Such queries have two key characteristics: (i) They view a Web repository simultaneously as a collection of text documents, as a navigable directed graph, and as a set of relational tables storing properties of Web pages (length, URL, title, etc.). (ii) The queries employ application-specific ranking and ordering relationships over pages and links to filter out and retrieve only the "best" query results. In this paper, we model a Web repository in terms of "Web relations" and describe an algebra for expressing complex Web queries. Our algebra extends traditional relational operators as well as graph navigation operators to uniformly handle plain, ranked, and ordered Web relations. In addition, we present an overview of the cost-based optimizer and execution engine that we have developed, to efficiently execute Web queries over large repositories.
Semantic Approach to Visualization Service Discovery
Authors: Gao Shu, Chen Dingfang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The amount of machine-oriented data on the Web is increasing rapidly as Semantic Web technologies achieve greater up-take. At the same time, the deployment of Grid/Web services is increasing and together they pose a service-discovery problem for users wishing to discover Grid/Web services to perform tasks. We build a portal to discover visualization services and characterize the distance between users' requirement for visualizing data and the advertised capabilities of available visualization services by means of multiple techniques, so that the user can make decision on which services to invoke.
Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces
Venue: OZCHI; Vol. 251 (2007)

Welcome OZCHI 2007 - Australasian Computer-Human Interaction Conference Delegates: OZCHI is Australia and New Zealand's leading forum for collaboration in all areas of human-computer interaction. This is the annual conference for the Computer-Human Interaction Special Interest Group (CHISIG) of the Human Factors and Ergonomics Society of Australia (HFESA). Every paper has been reviewed by a minimum of three experts in the field computer-human interactions.
A Study of a Multi-class Classification Algorithm of SVM Combined with ART
Authors: Anna Wang, Wenjing Yuan, Junfang Liu, Qinwan Wang, Zhiguo Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper provides a novel multi-class classification algorithm, which combines adaptive resonance theory with support vector machine principle. It improves the one-against-one classification of support vector machine. The algorithm adopts adaptive resonance theory network to fuse the classifiers' results and does not adopt voting principle. When the outputs of classifiers approach zero and the algorithm gets the same votes, it avoids the fusing errors coming from voting principle. We use this algorithm in fault diagnosis of power line network and give accurate results of classification.