ppxscal/embedding_network huggingface dataset:
Trust Modelling in E-Commerce through Fuzzy Cognitive Maps
Authors: Christian Schläger, Günther Pernul
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Trust and its role in e-commerce is a major topic for researchers, clients, and service providers alike. However, questions of origin and practical usage of trust in e-commerce are still not answered. Two eminent obstacles in the integration of information on trust and reputation are limited data about customers, and a missing fine grained access control model. The first hindrance is shrinking as users generate personal data in the Web 2.0 as they go (or rather surf). The aim of this paper is to show potentials for e-commerce federations using an attribute-based authentication and authorisation infrastructure to use customer information for the derivation of metric trust and reputation values. Using Fuzzy Cognitive Maps and trust metrics, a prototype integrates a federation’s user data within an easy to use service provider interface for reputation management. To assure user privacy the data is categorised and stored distributedly.
Improving the performance of Federated Digital Library services
Authors: Jernej Trnkoczy, Vlado Stankovski
Venue: Future Generation Computer Systems (2008)

The number of Digital Libraries (DLs) accessible over the Open Archives Initiative-Protocol for Metadata Harvesting (OAI-PMH) has been constantly increasing in the past years. Earlier efforts in the DL area have concentrated on metadata harvesting and provisioning of value-added Federated Digital Library (FDL) services to the users. FDL services, however, have to meet significant performance and scalability requirements, which is difficult to achieve in centralized metadata harvesting systems. The goal of the present study was to evaluate the benefits of using Web Services Resource Framework (WSRF) compliant grid middleware infrastructure for providing efficient and reliable FDL services. The presented FDL application allows for parallel harvesting of OAI-PMH compliant DLs. The results show that this approach efficiently solves the performance related problems, while it also contributes to greater flexibility of the system. The quality of service is improved as metadata can be updated frequently, and the system does not exhibit a single point of failure.
Using an interactive software environment for the parallelization of real-world scientific applications
Authors: C. S. Ierotheou, H. Jin, G. Matthews, S. P. Johnson, R. Hood, P. F. Leggett
Venue: International Journal of Computer Mathematics (2007)

The parallelization of real-world compute intensive Fortran application codes is generally not a trivial task. If the time to complete the parallelization is to be significantly reduced then an environment is needed that will assist the programmer in the various tasks of code parallelization. In this paper the authors present a code parallelization environment where a number of tools that address the main tasks such as code parallelization, debugging and optimization are available. The ParaWise and CAPO parallelization tools are discussed which enable the near automatic parallelization of real-world scientific application codes for shared and distributed memory-based parallel systems. As user involvement in the parallelization process can introduce errors, a relative debugging tool (P2d2) is also available and can be used to perform nearly automatic relative debugging of a program that has been parallelized using the tools. A high quality interprocedural dependence analysis as well as user-tool interaction are also highlighted and are vital to the generation of efficient parallel code and in the optimization of the backtracking and speculation process used in relative debugging. Results of benchmark and real-world application codes parallelized are presented and show the benefits of using the environment.
Effective Code Generation for Distributed and Ping-Pong Register Files: A Case Study on PAC VLIW DSP Cores
Authors: Yung-Chia Lin, Chia Han Lu, Chung-Ju Wu, Chung-Lin Tang, Yi-Ping You, Ya-Chaio Moo, Jenq-Kuen Lee
Venue: Journal of Signal Processing Systems (2008)

The compiler is generally regarded as the most important software component that supports a processor design to achieve success. This paper describes our application of the open research compiler infrastructure to a novel VLIW DSP (known as the PAC DSP core) and the specific design of code generation for its register file architecture. The PAC DSP utilizes port-restricted, distributed, and partitioned register file structures in addition to a heterogeneous clustered data-path architecture to attain low power consumption and a smaller die. As part of an effort to overcome the new challenges of code generation for the PAC DSP, we have developed a new register allocation scheme and other retargeting optimization phases that allow the effective generation of high quality code. Our preliminary experimental results indicate that our developed compiler can efficiently utilize the features of the specific register file architectures in the PAC DSP. Our experiences in designing compiler support for the PAC VLIW DSP with irregular resource constraints may also be of interest to those involved in developing compilers for similar architectures.
Quantitative Assessment of Enterprise Security System
Authors: Ruth Breu, Frank Innerhofer-Oberperfler, Artsiom Yautsiukhin
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper we extend a model-based approach to security management with concepts and methods that provide a possibility for quantitative assessments. For this purpose we introduce security metrics and explain how they are aggregated using the underlying model as a frame. We measure numbers of attack of certain threats and estimate their likelihood of propagation along the dependencies in the underlying model. Using this approach we can identify which threats have the strongest impact on business security objectives and how various security controls might differ with regard to their effect in reducing these threats.
Small storm precipitation estimation using merged radar and gauging data
Authors: O. A. Kalinga, T. Y. Gan
Venue: International Journal of Remote Sensing (2007)

