ppxscal/embedding_network huggingface dataset:
Global stabilisation of Lur'e network
Authors: Zengqiang Chen, Linying Xiang, Guan Ron Chen, Zhongxin Liu, Zhuzhi Yuan
Venue: International Journal of Systems, Control and Communications (2009)

A new complex dynamical network model consisting of Lur'e systems are proposed and studied in this paper. Some new global stabilisation conditions are derived based on the Lyapunov stability theory, which guarantee that the whole network can be pinned to its equilibrium by placing some feedback controllers on a small fraction of nodes. In some particular cases, even a single controller can achieve the control objective. It is found that global stabilisation of such a network is completely determined by the dynamics of each individual node, the coupling strength, the inner-coupling matrix, and the eigenvalues of the coupling matrix as well as the feedback-gain matrix of the network.
Effect of mobility on violence in a bi-communal population
Authors: Michael Winsper, Maria Chli
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We develop a multi-agent based model to simulate a population which comprises of two adversarial groups and a peacekeeping force. We compare the effect of random and ingroup migration strategies for civilian movement on the resulting violence in this bi-communal population. Ingroup migration leads the formation of clusters. Furthermore, we show that in settings where only one of the two groups adopts ingroup migration it is a winning strategy in violently predisposed populations. On the other hand, in relatively peaceful settings clustering is a restricting factor.
A Study on a Framework of Online Biometric Authentication with Verification of Personal Repository
Authors: Yoshifumi Ueshige, Kouichi Sakurai
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

Biometric authentication is remarkable with respect to identification of legitimate users. Biometric authentication is hopeful of services on the internet as reinforcement for conventional authentication such as ID and password, however, biometric information --acquisition raw data and template data--is unrenewable even though the data is compromised. We propose a framework of online biometric authentication with verification of validity of user's personal repository based on PKI. In this framework, information of biometrics authentication (certificate of templates) is related to not information of ownership but personal repository. This framework achieves anonymity during biometric authentication process by verifying validity of the user's personal repository.
Automatic Cross-Biometric Footstep Database Labelling Using Speaker Recognition
Authors: Rubén Vera-Rodríguez, John S. Mason, Nicholas W. Evans
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

The often daunting task of collecting and manually labelling biometric databases can be a barrier to research. This is especially true for a new or non-established biometric such as footsteps. The availability of very large data sets often plays a role in the research of complex modelling and normalisation algorithms and so an automatic, semi-unsupervised approach to reduce the cost of manual labelling is potentially of immense value.This paper proposes a novel, iterative and adaptive approach to the automatic labelling of what is thought to be the first large scale footstep database (more than 10,000 examples across 127 persons). The procedure involves the simultaneous collection of a spoken, speaker-dependent password which is used to label the footstep data automatically via a pre-trained speaker recognition system. Subsets of labels are manually checked by listening to the particular password utterance, or viewing the associated talking face; both are recorded with the same time stamp as the footstep sequence.Experiments to assess the resulting label accuracy, based on manually labelled subsets, suggest that the accuracy of the automatic labelling is better than 0.1%, and thus sufficient to assess a biometric such as footsteps, which is anticipated to have a much higher error rate.
New optimal approach for the identification of Takagi-Sugeno fuzzy model
Authors: Agustín Jiménez, Basil M.AL-Hadithi, Fernando Matía
Venue: Proceedings of the 4th WSEAS/IASME international conference on Dynamical systems and control (2008)

A new and efficient approach is presented that lead to improve the local and global approximation (matching) and modelling capability of Takagi-Sugeno (T-S) fuzzy model. The main aim is obtaining high function approximation accuracy and fast convergence. The main problem encountered is that T-S model can not be applied when the membership functions are overlapped by pairs. This restricts the application of the T-S model because this type of membership function has been widely used during the last two decades in the stability, controller design of fuzzy systems and are popular in industrial control applications. The approach developed here can be considered as a generalized version of T-S fuzzy model with optimized performance in approximating nonlinear functions. Illustrative examples are chosen to evaluate the robustness and performance of the proposed method and the high accuracy obtained in approximating nonlinear systems locally and globally in comparison with the original TS model. It is worth noting that proposed algorithm achieve a remarkable performance in comparison with the original T-S model.
Space vector double frame field oriented control of six phase induction motors
Authors: M. Kamari, M. Keramatzadeh, R. Kianinezhad
Venue: WSEAS Transactions on Systems and Control (2009)

