ppxscal/embedding_network huggingface dataset:
MapReduce optimization using regulated dynamic prioritization
Authors: Thomas Sandholm, Kevin Lai
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

We present a system for allocating resources in shared data and compute clusters that improves MapReduce job scheduling in three ways. First, the system uses regulated and user-assigned priorities to offer different service levels to jobs and users over time. Second, the system dynamically adjusts resource allocations to fit the requirements of different job stages. Finally, the system automatically detects and eliminates bottlenecks within a job. We show experimentally using real applications that users can optimize not only job execution time but also the cost-benefit ratio or prioritization efficiency of a job using these three strategies. Our approach relies on a proportional share mechanism that continuously allocates virtual machine resources. Our experimental results show a 11-31% improvement in completion time and 4-187% improvement in prioritization efficiency for different classes of MapReduce jobs. We further show that delay intolerant users gain even more from our system.
Optimizing feature complementarity by evolution strategy: Application to automatic speaker verification
Authors: C. Charbuillet, B. Gas, M. Chetouani, J. L. Zarader
Venue: Speech Communication (2009)

Conventional automatic speaker verification systems are based on cepstral features like Mel-scale frequency cepstrum coefficient (MFCC), or linear predictive cepstrum coefficient (LPCC). Recent published works showed that the use of complementary features can significantly improve the system performances. In this paper, we propose to use an evolution strategy to optimize the complementarity of two filter bank based feature extractors. Experiments we made with a state of the art speaker verification system show that significant improvement can be obtained. Compared to the standard MFCC, an equal error rate (EER) improvement of 11.48% and 21.56% was obtained on the 2005 Nist SRE and Ntimit databases, respectively. Furthermore, the obtained filter banks picture out the importance of some specific spectral information for automatic speaker verification.
The effect of cooperation at the network protocol level
Authors: Beiyu Rong, Anthony Ephremides
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

There has been a great deal of attention on cooperative communication which exploits the spatial diversity among antennas belonging to multiple terminals. Most of the existing work focuses on the physical layer and shows how message relaying can improve the Shannon capacity region, outage probability, diversity order, etc. But it is possible to use relays in simple, innovative ways that depend on the protocol properties at the medium access control (MAC) and network layers. In this paper we build upon prior work on such relay use by considering sets of nodes in simple topology configurations in which reaching a common destination is accomplished through direct links as well as relayed transmissions. Each non-destination node generates its own traffic for the destination but the nodes that are closer to the destination have the capability and option to relay packets from nodes farther afield. Channel quality is modeled by a reception probability which injects the physical layer property into upper layer design and analysis. We consider bursty arrival processes and we characterize the stable throughput region and delay performance at each node. We show that a proposed cooperation strategy can lead to improved performance for both work-conserving and Time Division Multiple Access (TDMA) MAC protocols. The innovative elements in this work are the balance between own and relayed traffic at each node and the fact that the performance improvement is in part due to the concentration of the queues of failed packets into fewer virtual queues.
A framework for virtual network embedding in wireless networks
Authors: Keun-mo Park, Chong-kwon Kim
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

In this paper, we formulate the virtual network embedding problem in wireless networks and suggest a framework to approach the problem. Also, we show an application of our problem modeling framework with ORBIT which is one of famous wireless test-bed networks.
IAMwildCAT: The Winning Strategy for the TAC Market Design Competition
Authors: Perukrishnen Vytelingum, Ioannis A. Vetsikas, Bing Shi, Nicholas R. Jennings
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper we describe the IAMwildCAT agent, designed for the TAC Market Design game which is part of the International Trading Agent Competition. The objective of an agent in this competition is to effectively manage and operate a market that attracts traders to compete for resources in it. This market, in turn, competes against markets operated by other competition entrants and the aim is to maximise the market and profit share of the agent, as well as its transaction success rate. To do this, the agent needs to continually monitor and adapt, in response to the competing marketplaces, the rules it uses to accept offers, clear the market, price the transactions and charge the traders. Given this context, this paper details IAMwildCAT's strategic behaviour and describes the wide techniques we developed to operationalise this. Finally, we empirically analyse our agent in different environments, including the 2007 competition where it ranked first.
Exploring an Open Source Data Mining Environment for Software Product Quality Decision Making
Authors: Houria Yazid, Hakim Lounis
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

