ppxscal/embedding_network huggingface dataset:
Information Privacy and Trust in Government: a citizen-based perspective from New Zealand
Authors: Rowena Cullen, Patrick Reilly
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Increasing use of e-government has raised issues about the privacy of information provided by citizens to government. This paper explores the experiences and concerns of New Zealanders in relation to information privacy, and the impact of these concerns on the trust they place in government. A series of focus groups were conducted among a range of community groups. The findings reflect a range of attitudes about information privacy and the trustworthiness of government, and centre around two major themes: the use of technology and concerns about the competency of and practices of government employees. Most respondents were unaware of their existing protections; preferred face to face communication; had low levels of confidence in the privacy of online communication but made use of it for convenience sake; had greater confidence in government than in commercial organizations but made distinctions between individual agencies. Breaches of privacy were shown to have a negative impact on trust in government.
Model-Based Data Processing with Transient Model Extensions
Authors: Michael Thonhauser, Gernot Schmoelzer, Christian Kreiner
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Software is often constructed using a layered approach to encapsulate the functionality in different layers. Individual requirements of each layer demand layer specific data structures. These data structures typically provide redundant information with respect to the data source. Providing a Model Driven Software Development approach for creating these data structures leads to overlapping data models, each containing data structures defined by the data source. Because putting all various requirements of the software layers in a single data model can lead to difficulties, each software layer should only extend the basic data source model with its specifically needed model elements. This paper presents a mechanism for transient extension of a data model. Using this mechanism, a basic data model can be used by every layer, being extended by additional attributes and classes for satisfying layer specific requirements.
Cache conscious Walsh-Hadamard transform
Authors: Neungsoo Park
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The Walsh-Hadamard Transform (WHT) is an important algorithm in signal processing because of its simplicity. However, in computing large size WHT, non-unit stride access results in poor cache performance leading to severe degradation in performance. This poor cache performance is also a critical problem in achieving high performance in other large size signal transforms. We develop a cache friendly technique that improves the performance of large size WHT. In our approach, data reorganization is performed between computation stages to reduce cache pollution. Furthermore, we develop an efficient search algorithm to determine the optimal factorization tree based upon problem size and stride access in the decomposition. Experimental results show that our approach achieves up to 180% performance improvement over the state of the art package on Alpha 21264 and MIPS R10000. In addition, the proposed optimization is applicable to other signal transforms and is portable across various platforms.
Simulation of boron diffusion in Si and strained SiGe layers
Authors: R. Kinder, F. Schwierz, P. Beňo, J. Geíner
Venue: Microelectronics Journal (2007)

Boron outdiffusion from the base into the emitter and collector caused by annealing in SiGe heterobipolar transistors (HBTs) has a serious influence on the transit frequency. One solution of the problem of boron outdiffusion is the creation of intrinsic spacers between the base, emitter and collector layers to prevent diffusion of boron across the heterointerface. For optimisation of SiGe HBT properties, several simulators are used. This paper presents a quantitative analysis of a SiGe HBT by process simulators SUPREM IV.GS and ISE TCAD-DIOS. Models for simulation of a boron-doped SiGe base of HBT are discussed and compared.
A new adaptive Runge-Kutta method for stochastic differential equations
Authors: A. Foroush Bastani, S. Mohammad Hosseini
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we will present a new adaptive time stepping algorithm for strong approximation of stochastic ordinary differential equations. We will employ two different error estimation criteria for drift and diffusion terms of the equation, both of them based on forward and backward moves along the same time step. We will use step size selection mechanisms suitable for each of the two main regimes in the solution behavior, which correspond to domination of the drift-based local error estimator or diffusion-based one. Numerical experiments will show the effectiveness of this approach in the pathwise approximation of several standard test problems.
Towards a theory of events
Authors: K. Mani Chandy, Michel. Charpentier, Agostino Capponi
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Event-driven systems are used in a wide range of applications such as responding to missile attacks, interdicting potential terrorists, exploiting arbitrage opportunities and responding to congestion in supply chains. The designs of event-driven systems vary widely because the costs and benefits to users of different applications are markedly different. This talk proposes a framework for unifying designs of different types of applications by representing the design problem as a constrained optimization and by defining interaction between components in distributed event-based systems in terms of a concept called "shared models." This talk is intended to suggest that there are concepts that unify analyses of a range of event-driven systems in nature, human social organizations and information technology systems.
The Insecurity Problem: Tackling Unbounded Data
Authors: Sibylle Froschle
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint four open problems in this category. The first two problems concern protocols with natural restrictions that any "realistic' protocol should satisfy while the second two concern protocols with disequality constraints. For protocols with disequality constraints we will prove: (1) Insecurity is decidable in NEXPTIME when bounding the size of messages and not requiring data to be freshly generated. (2) Insecurity is NEXPTIME-complete when bounding the size of messages and the number of freshly generated data used in honest sessions. This shows that unbounded data can be tackled in settings which do not trivially reduce to the case of bounded data. The second result is in contrast with a recently published proof, which appears to prove the same problem undecidable. We will point out why this proof cannot be considered to be valid.
Efficient decoding and training procedures for utterance verification in continuous speech recognition
Authors: E. Lleida, R. C. Rose
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

