ppxscal/embedding_network huggingface dataset:
Design of a Hardware Architecture Based on Microcontrollers for the Implementation of Membrane Systems
Authors: Abraham Gutierrez, Luis Fernandez, Fernando Arroyo, Victor Martinez
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The nature of the computation based on membranes, distributed, nondeterministic and massively parallel makes that the current hardware architectures, mainly based in the use of clusters of microprocessors, be not the most appropriate to house this type of systems; especially if we think about the associated costs to solutions that try to maximize the grade of potential parallelism. The use of microcontroller, in these cases, it could be considered like a viable alternative, by its low cost and its high processing capacity, of not being because its use is restricted to problems that can be adapted to the small amount of memory that this kind of devices has to store generic data. The present work describes in a exhaustive way the implementation of a low cost hardware prototype based on microcontrollers that making use of external memory modules is able to resolve the main problem of the small capacity of storage of these components. This way range of approachable problems is enlarged and its use becomes a real alternative to the solutions based on clusters of microprocessors. The adopted hardware architecture also endows from a great flexibility to the proposed solution, since, unlike others, it doesn't require modifications to adapt to anyone of the topologies of current membrane systems. It will be responsibility of the software component that we use, the implementation of the algorithms that reproduce the behavior of different membrane systems.
Adapting wavelet compression to human motion capture clips
Authors: Philippe Beaudoin, Pierre Poulin, Michiel van de Panne
Venue: Proceedings of Graphics Interface 2007 (2007)

