ppxscal/embedding_network huggingface dataset:
Triangulating a convex polygon with fewer number of non-standard bars
Authors: Yinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
Venue: Theoretical Computer Science (2007)

For a given convex polygon with inner angle no less than 23@p and boundary edge bounded by [l,@al] for 1@?@a@?1.4, where l is a given standard bar's length, we investigate the problem of triangulating the polygon using some Steiner points such that (i) the length of each edge in triangulation is bounded by [@bl,2l], where @b is a given constant and meets 0
Using mini-flash crowds to infer resource constraints in remote web servers
Authors: Pratap Ramamurthy, Vyas Sekar, Aditya Akella, Balachander Krishnamurthy, Anees Shaikh
Venue: Proceedings of the 2007 SIGCOMM workshop on Internet network management (2007)

Unexpected surges in request traffic (e.g., flash crowds) can exercise server-side resources such as access bandwidth, CPU, and disks in unanticipated ways. Administrators today do not have the requisite tools to fully understand the effect that flash crowds can have on server-side resources. As a result, most Web-servers today rely on significant over-provisioning, strict admission control, or alternatively use potentially expensive solutions like CDNs to provide high availability under load. A more fine-grained understanding of the performance of servers under emulated but controlled flash crowd like conditions can guide administrators to make more efficient provisioning and resource management decisions. We present the initial design of Mini-Flash Crowds (MFC) -- a light-weight wide-area profiling service that reveals resource bottlenecks in a Web-server infrastructure, including access bandwidth, processing resources, and back-end data management. The MFC approach is based on a set of controlled measurements in which an increasing number of distributed clients make synchronized requests to exercise specific resources of a remote server. Using a number of wide-area experiments and controlled lab tests, we show that our approach can faithfully track the impact of request loads on different server resources. Our approach is non-intrusive and thus we can use it to actively probe numerous live Web servers. We present the results from a preliminary measurement study of resource provisioning on public Web servers.
Spin-Around: Phase-Locked Synchronized Rotation and Revolution in Multistandpoint panoramic Browsers
Authors: Michael Cohen, Ishara Jaysingha, Julian Villegas
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Using multistandpoint panoramic browsers as dis- plays, we have developed a control function that syn- chronizes revolution and rotation of a visual perspective around a designated point of regard in a virtual environ- ment. The phase-locked orbit is uniquely determined by the focus and the start point, and the user can pa- rameterize direction, step size, and cycle speed, and in- voke an animated or single-stepped gesture. The images can be monoscopic or stereoscopic, and the rendering supports the usual scaling functions (zoom/unzoom). Additionally, via sibling clients that can directionalize realtime audio streams, spatialize hdd-resident audio files, or render rotation via a personal rotary motion platform, spatial sound and propriceptive sensations can be synchronized with such gestures, providing com- plementary multimodal displays.
Partial Disk Failures: Using Software to Analyze Physical Damage
Authors: Hai Huang, Kang G. Shin
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

A good understanding of disk failures is crucial to ensure a reliable storage of data. There have been numerous studies characterizing disk failures under the common assumption that failed disks are generally unusable. Contrary to this assumption, partial disk failures are very common, e.g., caused by a head crash resulting in a small number of inaccessible disk sectors. Nevertheless, the damage can sometimes be catastrophic if the file system meta-data were among the affected sectors. As disk density rapidly increases, the likelihood of losing data also rises. This paper describes our experience in analyzing partial disk failures using the physical locations of damaged disk sectors to assess the extent and characteristics of the damage on disk platter surfaces. Based on our findings, we propose several fault-tolerance techniques to proactively guard against permanent data loss due to partial disk failures.
Automated Segmentation of the Corpus Callosum Midsagittal Surface Area
Authors: Flavio Luiz Seixas, Andrea Silveira de Souza, Alair Augusto Sarmet M. D. dos Santos, Debora C. Muchaluat Saade
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