It is often necessary in speech recognition to include a mechanism for verifying decoded utterances in order to account for incorrectly decoded vocabulary words and utterances corresponding to words or sounds that are not included in a prespecified lexicon. This paper describes an utterance verification procedure for hidden Markov model (HMM) based continuous speech recognition that is based on a likelihood ratio (LR) criterion. There are two important contributions. The first is a search algorithm which directly optimizes a likelihood ratio criterion. This search algorithm is important because it allows decoding to be performed in speech recognition according to the same measure of confidence that is used in hypothesis testing. The second contribution is a corresponding training procedure for estimating model parameters which also directly optimizes the same likelihood ratio criterion. These techniques are applied to spontaneous spoken queries in the context of a "movie locator" dialog system.
Timeline: a high performance archive for a distributed object store
Authors: Chuang-Hue Moh, Barbara Liskov
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

This paper describes TimeLine, an efficient archive service for a distributed storage system. TimeLine allows users to take snapshots on demand. The archive is stored online so that it is easily accessible to users. It enables "time travel" in which a user runs a computation on an earlier system state. Archiving is challenging when storage is distributed. In particular, a key issue is how to provide consistent snapshots, yet avoid stopping user access to stored state while a snapshot is being taken. The paper defines the properties that an archive service ought to provide and describes an implementation approach that provides the desired properties yet is also efficient. TimeLine is designed to provide snapshots for a distributed persistent object store. However the properties and the implementation approach apply to file systems and databases as well. TimeLine has been implemented and we present the results of experiments that evaluate its performance. The experiments show that computations in the past run well when the archive store is nearby, e.g., on the same LAN, or connected by a high speed link. The results also show that taking snapshots has negligible impact on the cost of concurrently running computations, regardless of where the archived data is stored.
Combining Programmable Hardware and Web Services Technologies for Delivering High-Performance and Interoperable Security
Authors: Alessandro Cilardo, Luigi Coppolino, Antonino Mazzeo, Luigi Romano
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Information security is a key requirement in emerging networked scenarios, which typically involve a large variety of heterogeneous, often resource-constrained devices. Providing security to this emerging class of distributed applications raises a number of new challenges. This paper discusses such challenges with respect to two key security services, namely Public Key certification and digital timestamping, and presents a multi-tier architecture which combines a hardware-accelerated back-end and a Web Services based web tier to for achieving interoperability while boosting performance. The paper describes the organization of the multi-tier architecture, provides a detailed description of individual components, and presents the results of a thorough experimental campaign
Improving the trustworthiness of evidence derived from security trace files
Authors: Ennio Pozzetti, Vidar Vetland
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

