ppxscal/embedding_network huggingface dataset:
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Authors: Anne Bracy, Amir Roth
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Instruction aggregation-the grouping of multiple operations into a single processing unit -is a technique that has recently been used to amplify the bandwidth and capacity of critical processor structures. This amplification can be used to improve IPC or to maintain IPC while reducing physical resources. Mini-graph processing is a particular instruction aggregation technique that targets dynamically-scheduled superscalar processors and achieves bandwidth and capacity amplification throughout the pipeline. The dark side of aggregation is serialization. External serialization is an effect common to many aggregation schemes. An aggregate cannot issue until all of its external inputs are ready. If the last-arriving input to an aggregate feeds what is not the first instruction, the entire aggregate can be delayed. Mini-graphs additionally suffer from internal serialization. Serialization can degrade performance, sometimes to the point of overwhelming the benefits of aggregation. This paper examines the problem of serialization and serialization-aware aggregation in the context of mini-graphs. An aggressive mini-graph selection scheme that seeks to maximize amplification, produces amplification rates of 38% but, due to serialization, cannot use them to compensate for a 33% reduction in physical resources (i.e., a reduction from 4-way issue to 3-way issue). A conservative selection scheme that avoids serialization by static inspection produces amplification rates of only 20%, making a performance neutral reduction in resources virtually impossible. To reconcile the seemingly conflicting goals of resource amplification and serialization avoidance, this paper develops three schemes that identify and reject mini-graphs with harmful serialization. The most effective of these, Slack-Profile, uses local slack profiles to reject mini-graphs whose estimated delay cannot be absorbed by the rest of the program. Slack- Profile virtually eliminates serialization-induced slowdowns while providing 34% amplification rates. A 3-way issue processor augmented with Slack-Profile mini-graphs outperforms a 4-way issue processor by an average of 2%.
Progressive Image Transmission Using Significant Features and Linear Regression Prediction
Authors: Chin-Chen Chang, Jun-Chou Chuang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Progressive image transmission is often used in low bandwidth communications or in limited bandwidth environments. When a user browses an image on a website, the web server first sends a low quality image to the receiver and then gradually improves the image quality by subsequent transmissions .Because the image size becomes larger and larger, it is essential to develop a flexible and efficient technique to help users quickly browse or retrieve images on a website. For this reason, using significant features along with a prediction technique for progressive image transmission is proposed in this paper. In our method, significant features of an image need to be extracted first. Next, these features, according to their priority, are sent to the receiver. For reducing the encoding cost of the transmitted data, three approaches, sampling, quantization, and linear regression prediction, are also presented.
Pruning subscriptions in distributed publish/subscribe systems
Authors: Sven Bittner, Annika Hinze
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to several filter components. This approach allows for an application of routing algorithms that selectively forward event messages to only a subset of filter components. Beneficial e(r)ects of this scheme include decreasing network and computational load in single filter components.So far, we can find routing optimizations that exploit coverings among subscriptions or utilize subscription merging strategies. Generally, such optimizations aim at reducing the amount of subscriptions forwarded to filter components, which decreases their computational load. This might in turn result in an increasing number of event messages routed through the network.However, current optimization strategies only work on restrictive conjunctive subscriptions and cannot be extended to efficiently support arbitrary subscriptions. Furthermore, it is not possible to apply covering and perfect merging strategies in all application scenarios due to the strong dependency of these approaches on actually registered subscriptions.In this paper, we present a novel optimization approach, subscription generalization, to decrease the filtering overhead in publish/subscribe systems. Our approach is based on selectivities of subscriptions and can be utilized for all kinds of subscriptions including arbitrary Boolean and conjunctive subscriptions. We propose a simple subscription generalization algorithm and show an evaluation of the results of a first series of experiments proving the usefulness of our approach.
The vertical metal insulator semiconductor tunnel transistor: A proposed Fowler-Nordheim tunneling device
Authors: Lit-Ho Chong, Kanad Mallik, C. H. de Groot
Venue: Microelectronic Engineering (2005)

