ppxscal/embedding_network huggingface dataset:
H∞ fuzzy state-feedback control design for nonlinear systems with D-stability constraints: An LMI approach
Authors: Wudhichai Assawinchaichote, Sing Kiong Nguang, Peng Shi, El-Kébir Boukas
Venue: Mathematics and Computers in Simulation (2008)

This paper considers the problem of designing an H"~ fuzzy controller for a class of nonlinear systems with pole placement constraints. Based on an LMI approach, we develop a state-feedback controller that guarantees the L"2-gain of the mapping from the exogenous input noise to the regulated output is less than some prescribed value and the closed-loop system is D-stable. Numerical examples are provided to illustrate the design developed in this paper.
Keyword proximity search in complex data graphs
Authors: Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

In keyword search over data graphs, an answer is a nonredundant subtree that includes the given keywords. An algorithm for enumerating answers is presented within an architecture that has two main components: an engine that generates a set of candidate answers and a ranker that evaluates their score. To be effective, the engine must have three fundamental properties. It should not miss relevant answers, has to be efficient and must generate the answers in an order that is highly correlated with the desired ranking. It is shown that none of the existing systems has implemented an engine that has all of these properties. In contrast, this paper presents an engine that generates all the answers with provable guarantees. Experiments show that the engine performs well in practice. It is also shown how to adapt this engine to queries under the OR semantics. In addition, this paper presents a novel approach for implementing rankers destined for eliminating redundancy. Essentially, an answer is ranked according to its individual properties (relevancy) and its intersection with the answers that have already been presented to the user. Within this approach, experiments with specific rankers are described.
A note on a modification of Moser's method
Authors: J. M. Gutiérrez, M. A. Hernández, N. Romero
Venue: Journal of Complexity (2008)

