ppxscal/embedding_network huggingface dataset:
Sums of exchangeable Bernoulli random variables for family and litter frequency data
Authors: Chang Yu, Daniel Zelterman
Venue: Computational Statistics Data Analysis (2008)

We describe new families of discrete distributions that are used to model sums of exchangeable Bernoulli random variables. These discrete distributions can be parameterized in terms of their range, mean, variance, and shape parameters. These models are fitted to an example involving mortality rates for children in a survey of families in Brazil. The methods illustrate that mortality rates in this survey increase with family size and that the correlation of within-family mortality status also depends on the family size. These methods are also applied to a laboratory study of birth defects in mice.
Enabling self-management of component-based high-performance scientific applications
Authors: Hua Liu, Manish Parashar
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Emerging high-performance parallel/distributed scientific applications and environments are increasingly large, dynamic and complex. As a result, it requires programming systems that enable the applications to detect and dynamically respond to changing requirements, state and execution context by adapting their computational behaviors and interactions. In this paper, we present such a programming system that extends the common component architecture to enable self-management of component-based scientific applications. The programming system separates and categorizes operational requirements of scientific applications, and allows them to be specified and enforced at runtime through reconfiguration, optimization and healing of individual components and the application. Two scientific simulations are used to illustrate the system and its self-managing behaviors. A performance evaluation is also presented.
An Improved Method of Sensor-Based Path Planning Using Instant Goals
Authors: Lu Yin, Yixin Yin, Xuyan Tu, Daoping Jiang, Guobao Xu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, an effective improved path planning algorithm using Instant Goals is proposed. In the original Instant Goal theory, the determination process of Instant Goals is complicated and time-costly, so an alternative idea based on the searching beams from the online senor is proposed. After that the other significant problem is proposed: the original algorithm is well designed to detect and recognize the obstacles around in given positions, but it did not have it in consideration that how to make sure the robot gets the knowledge that the obstructing points detected belong to the new obstacle or the original obstacle it just avoided. To solve the problem just mentioned, some practical techniques are adopted and expounded explicitly to give robot a criterion to judge it. At last, some realistic simulation results are given to validate the effectiveness of the new improved path planning method.
Hierarchical Goal-Oriented Mobility Models with Applications to Mobile Ad-Hoc Networks
Authors: A. Roger Hammons Jr., Robert A. Nichols
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The new class of hierarchical goal-oriented mobility mod- els is introduced for the study of mobile ad hoc networks. The new models introduce role-based actors whose mo- bility behavior can vary in many different ways. The new models provide a flexible framework with aspects of both group (spatially correlated) and entity (spatially uncor- related) mobility models. The hierarchical rendezvous models in particular provide an abstract representation of civilian and military operations involving dynamic task- ing of small teams that form, separate, and reform over time on an ad-hoc basis. The models were motivated by the authors' research into protocols for highly directional delay tolerant MANETs for which the mobility model has significant performance implications. These are illus- trated through simulation results of the authors' Transient Information Level (TIL) protocol.
Computer Graphics In High Energy Physics
Authors: J. Bettels
Venue: IEEE Computer Graphics and Applications (1982)

Computer graphics is an invaluable aid to the design and interpretation of subatomic particle experiments conducted at the CERN laboratory on the Franco-Swiss border.
Multiscale histograms: summarizing topological relations in large spatial datasets
Authors: Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this paper, we present several novel techniques to effectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important topological relations: contains, contained, overlap, and disjoint. We first present a novel framework to construct a multiscale histogram composed of multiple Euler histograms with the guarantee of the exact summarization results for aligned windows in constant time. Then we present an approximate algorithm, with the approximate ratio 19/12, to minimize the storage spaces of such multiscale Euler histograms, although the problem is generally NP-hard. To conform to a limited storage space where only k Euler histograms are allowed, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy. Finally, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. Our extensive experiments against both synthetic and real world datasets demonstrated that the approximate multiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost efficiency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for the real datasets.
Rectangular v-Splines
Authors: Gregory Nielson
Venue: IEEE Computer Graphics and Applications (1986)