We propose a new field-effect transistor, the vertical metal insulator semiconductor tunnel transistor (VMISTT) which operates using gate modulation of the Fowler-Nordheim tunneling current through a metal insulator semiconductor (M-I-S) diode. The VMISTT has significant advantages over the metal-oxide-semiconductor field-effect transistor in device scaling. In order to allow room-temperature operation of the VMISTT, the tunnel oxide has to be optimized for the metal-to-insulator barrier height and the current-voltage characteristics. We have grown TiO"2 layers as the tunnel insulator by oxidizing 7 and 10nm thick Ti metal films vacuum-evaporated on silicon substrates, and characterized the films by current-voltage and capacitance-voltage techniques. The quality of the oxide films showed variations, depending on the oxidation temperatures in the range of 450-550^oC. Fowler-Nordheim tunneling was observed at low temperatures at bias voltage of 2V and above and a barrier height of approximately 0.4eV was calculated. Leakage currents present were due Schottky-barrier emission at room-temperature, and hopping at liquid nitrogen temperature.
Multi-Class MPLS Resilience Mechanism Supporting Traffic Engineering
Authors: Huang He, Wang Jin, Yang Bo, Li Peng
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In the classical MPLS resilience scenario, the fault recovery mechanism can only be deployed in two ways: either 100% protects traffic in protection switching case, or unprotect traffic in rerouting case. Consequently, the resource consumption is too high for network to afford if the fast recovery mechanism (protection switching) is deployed in the whole network. One of the objectives of our proposed multiclass resilience scheme is to decrease the resource consumption caused by recovery mechanism, while still meeting the needs of resilience requirements for network services. This is achieved by providing the differentiated resilience mechanisms for different services accordingly to meet their respective resilience requirements. Another improvement to the network performance in our proposal is done through offering an optimized routing algorithm for backup path computation in resilience. The algorithm finds optimized explicit routes for both working and backup paths for services with high-level resilience requirements. Through the treatments, Traffic Engineering capability is provided in resilience with the improvement of network resources utilization, and the provisioning of fast fault recovery mechanism for the services with high-level resilience requirements.
Combinatorial Grouping of Edges using Geometric Consistency in a Lagrangian Framework
Authors: Amir Tamrakar, Benjamin B. Kimia
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The grouping of edges into long meaningful curves is a goal of perceptual grouping. The typical approach involves a first stage of salience computation based on some pairwise affinity measure, followed by a second stage of linking salient edges into long curves. We argue that the two stages cannot be separated because the curve hypothesis each edge is representing must be explicitly represented to avoid "cross-talk" among various groupings. We also advocate reasoning directly with subpixel edges which does not rely on a Euclidean lattice of pre-determined positions, orientations, and curve labels. Specifically, we propose that a discrete combination of edges represent a curve hypothesis and that a first-order curvature variation can effectively measure consistency among edges making up this curve hypothesis. These combinations are constructed by forming viable edge pairs, then triplets, and finally quadruplets. This results in a hierarchical organization of an edge map into grouped quadruplets, triplets, pairs, and singleton edges with associated measures of curvature variation, curvature, tangents, and position, which we expect can be used for linking into longer curve segments as well as for mid-level vision tasks such as tracking and stereo.
Design Trade-Offs and Deadlock Prevention in Transient Fault-Tolerant SMT Processors
Authors: Xiaobin Li, Jean-Luc Gaudiot
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Since the very concept of Simultaneous Multi-Threading (SMT) entails inherent redundancy, some proposals have been made to run two copies of the same thread on top of SMT platforms in order to detect and correct soft errors. This allows, upon detection of an error, for the rolling back of the processor state to a known safe point, and then a retry of the instructions, thereby resulting in a completely error-free execution. This paper focuses on two crucial implementation issues introduced by this concept: (i) the design trade-off between the fault detection coverage versus the design costs; (ii) the possible occurrence of deadlock situations. To achieve the largest possible fault detection coverage, we replicate the instructions fetched in order to generate the redundant thread copies. Further, we apply the SMT thread scheduling at the the instruction dispatch stage so as to lower the performance overhead. As a result, when compared to the baseline processor, our simulation results show that by using our two new schemes, the performance overhead can be reduced down to as little as 34% on the average, down from 42%. Finally, in the faulttolerant execution mode, since the two copied threads are cooperating with one another, deadlock situations could be quite common. We thus present a detailed deadlock analysis and then conclude that allocating some entries of ROB, LQ, and SQ for the trailing thread is sufficient to prevent such deadlocks.
Towards a science of definition
Authors: Anne M. Cregan
Venue: Proceedings of the 2005 Australasian Ontology Workshop - Volume 58 (2005)