In this paper a new rotor field orientation control of six phase induction machine is proposed. The machine has two three phase windings spatially shifted by 30 electrical degrees. The dynamic model of the machine is based on the three two dimensional orthogonal subspaces. The proposed method uses a simple estimator for identifying rotor flux and its orientation. To eliminate the extra harmonic currents of stator windings that produce losses, space vector PWM technique and double synchronous frame current controller is employed. The simulation results illustrate the validity and efficiency of the proposed method.
Modelling FRR of Biometric Verification Systems Using the Template Co-update Algorithm
Authors: Luca Didaci, Gian Luca Marcialis, Fabio Roli
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

The decrease of representativeness of available templates during time is due to the large intra-class variations characterizing biometrics (e.g. faces). This requires the design of algorithms able to make biometric verification systems adaptive to such variations. Among others, the template co-update algorithm, which uses the mutual help of two complementary biometric matchers, has shown promising experimental results. The present paper is aimed to describe a theoretical model able to explain the co-update behaviour. In particular, the focus is on the relationships between error rate and gallery size increase. Preliminary experimental results are shown to validate the proposed model.
Electronic Commerce: Concepts, Methodologies, Tools and Applications
Authors: Annie Becker, Annie Becker
Venue: Premier Reference Source (2007)

The electronic commerce environment has evolved so rapidly that it is difficult for even seasoned professionals in IT, management, and other affected disciplines to keep up with the pace of change and to comprehend the full range of opportunities and challenges these emerging technologies present. Electronic Commerce: Concepts, Methodologies, Tools and Applications compiles a critical mass of top research nearly 300 chapters from upwards of 400 of the worlds leading experts to provide libraries with a landmark, four-volume reference to meet research needs in the many disciplines impacted by these far-reaching topics. The comprehensive range of covered topics includes mobile commerce, virtual enterprises, business-to-business applications, Web services, and enterprise methodologies.
The design trade-offs of BitTorrent-like file sharing protocols
Authors: Bin Fan, John C. S. Lui, Dah-Ming Chiu
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

The BitTorrent (BT) file sharing protocol is very popular due to its scalability property and the built-in incentive mechanism to reduce free-riding. However, in designing such P2P file sharing protocols, there is a fundamental trade-off between keeping fairness and providing good performance. In particular, the system can either keep peers (especially those resourceful ones) in the system for as long as possible so as to help the system to achieve better performance, or allow more resourceful peers to finish their download as quickly as possible so as to achieve fairness. The current BT protocol represents only one possible implementation in this whole design space. The objective of this paper is to characterize the design space of BT-like protocols. The rationale for considering fairness in the P2P file sharing context is to use it as a measure of willingness to provide service. We show that there is a wide range of design choices, ranging from optimizing the performance of file download time, to optimizing the overall fairness measure. More importantly, we show that there is a simple and easily implementable design knob so that the system can operate at a particular point in the design space. We also discuss different algorithms, ranging from centralized to distributed, in realizing the design knob. Performance evaluations are carried out, both via simulation and network measurement, to quantify the merits and properties of the BT-like file sharing protocols.
Ordering, distinctness, aggregation, partitioning and DQP optimization in sybase ASE 15
Authors: Mihnea Andrei, Xun Cheng, Sudipto Chowdhuri, Curtis Johnson, Edwin Seputis
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