Motion capture data is an effective way of synthesizing human motion for many interactive applications, including games and simulations. A compact, easy-to-decode representation is needed for the motion data in order to support the real-time motion of a large number of characters with minimal memory and minimal computational overheads. We present a wavelet-based compression technique that is specially adapted to the nature of joint angle data. In particular, we define wavelet coefficient selection as a discrete optimization problem within a tractable search space adapted to the nature of the data. We further extend this technique to take into account visual artifacts such as footskate. The proposed techniques are compared to standard truncated wavelet compression and principal component analysis based compression. The fast decompression times and our focus on short, recomposable animation clips make the proposed techniques a realistic choice for many interactive applications.
GRID Resource Consumption Estimates and Planning
Authors: G. Grabarnik, L. Kozakov, V. Lemberg, I. Rish, L. Shwartz
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.
Enabling Web Services Policy Negotiation with Privacy preserved using XACML
Authors: Vivying S. Y. Cheng, Patrick C. K. Hung, Dickson K. W. Chiu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In recent Web services research, there are increasing demands and discussions about negotiation technologies for different Web services applications. One of the important topics is the policy negotiation. As many business activities become automated, policy compliance negotiation between human agents can be a bottleneck. In this paper, we focus on the policy negotiation research issues in privacy policy. We adopt the eXtensible Access Control Markup Language (XACML) as a policy description language and explore its potential in privacy policy negotiation. We first formalize the negotiation process in the context of Web services. Then, we illustrate the policy negotiation model by introducing a policy negotiation point (PNP) between the policy enforcement point (PEP) and policy decision point (PDP) in the XACML policy management architecture. We discuss different phases in a privacy policy negotiation and finally we illustrate how PNP can help on negotiating policies through an example scenario.
ARE: instance splitting strategies for dependency relation-based information extraction
Authors: Mstislav Maslennikov, Hai-Kiat Goh, Tat-Seng Chua
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Information Extraction (IE) is a fundamental technology for NLP. Previous methods for IE were relying on co-occurrence relations, soft patterns and properties of the target (for example, syntactic role), which result in problems of handling paraphrasing and alignment of instances. Our system ARE (Anchor and Relation) is based on the dependency relation model and tackles these problems by unifying entities according to their dependency relations, which we found to provide more invariant relations between entities in many cases. In order to exploit the complexity and characteristics of relation paths, we further classify the relation paths into the categories of 'easy', 'average' and 'hard', and utilize different extraction strategies based on the characteristics of those categories. Our extraction method leads to improvement in performance by 3% and 6% for MUC4 and MUC6 respectively as compared to the state-of-art IE systems.
Auto-diagnosis of field problems in an appliance operating system
Authors: Gaurav Banga
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The use of network appliances, i.e., computer systems specialized to perform a single function, is becoming increasingly widespread. Network appliances have many advantages over traditional general-purpose systems such as higher performance/cost metrics, easier configuration and lower costs of management. Unfortunately, while the complexity of configuration and management of network appliances in normal usage is much lower than that of general-purpose systems, this is not always true in problem situations. The debugging of configuration and performance problems with appliance computers is a task similar to the debugging of such problems with general-purpose systems, and requires substantial expertise. This paper examines the issues of appliance-like management and performance debugging. We present a number of techniques that enable appliance-like problem diagnosis. These include continuous monitoring for abnormal conditions, diagnosis of configuration problems of network protocols via protocol augmentation, path-based problem isolation via cross-layer analysis, and automatic configuration change tracking. We also describe the use of these techniques in a problem autodiagnosis subsystem that we have built for the Data ONTAP operating system. Our experience with this system indicates a significant reduction in the cost of problem debugging and a much simpler user experience.
Towards a Gravity-Based Trust Model for Social Networking Systems
Authors: Muthucumaru Maheswaran, Hon Cheong Tang, Ahmad Ghunaim
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Web-based social networks are emerging as the top applications on the Internet. With this immense popularity, many of the shortcomings of the current social network deployments are also coming to light. One of the glaring problems with existing web-based social networks is trust management. In this paper, we focus on trust modeling in social networks. Another allied issue that is not considered here is using trust in managing the activities within the social network. We introduce a gravity-based model for estimating trust. We present the complete model along with the trust computation algorithms. We present initial results from a simulation study that investigates the feasibility of the proposed scheme.
Conflicts and Conflict Resolution Mechanisms in Remote Collaboration via Videoconferencing
Authors: Andreas Eckhardt, Tobias Keim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Globally active organizations and many virtual team based work structures are facing the challenge of a physically distributed workplace despite the necessity to closely interact among team members. While videoconferencing (VC) promises to replace the need for face-to-face meetings, this new medium also implies new cultural challenges. But what are the problems inherent to the social dynamics of videoconferencing usage in remote collaboration and what are mechanisms to overcome such conflicts? Based on an intense review of literature as well as a total of three case studies with multinational enterprises we identify nine major problems in VC and propose an adopted conflict management method for videoconferencing.
The eternal resource locator: an alternative means of establishing trust on the world wide web
Authors: Ross J. Anderson, Václav Matyáš,  Jr., Fabien A. P. Petitcolas
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

Much research on Internet security has concentrated on generic mechanisms such as firewalls, IP authentication and protocols for large scale key distribution. However, once we start to look at specific applications, some quite different requirements appear. We set out to build an infrastructure that would support the reliable electronic distribution of books on which doctors depend when making diagnostic and treatment decisions, such as care protocols, drug formularies and government notices. The integrity, authenticity and timeliness of this information is important for both safety and medico-legal purposes. We initially tried to implement a signature hierarchy based on X.509 but found that this had a number of shortcomings. We therefore developed an alternative means of managing trust in electronic publishing. This has a number of advantages which may commend it in other applications. It does not use export-controlled cryptography; it uses much less computation than digital signature mechanisms; and it provides a number of features that may be useful in environments where we are worried about liability. We also present our intermediate solution-the first ever large scale deployment of one-time signature systems. The move to one-time signatures enabled considerable simplification, cost reduction and performance improvement. We believe that similar mechanisms may be appropriate for protecting other information that changes slowly and remains available over long time periods. Book and journal publishing in general appear to be strong candidates.
Beacon vector routing: scalable point-to-point routing in wireless sensornets
Authors: Rodrigo Fonseca, Sylvia Ratnasamy, Jerry Zhao, Cheng Tien Ee, David Culler, Scott Shenker, Ion Stoica
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