This article describes and presents examples of some techniques for the representation and interactive design of surfaces based on a parametric surface representation that user v-spline curves. These v-spline curves, similar in mathematical structure to v-splines, were developed as a more computationally efficient alternative to splines in tension. Although splines in tension can be modified to allow tension to be applied at each control point, the procedure is computationally expensive. The v-spline curve, however, uses more computationally tractable piecewise cubic curves segments, resulting in curves that are just as smoothly joined as those of a standard cubic spline. After presenting a review of v-splines and some new properties, this article extends their application to a rectangular grid of control points. Three techniques and some application examples are presented.
Scholarly communication and national union catalogues: a strategic role for SUNCAT in the UK information environment
Authors: Peter Burnhill, Fred Guy, Nicola Osborne
Venue: The New Review of Information Networking (2006)

The paper sets out to re-assess the role for SUNCAT as national union serials catalogue, considering how it might move beyond its original remit as a simple route to discover and locate serials, to be a component in a system that also supports request and access to serial content. This is set within the context of the needs of scholarly communication and the particular role played by journals. The serials' community is faced with a paradigm shift, which challenges existing publishing practices. Union catalogues have traditionally played a role in resource sharing, often in association with schemes of inter-library loan. With online access to content and telematic opportunity, there are new possibilities that could also build on collaborative action. Opportunity is taken to review other union catalogues of serials, centralised and virtual, that are defined by theme or geographical location, both regional and national.
A Heuristic Algorithm for Multiple Depots Vehicle Routing Problem with Backhauls
Authors: Jianhua Fan, Xiufeng Wang, Qiushuang Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

An algorithm for multiple depots vehicle routing problem with backhauls is proposed and the goal is to minimize the total traveling cost in reasonable computation time. Firstly borderline customers are determined and the remaining customers are allocated to the nearest depot. Secondly, an effective method is presented to construct the initial routings and insert the borderline customers into the appropriate location. Finally, the initial routings are improved by post-optimization procedure. Some reduction computation strategies are designed to enhance algorithm efficiency. The experiment results indicate that this algorithm can produce encouraging results with less computation time. Keywords--multiple depots, VRPB, pick-up and delivery
Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences"
Authors: G. Metze
Venue: IEEE Transactions on Computers (1975)

In the above paper1, the partial Boolean difference is defined and an algorithm for deriving complete minimal test input sequences for single-fault detection is given. In this correspondence, it is shown that the presentation of the algorithm is inadequate with respect to the need for multiple path sensitization. It is further shown that the computational procedure used in footnote 1 do
An Enhancement Dynamic Contract Net Protocol
Authors: Zhao-Wen Wei, Jun-Yan Yan, Yun-Peng Ou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In the paper, we do some enhancement based on DCNP. In the EDCNP, we improved the credibility update rules and lead credibility range[min, max] and the volatilization into the algorithm. In this way we can reduce the amount of calculating and improve the system efficiency efficiently. The experiment proved that the algorithm is available.
A Journey towards More Efficient Processing of XML Data in (O)RDBMS
Authors: Irena Mlynkova
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

As XML has become a standard for data representation, it is inevitable to propose and implement techniques for effi- cient managing of XML data. A natural alternative is to ex- ploit features and functions of (object-)relational database systems, i.e. to rely on their long theoretical and practical history. The main concern of such techniques is the choice of an appropriate XML-to-relational mapping strategy. In this paper we focus on enhancing of user-driven tech- niques which leave the mapping decisions in hands of users. We propose an algorithm which exploits the user-given an- notations more deeply searching the user-specified "hints" in the rest of the schema and applies an adaptive method on the remaining schema fragments. We describe the algo- rithm, implementation of its key features called UserMap, and results of experimental testing on real XML data.
News Briefs
Authors: Brandi Ortega
Venue: IEEE Security and Privacy (2007)

A brief look at current events in security and privacy.
Interconnection Networks Using Shuffles
Authors: P. -Y. Chen
Venue: Computer (1981)

