ppxscal/embedding_network huggingface dataset:
Performance Evaluations of SSCOP Layer
Authors: L. Vidyasagar, K. Sree Latha Reddy
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This paper highlights control parameters that, if not used optimally, can cause degradation of SSCOP protocol throughput. To fine tune these parameters and hence decrease protocol performance bottlenecks, various factors were analyzed. The theoretical factors that influence the performance of the SSCOP protocol are discussed. The relationships between key protocol parameters (protocol window, control message transmission interval) and maximum achievable throughput efficiency were taken from current research literature. Known mathematical equations can be used to determine how much buffer capacity and/or what protocol timer settings allow SSCOP to operate at high performance. The analytical results are confirmed by comparison with observational results and the resultant graphs have been plotted. To get better protocol performance, potential solutions that take into account key control parameters have been proposed.
Localisation intra-b&acirc;timent multi-technologies: RFID, wifi et vision
Authors: Matthieu Anne, James L. Crowley, Vincent Devin, Gilles Privat
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Indoor location-based applications have strong precision and scalability requirements that usually cannot be met by any single location-sensing technology. Combining the strong identification of RF-based location sensing with the accuracy of computer vision-based-tracking provides a powerful new solution for multi scale and multi-target indoor location sensing, without requiring dedicated infrastructures.
Towards A Truly Concurrent Model for Processes Sharing Resources
Authors: Naiyong Jin, Jifeng He
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Conventional theories of concurrency reduce parallel processes to sequential ones. Here, we propose a true concurrency trace model which takes variables of parallel processes as a whole and runs parallel processes as simultaneous updates on variables. By equipping each resource an ownership variable, the model has a uniform treatment to both variable access conflicts and resource conflicts. A denotational semantics based on the model is studied. After that, we show how to use this model to build a correct resource scheduler, and specify pre-compilers such that the resulting systems do not incur conflicts and have less chance of deadlocks.
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
Authors: Grzegorz Kubicki, MichaL Morayne
Venue: SIAM Journal on Discrete Mathematics (2005)

We consider the following on-line decision problem. The vertices of a directed path of a known length are being observed one by one in some random order by a selector. At time $t$ the selector examines the $t$th vertex and knows the directed graph induced by the $t$ vertices that have been already examined. The selector's aim is to choose the currently examined vertex maximizing the probability that this vertex is the "uppermost" one, i.e., the only one that does not have an outgoing edge. An optimal algorithm for such a choice (in other words, optimal stopping time) is given. For a cardinality $n$ of the directed path considered, the probability $p_n$ of the right choice according to the optimal algorithm is given, and it is shown that $p_n\sqrt{n} \rightarrow \sqrt{\pi}/2$ as $n \rightarrow \infty$.
Index Calculation Attacks on RSA Signature and Encryption
Authors: Jean-Sébastien Coron, David Naccache, Yvo Desmedt, Andrew Odlyzko, Julien P. Stern
Venue: Designs, Codes and Cryptography (2006)

At Crypto '85, Desmedt and Odlyzko described a chosen-ciphertext attack against plain RSA encryption. The technique can also be applied to RSA signatures and enables an existential forgery under a chosen-message attack. The potential of this attack remained untapped until a twitch in the technique made it effective against two very popular RSA signature standards, namely iso/iec 9796-1 and iso/iec 9796-2. Following these attacks, iso/iec 9796-1 was withdrawn and ISO/IEC 9796-2 amended. In this paper, we explain in detail Desmedt and Odlyzko's attack as well as its application to the cryptanalysis of iso/iec 9796-2.
DRACO: optimized CC-NUMA system with novel dual-link interconnections to reduce the memory latency
Authors: Hyo-Joong Suh, Sung Woo Chung
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

The performances of multiprocessor systems mainly rely on the processor clock speed and the memory latency. As the processors speed up rapidly, the memory latency becomes a major performance bottleneck in multiprocessor systems. In this paper, we propose a dual-link interconnection topology and its effective routing scheme to reduce the remote memory latency on the interconnection network. It can be applied at a same implementation cost as traditional bi-directional ring systems. We compare the performance of the proposed system to that of the traditional bi-directional ring-based system and toroidal mesh-based system. By simulations, it is shown that the proposed system outperforms the traditional bi-directional ring-based system by 42~101 % and excels the toroidal mesh-based system by 4~14%.
Anti-collision performance of Gen2 Air Protocol in Random Error Communication Link
Authors: Yuusuke KAWAKITA, Jin MITSUGI
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