A small convective storm was grossly underestimated by both Mesonet rain gauge measurements and WSR-88D stage III radar rainfall data. However, if we merged radar data with the re-scaled gauged rainfall data using SOA and Haar wavelet schemes, results for both merged datasets are much better, especially that of Haar wavelet. It seems that by first scaling up the gauge measurements with an appropriate factor, Ko, we improve the accuracy of gauge measurements, which forms the basis for adjusting the depths of radar data, which by itself has already captured the spatial variability of precipitation but usually not its depth.
Generating Synthetic Data to Match Data Mining Patterns
Authors: Josh Eno, Craig W. Thompson
Venue: IEEE Internet Computing (2008)

Synthetic data sets can be useful for repeatable regression testing and for providing realistic — but not real — data to third parties for testing new software. In some cases, it is desirable that the synthetic data set be realistic, preserving various properties of the original data. Several synthetic data generators generate data that superficially matches known characteristics of data. This paper shows how to generate data that exhibits some of the same hidden patterns that can be discovered by data mining algorithms, in particular, decision tree patterns.
Simulation-Based Approaches Towards Congestion Problems
Authors: Teruaki Ito
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

A simulation-based approach provides a hint to study a solution to various problems. To show the feasibility of this approach in our research, this paper focuses on the congestion problems which can be found in various fields, including service counters at peak times, cafeteria at lunch times, road traffics in rush hours, and logistics control in a tight schedule. Ticket counter simulation was studied and implemented as a web-based simulation program. Human crowds control simulation and traffic simulation model were implemented with a general simulator, and evaluation on these models were studied to propose a solution to the congestion problems. Logistics control simulation was studied using an agent-based framework. Reviewing all of these application examples, this paper shows how the simulation-based approaches work towards congestion problems.
Run-time instruction set selection in a transmutable embedded processor
Authors: Lars Bauer, Muhammad Shafique, Jörg Henkel
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We are presenting a new concept of an application-specific processor that is capable of transmuting its instruction set according to non-predictive application behavior during run-time. In those scenarios, current (extensible) embedded processors are less efficient since they are not run-time adaptive. We have identified the instruction set selection to be a critical step to perform at run time and hence we focus this paper on that crucial part. Our paradigm conducts as many steps as possible at compile/design time and as little as necessary at run time with the constraint to provide a sufficient flexibility to react to non-predictive application behavior efficiently. We provide an in-depth analysis of our scheme and achieve a speed-up of up to 7.19x (average: 3.63x) compared to state-of-the-art adaptive approaches (like [19]). As an application, we have employed a whole H.264 video encoder though our scheme is by principle applicable to many other embedded applications. Our results are evaluated by an implementation of the instruction set selection for our transmutable processor on an FPGA platform.
Issues with representing software architectures in the unified modeling language
Authors: Sasa Baskarada
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

