ppxscal/embedding_network huggingface dataset:
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
Authors: Pritam Roy, David Parker, Gethin Norman, Luca de Alfaro
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

In this paper, we combine abstraction-refinement and symbolic techniques to fight the state-space explosion problem when model checking Markov Decision Processes (MDPs). The abstract-refinement technique, called "magnifying-lens abstraction" (MLA), partitions the state-space into regions and computes upper and lower bounds for reachability and safety properties on the regions, rather than the states. To compute such bounds, MLA iterates over the regions, analyzing the concrete states of each region in turn - as if one was sliding a magnifying lens across the system to view the states. The algorithm adaptively refines the regions, using smaller regions where more detail is required, until the difference between the bounds is below a specified accuracy. The symbolic technique is based on Multi-Terminal Binary Decision Diagrams (MTBDDs) which have been used extensively to provide compact encodings of probabilistic models. We introduce a symbolic version of the MLA algorithm, called "symbolic MLA", which combines the power of both practical techniques when verifying MDPs. An implementation of symbolic MLA in the probabilistic model checker PRISM and experimental results to illustrate the advantages of our approach are presented.
RST Invariant Wavelet-Based Image Watermarking Using Template Matching Techniques
Authors: F. Motallebi, H. Aghaeinia
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Securing any type of multi media data by digital watermarking techniques has gained publicity as a curtail issue for research in the present word. To meet certain market requirements a thorough research work was carried out, the findings of which is presented in this paper. The undertaken procedure has been based on proposing a new image-watermarking algorithm to overcome the RST attacks. The so-called Fourier domain for embedding a template has been employed and the watermark has embedded in Wavelet domain. LPM domain and phase information of the image were used to determine RST attacks. Verifying experiments prove that this algorithm leads to acceptable results with a little computational complexity.
A Dialog Management Methodology Based on Neural Networks and Its Application to Different Domains
Authors: D. Griol, L. F. Hurtado, E. Segarra, E. Sanchis
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper, we present a statistical approach for dialog management within the framework of two different domains. The dialog model, that is automatically learned from a data corpus, is based on the use of a classification process to generate the next system answer. A neural network classifier is used for the selection process. This methodology has been applied in a spoken dialog system that provides railway information. The definition of an extended methodology that takes into account new system functionalities and its application for developing a dialog system for booking sports facilities is also described.
An Introduction to PHP for Scientists and Engineers: Beyond JavaScript, 1 edition
Authors: David R. Brooks
Venue:  (2008)

PHP, originally created in 1994 as a Personal Home Page tool, is a server-side programming language that can be used to solve numerous computing problems that a client-side language like JavaScript cannot. This highly useful text/reference presents key information needed to write your own online science and engineering applications, including reading, creating and manipulating data files stored as text on a server, thereby overcoming the limitations of a client-side language. This book focuses on those elements of the language - such as file input/output, arrays, built-in math functions, and user-created functions - that are essential for solving a wide range of scientific/engineering computing problems. It assumes a working knowledge of HTML, programming concepts, and JavaScript, C or a similar language. Features: - Offers a working knowledge of PHP, essential for server-side programming, - Includes detailed code examples to guide the reader, - Contains several complete applications that show how to take advantage of server-side programming capabilities, - Extremely accessible, and ideal for self-study, - Provides an author-supported supplementary website containing code examples (www.pages.drexel.edu/~brooksdr/DRB_web_page/BookCode/PHPBookCode.htm), - Directly addresses the needs of engineers, scientists and working professionals by explaining precisely those components of PHP required. This concise applications-oriented text is an exceptional shortcut to learning the essentials of PHP and is ideal for self-study or course use. Dr. Brooks has authored several successful Springer titles, including: Problem Solving with Fortran 90 for Scientists and Engineers; C Programming: The Essentials for Engineers and Scientists; and An Introduction to HTML and JavaScript for Scientists and Engineers.
OO in One Sentence: Keep It DRY, Shy, and Tell the Other Guy
Authors: Andy Hunt, Dave Thomas
Venue: IEEE Software (2004)

Some people feel that "getting" object-oriented programming is a difficult, time-consuming process. But does it need to be that hard? And is the difficulty even specific to OO programming? Many of the cornerstones of OO programming benefit other programming paradigms as well. Even if you're writing shell scripts or batch files, you can use these techniques to great advantage.
Applied Parallel Computing
Authors: Hector Zenil Chavez
Venue: IEEE Distributed Systems Online (2004)