The non-invasive in vivo nature of magnetic resonance imaging (MRI) makes it the modality of choice of many neuroanatomical imaging studies. This paper discusses automatic brain structure segmentation based on previous knowledge on statistical models. The method is validated by an experiment involving magnetic resonance images acquired from 20 healthy adult individuals (10 men and 10 women). The results provide normative data of the midsagittal surface area of the corpus callosum from a 46-55 years old range group, splitting results by gender. Our results were also compared with data obtained from other authors, validating the correlation between brain volume and the area of this structure. The final goal of this work is computer-aided diagnosis for brain diseases.
Implementing a Pseudorandom Number Generator on a Minicomputer
Authors: W. V. Camp
Venue: IEEE Transactions on Software Engineering (1977)

Three contemporary pseudorandom number generators: Tausworthe, GFSR, and Lehmer are implemented on a 16-bit minicomputer. Practical comparisons are made in terms of 1) ease of implementation, 2) length of period, 3) execution speed, 4) program storage space, and 5) statistical quality. Although the results are conjectured to apply to any 16-bit word, limited memory capacity, and limited instruction set computer, the results for a PDP-11/05 indicate that the Lehmer generator satisfies criterion 5) but is slow and difficult to implement. The GFSR generator satisfies criteria 2) and 3) but is large, and the Tausworthe generator satisfies criteria 1) and 4) but can be statistically marginal.
Computing and the Handicapped: The Challenge in Education
Authors: H. J. Blaszczyk
Venue: Computer (1981)

A congressional mandate brought the handicapped into public education, but only a partnership of technologists and educators will bring them to the mainstream of American life. 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
The Right Way of Cognitive Vision Modeling: An Information Processing Approach
Authors: Emanuel Diamant
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

We live in an Information age, and information has become a critically important component of our life. Due to the success of the Internet, the amount of available information, including immense volumes of visualinformation, is growing explosively. Therefore, means for its faultless circulation and handling are urgently required. Considerable research efforts are dedicated today to address this necessity, but they are seriously hampered by the lack of a common agreement about "What actually is visual information?" Without answering this question, all our remarkable efforts inevitably end up with pure alchemy. I am trying to find out a remedy for this bizarre and absurd situation. Ipropose my own definition of information (derived from the Kolmogorov's compexity theory), and from this point of view, attempt to revise the state of the art of contemporary image processing custom.
A business-oriented load dispatching framework for online auction sites
Authors: Daniel A. Menasce, Vasudeva Akula
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Online auction sites have unique workloads and user behavior characteristics that do not exist in other e-commerce sites. Earlier studies by the authors identified i) significant changes in the workload depending on time of day and ii) the presence of heavy-tailed distributions involving bidder and seller behavior.Other studies indicate that a small fraction or power users, among millions of registered users, contribute to the majority of the site's revenue. Poor quality of service to power users may imply in loss of business and cause significant loss of revenue to an auction site. This problem could be mitigated by dedicating resources in an exclusive manner to this small group of users in order to improve the quality of service they receive. However, this approach can lead to i) under utilization of these dedicated resources and ii) overloading of resources allocated to regular users when the load from power users is low. In this paper, we propose a scheme whereby resources are primarily dedicated to power users, but regular users can take advantage of these dedicated resources when spare capacity is available. This paper provides a business-oriented framework for dispatching requests to the various servers of an online auction site. Our approach uses a controller that can dynamically shift the load to different types of servers as the workload changes. Experimental evaluation showed, among other things, that the total number of bids processed using a dynamic controller to allocate resources can be improved under heavy load conditions compared to using a load balancing technique that does not differentiate among users.
A Formal Approach to Test the Robustness of Embedded Systems using Behaviour Analysis
Authors: Antoine Rollet, Fares Saad-Khorchef
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Robustness is an important feature required for embedded systems. This paper presents a methodology to test robustness of such systems. We investigate system behaviour aspects. We handle two formal specifications : a nominal one which describes the system behaviour in normal conditions and a degraded one which describes the behaviour in critical conditions. Both are described as Labelled Transition Systems for the untimed systems and as Timed Automata for timed systems. We extract test sequences from the nominal or from the degraded specification. We perform fault injection on these test sequences. Finally, we submit these sequences to the Implementation Under Test (IUT) and then we analyze its behaviour using adequate robustness relations.
Better Exception-Handling in Block-Structured Systems
Authors: J. L. Knudsen
Venue: IEEE Software (1987)

Few exception-handling language proposals support secure and well-behaved activity termination in block-structured systems. This proposed mechanism does.
Conference Report: Fifth International Conference on Software Engineering
Authors: P. I. Rosengard
Venue: Computer (1981)