The vision of the Semantic Web is to provide machine-processable meaning for intelligent applications. Whilst knowledge representation structures like ontologies now have well-developed formalisms, the issue of determining or specifying exactly what it is that they represent is still not well-understood. However, it is crucial for validation, merging and alignment, as we cannot possibly hope to judge the accuracy or applicability of a representation structure without a clear specification of what it is intended to represent. This being the case, we must either accept that our representations will have a limited applicability and lifespan, or develop methods by which we can define our terms in a robust and standardized way. Building on philosopher Richard Robinson's analysis, it is argued that 'definition' is in fact the isolation of territories within conceptual landscapes, using the four mechanisms: example, semantic relation, analysis, and rule. These mechanisms are related to cognitive processes like abstraction and categorization. We speculate that there is a common semantic ground which forms the initial basis for symbol grounding, and is then extended through cognitive mechanisms. Some starting points for identifying common semantic ground and points of divergence from it are suggested.
Representation of Number in Animals and Humans: A Neural Model
Authors: Tom Verguts, Wim Fias
Venue: Journal of Cognitive Neuroscience (2004)

This article addresses the representation of numerical information conveyed by nonsymbolic and symbolic stimuli. In a first simulation study, we show how number-selective neurons develop when an initially uncommitted neural network is given nonsymbolic stimuli as input (e.g., collections of dots) under unsupervised learning. The resultant network is able to account for the distance and size effects, two ubiquitous effects in numerical cognition. Furthermore, the properties of the network units conform in detail to the characteristics of recently discovered number-selective neurons. In a second study, we simulate symbol learning by presenting symbolic and nonsymbolic input simultaneously. The same number-selective neurons learn to represent the numerical meaning of symbols. In doing so, they show properties reminiscent of the originally available number-selective neurons, but at the same time, the representational efficiency of the neurons is increased when presented with symbolic input. This finding presents a concrete proposal on the linkage between higher order numerical cognition and more primitive numerical abilities and generates specific predictions on the neural substrate of number processing.
Resource Availability Optimization for Priority Classes in a Website
Authors: V. P. Koutras, A. N. Platis
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

High resource availability in computer networks has become a critical issue as it can be affected by the increasing number of network users. A methodology based on classifying website visitors into priority groups is proposed, assuring high availability for priority classes, based on reserved website resources that can be accessed only by these groups and simultaneously providing as many resources as possible to lower priority visitors. A birth-death process is proposed to model website visitors' arrival and service. An optimization problem is solved to determine the optimal trade off between resource availability for high priority visitors and free resource access to lower priority visitors. The major contribution of this paper consists in deriving formulas for the probability that a website visitor has no further access to resources and in determining the optimal reserved resources assuring the above trade off.
Assessing Health Consumerism on the Web: A Demographic Profile of Information-Seeking Behaviors
Authors: Daniel P. Lorence, Heeyoung Park, Susannah Fox
Venue: Journal of Medical Systems (2006)