A review of Sourcebook of Parallel Computing, edited by Jack Dongarra, Ian Foster, Geoffrey Fox, William Gropp, Ken Kennedy, Linda To rczon, and Andy White.
Taxonomy of architectural style usage
Authors: Simon Giesecke
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

A taxonomy of architectural style usage is introduced, which serves to design new (agile or heavy-weight) software development methods that employ architectural styles. We use the term "architectural styles" to refer to high-level design patterns. We identified five major usages: ad-hoc, platform-oriented, customized, pre-modeling and post-documentation/analysis. In addition generic and reference architectures are compared to architectural styles based on their usage. Finally, a classification of these usages is presented that discusses the dimensions compositionality, specialization, explication/rigor, conceptual level, relationship to system quality attributes, and the suitability for architectural design exploration.
Screen codes: visual hyperlinks for displays
Authors: John P. Collomosse, Tim Kindberg
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

We present 'Screen codes' - a space- and time-efficient, aesthetically compelling method for transferring data from a display to a camera-equipped mobile device. Screen codes encode data as a grid of luminosity fluctuations within an arbitrary image, displayed on the video screen and decoded on a mobile device. These 'twinkling' images are a form of 'visual hyperlink', by which users can move dynamically generated content to and from their mobile devices. They help bridge the 'content divide' between mobile and fixed computing.
Observing Performance Dynamics Using Parallel Profile Snapshots
Authors: Alan Morris, Wyatt Spear, Allen D. Malony, Sameer Shende
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Performance analysis tools are only as useful as the data they collect. Not just accuracy of performance data, but accessibility, is necessary for performance analysis tools to be used to their full effect. The diversity of performance analysis and tuning problems calls for more flexible means of storing and representing performance data. The development and maintenance cycles of high performance programs, in particular, stand to benefit from exploration of and expansion of the means used to record and describe program execution behavior. We describe a means of representing program performance data via a time or event delineated series of performance profiles, or profile snapshots, implemented in the TAU performance analysis system. This includes an explanation of the profile snapshot format and means of snapshot analysis.
RFID Privacy Workshop: Concerns, Consensus, and Questions
Authors: Stephen A. Weis
Venue: IEEE Security and Privacy (2004)

Radio frequency identification devices (RFID) are at the center of much debate and controversy. Backers have hyped them as a godsend to supply-chain efficiency, while some privacy advocates have labeled RFID as the "worst thing that ever happened to consumer privacy."A group of technologists, industry proponents, academics, and privacy advocates gathered for the RFID Privacy Workshop at the Massachusetts Institute of Technology on 15 November 2003 to discuss privacy issues in RFID systems.
Quantum Key Distribution Based on Multi-qubit Hadamard Matrices
Authors: Dazu Huang, Zhigang Chen
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

A deterministic one-step quantum key distribution scheme is proposed based on multi-qubit Hadamard matrices. In our proposed scheme, the secret key, which is encoded and decoded by using multi-qubit Hadamard transform, is deterministic. In addition, we also discuss in some detail how this protocol must be carefully designed for correcting errors and checking eavesdropping. This protocol is secure under the well-known assumption that the classical channel cannot be modified. It also has an advantage of not exchanging any other classical information except for eavesdropping check.
Public Key Encryption with Keyword Search Revisited
Authors: Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The public key encryption with keyword search (PEKS) scheme, proposed by Boneh, Di Crescenzo, Ostrovsky and Persiano, enables one to search for encrypted keywords without compromising the security of the original data. In this paper, we address two important issues of a PEKS scheme, "removing secure channel" and "refreshing keywords", which have not been considered in Boneh et al.'s paper. We point out the inefficiency of the original PEKS scheme due to the use of the secure channel. We resolve this problem by constructing an efficient PEKS scheme that removes a secure channel. We then argue that care must be taken when keywords are used frequently in the PEKS scheme as this situation might contradict the security of PEKS.
Are Model-Based Clustering and Neural Clustering Consistent? A Case Study from Bioinformatics
Authors: Davide Bacciu, Elia Biganzoli, Paulo J. Lisboa, Antonina Starita
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