Evidence is required to prosecute intruders in computer systems and networks. Reliable trace files are needed to obtain such evidence. Trace files normally contain vast amounts of data of which only small portions are useful as evidence. Use of temporary files during analysis of the data is dangerous because inconsistencies may be introduced in that way. Since one inconsistency is enough to reduce the trustworthiness of the evidence, it is of paramount importance to develop a consistent way to extract and analyze information from trace files. In this paper we suggest such a method accompanied by proper tool support. We conclude that the raw trace files should never be altered, not even for the purpose of making them readable. All extraction and purification should be the result of systematic application of data filters. The systematic use of filters should be repeatable so that anyone can apply the filters. Thus the filters document the process from raw traces to information used as evidence.
The Length of the Product Generation Life Cycle as a Moderator of Innovation Strategy: A Comparative Cross-Industry Study of Ten Leading Technology-Based Companies
Authors: Frances T. J. M. Fortuin, S. W. F. (Onno) Omta
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper aims at exploring the role of the product generation life cycle (PGLC) on differences in innovation strategy among industries in a cross-industry study of ten multinational technology-based companies, leaders in their respective industries. It is concluded, that the length of the PGLC is a fundamental contrasting variable for the way companies formulate, implement and execute their innovation strategies. Companies in long life cycle industries (LLCIs, PGLCs \ge 6 years) that face higher technology complexity, craft innovation strategies that are characterized by higher emphasis on exploration, and open innovation. The innovation strategies of companies in short life cycle industries (SLCIs, PGLCs \le 6 years) that face higher market uncertainty and dynamism, are more directed to exploitation, reflected in a higher level of in-house competency planning and cross-functional communication. Based on the findings it is advised that innovation managers take special notice of the PGLC(s) they are in.
A Model in κ for DNA Addition
Authors: Xian Xu, Xiaoju Dong, Yuxi Fu
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

DNA computing is a hot research topic in recent years. Formalization and verification using theories(@p-calculus, bioambients, @k-calculus and etc.) in Computer Science attract attention because it can help prove and predict to a certian degree various kinds of biological processes. Combining these two aspects, formal methods can be used to verify algorithms in DNA computing, including basic arithmetic operations if they are to be included in a DNA chip. In this paper, we first introduce a newly-designed algorithm for solving binary addition with DNA, which contributes to a unit in DNA computer processor, and then formalize the algorithm in @k-calculus(a formal method well suited for describing protein interactions) to show the correctness of it in a sense, and a sensible example is provided. Finally, some discussion on the described model is made, in addition to a few possible future improvement directions.
Transition of an innovative teaching approach between two institutions
Authors: R. V. Pieri
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. This presentation describes an effort in progress to transition an innovative teaching approach from one university setting to another. The innovative approach, developed at the United States Air Force Academy, resulted from a unique funding opportunity to team instructors, educational developers and content experts. The development started with nearly a clean sheet. Its setting was to be a combined statics and mechanics of materials course, the first engineering course taken by those students. The goal of the activity was to improve motivation and retention of entering engineering students, while also improving students' subject matter abilities and retention. 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
The Israeli summer seminars for CS leading teachers
Authors: Tami Lapidot, Dan Aharoni
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In this poster, we describe a four years experience of summer seminars for high-school computer-science (CS) leading teachers in Israel. The seminars featured encounters between CS researchers and teachers, as well as pedagogy based activities.
The Concentration of Fractional Distances
Authors: Damien Francois Vincent Wertz, Michel Verleysen
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Nearest neighbor search and many other numerical data analysis tools most often rely on the use of the euclidean distance. When data are high dimensional, however, the euclidean distances seem to concentrate; all distances between pairs of data elements seem to be very similar. Therefore, the relevance of the euclidean distance has been questioned in the past, and fractional norms (Minkowski-like norms with an exponent less than one) were introduced to fight the concentration phenomenon. This paper justifies the use of alternative distances to fight concentration by showing that the concentration is indeed an intrinsic property of the distances and not an artifact from a finite sample. Furthermore, an estimation of the concentration as a function of the exponent of the distance and of the distribution of the data is given. It leads to the conclusion that, contrary to what is generally admitted, fractional norms are not always less concentrated than the euclidean norm; a counterexample is given to prove this claim. Theoretical arguments are presented, which show that the concentration phenomenon can appear for real data that do not match the hypotheses of the theorems, in particular, the assumption of independent and identically distributed variables. Finally, some insights about how to choose an optimal metric are given.
Revisiting Negative Selection Algorithms
Authors: Zhou Ji, Dipankar Dasgupta
Venue: Evolutionary Computation (2007)

