ppxscal/embedding_network huggingface dataset:
Controlling the Behaviour of Database Servers with 2PAC and DiffServ
Authors: Luís Fernando Orleans, Geraldo Zimbrão, Pedro Furtado
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

In order to avoid stress conditions in information systems, the use of a simple admission control (SAC) mechanism is widely adopted by systems' administrators. Most of the SAC approaches limit the number of concurrent work, redirecting to a waiting FCFS queue all transactions that exceed that number. The introduction of such a policy can be very useful when the most important metric for the system is the total throughput. But such a simple AC approach may not be sufficient when transactions have deadlines to meet, since in stressed scenarios a transaction may spend a lot of time only waiting for execution. This paper presents 2 enhancements that help keeping the number of transactions executed within the deadline near to the throughput. The enhancements are DiffServ, in which short transactions have priority, and a 2-Phase Admission Control (2PAC) mechanism, which tries to avoid the previousmentioned problem by limiting the queue size dynamically using informations provided by a feedback control. It also introduces the QoS-Broker --- a tool which implements both SAC and 2PAC --- and uses it to compare their performances when submitted to the TPC-C benchmark. Our results show that both total throughput and throughput within deadline increase when the 2 enhancements are used, although it becomes clear that 2PAC has a much bigger impact on performance than DiffServ.
Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness
Authors: Ho Woo Lee, Sahng Hoon Cheon, Se Won Lee, Jung Woo Baek
Venue: Discrete Event Dynamic Systems (2008)

This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic control of the D-policy and multiple server vacations. We derive the probability generating function of the queue length and the mean queue length. We then present computational experiences and compare the MAP queue with the Poisson queue.
Towards a Framework for Assessing Deformable Models in Medical Simulation
Authors: Maud Marchal, Jérémie Allard, Christian Duriez, Stéphane Cotin
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

Computational techniques for the analysis of mechanical problems have recently moved from traditional engineering disciplines to biomedical simulations. Thus, the number of complex models describing the mechanical behavior of medical environments have increased these last years. While the development of advanced computational tools has led to interesting modeling algorithms, the relevances of these models are often criticized due to incomplete model verification and validation. The objective of this paper is to propose a framework and a methodology for assessing deformable models. This proposal aims at providing tools for testing the behavior of new modeling algorithms proposed in the context of medical simulation. Initial validation results comparing different modeling methods are reported as a first step towards a more complete validation framework and methodology.
An Abandoned Objects Management System Based on the Gaussian Mixture Model
Authors: Chih-Yang Lin, Wen-Hao Wang
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In this paper, a comprehensive solution for managing abandoned objects is proposed, which means that the system can deal with the objects that are abandoned and removed. The system contains two adaptive abandoned object detection (AOD) methods that are both based on the Gaussian mixture model for real environments. The first method is more efficient than the second one, but the latter is more robust than the former. The proposed methods are proved to be characterized with prominent efficiency and robustness according to the experimental results.
New Algorithms for Online Rectangle Filling with k-Lookahead
Authors: Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study the online rectangle filling problem which arises in channel aware scheduling of wireless networks, and present improved deterministic and first known randomized results for algorithms that are allowed a k-lookahead for k ¿ 2. Our main result is a deterministic min {1.848,1 + 2/(k ¿ 1)}-competitive online algorithm. The previous best-known solution for this problem has a competitive ratio of 2 for any k ¿ 2. We also present a randomized online algorithm with a competitive ratio of 1 + 1/(k + 1). Our final result is a closely matching lower bound of $1+1/(\sqrt{k+2}+\sqrt{k+1})^2 > 1+1/(4(k+2))$ on the competitive ratio of any randomized online algorithm against an oblivious adversary.
A New Interestingness Measure of Association Rules
Authors: Jianhua Liu, Xiaoping Fan, Zhihua Qu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Discovering association rules is one of the most important tasks in data mining. The classical model of association rules mining is support-confidence, the interestingness measure of which is the confidence measure. The classical Interestingness measure in Association Rules have existed some disadvantage. In this paper, some problem of interestingness measures on the classical association rules model have been analyzed, and then a new interestingness measure for mining association rules is proposed based on sufficiency measure of uncertain reasoning to improve the classical method of mining association rules. The property of the new interestingness measures is analyzed. Its validity, has been tested in this paper.
The Influence of Power in the Development of an Information Infrastructure
Authors: Leila Lage Humes, Nicolau Reinhard
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

