ppxscal/embedding_network huggingface dataset:
Towards a Programmable TPM
Authors: Paul England, Talha Tariq
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

We explore a new model for trusted computing in which an existing fixed-function Trusted Platform Module (TPM) is coupled with user application code running on a programmable smart card. We will show that with appropriate coupling the resulting system approximates a "field-programmable TPM." A true field-programmable TPM would provide higher levels of security for user-functions that would otherwise need to execute in host software. Our coupling architecture supports many (but not all) of the security requirements and applications scenarios that you would expect of a programmable TPM, but has the advantage that it can be deployed using existing technology.This paper describes our TPM-smart card coupling architecture and the services that we have prototyped. The services include: (1) An implementation of count-limited objects in which keys can only be used a preset number of times. (2) More flexible versions of the TPM Unseal and Unbind primitives that allow sealing to groups of equivalent configurations. And (3) a version of Quote that uses alternative signature formats and cryptography available within smart cards but not in the TPM itself.We also describe the limitations of the coupling architecture and how some of the limitations could be overcome with a true programmable TPM.
Faceted search and retrieval based on semantically annotated product family ontology
Authors: Soon Chong Johnson Lim, Ying Liu, Wing Bun Lee
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

With the advent of various services and applications of Semantic Web, semantic annotation had emerged as an important research area. The use of semantically annotated ontology had been evident in numerous information processing and retrieval tasks. One of such tasks is utilizing the semantically annotated ontology in product design which is able to suggest many important applications that are critical to aid various design related tasks. However, ontology development in design engineering remains a time consuming and tedious task that demands tremendous human efforts. In the context of product family design, management of different product information that features efficient indexing, update, navigation, search and retrieval across product families is both desirable and challenging. This paper attempts to address this issue by proposing an information management and retrieval framework based on the semantically annotated product family ontology. Particularly, we propose a document profile (DP) model to suggest semantic tags for annotation purpose. Using a case study of digital camera families, we illustrate how the faceted search and retrieval of product information can be accomplished based on the semantically annotated camera family ontology. Lastly, we briefly discuss some further research and application in design decision support, e.g. commonality and variety, based on the semantically annotated product family ontology.
A power-effective scan architecture using scan flip-flops clustering and post-generation filling
Authors: Zhen Chen, Dong Xiang, Boxue Yin
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

In this paper, we propose a novel way to save test power, using the DFT based technique as basic method and post-generation filling as complementary. In this architecture, two methods of clustering flip-flops into scan chains are presented. One is clustering scan flip-flops into two parts to save capture power, and the other is clustering scan flip-flops of each part into scan chains to save shift power. By partitioning the scan flip-flops into two parts, the capture operation is cut into two sequential steps, which can effectively reduce the capture power. By partitioning flip-flops with common successors into one chain, we can make sure that, only one or a small part of scan chains are active during the shifting phase. For other scan chains, filling strategy is used as complementary method to further reduce test power. This architecture can effectively reduce the test time too. Experimental results show that average power reduction of 91.81% and average peak power reduction of 49.35% can be achieved, comparing to the ordinary full-scan architecture.
Model-checking Timed Temporal Logics
Authors: Patricia Bouyer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results.
Perceptible content retrieval in DCT domain and semi-fragile watermarking technique for perceptible content authentication
Authors: Chamidu Atupelage, Koichi Harada
Venue: WSEAS Transactions on Signal Processing (2008)

Digital watermarking was commenced to copyright protection and ownership verification of multimedia data. However the evolution of the watermark focused on different security aspects of multimedia data such as integrity and authenticity. Fragile and semi-fragile watermarking schemes were introduced to accomplish these requirements. In this paper, we propose semi-fragile watermarking scheme to authenticate visual content of the image. The proposed method is carried out in DCT domain and authenticating the particular number of low frequency coefficient, it achieves the integrity of the image. Since low frequency coefficients carry the essence of the visual data, authenticating only the low frequency data is adequate. Therefore the proposed technique is efficient than the others, which are processing in all DCT coefficients. Digital signature is generated by following the definition of elliptic curve digital signature algorithm (ECDSA). Thus, the scheme is faster than RSA based authentication definition and it provides high level of security and availability. Additionally our scheme localizes the compromised area of the image. Embedded and visual data are protected from quantization of JPEG by altering the quantization table. However the degradation of compression ratio due to alternation in quantization table has been evaluated. Experimental results show that the watermark does not make any visual artifact in original data and it gives evidence that compression ratio degradation is ignorable for average JPEG quality factors.
Measuring Proximity on Graphs with Side Information
Authors: Hanghang Tong, Huiming Qu, Hani Jamjoom
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