When a multitude of RFID tags are in the interrogating field, an anti-collision technology must be used. In literatures, the reading performance was mainly investigated on the error-free communication links between reader and tags. In the practical situations, particularly where a number of readers and other wireless devices share the same frequency band, the performance on the erroneous links would be significant interest. In this paper, we evaluated Gen2 Air Protocol paying attention to the anti-collision performance in random error communication link. As a result of simulation, two findings were obtained. Firstly, there is an appropriate number of slots depending on the number of tags. This number hardly changes even if a random error is incurred on the link. Secondly, the singulation speed might be significantly degraded particularly in erroneous links, if the optimal number of slots is not chosen. The findings can be interpreted such that the necessary link quality can be derived if the number of tags and permissible time are known a priori to the implementation. For instance, if 64 tags are required to be read in one second, it is necessary to ensure the link quality to be better than BER=10-4 in random error environment.
A Latent Semantic Indexing Based Method for Solving Multiple Instance Learning Problem in Region-Based Image Retrieval
Authors: Xin Chen, Chengcui Zhang, Shu-Ching Chen, Min Chen
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Relevance Feedback (RF) is a widely used technique in incorporating user's knowledge with the learning process for Content-Based Image Retrieval (CBIR). As a supervised learning technique, it has been shown to significantly increase the retrieval accuracy. However, as a CBIR system continues to receive user queries and user feedbacks, the information of user preferences across query sessions are often lost at the end of search, thus requiring the feedback process to be restarted for each new query. A few works targeting long-term learning have been done in general CBIR domain to alleviate this problem. However, none of them address the needs and long-term similarity learning techniques for regionbased image retrieval. This paper proposes a Latent Semantic Indexing (LSI) based method to utilize users' relevance feedback information. The proposed regionbased image retrieval system is constructed on a Multiple Instance Learning (MIL) framework with One-class Support Vector Machine (SVM) as its core. Experiments show that the proposed method can better utilize users' feedbacks of previous sessions, thus improving the performance of the learning algorithm (One-class SVM).
Finding LPRs in DNA Sequence Based on a New Index — SUA
Authors: Di Wang, Guoren Wang, Qingquan Wu, Baichen Chen
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

This paper proposes a new concept of repetitions, the Largest Pattern Repetition (the LPR) and a concept of pattern unit. A lightweight index structure, namely, the Succeeding Unit Array (the SUA) is designed based on pattern unit. The SUA decreases the space consumption efficiently and solves the space bottleneck in the search of repetitions. On the SUA all the atomic patterns which constitute the LPRs can be detected and the LPRs can be identified by connecting the same patterns. The theoretical analysis and experimental results show that both space and time complexity of the algorithms is O(n).
Congestion driven global routing and cross point assignment
Authors: C. Y. Chen
Venue:  (2005)

This research work presents a new methodology for congestion driven Global Routing (GR) and Cross Point Assignment (CPA) for use in VLSI designs. Global routing is often used to estimate wire length in many physical design steps and as a guide by DR algorithms to reduce runtime. Many GR algorithms have been published over the last few decades. However, the growth of design sizes and complexity makes these algorithms unsuitable due to longer runtimes. Rectilinear Steiner Trees (RST) are often used as faster alternative to GR. The problem of net ordering has traditionally been addressed using rip-up and re-route iterations, which are usually very time consuming. The proposed algorithm does not use rip-up and re-route. New models and algorithms for congestion estimation, spanning tree construction and RST determination are proposed. The pre-route congestion estimates are used to modify the classical Minimum Spanning Tree (MST) algorithm to account for routing congestion to create Congestion Driven Spanning Tree (CDST) algorithm. This research work also proposes a new RST algorithm that has a fast runtime. The proposed GR CPA algorithm uses these new components to compute a global routing solution. By utilizing the pre-route congestion estimates, every net is routed with due consideration to other nets. The combined effect of these innovations enables the proposed GR CPA methodology to achieve high completion rates with fast runtimes. The simultaneous GR CPA algorithm was tested on the MCNC testcases and a number of other testcases from the VLSI industry. The total GR net length is within 1.97% of the DR wire length, while the total Steiner tree length is within 3.63% of DR wire length. Individual net wire lengths are also compared and it was found that the GR net lengths correlate with DR wire length better than Steiner tree lengths. The runtime of the proposed GR CPA algorithm is comparable to the Batched-1-Steiner algorithm. The fast runtime (at least 15x faster than a detailed router) and better correlation to the final routing makes the proposed algorithm very useful for early estimation of routing for use in circuit and layout design feasibility analysis and to reduce the detailed routing runtime.
A New Method for Automatic 3D Face Registration
Authors: Venkat R. Ayyagari, Faysal Boughorbel, Andreas Koschan, Mongi A. Abidi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In view of today¿s security concerns, 3D face reconstruction and recognition has gained a significant position in computer vision research. Depth information of a 3D face can be used to solve the problems of illumination and pose variation associated with face recognition. Registration is an integral part of any reconstruction process and hence we focus on the problem of automatic registration of 3D face point sets through a criterion based on Gaussian fields. The method defines a simple energy function, which is always differentiable and convex in a large neighborhood of the alignment parameters; allowing for the use of powerful standard optimization techniques. The new method overcomes the necessity of close initialization, which is required by Iterative Closest Point algorithm. Moreover, the use of the Fast Gauss Transform reduces the computational complexity of the registration algorithm.
A Class of General Supertree Methods for Nested Taxa
Authors: Philip Daniel, Charles Semple
Venue: SIAM Journal on Discrete Mathematics (2005)