This paper shows how the Unified Modeling Language (UML) can be used to model software architectures effectively. Software architectures represent high-level views of systems and therefore allow developers to concentrate on the big picture rather than on low-level details [13]. They are also one of the best approaches to consider non-functional requirements early in the development process [1]. However, there is no standard definition of software architecture [17]. There is no agreement yet on how they should be modeled either. Therefore, software architectures are often described informally (using arrows, lines and boxes). Standardizing the notation, by using UML as a modeling tool, would reduce the ambiguity and make software architecture modeling easier for practitioners. A number of Architecture Description Languages (ADLs) already exist, which can be used to model software architectures. However, the software architecture community does not yet agree on what features should be present in an ADL, or precisely what these features should model [6]. Furthermore, there exists no common definition of the term Architecture Description Language either [17]. A large number of ADLs have been proposed as well and each of them takes a particular approach to the modeling of architectures [14]. This is one more reason why a standard modeling notation is needed. UML is already widely used for software analysis & design and it could also be a very useful tool for software architecture modeling. By modeling the CommPOS software architecture in UML, the paper shows how UML can be used to model component-based software architectures. However, further research into using UML for modeling of software architecture behaviors and dynamic software architectures is needed.
Microsoft Word 2007 Introduction Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Microsoft Office Word 2007. The following topics are covered: Creating, Opening & Saving Documents; Setting up the Page; Text Editing; Spacing between Paragraphs; Undo, Redo, and Repeat; Moving and Copying Text; Going to a Page; Going to the Next Table or Heading; Draft, Print Layout & Reading Views; Using Thumbnails; Using the Document Map. Formatting: Font, Size, Enhancements, Alignment; Copying Formatting; Using the Mini Toolbar; Highlighter; Creating and Editing Headers and Footers; No Header or Footer on the First Page, Spelling, Grammar, AutoCorrect; Quick Parts; Page Breaks; Printing Envelopes and Labels, Previewing and Printing; Sending the Document as an E-mail Attachment; Saving as PDF; and E-mailing a PDF. Also includes: Lists of Selection and Movement Shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
C-based design flow: a case study on G.729A for voice over internet protocol (VoIP)
Authors: Mehrdad Reshadi, Bita Gorjara, Daniel Gajski
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper we present the design of a G. 729a codec in a C-based design flow. The codec is used in VoIP applications for sending speech over internet protocol. We started from the standard reference C implementation and generated several customized designs using the NISCT C-to-RTL toolset. Our final designs could run at very low clock frequencies (11 MHz for the decoder and 30 MHz for the coder) while meeting the timing requirements of the standard. We present these designs and the corresponding C-based design flow in this paper.
Genetic networks: processing data, regulatory network modelling and their analysis
Authors: M. T. Thai, Z. Cai, D. Z. Du
Venue: Optimization Methods Software (2007)

Recent advances in post-genomic biology are enabling us to investigate and reconstruct the precise gene interaction networks. Inferring genetic networks from a large-scale expression data is very important to understand the underlying biological systems. Thus in this paper, we review the state of the art in genetic network research field. First we focus on the latest techniques developed for processing raw expression data for reconstructing genetic networks. We next discuss a number of significant impacting factors of regulatory networks. Third, we present several popular models for inferring genetic networks and analyse the advantages and disadvantages of each model.
Issues and Challenges in Teaching SE, IT, IS and EC
Authors: Kum Leng Chin
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Teaching and learning for the degrees of Software Engineering (SE), Computer Science (CS), InformationTechnology (IT), Information Systems (IS) and Electronic Commerce (EC), with recent trends in Business IT, Management of Information Systems (MIS) or Information Communication Technology (ICT) and so forth are often confused by staff and students. These new disciplines, which have emerged over the last 30 years, strongly overlap each other [4]. New disciplines like IS and EC are not clearly definedand are often confused with other related fields such asCS, CE and SE [1]. The lack of standard curriculum amongst Australian IT, IS and EC programmes adds further confusion to the CS and SE programmes. Professional bodies such as IEEE, ACM, AIS and the like have been developing model curricula as a guide for universities that wish to obtain accreditation for their CS, SE and IT / IS courses. They normally make up core topics and a list of electives that are guided by intended SE, CS, IT, IS and EC career tracks.The purpose of this study is to perform a comparative analysis of USA, UK and Australian academic programmes against the proposed curriculum structure. It is envisage that the result of this study will provide a baseline in guiding curriculum evaluation and revision for Australian and international universities’ computing and IT related courses. Education in the computing / IT related areas are currently facing the global challenges of declining interest, low student enrolment and the increasing demand of computing / IT skilled workers in industry and commerce. The disappearance of CS, SE, IS intoScience, IT or Electrical Engineering add confusionfor prospective students and industry employers. The disciplines of SE, CS, IT, IS and EC, are now facingthe increasing challenges in survival, and they need tobe clearly re-defining themselves in order to survive into the 2020s [4]. This paper describes the issues and challenges in teaching and learning these disciplinesand identifies the possible causes and possible sustainable solution for ICT educators.
Possibilistic regression in false-twist texturing
Authors: S. M. Taheri, H. Tavanai, M. Nasiri
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