Networking techniques allow several processors within a multiprocessing system to cooperate efficiently on a single large problem.
Comparing the Contribution of Syntactic and Semantic Features in Closed versus Open Domain Question Answering
Authors: Abolfazl Keighobadi Lamjiri, Leila Kosseim, Thiruvengadam Radhakrishnan
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper we analyze the contribution of semantic, syntactic and word similarity of document features in closed and open domain question answering. Semantic similarity is computed as the similarity of the action in the candidate sentence to the action asked in the question, measured using WordNet::Similarity on main verbs. The syntactic similarity feature measures the unifiability of a candidate's parse tree with the question's parse tree. It uses syntactic restrictions as well as lexical measures to compute the unifiability of critical syntactic participants in the parse trees. Finally, the word similarity of the document containing a candidate sentence is computed as the cosine of the angle between the question keywords vector and the document vector. Since the semantic feature is more reliable on content verbs and syntactic similarity is suitable for questions with a subjectverb- object syntactic structure, we only consider questions with a main content verb in our analysis (non-copulative questions). This type comprise 70% of our closed domain and 33% of our open domain test questions. The combination of these three features achieves an MRR of 28% in our closed domain and 23% in open domain. Our analysis shows that the syntactic feature has a significant contribution in both open and closed domains. However, the path-based lch semantic similarity measure we used, only contributes in our closed domain probably because of less variation in the vocabulary and topic. Document IR score on the other hand, has more contribution in open domain, because query keywords are more discriminating in a large document set with a vast vocabulary range.
Efficient Logging and Replication Techniques for Comprehensive Data Protection
Authors: Maohua Lu, Shibiao Lin, Tzi-cker Chiueh
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Mariner is an iSCSI-based storage system that is designed to provide comprehensive data protection on commodity ATA disk and Gigabit Ethernet technologies while offering the same performance as those without any such protection. In particular, Mariner supports continuous data protection (CDP) that allows every disk update within a time window to be undoable, and local/remote mirroring to guard data against machine/site failures. To minimize the performance overhead associated with CDP, Mariner employs a modified track-based logging technique that unifies the long-term logging required for CDP and short-term logging for low-latency disk writes. This new logging technique strikes an optimal balance among log space utilization, disk write latency, and ease of historical data access. To reduce the performance penalty of physical data replication used in local/remote mirroring, Mariner features a modified two-phase commit protocol that in turn is built on top of a novel transparent reliable multicast (TRM) mechanism specifically designed for Ethernet-based storage area networks. Without flooding the network, TRM is able to keep the network traffic load of reliable N-way replication roughly at the same level as the no-replication case, regardless of the value of N. Empirical performance measurements on the first Mariner prototype, which is built from Gigabit Ethernet and ATA disks, shows that the average end-to-end latency for a 4KByte iSCSI write is under 1.2msec when data logging and replication are both turned on.
Unlabeled Compression Schemes for Maximum Classes
Authors: Dima Kuzmin, Manfred K. Warmuth
Venue: The Journal of Machine Learning Research (2007)

Maximum concept classes of VC dimension d over n domain points have size n C ≤d, and this is an upper bound on the size of any concept class of VC dimension d over n points. We give a compression scheme for any maximum class that represents each concept by a subset of up to d unlabeled domain points and has the property that for any sample of a concept in the class, the representative of exactly one of the concepts consistent with the sample is a subset of the domain of the sample. This allows us to compress any sample of a concept in the class to a subset of up to d unlabeled sample points such that this subset represents a concept consistent with the entire original sample. Unlike the previously known compression scheme for maximum classes (Floyd and Warmuth, 1995) which compresses to labeled subsets of the sample of size equal d, our new scheme is tight in the sense that the number of possible unlabeled compression sets of size at most d equals the number of concepts in the class.
An efficient cross layer scheduler for multimedia traffic in wireless local area networks with IEEE 802.11e HCCA
Authors: Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Giovanni Stea
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2007)