Software metrics play a major role in predicting software quality; they help project managers in decision-making. Indeed, software metrics provide a quantitative approach allowing the control and the improvement of the development process including the maintenance. The ISO/IEC international standard (14598) on software product quality states, “Internal metrics are of little value unless there is evidence that they are related to external quality”. Many empirical prediction models are presented in the literature; their goal is to investigate the relationship between internal metrics and external qualities, in order to assess software quality. In this paper, we explore different machine-learning (ML) algorithms provided by an open source data-mining environment. We analyse their capacities to produce accurate and usable predictive models.
Reflecting the relevance of communication in e-government-projects: two case studies in the field of knowledge management in the Swiss public administration
Authors: Marianne Fraefel, Alessia C. Neuroni, Reinhard Riedl
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

The present paper focuses on the managerial and social perspective of ICT-based change in E-government projects. Taking the political and legal setting into account, it takes a closer look at how a main goal of the Swiss E-government-strategy, the modernisation of public authorities' business processes and their electronic interaction, is realised in the public administration. Illustrated by two examples in the field of knowledge management, the paper reflects the relevance of planned communication in the context of ICT-based change projects. Based on a review of empirical, theoretical and practical literature relevant to the fields of change and project communication and on a comparison of two case studies, the authors aim at clarifying the relation between the impact of communication and its contextual factors when implementing E-Government-projects. Communication clearly is not the only key for success, however, a conscious approach towards communication is likely to increase acceptance of the intended change, decrease some of the typical risks in IT-project management and support controlling. The authors suggest that an integrative approach, drawing on insights from the field of change communication and existing project management methods and tools for managing communication, should be applied when developing a communicational strategy for E-Government projects. Since the adequacy of communicative measures is context-dependent, further research on the characteristics of different forms of ICT-implementation in public administration is needed. This might lead to the identification of prototypical context factors relevant to communication management in E-Government projects.
Design Strategies and Principles in VISOLE
Authors: Junjie Shang, Fong-Lok Lee, Jimmy Ho-Man Lee
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

VISOLE (Virtual Interactive Student-Oriented Learning Environment) is a learning style that uses a virtual game environment to facilitate learning. The web-based game environment is a simulation of the real world where students participate as “citizens” and take part in shaping the development of the virtual world. It provides a platform for participants to apply the theoretical knowledge to solve problems in a near-real environment, as well as to develop high-level skills for communication and problem solving in addition to subject knowledge. In this paper, we will discuss the difficulties and challenges that we met and the design strategies and principles we adopted in the construction of a VISOLE testbed.
Weight and cost oriented multi-objective optimisation of impact damage resistant stiffened composite panels
Authors: M. Corvino, L. Iuspa, A. Riccio, F. Scaramuzzino
Venue: Computers and Structures (2009)

In this paper, a multi-objective optimisation procedure, based on the adoption of genetic algorithms, is presented. The optimal configuration with minimum weight and minimum cost of a damage resistant stiffened, composite panel with buckling constraints has been determined. The numerical procedure is based on an in-house optimisation code used in conjunction with the ANSYS FEM code. The presence of both continuous and high sensitivity discrete design variables, suggested for GA the adoption of a special bit-masking data structure able to increase the overall computational efficiency. Optimal configurations of the stiffened panel, are finally analysed and discussed focusing on the influence of the damage resistance constraint on the overall costs.
Automata theory based on complete residuated lattice-valued logic: A categorical approach
Authors: Hongyan Xing, Daowen Qiu
Venue: Fuzzy Sets and Systems (2009)