Tools for improving software quality and productivity were emphasized at the Fifth International Conference on Software Engineering, held March 9-12 in San Diego, California. In the first of three keynote sessions-one each day following the preconference tutorials on March 9-Niklaus Wirth of ETH, Zurich, introduced his software engineering workstation, Lilith. I The system was one of over 40 software tools demonstrated later at the Tools Fair held in conjunction with the conference. 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
Evaluating Electric ILM Customers_ Default Risk Based on Fuzzy Set Theory
Authors: Shaoling Huang, Li Li, Zhongfu Tan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The default risk in electric Interruptible Load Management (ILM) can produce huge economic losses to the electric grid company. It is vital to evaluate the customers' default risk before signing up the ILM contracts for the electric grid company's healthy operation. This paper constructs an ILM default risk indexes evaluation system, and uses the Fuzzy Extend Analytic Hierarchy Process (FEAHP) which is an improvement of Analytic Hierarchy Process (AHP) to calculate the weights vectors of the indexes due to its advantages of solving the experts' vagueness in marking the pairwise comparing importance. The Fuzzy Evaluation Method and probability theory are selected to calculate the integrated possible risk values. Finally, the given example proves the feasibility of the models mentioned.
Robust and efficient detection of DDoS attacks for large-scale internet
Authors: Kejie Lu, Dapeng Wu, Jieyan Fan, Sinisa Todorovic, Antonio Nucci
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

In recent years, distributed denial of service (DDoS) attacks have become a major security threat to Internet services. How to detect and defend against DDoS attacks is currently a hot topic in both industry and academia. In this paper, we propose a novel framework to robustly and efficiently detect DDoS attacks and identify attack packets. The key idea of our framework is to exploit spatial and temporal correlation of DDoS attack traffic. In this framework, we design a perimeter-based anti-DDoS system, in which traffic is analyzed only at the edge routers of an internet service provider (ISP) network. Our framework is able to detect any source-address-spoofed DDoS attack, no matter whether it is a low-volume attack or a high-volume attack. The novelties of our framework are (1) temporal-correlation based feature extraction and (2) spatial-correlation based detection. With these techniques, our scheme can accurately detect DDoS attacks and identify attack packets without modifying existing IP forwarding mechanisms at routers. Our simulation results show that the proposed framework can detect DDoS attacks even if the volume of attack traffic on each link is extremely small. Especially, for the same false alarm probability, our scheme has a detection probability of 0.97, while the existing scheme has a detection probability of 0.17, which demonstrates the superior performance of our scheme.
Improvement of PageRank for Focused Crawler
Authors: Fuyong Yuan, Chunxia Yin, Jian Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The rapid growth of the World-Wide Web poses unprecedented scaling challenges for general-purpose crawlers. Focused crawler is developed to collect relevant web pages of interested topics form the Internet. The PageRank algorithm is used in ranking web pages. It estimates the page's authority by taking into account the link structure of the Web. However, it assigns each outlink the same weight and is independent of topics, resulting in topic-drift. In this paper, we proposed an improved PageRank algorithm, which we called "T-PageRank", and it based on "topical random surfer". The experiment in focused crawler using the T-PageRank has better performance than the Breath-first and PageRank algorithms.
Data Mining Applied to the Electric Power Industry: Classification of Short-Circuit Faults in Transmission Lines
Authors: Jefferson Morais, Yomara Pires, Claudomir Cardoso, Aldebaro Klautau
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Data mining can play a fundamental role in mod- ern power systems. However, the companies in this area still face several difficulties to benefit from data mining. A major problem is to extract useful informa- tion from the currently available non-labeled digitized time series. This work focuses on automatic classifi- cation of faults in transmission lines. These faults are responsible for the majority of the disturbances and cas- cading blackouts. To circumvent the current lack of la- beled data, the Alternative Transients Program (ATP) simulator was used to create a public comprehensive la- beled dataset. Results with different preprocessing (e.g., wavelets) and learning algorithms (e.g., decision trees and neural networks) are presented, which indicate that neural networks outperform the other methods.
ACO based optimized scheduling algorithm for computational grids
Authors: Bhupinder Singh, Seema Bawa
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper presents hybrid approach based on Ants Colony Optimization (ACO) and Genetic Operators for resource allocation and scheduling in computational grid. The objective is to find an optimal schedule which will minimize the makespan so as to ensure the proper utilization of the resources and minimize the delay in achieving user specified deadlines. Though ACO along with local search techniques had been applied to solve many combinatorial problems, but first time a hybrid approach based on ACO and Genetic operators is proposed for resource allocation and scheduling in computational grids.
Defect-tolerance in cellular nanocomputers
Authors: Teijiro Isokawa, Shin'ya Kowada, Yousuke Takada, Ferdinand Peper, Naotake Kamiura, Nobuyuki Matsui
Venue: New Generation Computing (2007)