The Sybase ASE RDBMS version 15 was subject to major enhancements, including semantic partitions and a full QP rewrite. The new ASE QP supports horizontal and vertical parallel processing over semantically partitioned tables, and many other modern QP techniques, as cost-based eager aggregation and cost-based join relocation DQP. In the new query optimizer, the ordering, distinctness, aggregation, partitioning, and DQP optimizations were based on a common framework: plan fragment equivalence classes and logical properties. Our main outcomes are a) an eager enforcement policy for ordering, partitioning and DQP location; b) a distinctness and aggregation optimization policy, opportunistically based on the eager ordering enforcement, and which has an optimization-time computational complexity similar to join processing; c) support for the user to force all of the above optimizer decisions, still guaranteeing a valid plan, based on the Abstract Plan technology. We describe the implementation of this solution in the ASE 15 optimizer. Finally, we give our experimental results: the generation of such complex plans comes with a small increase of the optimizer's SS size, hence within an acceptable optimization time; at execution, we have obtained performance improvements of orders of magnitude for some queries.
Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis
Venue: Human Language Technology Conference (2006)

Welcome to the HLT-NAACL'06 BioNLP Workshop, Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis. The late 1990s saw the beginning of a trend towards significant growth in the area of biomedical language processing, and in particular in the use of natural language processing techniques in the molecular biology and related computational bioscience domains. The figure below gives an indication of the amount of recent activity in this area: it shows the cumulative number of documents returned by searching PubMed, the premiere repository of biomedical scientific literature, with the query ((natural language processing) OR (text mining)) AND (gene OR protein), limiting the search by year for every year from 1999 through 2005: the three papers in 1999 had grown to 227 by the end of 2005. Significant challenges to biological literature exploitation remain, in particular for such biological problem areas as automated function prediction and pathway reconstruction and for linguistic applications such as relation extraction and abstractive summarization. In light of the nature of these remaining challenges, the focus of this workshop was intended to be applications that move towards deeper semantic analysis. We particularly solicited work that addresses relatively under-explored areas such as summarization and question-answering from biological information. Papers describing applications of semantic processing technologies to the biology domain were especially invited. That is, the primary topics of interest were applications which require deeper linguistic analysis of the biological literature. We also solicited papers exploring issues in porting NLP systems originally constructed for other domains to the biology domain. What makes the biology domain special? What hurdles must be overcome in performing linguistic analysis of biological text? Are any special linguistic or knowledge resources required, beyond a domain-specific lexicon? What relations in biological text are most interesting to biologists, and hence should be the focus of our future efforts? The workshop received 31 submissions: 29 full-paper submissions, and two poster submissions. A strong program committee, representing BioNLP researchers in North America, Europe, and Asia, provided thorough reviews, resulting in the acceptance of eleven full papers and nineteen posters, for an acceptance rate for full papers of 38% (11/29), which we believe made this one of the most competitive BioNLP workshop or conference sessions to date. A notable trend in the accepted papers is that only one of them was on the topic of entity identification. The subject areas of the papers presented at BioNLP'06 included an exceptionally wide range of topics: question-answering, computational lexical semantics, information extraction, entity normalization, semantic role labelling, image classification, and syntactic aspects of the sublanguage of molecular biology
Dirty-slate approaches to scaling global internet routing
Authors: Paul Francis
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

The Internet research community has in recent years taken a renewed interest in the long-standing global Internet routing scaling problem. Much of this research has taken the form of much-needed "clean-slate" research, where ideas are pursued unconstrained by the installed base. Our research group takes an opposite but complementary approach. We look for solutions that are economically motivated and therefore have a decent chance of actually being deployed. One such solution is Virtual Aggregation, an approach that exploits tunneling and aggregation to reduce the size of hardware routing tables (the FIB) easily by an order of magnitude. This work is being pursued in the IETF. More recently, we are working on adapting Virtual Aggregation to shrinking software routing tables (the RIB) as well. In this session, we will discuss the root causes of scaling problems in the Internet, review the history of scaling solutions, and present Virtual Aggregation in detail.
A socio-emotional model of impoliteness for non-player characters
Authors: Sabrina Campano, Nicolas Sabouret
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Due to its important role in dialogue, politeness has been widely studied both from a theoretical point of view and at a practical level in virtual agents [1, 4]. However, few attention has been given to impoliteness, even though virtual characters, such as Non Player Characters in video games, should be able to use it to improve their believability. Impoliteness consists in performing verbal attacks towards the interlocutor [3], most of the time deliberately, while politeness consists in minimizing verbal offenses towards the interlocutor [2].
Methodologies for evaluating IT business value management
Authors: Mario Spremic
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