The growing diversity of the online health information community is increasingly cited as a limiting factor related to the potential of the Internet as an effective health communication channel and information resource. Public-access Internet portals and decreasing costs of personal computers have created a consensus that unequal access to information, or a "Digital Divide," presents a like problem specific to health care consumers. Access to information, however, is an essential part of the consumer-centric framework outlined in the recently proposed U.S. National Health Information Infrastructure (NHII) and Health Architecture initiatives. To date little research has been done to differentiate the types of health information sought on the Web by different subgroups, linking user characteristics and health-seeking behaviors. Data from a study of consumer Web search activity in a post-intervention era serves as a natural experiment, and can identify whether a "digitally underserved group" persists in the United States. Such an environment would serve to exclude traditionally underserved groups from the benefits of the planned national heath information infrastructure. This exploratory technology assessment study seeks to differentiate and delineate specific behaviors, or lack of desired behaviors, across targeted health care subgroups. Doing so allows the design of more effective strategies to promote the use of the Web as a health education and health promotion tool, under the envisioned shared decision-making, consumer-centric health information model.
Illumination Invariant Elastic Bunch Graph Matching for Efficient Face Recognition
Authors: Nikunj Kela, Ajita Rattani, Phalguni Gupta
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper proposes a system which can handle illumination problem of face recognition systems by using "Retinex and color constancy" algorithm. The Retinex and color constancy approach has been plugged with Elastic Bunch Graph Matching (EBGM). The proposed system has been tested on IITK database having more than 1000 face images. The experimental results demonstrate that performance of the proposed system is superior to the known systems. The overall accuracy has shown an increase of 3.14% as compared to the known EBGM based recognition system without using Retinex and Color Constancy method.
Three-Dimensional Shape and Motion Reconstruction for the Analysis of American Sign Language
Authors: Liya Ding, Aleix M. Martinez
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The design of systems that can analyze and recognize American Sign Language (ASL) sentences, require that motion patterns and handshapes be independently represented from one another. In this paper, we define an algorithm that first obtains the 3D shape of each of the linguistically significant fingers (known as "selected" fingers in the linguistic literature), and then represents the motion of the hand as a three-dimensional trajectory in the coordinate system of the camera. In doing so, we address the problems caused by self-occlusions and localization errors. The 3D shape is obtained using an affine structure from motion algorithm that is based on the linear fitting of matrices with missing data. To recover the 3D motion of the hand, we define a robust algorithm that selects the most stable solution from the pool of all the solutions given by the three point resection problem. To be robust to localization errors (of the hand feature points tracked) we define a simple algorithm that searches for that combination of coordinates that gives the largest number of stable solutions in our system of equations. To validate our theory, we provide a set of experimental results using video sequences of ASL signs.
Satellite Features for the Classification of Visually Similar Classes
Authors: Boris Epshtein, Shimon Ullman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We show that the discrimination between visually similar classes often depends on the detection of socalled 'satellite features'. These are local features which are not informative by themselves, and can only be detected reliably at locations specified relative to other features. This makes satellite features difficult to extract by current classification methods. We describe a novel scheme which can extract discriminative satellite features and use them to distinguish between visually similar classes. The algorithm first searches for a set of features ("anchor features") that can be found in all the similar classes. Such features can be detected because the classes are visually similar. The anchors are used to determine the locations of satellite features, which are extracted during learning and used in classification to distinguish between the similar classes. The algorithm is fully automatic, and is shown to work well for many categories of visually similar classes.
On goodness-of-fit for homogeneity and proportional hazards: Research Articles
Authors: Vilijandas Bagdonavičius, Mikhail Nikulin
Venue: Applied Stochastic Models in Business and Industry (2006)

The classical goodness-of-fit tests for homogeneity and proportional hazards have small power in the case of alternatives when crossings of survival functions are possible. We give test statistics which are oriented against wide classes of alternatives including single or multiple crossings of survival functions. The limit distributions of the test statistics are derived. Power of some tests are investigated by simulation. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Designs for collaborative learning environments: can specialization encourage knowledge integration?
Authors: Alex J. Cuthbert
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

In this paper, I develop strategies for designing and assessing collaborative learning environments from a knowledge integration perspective. I identify strengths and weaknesses associated with collaborative learning, linking them to the instructional approaches used in an eighth-grade science curriculum where students design a desert house. The house design activity provides a context for connecting instructional goals and technical innovations. Focusing on how students specializing in different areas can share ideas and provide feedback for each other, I show how social and technical supports can work to achieve common goals. I examine two assumptions about how an expanded repertoire of models contributes to knowledge integration. First, I provide evidence that considering more alternatives leads to improved designs only if students have a framework for organizing those alternatives and selecting between them. Then, I provide evidence that encouraging students to iteratively refine their ideas contributes to knowledge integration. Finally, I show how these cognitive goals can be pursued through social and technical innovations which seek to encourage knowledge integration by making thinking visible for students.
Image Watermarking Based on Singular Value Decomposition
Authors: Jie Liu, Xiamu Niu, Wenhai Kong
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, a new blind image watermarking algorithm is proposed based on the Singular Value Decomposition. The watermarks can be detected without the original image or any other information of the original singular values. Experiments show that the algorithm has good robustness on JPEG compression, median filtering, rescaling, and Gaussian low-pass filtering, etc.
Reconstruct the Distributed Transaction Monitor OnceTX
Authors: Beihong Jin, Gang Li, Liang Zhang
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Distributed transaction monitor is the fundamental software for critical transactional applications across network. We concern its quality from the point of view of practicality. This paper presents the key technologies during the reconstruction of the distributed transaction monitor OnceTX1.0 to OnceTX2.0, including scalable architecture, multi-phase concurrency control, dynamic configuration and access for system services, and optimization of message organization and processing. OnceTX2.0 is now applicable to not only small-scale and tight-coupling transaction applications, but also geographically dispersed applications with transaction demands. Its performance has also been enhanced, which is proved by the benchmark results. Moreover, extensibility and maintainability are achieved.