This study addresses the role of power in the development of an information infrastructure. It examines an information system which, once implemented, was institutionalized, expanded and integrated into a network of independent systems and services which originated an information infrastructure. It describes how powerful or empowered agents contributed to develop the analyzed, information infrastructure and put into practice the first attempt to introduce e-gov, in the Brazilian State of Sao Paulo. Its implementation was initially based on the government discourse on transparency and control of public finances. However, knowledgeable actors used it to change the role they played in their institutions. Power is examined using the circuits of power framework adapted by Silva and Backhouse [1] for the information systems area. Hanseth´s infrastructure theory is adopted to study development of the information infrastructure and is complemented by disclosing the role played by power in the development of this information infrastructure.
A Rigorous Approach to Fault-Tolerant Programming
Authors: F. Cristian
Venue: IEEE Transactions on Software Engineering (1985)

The design of programs that are tolerant of hardware fault occurrences and processor crashes is investigated. Using a stable storage management system as a running example, a new approach is suggested for specifying, understanding, and verifying the correctness of fault-tolerant software. The approach extends previously developed axiomatic reasoning methods to the design of fault-tolerant systems by modeling faults as being operations that are performed at random time intervals on any computing system by the system's adverse environment.
Ncaa website coverage: an analysis of gender and individual sport team coverage on intercollegiate athletic home web pages across multiple divisions
Authors: Paul M. Pedersen
Venue:  (2007)

The current study is a content analysis of the gender and individual sport team coverage provided on intercollegiate athletic websites. In addition to providing insight into the gender and individual sport team coverage allocations, the current study demonstrates additional depth by focusing on the coverage provided within the following four units of measurement: advertisements, articles, multimedia, and photographs. Furthermore, the study also examines the non-scroll coverage provided to the female and male teams included in the study. One of the primary reasons why the study is necessary is because it examines a media outlet with Title IX implications. Because the study focuses on intercollegiate athletic websites, the expectation would be that both females and males in the study would receive equitable coverage. Overall, when focusing on the entire 18 team sample, the results demonstrated a statistically significant difference in the 37.5% participation rate provided to females when in comparison to males. Furthermore, the results revealed a statistically significant difference in the coverage provided to females within the unit of measurement when in comparison to males. Particularly, females were severely underrepresented in the advertisement (29.3%) and multimedia (21.9%) units of measurement. The results also showed that females received less favorable non-scroll coverage when in comparison to overall coverage rates. The study also examined the individual sport team coverage provided on intercollegiate athletic websites. Overall, when focusing solely on coverage rates, the results revealed that men's baseball, men's basketball, men's football, and women's basketball received a majority of the coverage. Particularly, the teams received significant amounts of coverage within the advertisement (82.5%) and multimedia (85.6%) units of measurement. Similarly, when focusing on the difference between individual team coverage rates and coinciding NCAA individual team participation rates, the results revealed that men's and women's basketball received coverage allocations exceeding their coinciding team participation by at least eight percent within each of the units of measurement analyzed. As a result, many of the remaining nonrevenue sport teams received coverage rates below their coinciding team participation rates. Similar results were reported within the non-scroll coverage included in the study.
Clustering of Leaf-Labelled Trees
Authors: Jakub Koperwas, Krzysztof Walczak
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