For the manufacturing of computers built by nanotechnology, defects are expected to be a major problem. This paper explores this issue for nanocomputers based on cellular automata. Known for their regular structure, such architectures promise cost-effective manufacturing based on molecular self-organization. We show how a cellular automaton can detect defects in a self-contained way, and how it configures circuits on its cells while avoiding the defects. The employed cellular automaton is asynchronous, i.e., it does not require a central clock to synchronize the updates of its cells. This mode of timing is especially suitable for the high integration densities of nanotechnology implementations, since it potentially causes less heat dissipation.
An Initial Performance Evaluation of Rapid PHY Selection (RPS) for Energy Efficient Ethernet
Authors: Francisco Blanquicet, Ken Christensen
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The IEEE 802.3 Energy Efficient Ethernet (EEE) study group is considering Rapid PHY Selection (RPS) as a mechanism to quickly switch the data rate of an Ethernet link to match link data rate with link utilization. When switching the data rate, RPS causes a momentary disruption of the link. This disruption may cause packet loss due to buffer overflow in upstream switches. We emulate RPS using PAUSE flow control and experimentally study the possible effects of RPS on TCP and UDP file transfer. We show that RPS has little or no perceivable effect on performance, but has some subtle effects on TCP throughput if PAUSE flow control is enabled in the file server.
Accurate and efficient crawling for relevant websites
Authors: Martin Ester, Hans-Peter Kriegel, Matthias Schubert
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Focused web crawlers have recently emerged as an alternative to the well-established web search engines. While the well-known focused crawlers retrieve relevant webpages, there are various applications which target whole websites instead of single webpages. For example, companies are represented by websites, not by individual webpages. To answer queries targeted at websites, web directories are an established solution. In this paper, we introduce a novel focused website crawler to employ the paradigm of focused crawling for the search of relevant websites. The proposed crawler is based on a two-level architecture and corresponding crawl strategies with an explicit concept of websites. The external crawler views the web as a graph of linked websites, selects the websites to be examined next and invokes internal crawlers. Each internal crawler views the webpages of a single given website and performs focused (page) crawling within that website. Our experimental evaluation demonstrates that the proposed focused website crawler clearly outperforms previous methods of focused crawling which were adapted to retrieve websites instead of single webpages.
Query processing over incomplete autonomous databases
Authors: Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, Yi Chen, Subbarao Kambhampati
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query processing techniques that focus on the strict soundness of answer tuples often ignore tuples with critical missing attributes, even if they wind up being relevant to a user query. Ideally we would like the mediator to retrieve such possible answers and gauge their relevance by accessing their likelihood of being pertinent answers to the query. The autonomous nature of web databases poses several challenges in realizing this objective. Such challenges include the restricted access privileges imposed on the data, the limited support for query patterns, and the bounded pool of database and network resources in the web environment. We introduce a novel query rewriting and optimization framework QPIAD that tackles these challenges. Our technique involves reformulating the user query based on mined correlations among the database attributes. The reformulated queries are aimed at retrieving the relevant possible answers in addition to the certain answers. QPIAD is able to gauge the relevance of such queries allowing tradeoffs in reducing the costs of database query processing and answer transmission. To support this framework, we develop methods for mining attribute correlations (in terms of Approximate Functional Dependencies), value distributions (in the form of Na&iuml;ve Bayes Classifiers), and selectivity estimates. We present empirical studies to demonstrate that our approach is able to effectively retrieve relevant possible answers with high precision, high recall, and manageable cost.