Automata theory based on complete residuated lattice-valued logic, called L-valued automata (L-VAs), has been primarily established by Qiu in 2001 and 2002. In this paper, we consider the L-VAs that have L-valued initial and final states. We study the categorical issue of L-VAs. The main technical contributions include: (1) We investigate the relationship between the category of L-VAs and the category of non-deterministic automata (NDAs); also, we study the relationship between the category of generalized L-VAs and the category of NDAs. (2) We prove the existence of isomorphisms between the category of L-VAs and the subcategory of generalized L-VAs and between the category of L-VAs and the category of sets of NDAs. (3) Finally, we further investigate some specific relationships between the output L-valued subsets of generalized L-VAs and the output L-valued subsets of NDAs.
Space-optimal heavy hitters with strong error bounds
Authors: Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several proposed solutions to this problem can outperform their worst-case guarantees on real data. This leads to the question of whether some stronger bounds can be guaranteed. We answer this in the positive by showing that a class of "counter-based algorithms" (including the popular and very space-efficient FREQUENT and SPACESAVING algorithms) provide much stronger approximation guarantees than previously known. Specifically, we show that errors in the approximation of individual elements do not depend on the frequencies of the most frequent elements, but only on the frequency of the remaining "tail." This shows that counter-based methods are the most space-efficient (in fact, space-optimal) algorithms having this strong error bound. This tail guarantee allows these algorithms to solve the "sparse recovery" problem. Here, the goal is to recover a faithful representation of the vector of frequencies, f. We prove that using space O(k), the algorithms construct an approximation f* to the frequency vector f so that the L1 error ||f -- f*||1 is close to the best possible error minf2 ||f2 -- f||1, where f2 ranges over all vectors with at most k non-zero entries. This improves the previously best known space bound of about O(k log n) for streams without element deletions (where n is the size of the domain from which stream elements are drawn). Other consequences of the tail guarantees are results for skewed (Zipfian) data, and guarantees for accuracy of merging multiple summarized streams.
A Formal Approach for the Forensic Analysis of Logs
Authors: Ali Reza Arasteh, Mourad Debbabi, Assaad Sakha
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

The increasing trend of computer crimes has intensified the relevance of cyber-forensics. In such a context, forensic analysis plays a major role by analyzing the evidence gathered from the crime scene and corroborating facts about the committed crime. In this paper, we propose a formal approach for the forensic log analysis. The proposed approached is based on the logical modelling of the events and the traces of the victim system as formulas over a modified version of the ADM logic[12]. In order to illustrate the proposed approach, the Windows auditing system[21] is studied. We will discuss the importance of the different features of such a system from the forensic standpoint (e.g. the ability to log accesses to specific files and registry keys and the abundance of information that can be extracted from these logs). Furthermore, we will capture logically: Invariant properties of a system, forensic hypotheses, generic or specific attack signatures. Moreover, we will discuss the admissibility of forensics hypotheses and the underlying verification issues.
A web of concepts
Authors: Nilesh Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, Sathiya Keerthi, Srujana Merugu
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

We make the case for developing a web of concepts by starting with the current view of web (comprised of hyperlinked pages, or documents, each seen as a bag of words), extracting concept-centric metadata, and stitching it together to create a semantically rich aggregate view of all the information available on the web for each concept instance. The goal of building and maintaining such a web of concepts presents many challenges, but also offers the promise of enabling many powerful applications, including novel search and information discovery paradigms. We present the goal, motivate it with example usage scenarios and some analysis of Yahoo! logs, and discuss the challenges in building and leveraging such a web of concepts. We place this ambitious research agenda in the context of the state of the art in the literature, and describe various ongoing efforts at Yahoo! Research that are related.
Plenary lecture 2: fuzzy techniques for sensors
Authors: Valentina E. Balas
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

A good strategy to improve the technologies is to provide them with useful pieces of deterministic previous knowledge about the processes and the equipment. The lecture is focused on the industrial systems, implemented with low level devices that need knowledge on the controlled plants as well as on the general theoretical foundations. This can be done by the help of internal models, or with planners whose design is performed by simulations. A particular architecture of sensors relying on modeling techniques and some internal model estimators for different applications is presented.
Modelling and method for beef quality risk identification and optimization in beef cattle breeding
Authors: Hui Li, Jian Zhang, Lingxian Zhang, Liang Shi, Daoliang Li, Zetian Fu
Venue: WSEAS Transactions on Information Science and Applications (2009)