This paper proposes a scheduling algorithm, namely Wireless Timed Token Protocol (WTTP), for the Hybrid Coordination Function (HCF) Controlled Channel Access (HCCA) in IEEE 802.11e. WTTP provides traffic streams with a minimum reserved rate, as required by the standard, and it accounts for two types of traffic streams simultaneously, depending on the corresponding application: constant bit rate, which are served according to their rate, and variable bit rate traffic streams. The latter are guaranteed a minimum rate, but they are also allowed to exploit unused bandwidth, which preserves small access delays in case of bursty arrivals. Additionally, WTTP shares the capacity which is not reserved for QoS traffic streams transmissions among traffic flows with no specific QoS requirements. We also propose a strategy for the QoS Access Point to infer the idle/busy status of the uplink transmission buffers, based on cross layer information made available at the MAC by the application layer, which allows channel capacity to be saved. WTTP exhibits O(1) per packet computational complexity. We evaluate the performance of WTTP via simulation under different traffic conditions, and we investigate its resilience to variations of different system parameters.
Performance evaluation of bandwidth allocation methods in a geostationary satellite channel in the presence of internet traffic
Authors: Igor Bisio, Mario Marchese
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Resource allocation represents an important issue for the next generation TCP/IP Quality of Service-based satellite networks. Many schemes, proposed in the recent literature, consider Internet traffic as the superposition of traffic sources without distinguishing between User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) flows, even if UDP and TCP imply very different traffic characteristics. The basic idea of this work is that a resource allocation algorithm which is conscious of the difference may be more efficient because it can make use of the different behaviour of TCP and UDP in the presence of network congestion. Actually TCP reduces the source flow rate and, as a consequence, also the bandwidth occupancy when there is network congestion. The use of this feature within the bandwidth allocation scheme allows reducing the bandwidth waste due to over provisioning and using the residual bandwidth for other sources. The advantage is particularly clear over satellite channels where fading often affects the communication: having some residual bandwidth available for stations which have experienced fading can improve the satellite network performance. This paper presents a detailed performance evaluation of a bandwidth allocation scheme, called E-CAP-ABASC and studied for the satellite environment. The bandwidth is assigned to the earth stations that compose the network by a master station on the basis of a cost function whose main part is represented by a closed-form of the packet loss probabilities for the TCP and UDP traffic. The use of two different packet loss probability models for TCP and UDP allows exploiting the different features of the two traffic types, so improving the overall performance either in terms of packet loss or, on the other hand, in terms of the traffic admitted. The performance evaluation is carried out by varying the link degradation due to fading, the traffic load, and the flow balance between UDP and TCP. The results show a good performance of E-CAP-ABASC, compared with two other schemes. Advantages and drawbacks are discussed.
Determining the coverage of a test suite
Authors: Richard C. Waters
Venue: ACM SIGPLAN Lisp Pointers (1991)

The value of a suite of test cases depends critically on its coverage. Ideally a suite should test every facet of the specification for a program and every facet of the algorithms used to implement the specification. Unfortunately, there is no practical way to be sure that complete coverage has been achieved. However, something should be done to assess the coverage of a test suite, because a test suite with poor coverage has little value.
Virtual human animation in natural language visualisation
Authors: Minhua Ma, Paul Kevitt
Venue: Artificial Intelligence Review (2006)

Simulation motion of Virtual Reality (VR) objects and humans has experienced important developments in the last decade. However, realistic virtual human animation generation remains a major challenge, even if applications are numerous, from VR games to medical training. This paper proposes different methods for animating virtual humans, including blending simultaneous animations of various temporal relations with multiple animation channels, minimal visemes for lip synchronisation, and space sites of virtual human and 3D object models for object grasping and manipulation. We present our work in our natural language visualisation (animation) system, CONFUCIUS, and describe how the proposed approaches are employed in CONFUCIUS' animation engine.
Novel wire density driven full-chip routing for CMP variation control
Authors: Huang-Yu Chen, Szu-Jui Chou, Sheng-Lung Wang, Yao-Wen Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

As nanometer technology advances, the post-CMP dielectric thickness variation control becomes crucial for manufacturing closure. To improve CMP quality, dummy feature filling is typically performed by foundries after the routing stage. However, filling dummy features may greatly degrade the interconnect performance and lead to explosion of mask data. It is thus desirable to consider wire-density uniformity during routing to minimize the side effects from aggressive post-layout dummy filling. In this paper, we present a new full-chip grid-based routing system considering wire density for reticle planarization enhancement. To fully consider wire distribution, the router applies a novel two-pass, top-down planarity-driven routing framework, which employs a new density critical area analysis based on Voronoi diagrams and incorporates an intermediate stage of density-driven layer/track assignment based on incremental Delaunay triangulation. Experimental results show that our methods can achieve more balanced wire distribution than state-of-the-art works.
Predictive Model for Internet Public Opinion
Authors: Jianping Zeng, Shiyong Zhang, Chengrong Wu, Jianfeng Xie
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The Internet is becoming a spreading platform for the public opinion. It's important to model the Internet public opinion activity as accurate as possible. Hidden Markov Model (HMM) is introduced to describe the activity of the Internet public opinion. The state of the Internet public opinion is represented as the hidden state of HMM, and its characteristic is considered as the visible states in HMM. Then the HMM is used to predict the characteristic changing of the Internet public opinion using two different algorithms under the circumstances of different amount of characteristic data gathered. Experiments on the Internet public opinion are done and the result shows that the modeling method and prediction algorithms are effective.