A novel neural network clustering algorithm, CoRe, is benchmarked against previously published results on a breast cancer data set and applying the method of Partition Around Medoids (PAM). The data serve to compare the samples partitions obtained with the neural network, PAM and model-based algorithms, namely Gaussian Mixture Model (GMM), Variational Bayesian Gaussian Mixture (VBG) and Variational Bayesian Mixtures with Splitting (VBS). It is found that CoRe, on the one hand, agrees with the previously published partitions; on the other hand, it supports the existence of a supplementary cluster that we hypothesize to be an additional tumor subgroup with respect to those previously identified by PAM.
Optimization Algorithm for Scalar Multiplication in the Elliptic Curve Cryptography over Prime Field
Authors: Yuanling Hao, Shiwei Ma, Guanghua Chen, Xiaoli Zhang, Hui Chen, Weimin Zeng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Elliptic curve cryptography (ECC) is a major public-key cryptosystem standard in data security systems due to its high strength of security. But its application was limited because of the constraint of its speed. Therefore, it is much necessary to develop efficient method for ECC implementation. In this paper, the efficient algorithm for scalar multiplication in ECC was discussed and the corresponding comparative results were given. An optimization technique based on sliding-window non-adjacent form (NAF-Window) algorithm for the high-speed operation of point doubling and point addition over prime fields in ECC system were proposed. The results of numerical tests and performance comparisons manifested that the proposed algorithm can remarkably improve the computational efficiency of scalar multiplication. Hence, it has practical significance for the implementation of ECC and is expected to be applied to data security.
Optimal Control of Patient Admissions to Satisfy Resource Restrictions
Authors: Lalit Garg, Sally McClean, Brian Meenan, Peter Millard
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

An effective admission policy is an essential part of successful management of a patient care system. This admission policy should consider the future availability of resources, e.g. number of beds or budgets available. All possible pathways through the whole patient care system need to be identified to better understand the process dynamics of a care system. In the current paper we show how such patient pathways can be used to predict the care resource requirements in the future. The patient pathways, developed using Markov chain modelling, are used to design an appropriate admission policy to meet future resource availability for the care system. We demonstrate an application of control theory to manage current admission rates to meet future scarce budgetary resource availability. This model can also be used to estimate the effect of an admission policy. Geriatric Patients' data from a London hospital are used to illustrate the approach. An optimization technique is also presented to reduce the implementation complexity and time.
Pre-filling Based on Community for Sparsity in Collaborative Filtering
Authors: Li Yu, Zhaoli Meng, Rong Wang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Collaborative filtering is a key technique in recommender system and applied widely in E-commerce. In reality, due to data sparseness, similarity of users is computed wrongly, which results that really similar users maybe filtered out while false similar users are exploited to produce recommendation. In this paper, two pre-filling methods based on community, respectively simple pre-filling based on community (PFCI) and pre-filling based on community association (PFCII) are presented to overcome the sparsity. If user-item pair is null, its rating is pre-filling by using our method before traditional collaborative filtering is executed. The experiment shows better performance of our methods.
The Who, What, Why, Where, and When of IT Outsourcing
Authors: Phillip A. Laplante, Tom Costello, Pawan Singh, Sudi Bindiganavile, Mark Landon
Venue: IT Professional (2004)

The decision to outsource depends on several factors that need to be carefully addressed before taking the plunge.
Evaluation of Security Lifecycle for the Quantitative Analysis
Authors: Kim Young Jip, Eun-Ser Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper is intended to evaluate security lifecycle and efficiency in ISO/IEC 15408, Common Criteria. There are many risk items that cause the security requirement problems during software development. This paper evaluates the efficiency of security lifecycle that detection of new risk items and remove ratio at the security requirement lifecycle. For the similar domain projects, we can remove security risk items and manage to progress them by using security lifecycle, which can greatly improve the software process.
The ethical dilemma of internet pornography in the state of Kuwait
Authors: Hasan A. Abbas, Salah M. Fadhli
Venue: ACM SIGCAS Computers and Society (2008)

The necessity of having effective and socially sound networks is trivial. It is clear that information technology (IT) is now a necessary tool that has well understood advantages. The same technology carries negative side-effects. It is our social and ethical duty to examine the possibly negative side effects of IT, especially as IT becomes prevalent in a conservative society such as Kuwait. In our research Kuwait forms a case study as we try to understand what ethical theories underlie the attitude toward one problematic aspect of IT, online pornography, in Muslim/Arab societies. In this paper we review several ethical theories and then present the results of experimental research aimed at determining the concepts that underlie the Kuwaiti response to pornography online.
A probabilistic alternative to regression suites
Authors: Shady Copty, Shai Fine, Shmuel Ur, Elad Yom-Tov, Avi Ziv
Venue: Theoretical Computer Science (2008)