This paper introduces novel methodology for the clustering of data represented as leaf-labelled trees on the same leaf-set. We define an abstract term - the representative tree, which can be represented with a variety of trees, depending on applications. The quality of tree-clustering is based on Information Gain, which measures the increase of information contained by representative trees of the resulting clusters compared to a single representative tree of the whole dataset. Finally, we propose the k-best algorithm the objective function of which is to maximize the information gain. We show how it can be constructed for two different representative trees, well- known in phylogenetic analysis. Developed algorithms yield very promissing results.
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
Authors: Thomas Ristenpart, Scott Yilek
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Multiparty signature protocols need protection against rogue-key attacks, made possible whenever an adversary can choose its public key(s) arbitrarily. For many schemes, provable security has only been established under the knowledge of secret key (KOSK) assumption where the adversary is required to reveal the secret keys it utilizes. In practice, certifying authorities rarely require the strong proofs of knowledge of secret keys required to substantiate the KOSK assumption. Instead, proofs of possession (POPs) are required and can be as simple as just a signature over the certificate request message. We propose a general registered key model, within which we can model both the KOSK assumption and in-use POP protocols. We show that simple POP protocols yield provable security of Boldyreva's multisignature scheme [11], the LOSSW multisignature scheme [28], and a 2-user ring signature scheme due to Bender, Katz, and Morselli [10]. Our results are the first to provide formal evidence that POPs can stop rogue-key attacks.
Utilization-based delay guarantee techniques and their applications
Authors: Wei Zhao
Venue:  (2006)

Many real-time systems demand effective and efficient delay-guaranteed services to meet timing requirements of their applications. We note that a system provides a delay-guaranteed service if the system can ensure that each task will meet its predefined end-to-end deadline. Admission control plays a critical role in providing delay-guaranteed services. The major function of admission control is to determine admissibility of a new task. A new task will be admitted into the system if the deadline of all existing tasks and the new task can be met. Admission control has to be efficient and efficient, meaning that a decision should be made quickly while admitting the maximum number of tasks. In this dissertation, we study a utilization-based admission control mechanism. Utilization-based admission control makes an admission decision based on a simple resource utilization test: A task will be admitted if the resource utilization is lower than a pre-derived safe resource utilization bound. The challenge of obtaining a safe resource utilization bound is how to perform delay analysis offline, which is the main focus of this dissertation. For this, we develop utilization-based delay guarantee techniques to render utilization-based admission control both efficient and effective, which is further confirmed with our data. We develop techniques for several systems that are of practical importance. We first consider wired networks with the Differentiated Services model, which is wellknown as its supporting scalable services in computer networks. We consider both cases of providing deterministic and statistical delay-guaranteed services in wired networks with the Differentiated Services model. We will then extend our work to wireless networks, which have become popular for both civilian and mission critical applications. The variable service capacity of a wireless link presents more of a challenge in providing delay-guaranteed services in wireless networks. Finally, we study ways to provide delay-guaranteed services in component-based systems, which now serve as an important platform for developing a new generation of computer software. We show that with our utilization-based delay guarantee technique, component-based systems can provide efficient and effective delay-guaranteed services while maintaining such advantages as the reusability of components.
Integral Operators for Computing Homology Generators at Any Dimension
Authors: Rocio Gonzalez-Diaz, Maria Jose Jimenez, Belen Medrano, Helena Molina-Abril, Pedro Real
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Starting from an nD geometrical object, a cellular subdivision of such an object provides an algebraic counterpart from which homology information can be computed. In this paper, we develop a process to drastically reduce the amount of data that represent the original object, with the purpose of a subsequent homology computation. The technique applied is based on the construction of a sequence of elementary chain homotopies (integral operators) which algebraically connect the initial object with a simplified one with the same homological information than the former.
Network Modeling of Complex Dynamic Systems
Authors: Bosiljka Tadić
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Networks representing complex dynamical systems often have a multiscale structure and additional properties of nodes and links, which may vary in time. We briefly summarize current trends in the statistical physics research of networks structure and dynamics and its applications to physical, biological, and social systems discussed in the Workshop.
Attribute Reduction Based on Bi-directional Distance Correlation and Radial Basis Network
Authors: Li-Chao Chen, Wei Zhang, Ying-Jun Zhang, Bin Ye, Li-Hu Pan, Jing Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Attribute reduction is one of the important means to improve the efficiency and the quality of data mining, especially for high dimension data. From the view of distance and correction , the bi-directional distance and correction method was presented. This method can be used to measure the importance of dada attributes. Moreover, the revised decrease-increase combination strategy was used to reduce dimensionality and the radial basis neural network was used to validate the sub-set. This method adopts appropriate correlation function according to sample characteristic, which can avoid the limitation of IOC method. Since the longitudinal input-output connection and the horizontal difference between attribute and target was taken into account, the measure of the attribute importance will be more rational. So, quality data will be supply for the process of data mining subsequently.
Liquid State Genetic Programming
Authors: Mihai Oltean
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing the inputs (the liquid) and a Genetic Programming technique used for the problem solving part. Several numerical experiments with LSGP are performed by using several benchmarking problems. Numerical experiments show that LSGP performs similarly and sometimes even better than standard Genetic Programming for the considered test problems.
On the Value of Static Analysis for Fault Detection in Software
Authors: Jiang Zheng, Laurie Williams, Nachiappan Nagappan, Will Snipes, John P. Hudepohl Mladen A. Vouk
Venue: IEEE Transactions on Software Engineering (2006)