We propose a practical and scalable technique for point-to-point routing in wireless sensornets. This method, called Beacon Vector Routing (BVR), assigns coordinates to nodes based on the vector of hop count distances to a small set of beacons, and then defines a distance metric on these coordinates. BVR routes packets greedily, forwarding to the next hop that is the closest (according to this beacon vector distance metric) to the destination. We evaluate this approach through a combination of high-level simulation to investigate scaling and design tradeoffs, and a prototype implementation over real testbeds as a necessary reality check.
Copilot - a coprocessor-based kernel runtime integrity monitor
Authors: Nick L. Petroni,  Jr., Timothy Fraser, Jesus Molina, William A. Arbaugh
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Copilot is a coprocessor-based kernel integrity monitor for commodity systems. Copilot is designed to detect malicious modifications to a host's kernel and has correctly detected the presence of 12 real-world rootkits, each within 30 seconds of their installation with less than a 1% penalty to the host's performance. Copilot requires no modifications to the protected host's software and can be expected to operate correctly even when the host kernel is thoroughly compromised - an advantage over traditional monitors designed to run on the host itself.
Optical CDMA; Optical Parallel Interference Cancellation Using the Lowest Threshold Value
Authors: N. Elfadel, E. I. Babekir, A. Mohammed, A. A. Aziz, N. M. Saad
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This paper presents the study of a receiver device for the Optical Code Division Multiple Access (OCDMA) called the Optical Parallel Interference Cancellation (Opt-PIC). The performance of OCDMA system is known to be easily influenced by the Multiple Access Interference (MAI) caused by other simultaneous users. To overcome this problem, there is a strong demand for the design of new detection scheme that will be efficient enough to improve the performance of the OCDMA system, while minimizing the effects of the MAI. In this paper, some studies have been conducted on the Opt- PIC specifically for the lowest threshold value. Studies have been carried out not only using the conventional method but also using a hard limiter. The results are compared to the previous techniques used to mitigate the effect of MAI.
On equivalence checking between behavioral and RTL descriptions
Authors: M. Fujita
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper we present techniques for comparison between behavioral level and register transfer level (RTL) design descriptions by mapping the designs into virtual controllers and virtual datapaths. We also discuss about how the equivalence between behavioral level and RTL designs can be defined precisely using the proposed "attribute statements" in an interactive fashion. Implementation issues as well as considerations on real life industrial design examples are presented as well.
Performance Analysis of dual priority single-buffered blocking Multistage Interconnection Networks
Authors: D. C. Vasiliadis, G. E. Rizos, C. Vassilakis
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper a novel architecture of dual priority single-buffered blocking Multistage Interconnection Networks (MINs) is presented. We analyzed their performance in the uniform traffic condition under various loads using simulations. We compared the dual priority architecture against a single priority MIN, by gathering metrics for the two most important network performance factors, namely packet throughput and the mean time a packet needs to traverse the network. We demonstrated the gain of the high priority packets against the low priority packets under different configuration schemas. In this paper we focus on studying the influence of the priority bit in the header field of transmitted packets on the performance of high and low priority traffic of a MIN. Performance prediction before actual network implementation and understanding the impact of parameter settings in a MIN setup are valuable assets for network designers for minimizing overall deployment costs and delivering efficient networks.
A set of CS 1 labs utilizing graphical objects and inheritance
Authors: P. Andrews
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

A series of weekly CS 1 labs utilizing C++ have been developed, implemented and tested in a student lab environment. Of particular interest is the emphasis on mathematics and the early and extensive use of objects and graphics, including simple animation. Many basic concepts (e.g., objects, files, and functions) are introduced and expanded over several weeks, and important themes recur throughout a series of labs (e.g., file processing and bar charts, classes and inheritance). Included are preview, lab and follow-up exercises, check-off and grade sheets, weekly topics and hints for instructors, additional programming exercises that are extensions of the lab material and a student reference manual.
Analyzing the combination of conflicting belief functions
Authors: Philippe Smets
Venue: Information Fusion (2007)