Automated regression suites are essential in developing large applications, while maintaining reasonable quality and timetables. The main argument against the automation of regression suites, in addition to the cost of creation and maintenance, is the observation that if you run the same test many times, it becomes increasingly less likely to find bugs. To alleviate such problems, a new regression suite practice, using random test generators to create regression suites on-the-fly, is becoming more common. In this practice, instead of maintaining tests, we generate test suites on-the-fly by choosing several specifications and generating a number of tests from each specification. We describe techniques for optimizing random generated test suites. We first show how the set cover greedy algorithms, commonly used for selecting tests for regression suites, may be adapted to selecting specifications for randomly generated regression suites. We then introduce a new class of greedy algorithms, referred to as future-aware greedy algorithms. The algorithms are computationally efficient and generate more effective regression suites.
Social heroes: games as APIs for social interaction
Authors: Adam Simon
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Social Heroes is a pervasive social game in which players trade points by tagging each other using Twitter. Through the accumulation of tags and points in defined combinations, they earn achievement awards and gain the ability to create their own tags and achievements. Taking the metaphor of APIs from software development and drawing parallels between the way we model game state, Social Heroes attempts to provide a ludic interface for our personal relationships. The result is a system for social play surrounding identity, relationships, and communication.
Applying Ontology Design Patterns in Bio-ontologies
Authors: Mikel Egaña, Alan Rector, Robert Stevens, Erick Antezana
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Biological knowledge has been, to date, coded by biologists in axiomatically lean bio-ontologies. To facilitate axiomatic enrichment, complex semantics can be encapsulated as Ontology Design Patterns (ODPs). These can be applied across an ontology to make the domain knowledge explicit and therefore available for computational inference. The same ODP is often required in many different parts of the same ontology and the manual construction of often complex ODP semantics is loaded with the possibility of slips, inconsistencies and other errors. To address this issue we present the Ontology PreProcessor Language (OPPL), an axiom-based language for selecting and transforming portions of OWL ontologies, offering a means for applying ODPs. Example ODPs for the common need to represent "modifiers" of independent entities are presented and one of them is used as a demonstration of how to use OPPL to apply it.
A mobile knowledge management decision support system for automatically conducting an electronic business
Authors: W. Wen, Y. H. Chen, H. H. Pao
Venue: Knowledge-Based Systems (2008)

This paper presents a mobile knowledge management decision support system using multi-agent technology for automatically providing efficient solutions for decision making and managing an electronic business. The architecture consists of a user interface, an assignment agent, a knowledge reasoning agent, a search agent, a knowledge base, a database, and a model base. The knowledge reasoning agent selects appropriate rules from the knowledge base and uses the facts in the database to reason out suitable solutions, which match better effectiveness via a foreword chaining reasoning method. Furthermore, to provide instant management and control, we have developed an automatic agent to manually or periodically monitor managerial problems using knowledge rules. In addition, the system makes use of ASP combined with Visual Basic to build the functions so that the system is easily implemented., We have also designed a user transparency approach to modify all vital rules, if necessary, without revising the program source codes, so that users can easily manage the knowledge base. Users can modify, add, or drop their latest knowledge rules from the system. When new knowledge is introduced, the system is able to automatically evaluate accurate actions or alternatives for conducting an electronic business. Finally, for the purpose of improving financial management, a neural network is used for predicting future financial measures.
Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Venue: SIGGRAPH/EUROGRAPHICS Conference On Graphics Hardware (2008)

Welcome to Graphics Hardware 2008, the premier venue for research and development on high-performance graphics hardware and its applications. This is the 23rd event in a sequence of successful conferences and workshops, which this year was held on 20--21 June 2008 in Sarajevo, Bosnia and Herzegovina. For many years we have colocated this conference with ACM SIGGRAPH or Eurographics. Because Eurographics has moved to the spring, beginning this year, and because of our desire to hold Graphics Hardware in the summer, we are pleased to partner this year with the Eurographics Symposium on Rendering. Next year we will return to the US and colocate our conference with ACM SIGGRAPH in New Orleans in August. This year we received a strong pool of 32 paper submissions. These were carefully considered by our 37 program committee members, plus additional reviewers. At the end we selected 11 high-quality papers for presentation at the conference and for publication in these proceedings.