This paper reviews the progress of negative selection algorithms, an anomaly/change detection approach in Artificial Immune Systems (AIS). Following its initial model, we try to identify the fundamental characteristics of this family of algorithms and summarize their diversities. There exist various elements in this method, including data representation, coverage estimate, affinity measure, and matching rules, which are discussed for different variations. The various negative selection algorithms are categorized by different criteria as well. The relationship and possible combinations with other AIS or other machine learning methods are discussed. Prospective development and applicability of negative selection algorithms and their influence on related areas are then speculated based on the discussion.
Development of integrated learning modules for engineering technology students
Authors: S. Anwar
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

This paper describes a project currently in progress at Penn State Altoona. The project deals with the development of learning modules which will integrate various concepts from physics, mathematics, and engineering technology to provide students with a clear understanding of the usefulness of physics and mathematics in real-world engineering problems. Case studies derived from real-life situations will constitute a significant part of these modules. These learning modules will be suitable for use in a one-semester physics course for associate degree engineering technology students. Both EET and MET students will benefit from these modules.
The impacts of errors and delays on the performance of MPEG2 video communications
Authors: A. Mehaoua
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Transmission of MPEG2-encoded video is one of the most demanding applications in terms of network resources and QoS requirement. It needs high bandwidth with stringent transmission delays. It can not tolerate large variations on delays and it requires low error and loss data rates. Therefore, in order to design efficient integrated video communication systems over ATM networks, we propose in this paper to analyze the effects of errors and delays on both video signal and network performance.
The effects of signal-to-noise ratio mismatch on Bayesian matched-field source localization performance
Authors: S. L. Tantum
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

The signal-to-noise ratio of real data is rarely known with complete certainty. However, Bayesian matched-field processing techniques for ocean acoustic source localization often require the signal-to-noise ratio (SNR) to be known a priori. In this paper, the effects of SNR mismatch on the performance of a Bayesian matched-field source localization method, the optimum uncertain field processor (A.M. Richardson and L.W. Nolte, J. Acoust. Soc. Am. vol.89, no.5, 2280-4 (1991)), are investigated. Theoretical and empirical analyses show that when the maximum a posteriori (MAP) estimate is utilized as the source location estimate, the localization performance is unaffected by the uncertainty regarding the SNR, provided that the assumed SNR is sufficiently high.
Passive Worm Propagation Modeling and Analysis
Authors: Hanxun Zhou, Yingyou Wen, Hong Zhao
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

The target selection algorithm of passive worms makes them difficult to detect, and therefore they threaten the Internet greatly. Modeling the propagation of passive worms can provide profound insight into the passive worm behavior. In this paper we present a mathematical model named as the Passive Worm Propagation (PWP) model. Based on the two-factor model, it represents the propagation of passive worms. The simulation of the model indicates that the spread of passive worms is governed by the initial value of passive worms, the infectious rate of worms, the removal rate of worms and time delay. We also analyze the feasibility of passive worms as one kind of benign worms. To the best of our knowledge, there is no relevant model for the propagation of a passive worm. Therefore, we believe that this paper is the first attempt on modeling passive worms.
Limits of Multi-Discounted Markov Decision Processes
Authors: Hugo Gimbert, Wieslaw Zielonka
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, depending on the payoff function the MDP is equipped with. For example a mean-payoff function evaluates average performance, whereas a discounted payoff function gives more weights to earlier performance by means of a discount factor. Another well-known example is the parity payoff function which is used to encode logical specifications [14]. Surprisingly, parity and mean-payoff MDPs share two non-trivial properties: they both have pure stationary optimal strategies [4, 15] and they both are approximable by discounted MDPs with multiple discount factors (multi- discounted MDPs) [5, 15]. In this paper we unify and generalize these results. We introduce a new class of payoff functions called the priority weighted payoff functions, which are generalization of both parity and mean-payoff functions. We prove that priority weighted MDPs admit optimal strategies that are pure and stationary, and that the priority weighted value of an MDP is the limit of the multi-discounted value when discount factors tend to 0 simultaneously at various speeds.