Most organizations in all sectors of industry, commerce and government are fundamentally dependent on their information systems (IS) and would quickly cease to function should the technology (preferably information technology - IT) that underpins their activities ever come to halt [15]. The development and governance of proper IT infrastructure may have enormous implications for the operation, structure and strategy of organizations. IT and IS may contribute towards efficiency, productivity and competitiveness improvements of both inter-organizational and intraorganizational systems [1]. On the other hand, successful organizations manage IT function in much the same way that they manage their other strategic functions and processes. This in particular means that they understand and manage risks associated with growing IT opportunities as well as critical dependence of many business processes on IT and vice-versa. IT risk management issues are not only any more marginal or 'technical' problems and become more and more a 'business problem'. Therefore, in this chapter a Corporate IT Risk Management model is proposed and contemporary frameworks of IT Governance and IT Audit explained. Also, it is depicted how to model information systems and supporting IT procedures to meet 'always-on' requirements that comes from the business. In fact, a number of IT metrics proposed in the chapter support the alignment of IT Governance activities with business requirements towards IT.
Mixing icons, geometric shapes and temporal axis to propose a visual tool for querying spatio-temporal databases
Authors: Christine Bonhomme, Marie-Aude Aufaure
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

This paper presents Lvis, a visual query language for Geographic Information Systems (GIS) and for spatio-temporal databases. Visual queries are specified by means of a combination of icons. These icons are used to represent both object types and operators. Geometric shapes are used to represent spatial objects and relations among them; Balloons and temporal axis are used to represent temporal criteria. A visual approach has been chosen because it offers numerous advantages for the representation of spatio-temporal queries. Visual representations are in fact well-suited since they easily permit to express the spatial nature of a query. Several research works dealing with this issue have been proposed in the last ten years. Besides, visual querying is a friendly and simple querying mode. It is the reason why it is well-adapted to novice users. The paper introduces the spatio-temporal model of the language. It gives some examples of queries to explain how geometric shapes, icons and temporal axis are combined. Finally, it discusses the main issues tied to the visual, psycho-cognitive and spatio-temporal considerations.
A Note on Multiflows and Treewidth
Authors: Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
Venue: Algorithmica (2009)

We consider multicommodity flow problems in capacitated graphs where the treewidth of the underlying graph is bounded by r. The parameter r is allowed to be a function of the input size. An instance of the problem consists of a capacitated graph and a collection of terminal pairs. Each terminal pair has a non-negative demand that is to be routed between the nodes in the pair. A class of optimization problems is obtained when the goal is to route a maximum number of the pairs in the graph subject to the capacity constraints on the edges. Depending on whether routings are fractional, integral or unsplittable, three different versions are obtained; these are commonly referred to respectively as maximum MCF, EDP (the demands are further constrained to be one) and UFP. We obtain the following results in such graphs. An O(rlog&#x2009;rlog&#x2009;n) approximation for EDP and UFP. The integrality gap of the multicommodity flow relaxation for EDP and UFP is $O(\min\{r\log n,\sqrt{n}\})$. The integrality gap result above is essentially tight since there exist (planar) instances on which the gap is $\Omega(\min\{r,\sqrt{n}\})$. These results extend the rather limited number of graph classes that admit poly-logarithmic approximations for maximum EDP. Another related question is whether the cut-condition, a necessary condition for (fractionally) routing all pairs, is approximately sufficient. We show the following result in this context. The flow-cut gap for product multicommodity flow instances is O(log&#x2009;r). This was shown earlier by Rabinovich; we obtain a different proof.