No single software fault-detection technique is capable of addressing all fault-detection concerns. Similarly to software reviews and testing, static analysis tools (or automated static analysis) can be used to remove defects prior to release of a software product. To determine to what extent automated static analysis can help in the economic production of a high-quality product, we have analyzed static analysis faults and test and customer-reported failures for three large-scale industrial software systems developed at Nortel Networks. The data indicate that automated static analysis is an affordable means of software fault detection. Using the Orthogonal Defect Classification scheme, we found that automated static analysis is effective at identifying Assignment and Checking faults, allowing the later software production phases to focus on more complex, functional, and algorithmic faults. A majority of the defects found by automated static analysis appear to be produced by a few key types of programmer errors and some of these types have the potential to cause security vulnerabilities. Statistical analysis results indicate the number of automated static analysis faults can be effective for identifying problem modules. Our results indicate static analysis tools are complementary to other fault-detection techniques for the economic production of a high-quality software product.
Dynamic Catalogue Enrichment with SeeAlso Link Servers
Authors: Jakob Voß
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

The poster presents architecture and usage of SeeAlso, a simple protocol for link servers that is used to dynamically enrich catalouges of libraries in the German Common library network GBV. 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
Supermartingales in Prediction with Expert Advice
Authors: Alexey Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

This paper compares two methods of prediction with expert advice, the Aggregating Algorithm and the Defensive Forecasting, in two different settings. The first setting is traditional, with a countable number of experts and a finite number of outcomes. Surprisingly, these two methods of fundamentally different origin lead to identical procedures. In the second setting the experts can give advice conditional on the learner's future decision. Both methods can be used in the new setting and give the same performance guarantees as in the traditional setting. However, whereas defensive forecasting can be applied directly, the AA requires substantial modifications.
Optimization of Handover Parameters for Traffic Sharing in GERAN
Authors: Matías Toril, Volker Wille
Venue: Wireless Personal Communications: An International Journal (2008)

Cellular network traffic is unevenly distributed both in time and space, which greatly complicates network dimensioning. As a result, some cells in the network are permanently congested, while others are underutilized. In a previous paper, the authors showed that this problem can be effectively solved in GSM/EDGE Radio Access Networks (GERAN) by modifying handover boundaries. However, several drawbacks prevent operators from fully exploiting the potential of this technique. This paper investigates the limitations of current traffic-sharing approaches with tight frequency reuses in GERAN. To deal with such limitations, an algorithm is proposed to jointly optimize handover margins and signal-level constraints based on network statistics for traffic sharing in GERAN. A complementary algorithm is proposed to adjust cell (re)selection offsets to minimize the number of handovers. Simulation results show that the proposed method achieves a significant reduction in call blocking without excessive call quality impairment or increase of network signaling load when compared to the current approaches. More traffic can thus be handled without the need for any hardware upgrades, providing a cost-effective means to increase network capacity.
Die Gedanken Sind Frei
Authors: Marc Donner
Venue: IEEE Security and Privacy (2004)

Security and privacy are twin social goods that exist in perpetual tension: our society has debated the trade-offs between them ever since the first days of social organization. Over the ages, the border between security and privacy has moved back and forth as first one side and then the other made bold steps forward from events in ideas, economics, technology, and warfare. At present, privacy appears to be in retreat under the threat of terrorism; it seems at times as if we ourselves are destroying the very freedom that terrorists find so threatening. In this issue, we'll look at some radical views of privacy's future through the eyes of several influential science-fiction (SF) writers.