A possibilistic linear regression, i.e. a linear regression with possibilistic coefficients, is explained. The application of such possibilistic regression method for modeling of twist liveliness of false twist textured nylon yarns as a function of percentage retraction has been studied, based on a few available data. It turns out that possibilistic regression method is superior to conventional statistical regression, when a very small number of observations are available. In such cases the basic assumptions, under which statistical regression analysis is valid, can not be investigated. Based on some criterions, such as the total vagueness of models and the mean of predictive capabilities, the optimum fuzzy model has been derived.
Symbolic and Abstract Interpretation for C/C++ Programs
Authors: Helge Löding, Jan Peleska
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We present a construction technique for abstract interpretations which is generic in the choice of data abstractions. The technique is specialised on C/C++ code, internally represented by the GIMPLE control flow graph as generated by the gcc compiler. The generic interpreter handles program transitions in a symbolic way, while recording a history of symbolic memory valuations. An abstract interpreter is instantiated by selecting appropriate lattices for the data types under consideration. This selection induces an instance of the generic transition relation. All resulting abstract interpretations can handle pointer arithmetic, type casts, unions and the aliasing problems involved. It is illustrated how switching between abstractions can improve the efficiency of the verification process. The concepts described in this paper are implemented in the test automation and static analysis tool RT-Tester which is used for the verification of embedded systems in the fields of avionics, railways and automotive control.
Patent classifications as indicators of intellectual organization
Authors: Loet Leydesdorff
Venue: Journal of the American Society for Information Science and Technology (2008)

Using the 138,751 patents filed in 2006 under the Patent Cooperation Treaty, co-classification analysis is pursued on the basis of three- and four-digit codes in the International Patent Classification (IPC, 8th ed.). The co-classifications among the patents enable us to analyze and visualize the relations among technologies at different levels of aggregation. The hypothesis that classifications might be considered as the organizers of patents into classes, and therefore that co-classification patterns&mdash;more than co-citation patterns&mdash;might be useful for mapping, is not corroborated. The classifications hang weakly together, even at the four-digit level; at the country level, more specificity can be made visible. However, countries are not the appropriate units of analysis because patent portfolios are largely similar in many advanced countries in terms of the classes attributed. Instead of classes, one may wish to explore the mapping of title words as a better approach to visualize the intellectual organization of patents. &copy; 2008 Wiley Periodicals, Inc.
Minimum k-way cuts via deterministic greedy tree packing
Authors: Mikkel Thorup
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We present a simple and fast deterministic algorithm for the minimum k-way cut problem in a capacitated graph, that is, finding a set of edges with minimum total capacity whose removal splits the graph into at least k components. The algorithm packs O(mk3 log n) trees. Each new tree is a minimal spanning tree with respect to the edge utilizations, and the utilization of an edge is the number of times it has been used in previous spanning trees divided by its capacity. We prove that each minimum k-way cut is crossed at most 2k-2 times by one of the trees. We can enumerate all such cuts in ~O(n2k) time, which is hence the running time of our algorithm producing all minimum k-way cuts. The previous fastest deterministic algorithm of Kamidoi et al. [SICOMP'06] took O(n(4+o(1))k) time, so this is a near-quadratic improvement. Moreover, we essentially match the O(n(2-o(1))k) running time of the Monto Carlo (no correctness guarantee) randomized algorithm of Karger and Stein [JACM'96].
Symmetric Active/Active High Availability for High-Performance Computing System Services: Accomplishments and Limitations
Authors: C. Engelmann, S. L. Scott, C. Leangsuksun, X. He
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

This paper summarizes our efforts over the last 3-4 years in providing symmetric active/active high availability for high-performance computing (HPC) system services. This work paves the way for high-level reliability, availability and serviceability in extreme-scale HPC systems by focusing on the most critical components, head and service nodes, and by reinforcing them with appropriate high availability solutions. This paper presents our accomplishments in the form of concepts and respective prototypes, discusses existing limitations, outlines possible future work, and describes the relevance of this research to other, planned efforts.
On the evolution of the yahoo! answers QA community
Authors: Yandong Liu, Eugene Agichtein
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

While question answering communities have been gaining popularity for several years, we wonder if the increased popularity actually improves or degrades the user experience. In addition, automatic QA systems, which utilize different sources such as search engines and social media, are emerging rapidly. QA communities have already created abundant resources of millions of questions and hundreds of millions of answers. The question whether they will continue to serve as an effective source is of information for web search and question answering is of vital importance. In this poster, we investigate the temporal evolution of a popular QA community - Yahoo! Answers, with respect to its effectiveness in answering three basic types of questions: factoid, opinion and complex questions. Our experiments show that Yahoo! Answers keeps growing rapidly, while its overall quality as an information source for factoid question-answering degrades. However, instead of answering factoid questions, it might be more effective to answer opinion and complex questions.