We consider uncertain data which uncertainty is represented by belief functions and that must be combined. The result of the combination of the belief functions can be partially conflictual. Initially Shafer proposed Dempster's rule of combination where the conflict is reallocated proportionally among the other masses. Then Zadeh presented an example where Dempster's rule of combination produces unsatisfactory results. Several solutions were proposed: the TBM solution where masses are not renormalized and conflict is stored in the mass given to the empty set, Yager's solution where the conflict is transferred to the universe and Dubois and Prade's solution where the masses resulting from pairs of conflictual focal elements are transferred to the union of these subsets. Many other suggestions have then been made, creating a 'jungle' of combination rules. We discuss the nature of the combinations (conjunctive versus disjunctive, revision versus updating, static versus dynamic data fusion), argue about the need for a normalization, examine the possible origins of the conflicts, determine if a combination is justified and analyze many of the proposed solutions.
Hierarchical Agglomerative Clustering Based T-outlier Detection
Authors: Dajun Wang, Paul J. Fortier, Howard E. Michel, Theophano Mitsa
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Diversification is a technique to reduce portfolio volatility. In traditional financial domains, the correlation coefficient has been used as a basis for diversification. However, it is problematic in reality since it only captures a single dimension. This research introduces a unique similarity based framework to identify outliers among high dimensional time series objects in financial markets. As the similarity between two assets decreases in the portfolio, the benefits of diversification increase. The paper proposes a novel and efficient Hierarchical Agglomerative Clustering (HAC) algorithm based on vertical and horizontal dimension reduction algorithms. [11] Finally, this paper proposes a unique similarity measurement definition/calculation based on the timevalue function. This paper discloses a series of experiment results illustrating the effectiveness of the framework. The detected outliers can be used to monitor portfolio diversification and therefore mitigate risk.
Temporal patterns (TRAPs) in ASR of noisy speech
Authors: H. Hermansky
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We study a new approach to processing temporal information for automatic speech recognition (ASR). Specifically, we study the use of rather long-time temporal patterns (TRAPs) of spectral energies in place of the conventional spectral patterns for ASR. The proposed neural TRAPs are found to yield significant amount of complementary information to that of the conventional spectral feature based ASR system. A combination of these two ASR systems is shown to result in improved robustness to several types of additive and convolutive environmental degradations.
Efficient learning of standard finite normal mixtures for image quantification
Authors: Yue Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents an efficient on-line distribution learning procedure of standard finite normal mixtures for image quantification. Based on the standard finite normal mixture (SFNM) model, we formulate image quantification as a distribution learning problem, and derive the probabilistic self-organizing map (PSOM) algorithm by minimizing the relative entropy between the SFNM distribution and the image histogram. We justify our formulation and hence provide a basis for the use of SFNM, in pixel image modeling in terms of large sample properties of the maximum likelihood estimator. We then establish convergence properties of the PSOM which simulates a Bayesian rule network structure with Gaussian activation functions forming soft splits of the data, and thus providing unbiased estimates. It is shown that by incorporating learning rate adaptation in a sequential mode, PSOM achieves fast convergence and has efficient learning capabilities which make it very attractive for many practical image quantification applications; such as unsupervised image segmentation and diagnosis by medical images.
An integrated systolic array design for video compression
Authors: Liang-Gee Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents an integrated systolic array design for implementing full-search block matching, 2-D discrete wavelet transform, and full-search vector quantization on the same VLSI architecture. The above three functions are prime essential but with a large amount of computation in video compression. To meet real-time requirements, many systolic arrays are designed for individually performing each of them. In fact, these functions contain the similar computational procedure. The matrix-vector product forms of them are quite similar. In this paper, by carefully extracting the common computation component, an integrated systolic array design that can perform the above three functions is presented. A utilization of 100% to 97% is achieved for executing full-search block matching and full-search vector quantization. When performing the 2-D discrete wavelet transform, the utilization is about 32%. The proposed integrated architecture has lower hardware cost and has a a regular hardware structure. It befits the VLSI implementation for video compression. 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