We use a recurrence technique to obtain semilocal convergence results for Ulm's iterative method to approximate a solution of a nonlinear equation F(x)=0x"n"+"1=x"n-B"nF(x"n),n>=0,B"n"+"1=2B"n-B"nF^'(x"n"+"1)B"n,n>=0.This method does not contain inverse operators in its expression and we prove it converges with the Newton rate. We also use this method to approximate a solution of integral equations of Fredholm-type.
Resource discovery in federated systems with voluntary sharing
Authors: Hao Yang, Fan Ye, Zhen Liu
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

Federated system is a popular paradigm for multiple organizations to collaborate and share resources for common benefits. In practice, however, these organizations are often within different administrative domains and thus demand autonomous resource management, as opposed to blindly exporting their resources for efficient search. To address these challenges, we present a new resource discovery middleware, called ROADS, that can facilitate voluntary sharing. In ROADS, the participants can associate with each other at their own will and dictate the extent of sharing by properly exporting summaries, a condensed representation of their resource records. To enable efficient search, these summaries are aggregated and replicated along an overlay-assisted server hierarchy, and the queries are routed to those servers that are likely to hold the desired resources. Our experimental results show that ROADS provides not only flexible resource sharing for federated systems but also efficient resource discovery, with performance comparable to a centrally managed system.
Towards semantic-aware management of security services in GT4
Authors: Andrés Muñoz Ortega, Juan A. Botía Blaya, Félix J. García Clemente, Gregorio Martínez Pérez, Antonio F. Gómez Skarmeta
Venue: Multiagent and Grid Systems (2007)

Globus Toolkit version 4 (GT4) leads to a set of new services and tools. This is the culmination of a first step towards the migration to web services from previous Globus Toolkit versions. GT4 directly addresses basic issues, in the form of services, inherent to any distributed system like, for example, security, resource discovery, data movement and management, etc. However, we believe that an advanced management is still needed in the framework, in order to provide a system-wide view of these services. This is especially true in the case of security related services. They must be properly managed all across different collaborating organizations within the grid infrastructure. This paper presents the major achievements when designing and developing a semantic-aware management framework for GT4 security services.
Counterexample Guided Abstraction Refinement is Better under Equational Abstraction
Authors: Constantin Enea
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

We introduce an improved version of the equational abstraction for rewrite theories in which the temporal logic used handles also maximal finite paths and the representation of the atomic propositions, by itself, can not lead to useless abstractions. Afterward, we establish a counterexample guided abstraction refinement procedure under equational abstraction and we prove by a consistent example that it may lead to better abstractions than in the case of the classical counterexample guided abstraction refinement procedure under predicate abstraction. The new procedure offers us for free something similar to the localization for predicate abstraction and it is able to reuse the already developed heuristics for discovering predicates that eliminate spurious counterexamples.
A novel tracking scheme in location systems
Authors: Seungsoo Yoo, Jun Tae Kim, Sun Yong Kim, Youngyoon Lee, Seokho Yoon
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper addresses a tracking bias compensation scheme for location systems and analyzes tracking bias and its running average via simulation. The proposed scheme can be well combined with double delta typed DLL. In this case, it can be implemented without supplementary engines. Also, it can be combined with single delta typed DLL if two correlators can be used.
Virtual Exclusion: An architectural approach to reducing leakage energy in caches for multiprocessor systems
Authors: Mrinmoy Ghosh, Hsien-Hsin S. Lee
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

This paper proposes Virtual Exclusion, an architectural technique to reduce leakage energy in the L2 caches for cache-coherent multiprocessor systems. This technique leverages two previously proposed circuits techniques &#x2014; gated Vdd and drowsy cache, and proposes a low cost, easily implementable scheme for cache-coherent multiprocessor systems. The Virtual Exclusion scheme saves leakage energy by keeping the data portion of repetitive cache lines off in the large higher level caches while still manages to maintain Multi-Level Inclusion, an essential property for an efficient implementation of conventional cache coherence protocols. By exploiting the existing state information in the snoop-based cache coherence protocol, there is almost no extra hardware overhead associated with our scheme. In our experiments, the SPLASH-2 multiprocessor benchmark suite was correctly executed under the new Virtual Exclusion policy and showed an up to 72% savings of leakage energy (46% for SMP and 35% for multicore in L2 on average) over a baseline drowsy L2 cache.
Formal concept analysis applied to fault localization
Authors: Peggy Cellier
Venue: Companion of the 30th international conference on Software engineering (2008)

One time-consuming task in the development of software is debugging. Recent work in fault localization crosschecks traces of correct and failing execution traces, it implicitly searches for association rules which indicate that executing a line will most probably cause the whole execution to fail. This technique has some limitations: it assumes that an error has a single faulty statement origin, and that lines are independent. Our research hypothesis is that using association rules with more expressive premises, some limitations can be alleviated. The solution that we propose combines association rules and formal concept analysis. Our technique is already usable when the size of the execution traces is not too large. We conjecture that the technique can be used to analyze large executions, thanks to the information contained in the Abstract Syntax Tree.
An unsupervised framework for extracting and normalizing product attributes from multiple web sites
Authors: Tak-Lam Wong, Wai Lam, Tik-Shun Wong
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We have developed an unsupervised framework for simultaneously extracting and normalizing attributes of products from multiple Web pages originated from different sites. Our framework is designed based on a probabilistic graphical model that can model the page-independent content information and the page-dependent layout information of the text fragments in Web pages. One characteristic of our framework is that previously unseen attributes can be discovered from the clue contained in the layout format of the text fragments. Our framework tackles both extraction and normalization tasks by jointly considering the relationship between the content and layout information. Dirichlet process prior is employed leading to another advantage that the number of discovered product attributes is unlimited. An unsupervised inference algorithm based on variational method is presented. The semantics of the normalized attributes can be visualized by examining the term weights in the model. Our framework can be applied to a wide range of Web mining applications such as product matching and retrieval. We have conducted extensive experiments from four different domains consisting of over 300 Web pages from over 150 different Web sites, demonstrating the robustness and effectiveness of our framework.
Flexible Host-Based Handoff Selection for Next Generation Networks
Authors: Michael Mackay, Jose Moura, Christopher Edwards
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In contrast to the traditional ‘fixed’ network model, future devices will roam between points of attachment while maintaining the best Layer 2 connectivity. It therefore becomes critical for Mobile Nodes to determine semi-independently the most appropriate technology and Access Network for a given scenario. This supports both the dynamic selection of the ‘best’ point of attachment and near-seamless handoff. Several solutions have already been proposed both within standards bodies and the wider academic community. Our aim is to define an intelligent network selection mechanism, capable of representing and enforcing explicit user-defined parameters as part of a host-based handoff mechanism. Moreover, our proposal works both independently and in cooperation with network-based handoff mechanisms.
New closed-form bounds on the partition function
Authors: Dvijotham Krishnamurthy, Soumen Chakrabarti, Subhasis Chaudhuri
Venue: Machine Learning (2008)

Estimating the partition function is a key but difficult computation in graphical models. One approach is to estimate tractable upper and lower bounds. The piecewise upper bound of Sutton et al. is computed by breaking the graphical model into pieces and approximating the partition function as a product of local normalizing factors for these pieces. The tree reweighted belief propagation algorithm (TRW-BP) by Wainwright et al. gives tighter upper bounds. It optimizes an upper bound expressed in terms of convex combinations of spanning trees of the graph. Recently, Globerson et al. gave a different, convergent iterative dual optimization algorithm TRW-GP for the TRW objective. However, in many practical applications, particularly those that train CRFs with many nodes, TRW-BP and TRW-GP are too slow to be practical. Without changing the algorithm, we prove that TRW-BP converges in a single iteration for associative potentials, and give a closed form for the solution it finds. The closed-form solution obviates the need for complex optimization. We use this result to develop new closed-form upper bounds for MRFs with arbitrary pairwise potentials. Being closed-form, they are much faster to compute than TRW-based bounds. We also prove similar convergence results for loopy belief propagation (LBP) and use it to obtain closed-form solutions to the LBP pseudomarginals and approximation to the partition function for associative potentials. We then use recent results proved by Wainwright et al for binary MRFs to obtain closed-form lower bounds on the partition function. We then develop novel lower bounds for arbitrary associative networks. We report on experiments with synthetic and real-world graphs. Our new upper bounds are considerably tighter than the piecewise bounds in practice. Moreover, we can compute our bounds on several graphs where TRW-BP does not converge. Our novel lower bound, in spite of being closed-form and much faster to compute, outperforms more complicated popular algorithms for computing lower bounds like mean-field on densely connected graphs by wide margins although it does worse on sparsely connected graphs like chains.
The structure of Web-based information systems satisfaction: Testing of competing models
Authors: Christy M. K. Cheung, Matthew K. O. Lee
Venue: Journal of the American Society for Information Science and Technology (2008)

User satisfaction has become one of the most important measures of the success or effectiveness of information systems (IS). In the current study, the dimensionality of Web-based information systems (WIS) satisfaction was first examined. Two composite latent variable models with factor-order structures were then empirically tested and compared to describe the relationships among observable variables concerned with WIS satisfaction. Using data from a sample of 515 university students, a third-order composite latent variable model was retained based on statistical and theoretical criteria. At the third-order level, WIS satisfaction is determined by two second-order constructs: Web information satisfaction and Web system satisfaction. Web information satisfaction is determined by understandability, reliability, and usefulness, while Web system satisfaction is determined by access, usability, and navigation. Overall, the model provides a good fit to the data and is theoretically valid, reflecting logical consistency. Implications of the current investigation for practice and research are provided. &copy; 2008 Wiley Periodicals, Inc.
Between, within and across cultures
Authors: Robert Gluck
Venue: Organised Sound (2008)

The phenomenon of contemporary composers reaching across cultures in search of inspiration, musical materials and forms, and new ideas is not a new one, but it is occurring now with greater frequency. Some seek to join inherited traditions from within their own ancestral cultures with new traditions from the West or with new technologies. Some are Westerners exploring traditional musical forms and aesthetics from cultures different from their own. The process of engaging interculturally raises complex issues, at times challenging historical attitudes towards the culture of ‘the other’. The author considers a wide range of motivations for this emerging body of work, surveying the range of approaches that composers have taken, and urges the cultivation of cultural sensitivity. This essay proposes what the author terms a ‘reflective compositional process’ with which composers can explore their motivations and compositional strategies and consider the relationships inhering between materials and cultural origins. Implications for works engaging new technologies are considered throughout the essay.
A new constrained fixed-point algorithm for ordering independent components
Authors: Hongjuan Zhang, Chonghui Guo, Zhenwei Shi, Enmin Feng
Venue: Journal of Computational and Applied Mathematics (2008)

Independent component analysis (ICA) aims to recover a set of unknown mutually independent components (ICs) from their observed mixtures without knowledge of the mixing coefficients. In the classical ICA model there exists ICs' indeterminacy on permutation and dilation. Constrained ICA is one of methods for solving this problem through introducing constraints into the classical ICA model. In this paper we first present a new constrained ICA model which composed of three parts: a maximum likelihood criterion as an objective function, statistical measures as inequality constraints and the normalization of demixing matrix as equality constraints. Next, we incorporate the new fixed-point (newFP) algorithm into this constrained ICA model to construct a new constrained fixed-point algorithm. Computation simulations on synthesized signals and speech signals demonstrate that this combination both can eliminate ICs' indeterminacy to a certain extent, and can provide better performance. Moreover, comparison results with the existing algorithm verify the efficiency of our new algorithm furthermore, and show that it is more simple to implement than the existing algorithm due to its advantage of not using the learning rate. Finally, this new algorithm is also applied for the real-world fetal ECG data, experiment results further indicate the efficiency of the new constrained fixed-point algorithm.
Semi-automatic Learning of Two-Level Phonological Rules for Agentive Nouns
Authors: Arbana Kadriu, Katerina Zdravkova
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The subject of the research presented in this paper is to build a system that will automatically obtain the two-level rules for agentive nouns in two languages: English and Macedonian. A set of pairs base_word - derived_agentive noun is constructed and for all these pairs a string edit sequence is built using the insert, delete and replace operations. Using the resulting sequences, a minimal acyclic finite state automaton is constructed, which has only one start and one final state. From this automaton, the two-level phonological rules are obtained. These rules are extended to improve some of their limitations. In total, seventeen two-level rules are implemented to the English agentive nouns, as well as nine two-level rules for the Macedonian agentive nouns.
iVisual: an intelligent visual sensor SoC with 2790fps CMOS image sensor and 205GOPS/W vision processor
Authors: Chih-Chi Cheng, Chia-Hua Lin, Chung-Te Li, Samuel C. Chang, Liang-Gee Chen
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

iVisual, an intelligent visual sensor SoC integrating 2790fps CMOS image sensor and 76.8GOPS, 374mW vision processor, is implemented on a 7.5mmx9.4mm die with 0.18&mu;m CIS process. The light-in, answer-out SoC architecture avoids privacy problems of intelligent visual sensor. The feature processor and inter-processor synchronization scheme together increase 51% of average throughput. The 205GOPS/W power efficiency and 1.16GOPS/mm2 area efficiency are achieved.
NectaRSS, an intelligent RSS feed reader
Authors: Juan J. Samper, Pedro A. Castillo, Lourdes Araujo, J. J. Merelo, íscar Cordón, Fernando Tricas
Venue: Journal of Network and Computer Applications (2008)

In this paper a novel article ranking method called NectaRSS is introduced. The system recommends incoming articles, which we will designate as newsitems, to users based on their past choices. User preferences are automatically acquired, avoiding explicit feedback, and ranking is based on those preferences distilled to a user profile. NectaRSS uses the well-known vector space model for user profiles and new documents, and compares them using information retrieval techniques, but introduces a novel method for user profile creation and adaptation from users' past choices. The efficiency of the proposed method has been tested by embedding it into an intelligent aggregator (RSS feed reader) which has been used by different and heterogeneous users. Besides, this paper proves that the ranking of newsitems yielded by NectaRSS improves its quality with user's choices, and its superiority over other algorithms that use a different information representation method.
QoS modeling and analysis of component-based software systems: a stochastic approach
Authors: Yunni Xia, Hanpin Wang, Wangsen Feng, Yu Huang
Venue: Concurrency and Computation: Practice Experience (2008)

There is a growing demand for using commercial-off-the-shelf (COTS) software components to facilitate the development of software systems. Among many research topics for component-based software, quality-of-service (QoS) evaluation is yet to be given the importance it deserves. In this paper, we propose a novel analytical model to evaluate the QoS of component-based software systems. We use the component execution graph (CEG) graph model to model the architecture at the process level and the interdependence among components. The CEG graph can explicitly capture sequential, parallel, selective and iterative compositions of components. For QoS estimation, each component in the CEG model is associated with execution rate, failure rate and cost per unit time. Three metrics of the QoS are considered and analytically calculated, namely make-span, reliability and cost. Through a case study, we show that our model is capable of modeling real-world COTS software systems effectively. Also, Monte-Carlo simulation in the case study indicates that analytical results are consistent with simulation and all are covered by 95&percnt; confidence intervals. We also present a sensitivity analysis technique to identify QoS bottlenecks. This paper concludes with a comparison with related work. Copyright &copy; 2007 John Wiley & Sons, Ltd.