This paper studies how to incorporate side information (such as users' feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studied random walk with restart (RWR). The basic idea behind ProSIN is to leverage side information to refine the graph structure so that the random walk is biased towards/away from some specific zones on the graph. Our case studies demonstrate that ProSIN is well-suited in a variety of applications, including neighborhood search, center-piece subgraphs, and image caption. Given the potential computational complexity of ProSIN, we also propose a fast algorithm (Fast-ProSIN) that exploits the smoothness of the graph structures with/without side information. Our experimental evaluation shows that Fast-ProSIN achieves significant speedups (up to 49x) over straightforward implementations.
Design considerations for community portals in master-planned developments in Australia and Mexico
Authors: Marcus Foth, Victor M. Gonzalez, Kenneth L. Kraemer
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper presents a discussion of design considerations for community web portals as social networking systems. We analyse and compare the social interaction approach, design considerations and socio-technical requirements with regards to community portal technology employed in two master-planned urban developments in Australia and Mexico. We focus on how the human and social concepts and local contextualisations affect technology design and use. In response to our analysis, and to face the challenge of designing for variability and diversity, we present the communicative ecology model as a conceptual tool to help researchers and designers grasp the situated context and purpose of these systems in order to inform the design and development of better community technology.
Production Plannning and Control with SAP, 2nd edition
Authors: Jorg Thomas Dickersbach, Gerhard Keller, Klaus Weihrauch
Venue:  (2007)

This all-new, extended second edition provides readers with a detailed introduction to the tasks associated with industrial operations as well as highly detailed descriptions of the core processes of SAP PP (mySAP ERP 2005 Release). The various processes of discrete manufacturing are explained clearly in the following contexts: What are the business requirements? How can they be implemented using SAP? Which configuration steps are necessary and what are their effects? With step-by-step instruction and detailed, expert guidance, this book enables you to successfully implement and apply SAP PP in your own company. You ll also benefit from exclusive content devoted to exploring possible scenarios and the vast potential of mySAP SCM (APO) integration. The book is intended for consultants, implementation project teams, and employees involved in production. In addition, numerous real-world examples and a comprehensive glossary make this book a must-have reference.* Industrial Operations Tasks * Production Planning and Control in mySAP ERP * Organizational Structures * Master Data * Sales and Operations Planning * Demand Management * Material Requirements Planning * Long-Term Planning * Production Order Creation * Capacity Requirements Planning * Production Execution * Supply Chain Management and Integration with SAP APO
Transformer fault diagnosis method based on rough set and Bayesian otimal classifier
Authors: Hongsheng Su
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

According to intelligent complementary ideas, a new transformer fault diagnosis method is proposed based on rough set (RS) and Bayesian optimal classifier in this paper. Through RS reduction, the diagnostic decision table is simplified and fault symptoms information is compressed, and the minimal decision rules can be obtained. In light of the minimal decision rules, the complexity of Bayesian reasoning and difficulties of fault symptom acquisition are dramatically decreased. Moreover, probability reasoning may be realized by applying Bayesian optimal classifier, which can be used to describe the characteristics of fault information and investigate the fault reasons of transformer. In the end, a simulation example in transformer fault diagnosis indicates that the method is very effective and ubiquitous.
Privacy-preserving data publishing for cluster analysis
Authors: Benjamin C. M. Fung, Ke Wang, Lingyu Wang, Patrick C. K. Hung
Venue: Data Knowledge Engineering (2009)

Releasing person-specific data could potentially reveal sensitive information about individuals. k-anonymization is a promising privacy protection mechanism in data publishing. Although substantial research has been conducted on k-anonymization and its extensions in recent years, only a few prior works have considered releasing data for some specific purpose of data analysis. This paper presents a practical data publishing framework for generating a masked version of data that preserves both individual privacy and information usefulness for cluster analysis. Experiments on real-life data suggest that by focusing on preserving cluster structure in the masking process, the cluster quality is significantly better than the cluster quality of the masked data without such focus. The major challenge of masking data for cluster analysis is the lack of class labels that could be used to guide the masking process. Our approach converts the problem into the counterpart problem for classification analysis, wherein class labels encode the cluster structure in the data, and presents a framework to evaluate the cluster quality on the masked data.
Sixty Years of Stable Models
Authors: David Pearce
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Twenty years ago Michael Gelfond and Vladimir Lifschitz published their celebrated paper on the stable model semantics of logic programs. Today, having built on and enlarged those key ideas of twenty years ago, answer set programming (ASP) has emerged as a flourishing paradigm of declarative programming, rich in theoretical advances and maturing applications. This is one aspect of the legacy of stable models, and a very important one. Another aspect, equally important, but somewhat farther from the limelight today, resides in the ability of stable models to provide us with a valuable method of reasoning - to give it a name let us call it stable reasoning. In the full version of this essay I examine some of the foundational concepts underlying the approach of stable models. I try to answer the question: "What is a stable model?" by searching for a purely logical grasp of the stability concept. In so doing, I shall discuss some concepts and results in logic from around 60 years ago. In particular, I look at questions such as:How does a notion of stability presented in a work on intuitionistic mathematics in 1947 relate to the Gelfond-Lifschtiz concept of 1988?How does the notion of constructible falsity published in 1949 help to explain certain properties of negation arising in the language of ASP?Why is a seminal paper by McKinsey and Tarski, published in 1948, important for understanding the relations between answer sets and epistemic logic?
Limits of signal processing performance under thresholding
Authors: Holger Boche, Ullrich J. Mönich
Venue: Signal Processing (2009)

In this paper the reconstruction of bandlimited signals by sampling series is analyzed for the case where the samples of the signal are disturbed by the non-linear threshold operator. This operator sets all samples whose absolute value is smaller than some threshold to zero. It is shown that the reconstruction error can grow arbitrarily large, regardless of how small the threshold is chosen, when no oversampling is used. However, with oversampling, it is possible to upper bound the reconstruction error. Additionally, we consider the approximation of outputs of stable linear time-invariant systems, by sampling series that use only the samples that are larger than the threshold, and show that there exist stable linear time-invariant systems for which the approximation error is unbounded, even if oversampling is applied. Finally, we consider the case of non-equidistant sampling. It is possible to draw conclusions about the approximation behavior of the sampling series with threshold operator by analyzing the convergence behavior of the sampling series with permuted sampling points and without threshold operator. Since the latter does not have a good approximation behavior in general, we conjecture that the sampling series with non-equidistant samples and threshold operator has no good approximation behavior either.
Using augmented reality to promote an understanding of materials science to school children
Authors: Kevin T. W. Tan, Emma M. Lewis, Nick J. Avis, Philip. J. Withers
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

This paper considers the potential of Augmented Reality (AR) in schools focusing on learning about materials. We have developed tools that target different age groups of school children using the concept of AR. Our AR tools had made a good impression on a number of school teachers and we have received positive feedback during our preliminary AR tools trials at Family Days in the Museum of Science and Industry at Manchester, UK. We have now produced a set of evaluation forms for school pupils and teachers, and we will carry out further evaluation during our forth-coming Farnborough Air Show, Manchester Science Festival and school visits. The lessons learnt and evaluation results will prove useful in informing other AR tools developer particular for educational area.
Improved Bayesian Anti-Spam Filter Implementation and Analysis on Independent Spam Corpuses
Authors: Biju Issac, Wendy Japutra Jap, Jofry Hadi Sutanto
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Spam emails are causing major resource wastage by unnecessarily flooding the network links. Though many anti-spam solutions have been implemented, the Bayesian spam score approach looks quite promising. A proposal for spam detection algorithm is presented and its implementation using Java is discussed, along with its performance test results on two independent spam corpuses – Ling-spam and Enron-spam. We use the Bayesian calculation for single keyword sets and multiple keywords sets, along with its keyword contexts to improve the spam detection and thus to get good accuracy.
Using ontology in electronic evaluation for personalization of e-Learning systems
Authors: Iulian Pah, Florin Stoica, Laura F. Cacovean, Emil M. Popa
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The testing or the evaluation is a key element of the process learning. The modern techniques, the computers and the Internet, brought new tendencies in learning and evaluation. The distance is no more a problem so the relationship teacher-student is changed more and more. As a new signification of evaluation, we mention here about the self-evaluation, which can be achieved periodic or on the semester end of the discipline. The teacher can choose a type of evaluation and then creates a frame in which the student to be evaluated. In the paper is presented a solution for electronic evaluation, which can be easily adjusted to achieve the self-evaluation. Learning is a cognitive activity that differs from student to student. Most of the eLearning systems do not take into account individual aspects of students, ignoring the different needs that are specific to existing cognitive profiles. Students can have several cognitive styles [12], which makes the efficiency and efficacy of an eLearning system different with distinct students. We have developed an approach based on a dynamic student model (which comprises the student knowledge data) and ontology in order to personalize an eLearning system. The eLearning system will behave differently according to the student characteristics and performance, depending also on the concepts that the student knows.
Multi-sector antenna performance in dense wireless networks
Authors: Henrik Lundgren, Anand Prabhu Subramanian, Theodoros Salonidis, Marianna Carrera, Pascal Le Guyadec
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Sectorized antennas provide an attractive solution to increase wireless network capacity through higher spatial reuse. Despite their increasing popularity, the real-world performance characteristics of such antennas in dense wireless mesh networks are not well understood. In this demo, we demonstrate our multi-sector antenna prototypes and their performance through video streaming over an indoor wireless network in the presence of interfering nodes. We use our graphical tool to vary the sender, receiver, and interferer antenna configurations and the resulting performance is directly visible in the video quality displayed at the receiver.
Social electronic governance: re-visiting the redistribution question through coordinating relations between electronic governance and social goals
Authors: Jason Musyoka
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Historically, development theories have recognized the significance of technology for development. The post World War II decades were treated with arguments that utilized protechnology thinking as a kind of missing link in the then development agenda. However, the rise of neo -classical school from the 1980's onwards has altered the technology-development landscape, by introducing untraditional sets of institutional relations-in particular, reduction of the state, expansion of markets and generally curtailing the civil society. Electronic governance has ascended the world stage from within the neo-classical order. The implications being that market systems define the rules of the game as far as e-Governance operations are concerned. Inevitably, the expansive power allocated to markets by the neo-classical order has generated different forms of regulation, aimed at addressing social polarization. The need for regulation has long been advocated for, by Keynesian and other renowned theorists. By interrogating these sorts of issues, this paper established that e-Governance negotiates poorly with social goals in particular forms of regimes. In details, the study found that market economies with high levels of e-Governance registers high inequality levels, while mixed or social democracies on medium levels of e-Governance record better trends of social equality. Many developing countries fall under market economies, not by choice, but largely due to dysfunctional bureaucracies. The argument being that when bureaucracies dysfunction, market systems naturally take charge. On the above account, the study proposed that e-Governance could operate far better in social terms, if it is compartmentalized. It also suggested that e-Governance target human development initiatives at earlier rather than late stages.
Towards embedded runtime system level optimization for MPSoCs: on-chip task allocation
Authors: Theocharis Theocharides, Maria K. Michael, Marios Polycarpou, Ajit Dingankar
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Next generation multiprocessor systems-on-chip (MPSoCs) are expected to contain numerous processing elements, interconnected via on-chip networks, executing real-time applications. It is anticipated that runtime optimization algorithms which dynamically adjust system parameters with the purpose of optimizing the system's operation, will be embedded in the system software and/or hardware. In this paper, we present a methodology for simulating and evaluating system-level optimization algorithms, demonstrated by the case of on-chip dynamic task allocation applied to generic MPSoC architectures. Through this methodology, we are able to show that dynamic, system-level bidding-based task allocation can improve system performance, when compared to a round robin allocation, in popular MPSoC applications.