Amalgamating smaller evolutionary trees into a single parent tree is an important task in evolutionary biology. Traditionally, the (supertree) methods used for this amalgamation take a collection of leaf-labeled trees as their input. However, it has been recently highlighted that, in practice, such an input is somewhat limiting and that one would like supertree methods for collections of trees in which some of the interior vertices, as well as all of the leaves, are labeled [R. D. M. Page, in Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. Bininda-Emonds, ed., Kluwer, Dordrecht, The Netherlands, 2004, pp. 247--265]. In this paper, we describe what appears to be the first approach for constructing such methods and show that any method using this approach satisfies particular desirable properties.
HPEQ A Hierarchical Periodic, Event-driven and Query-based Wireless Sensor Network Protocol
Authors: Azzedine Boukerche, Richard Werner N. Pazzi, Regina B. Araujo
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Applications that require fine-grain monitoring of physical environments subjected to critical conditions, such as fire, leaking of toxic gases and explosions, pose a great challenge to sensor network protocols. These networks have to provide a fast, reliable, fault tolerant and energy aware channel for events diffusion, which meets the requirements of query-based, event-driven and periodic sensor networks application scenarios. These requirements have to be met even in the presence of emergency conditions that can lead to node failures and path disruption to the sink. This paper presents HPEQ (Hierarchical Periodic, Event-driven and Query-based), a cluster-based routing protocol that groups sensor nodes to efficiently relay the sensed data to the sink. In HPEQ protocol nodes with more residual energy are selected as aggregator nodes that relay data to the sink by uniformly distributing energy dissipation among the nodes, and reducing latency and network data traffic. HPEQ is based on a previous protocol, PEQ, that meets sensor networks requirements for critical conditions surveillance applications. HPEQ uses the publish/subscribe paradigm to disseminate requests across the network. The algorithm was implemented using NS-2 simulator and compared to PEQ and to the Directed Diffusion paradigm. Important metrics were evaluated showing that the proposed algorithm can be a potential solution to meet constraints and requirements of events delivery in critical conditions monitoring applications.
Explicit energy resource management as a first class operating system resource
Authors: Heng Zeng
Venue:  (2004)

Energy consumption has recently been widely recognized as a major challenge for computer system design, especially for mobile systems. The energy constraint will often impact the performance of devices as well as applications. To address this problem, previous works focus on improving energy efficiency of hardwires or reducing energy demand of applications. This thesis advocates a new way to look at the energy problem. It is argued that energy should be managed explicitly as a first-class system resource by the OS and energy-saving efforts across the system should be coordinated in order to achieve global energy-related goals. This thesis proposes the currentcy model as the basic abstraction for the energy resource. It represents an application's right to consume a certain amount of energy within a fixed amount of time. Currentcy is allocated to applications according to their importance and can be spent on any hardware device to pay for the energy consumption of their activities. Through the management of currentcy, including the currentcy allocation to applications, the currentcy consumption scheduling on devices and currentcy payback, energy could be managed explicitly. A currentcy based energy management framework is proposed in this thesis and it is demonstrated that the battery lifetime (and thus the system lifetime) can be extended while the execution of critical applications can be guaranteed. The energy resource is a special resource with many unique characteristics. It has impact on all applications as well as all devices, and its management is an unified effort from all system components. These characteristics directly affect the design of the management framework and the management policies. In this thesis, an embedded energy model approach is proposed for energy accounting, the currentcy conserving allocation policy is proposed for efficient management and the currentcy centric scheduling policy is proposed to provide prioritized service to applications. Working within the management framework, these policies can enforce the global goals without application cooperation. In addition to global management and energy quota enforcement, the management framework is also capable of assisting various local energy-saving efforts. A currentcy-based hard disk scheduler is introduced that schedules hard disk accesses by pseudo-economic activities such as bidding, pricing and debiting. It is shown that by exposing currentcy information to the hard disk, energy can be saved by smarter decisions without violating the global goals. The application-OS interaction for better energy management is also discussed in this thesis. A prototype system, ECOSystem, is implemented based on the Linux kernel on a laptop platform. The currentcy model, the management framework and the management policies are evaluated using a variety of synthetic benchmarks and real applications. Experiment results show the success of the explicit energy management approach in achieving global energy-related goals and in coordinating various energy-saving efforts.
Probabilistic interval-valued computation: representing and reasoning about uncertainty in dsp and vlsi design
Authors: Claire Fang Fang
Venue:  (2005)