The meat industry is seeking to establish reassurance on traceability and production techniques that may help to promote confidence in the integrity and origin of the products. The overall tracing of beef quality is actually the risk identification and control along the supply chains of beef production. This study focused on the identification and control methods of quality risks in China traditional beef cattle breeding with optimization approaches concerned. The quality risks in beef cattle breeding were classified by features to develop the disseminated model of these risks and its algorithms. Then the theory of quality traceability was used and a concept model of quality risk control was proposed. Tracing units were divided and tracing nodes were set through optimization. The proposed risk identification and control models were capable of identifying and handling a product and the information attached to it throughout the whole production process to retail packs.
Least conservative robust stability condition for linear bilateral teleoperation control systems
Authors: Amir Haddadi, Keyvan Hashtrudi-Zaad
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In this paper, we analyze the stability robustness of teleoperation systems, coupled to operators and environments with finite range of dynamic variations. A new graphical extension of the scattering-based absolute stability method [5] is proposed, which incorporates minimum inherent damping of the operator as well as bounds on the environment impedance. The proposed method provides both mathematical and visual aid for the determination of passive or active environment regions that result in coupled stability. Our rigorous studies have shown that for potentially unstable systems, as the operator minimum damping grows, the environment stability region grows to include all passive environments.
Inverse parametric alignment for accurate biological sequence comparison
Authors: John D. Kececioglu
Venue:  (2008)

For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. In practice, substitution scores are usually chosen by convention, and gap penalties are often found by trial and error. In contrast, a rigorous way to determine parameter values that are appropriate for aligning biological sequences is by solving the problem of Inverse Parametric Sequence Alignment. Given examples of biologically correct reference alignments, this is the problem of finding parameter values that make the examples score as close as possible to optimal alignments of their sequences. The reference alignments that are currently available contain regions where the alignment is not specified, which leads to a version of the problem with partial examples. In this dissertation, we develop a new polynomial-time algorithm for Inverse Parametric Sequence Alignment that is simple to implement, fast in practice, and can learn hundreds of parameters simultaneously from hundreds of examples. Computational results with partial examples show that best possible values for all 212 parameters of the standard alignment scoring model for protein sequences can be computed from 200 examples in 4 hours of computation on a standard desktop machine. We also consider a new scoring model with a small number of additional parameters that incorporates predicted secondary structure for the protein sequences. By learning parameter values for this new secondary-structure-based model, we can improve on the alignment accuracy of the standard model by as much as 15% for sequences with less than 25% identity.
Plenary lecture 4: studying modules using endomorphisms
Authors: Ulrich Albrecht
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

Many applications of algebra require a deep understanding of non-commutative rings and of the structure of modules over such rings. Unfortunately, the rich structure theory available for modules over integral domains appears to be not available in this more general setting. This lecture demonstrates that this is not the case by presenting an approach to studying modules over rings without requiring immediate restrictions on the ring. As most results in module-theory, our discussion has its roots in the theory of linear transformations of a (finite-dimensional) vector-space V. For a given right module M over a ring R, we consider the group E = E(M) of all R-linear transformations M ® M. Composition of maps makes E a ring, and M an E-R-bimodule. The ring E is called the endomorphism ring of M. We will discuss how ring-theoretic properties of the ring E are reflected in the structure of the module M and vice-versa. Examples of applications of this approach to several problems in Algebra will be given.
SCJP 100 Success Secrets: Success with The Sun Certified Java Programmer (SCJP) Exam, before and after passing
Authors: Gerard Blokdijk
Venue:  (2007)

There has never been a SCJP manual like this. 100 Success Secrets is not about the ins and outs of the SCJP. Instead, it answers the top 100 questions that we are asked and those we come across in forums, our consultancy and education programs. It tells you exactly how to deal with those questions, with tips that have never before been offered in print. This book is also not about a SCJP's best practice and standards details. Instead it introduces everything you want to know to be successful with and in SCJP. 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
Virtual radio: a framework for configurable radio networks
Authors: Joachim Sachs, Stephan Baucke
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

Network virtualization has recently been proposed for the development of large scale experimental networks, but also as design principle for a Future Internet. In this paper we describe the background to network virtualization and extend this concept into the wireless domain, which we denote as radio virtualization. With radio virtualization different virtual radio networks can operate on top of a common shared infrastructure and share the same radio resources. We present how this radio resource sharing can be performed efficiently without interference between the different virtual radio networks. Further we discuss how radio transmission functionality can be configured. Radio virtualization provides flexibility in the design and deployment of new wireless networking concepts. It allows customization of radio networks for dedicated networking services at reduced deployment costs.