In DSP and VLSI design, there are many variational parameters that are unknown during the design stage, but significantly affect chip performance. Some uncertainties are due to manufacturing process fluctuations, others depend on the dynamic context in which the chip is used, such as input patterns, temperature and voltage. Chip designers need to consider these uncertainties as early as possible to ensure chip performance, improve yield and reduce design cost. However, it is a challenging task to model uncertainties and predict the joint impacts of them, which often either requires high computational cost or yields unsatisfactory accuracy. Interval algebra provides a general solution to modeling and manipulating uncertainties. The idea is to replace scalar quantities with bounded intervals, and propagate intervals through arithmetic operations. A recent technique&mdash;affine arithmetic&mdash;advances the field in handling correlated intervals. However, it still produces overly conservative bounds due to the inability to consider probability information. The goal of this dissertation is to improve the accuracy of affine arithmetic and broaden its application in DSP and VLSI design. To achieve this goal, we develop a probabilistic interval method that enhances the interval representation and computations with probability information. First, we provide a probabilistic interpretation for affine intervals based on the Central Limit Theory. Based on this interpretation, we present a probabilistic bounding method that returns less pessimistic bounds of affine intervals. Second, we propose an enhanced interval representation form that utilizes probability information to handle asymmetric affine intervals. This addresses a fundamental issue of current affine arithmetic, i.e., it only represents center-symmetric intervals. This restriction highly limits the accuracy of nonlinear interval functions. By introducing center-asymmetric affine intervals, we are able to design better algorithms for nonlinear interval functions. We present the improved algorithms for common nonlinear functions, with emphasis on the multiplication and the division algorithms. Finally, we also realize that in many applications, detailed probability distribution within an interval is more desirable than its bounds. Therefore, another contribution of this dissertation is to enable our interval method to estimate not only the bounds, but also the distribution within an interval. We demonstrate the effectiveness of our techniques by several applications in DSP and VLSI design.
Melanocytic Lesion Images Segmentation Enforcing by Spatial Relations Based Declarative Knowledge
Authors: Halina Kwasnicka, Mariusz Paradowski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper presents a method for enforcing image segmentation. Method presented here is a part of a wider research - an image understanding system. Regions of the image, extracted by a basic segmentation process, belong to certain classes. Spatial relations are calculated for extracted regions of the image, according to the declared knowledge. Declarative knowledge in the form of semantic rules is used as a second step to eliminate errors in the basic segmentation process. The approach is generic, but in this case it is used for melanoma skin lesions diagnosis.
Talk to Your Semantic Web
Authors: Craig W. Thompson, Paul Pazandak, Harry R. Tennant
Venue: IEEE Internet Computing (2005)

Using natural language to communicate with computers remains a grand-challenge question. The authors' LingoLogic interface technology can be seen as a widely useful human interface technology that can extend the Semantic Web.
Multivariate Glyphs for Multi-Object Clusters
Authors: Eleanor Boyle Chlan, Penny Rheingans
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Aggregating items can simplify the display of huge quantities of data values at the cost of losing information about the attribute values of the individual items. We propose a distribution glyph, in both two- and three-dimensional forms, which specifically addresses the concept of how the aggregated data is distributed over the possible range of values. It is capable of displaying distribution, variability and extent information for up to four attributes at a time of multivariate, clustered data. User studies validate the concept, showing that both glyphs are just as good as raw data and the 3D glyph is better for answering some questions.
Optimizing abstaining classifiers using ROC analysis
Authors: Tadeusz Pietraszek
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Classifiers that refrain from classification in certain cases can significantly reduce the misclassification cost. However, the parameters for such abstaining classifiers are often set in a rather ad-hoc manner. We propose a method to optimally build a specific type of abstaining binary classifiers using ROC analysis. These classifiers are built based on optimization criteria in the following three models: cost-based, bounded-abstention and bounded-improvement. We demonstrate the usage and applications of these models to effectively reduce misclassification cost in real classification systems. The method has been validated with a ROC building algorithm and cross-validation on 15 UCI KDD datasets.