ppxscal/embedding_network huggingface dataset:
Memetic: Semantic Meeting Memory
Authors: Danius Michaelides, Simon Buckingham Shum, Ben Juby, Clara Mancini, Roger Slack, Michelle Bachler, Rob Procter, Michael Daw, Andrew Rowley, Tim Chown, David De Roure, Terry Hewitt
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper introduces the Memetic toolkit for recording meetings held over Internet-based video conferencing technologies, and making these navigable in linear and nonlinear ways. We introduce the tools and technologies that form the toolkit and discuss the semantics of the information they capture.
On the power of simple branch prediction analysis
Authors: Onur Aciiçmez, Çetin Kaya Koç, Jean-Pierre Seifert
Venue: Proceedings of the 2nd ACM symposium on Information, computer and communications security (2007)

Very recently, a new software side-channel attack, called Branch Prediction Analysis (BPA) attack, has been discovered and also demonstrated to be practically feasible on popular commodity PC platforms. While the above recent attack still had the flavor of a classical timing attack against RSA, where one uses many execution-time measurements under the same key in order to statistically amplify some small but key-dependent timing differences, we dramatically improve upon the former result. We prove that a carefully written spy-process running simultaneously with an RSA-process, is able to collect during one single RSA signing execution almost all of the secret key bits. We call such an attack, analyzing the CPU's Branch Predictor states through spying on a single quasi-parallel computation process, a Simple Branch Prediction Analysis (SBPA) attack --- sharply differentiating it from those one relying on statistical methods and requiring many computation measurements under the same key. The successful extraction of almost all secret key bits by our SBPA attack against an openSSL RSA implementation proves that the often recommended blinding or so called randomization techniques to protect RSA against side-channel attacks are, in the context of SBPA attacks, totally useless. Additional to that very crucial security implication, targeted at such implementations which are assumed to be at least statistically secure, our successful SBPA attack also bears another equally critical security implication. Namely, in the context of simple side-channel attacks, it is widely believed that equally balancing the operations after branches is a secure countermeasure against such simple attacks. Unfortunately, this is not true, as even such "balanced branch" implementations can be completely broken by our SBPA attacks. Moreover, despite sophisticated hardware-assisted partitioning methods such as memory protection, sandboxing or even virtualization, SBPA attacks empower an unprivileged process to successfully attack other processes running in parallel on the same processor. Thus, we conclude that SBPA attacks are much more dangerous than previously anticipated, as they obviously do not belong to the same category as pure timing attacks.
Innovative collaborative learning and research environments in academia and government: developing the NCSA ACCESS center
Authors: M. B. Walker
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In April, 1999, the National Science Foundation (NSF)-sponsored National Computational Science Alliance (the Alliance) opened its new 7000 square foot advanced technology training and demonstration facility in the Washington, DC metropolitan area. Called the Alliance Center for Collaboration, Education, Science, and Software (ACCESS), it is a new technology transfer and learning mechanism for emerging and advanced technologies, high performance computing, communications, and information technologies. The paper discusses the development of this highly flexible facility for collaborative research and education for high performance computing (HPC) science and engineering users. The leading edge site for ACCESS and the alliance is the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champaign. ACCESS is staffed by NCSA. The paper discusses planning, designing and developing this innovative site, and meeting technological, aesthetic, spatial, and other challenges in setting up this multiple-use, multiple-partner center. It will make recommendations to those wishing to set up similar facilities.
Approximate solution of linear ordinary differential equations with variable coefficients
Authors: Xian-Fang Li
Venue: Mathematics and Computers in Simulation (2007)

In this paper, a novel, simple yet efficient method is proposed to approximately solve linear ordinary differential equations (ODEs). Emphasis is put on second-order linear ODEs with variable coefficients. First, the ODE to be solved is transformed to either a Volterra integral equation or a Fredholm integral equation, depending on whether initial or boundary conditions are given. Then using Taylor's expansion, two different approaches based on differentiation and integration methods are employed to reduce the resulting integral equations to a system of linear equations for the unknown and its derivatives. By solving the system, approximate solutions are determined. Moreover, an n th-order approximation is exact for a polynomial of degree less than or equal to n. This method can readily be implemented by symbolic computation. Illustrative examples are given to demonstrate the efficiency and high accuracy of the proposed method.
A comparison of methods for implementing adaptive security policies
Authors: Michael Carney, Brian Loe
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

The security policies for computing resources must match the security policies of the organizations that use them; therefore, computer security policies must be adaptive to meet the changing security environment of their user-base. This paper presents four methods for implementing adaptive security policies for architectures which separate the definition of the policy in a Security Server from the enforcement which is done by the kernel. The four methods discussed include • reloading a new security database for the Security Server, • expanding the state and security database of the Security Server to include more than one mode of operation, • implementing another Security Server and handing off control for security computations, and • implementing multiple, concurrent Security Servers each controlling a subset of processes. Each of these methods comes with a set of trade-offs: policy flexibility, functional flexibility, security, reliability, and performance. This paper evaluates each of the implementations with respect to each of these criteria. Although the methods described in this paper were implemented for the Distributed Trusted Operating System (DTOS) prototype, this paper describes general research, and the conclusions drawn from this work need not be limited to that development platform.
Security and Access of Health Research Data
Authors: Willy Susilo, Khin Than Win
Venue: Journal of Medical Systems (2007)

The objective of this study is to discover how to maximise the use of health research data without breaching the patient's confidentiality. To achieve this, we have examined available options identified in enhancing information security of health research data. It has been noted that there are gaps in information security for health research data. Our novel approach, searching through encrypted data is discussed in this paper.
Sequential extraction of components of multicomponent PPS signals
Authors: P. M. Oliveira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A procedure for parameter estimation of multicomponent polynomial phase signals is presented. This scheme, while restricted to high SNRs, has the advantage of being extremely simple. It is also insensitive to the equal-coefficient identifiability problem of the HAF (high-order ambiguity function) based methods. It poses, however, some restrictions on the component amplitudes. Its performance in noise is investigated, and confirmed with several examples.
Video Coding Based on Distributed Source Coding
Authors: Cristian Perra, Daniele D. Giusto
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Distributed video coding is a new paradigm for video compression. Practical distributed video coding are promising solutions for emerging applications. Nevertheless, more study and exploration is needed. This paper proposes an application of distributed source coding for video coding. While most of the solutions proposed in literature rely on an off-line model training the proposed solution is based on an on-line model training that exploits information from conventionally encoded frames.
Information Security Education and Foundational Research
Authors: Linda Morales, Melissa Dark
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The mini-track on Information Security Education and Foundational Research is a forum for the discussion of advances in two important areas of information security: education and basic research. The information security education area is concerned information security curriculum design at the national and institutional levels, innovative approaches to teaching information security, evaluations of existing approaches, emerging needs for information security curriculum, innovative approaches to faculty development and capacity building, challenges faced by institutions and programs, and other topics relevant to information security education. The fundamental research area is concerned with advances in the theory and foundations of information security such as new analytic results, mathematical developments and proofs. Topics covered in this category include cryptography and cryptographic protocols, mathematical analyses of secure computing systems, foundations of network security, ethical and legal issues in information security, the theoretical foundations of information security, information security management policy and response, and other foundational topics.
Course of thermal solar energy - experiment of a project of non-distance teaching
Authors: E. M. D. Pereira
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

A proposal for the creation of a thermal solar energy course at a distance aims to fill a gap in the typical academic qualifications of engineers and architects in Brazil for a period and at a cost that is compatible with the reality of our country. Our objective is the graduation of professionals who can work in small and medium solar projects by replacing electric showers in demand-side management programmes. The elaboration of the course was developed by three teams organized in a way which is similar to that of film-making, viz. screenplay, production and direction. The selected working environment was Learning Space by Lotus/IBM. The results pointed to a friendly relation between professors, trainees and learners, although a slower rhythm than that expected at first was noticed.
A Comparison of Static Architecture Compliance Checking Approaches
Authors: Jens Knodel, Daniel Popescu
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

The software architecture is one of the most important artifacts created in the lifecycle of a software system. It enables, facilitates, hampers, or interferes directly the achievement of business goals, functional and quality requirements. One instrument to determine how adequate the architecture is for its intended usage is architecture compliance checking. This paper compares three static architecture compliance checking approaches (reflexion models, relation conformance rules, and component access rules) by assessing their applicability in 13 distinct dimensions. The results give guidance on when to use which approach.
A computer-based learning environment for teaching high-school students feedback control through design
Authors: J. Ma
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given as follows. Feedback control is a pervasive and powerful concept that engineers have applied to design and analyze devices and processes, such as satellite attitude control and that scientists have used to study natural phenomena, such as thermoregulation in the human body. Yet, traditionally, students first encounter feedback control theory in college engineering courses where it is taught using mathematics that is more advanced than what most high school students study (i.e., calculus, Laplace transforms, and complex analysis). This paper describes current efforts to introduce the concept of feedback control to high school students with a computer-based learning environment we have developed called the Feedback Articulate Virtual Laboratory, or FAVL. The environment consists of a virtual design space and associated activities in which students can analyze, construct, and run simulations of feedback control systems without resorting to college-level mathematics. In addition, FAVL provides scaffolding, or learning supports, for students to help them understand feedback concepts and develop design and analysis skills. In this paper, we describe FAVL and present preliminary findings from a pilot study we conducted in a high school engineering class with two groups of 9th grade students. Specifically, we share initial results on students' changing conceptions of feedback phenomena and difficulties and successes students had while working with FAVL. 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
An improved charge-averaging charge-pump scheme
Authors: Shuilong Huang, Zhihua Wang
Venue: Analog Integrated Circuits and Signal Processing (2007)

An improved charge-averaging charge-pump scheme is described in the paper. The circuit mainly includes four pairs of switches and four sampling capacitors. Two operation modes (normal/charge-averaging) are achieved by switching on/off. SpectreVerilog simulation results show the proposed scheme can strongly reduce the energy of spurs, and could be applied to high performance frequency synthesizers.
An undecimated wavelet transform based detector for transients in 1/f noise
Authors: T. T. Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We consider the detection in the presence of 1/f noise of a known transient signal of unknown amplitude, scale and delay. We introduce a generalized likelihood ratio test (GLRT) method based on pattern matching in the undecimated discrete wavelet transform (UDWT) domain. In many cases, the computational complexity of the detector can be reduced with minimal performance impact by limiting the pattern matching operations to locations in the UDWT domain that correspond to the existence of transform local maxima. As examples of our approach, we simulate the detection of transients that are modeled either by scaling functions, Gaussian functions, or two-sided exponential functions.
V/sup 2/ID: virtual visual interior design system
Authors: Zhibin Lei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

In this paper we propose a novel system of semantic feature extraction and retrieval for interior design and decoration application. The system, V/sup 2/ID (virtual visual interior design), uses colored texture and spatial edge layout to obtain simple information about global room environment. We address the domain specific segmentation problem in our application and the techniques for obtaining semantic features from a room environment. We also discuss heuristics for making use of these features (color, texture or shape) to retrieve objects from an existing database. The final resynthesized room environment with original scene and novel object from database is created for the purpose of animation and virtual room walkthrough.
When home base is not a place: parents' use of mobile telephones
Authors: Leysia Palen, Amanda Hughes
Venue: Personal and Ubiquitous Computing (2007)

More attention is being paid to the development of information and communication technologies (ICTs) that are sensitive to the needs of people in their homes. By studying mobile telephony in such settings, we contribute to this discussion by examining how behaviors and characteristics of family life shape and in turn are shaped by ICTs. We present the results of a study of the primary caregivers in five families who were studied over the course of a week. We found that parents only relaxed their attachment to their mobile phones when in the presence of their children. Parents and other families perceived their phones as a means of staying connected or tethered across different kinds of situations. Ages of children and their involvement with other institutions beyond the family affected how parents oriented to their mobile phones, matching their parental shift work to those institutional schedules. Transition times between children's activities were important moments for mobile phone use between child and parent as well as parent and others because those transitions also marked a change in parents' work. Ultimately, the mobile phone facilitated the extension of a wider reach of "home" beyond the physical house, meaning that the parent--enhanced by the direct line of the mobile phone--was the embodiment of "home base."
ArchVoc--Towards an Ontology for Software Architecture
Authors: Lenin Babu T., M. Seetha Ramaiah, T. V. Prabhakar, D. Rambabu
Venue: Proceedings of the Second Workshop on SHAring and Reusing architectural Knowledge Architecture, Rationale, and Design Intent (2007)

Knowledge management of any domain requires controlled vocabularies, taxonomies, thesauri, ontologies, concept maps and other such artifacts. This paper describes an effort to identify the major concepts in software architecture that can go into such meta knowledge. The concept terms are identified through two different techniques (1) manually, through back-of- the-book index of some of the major texts in Software Architecture (2) through a semi-automatic technique by parsing the Wikipedia pages. Only generic architecture knowledge is considered. Apart from identifying the important concepts of software architecture, we could also see gaps in the software architecture content in the Wikipedia.
An Approach based on Bigraphical Reactive Systems to Check Architectural Instance Conforming to its Style
Authors: Zhiming Chang, Xinjun Mao, Zhichang Qi
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

With the spread of the Internet and software evolution in complex intensive systems, software architecture often need be reconfigured during run time in dynamic, heterogeneous environments in order to satisfy design objectives, which poses new problems such as, does the architecture of a system conform to the given architectural style? Existing formal methods for the conformance check are either obscure to be understood, or inadequate to express parameters, global conditions, and so on. In this paper, we present an approach to check architectural instance conforming to its style based on bigraphical reactive systems (BRSs). We extend bigraph and Ó-sorted BRS to describe architectural instance and architectural style respectively, and provide an approach to support the conformance check. The approach not only provides a visual and formal mechanism to specify architectural instances and styles, but also enriches the capability to model evolving systems and deal with parametric reaction rules, which are excellent over other existing formal methods naturally. An important theorem the changing bigraphs always preserve the constraints defined by Ó-sorted BRS if the initial bigraph and reaction rules do is proved and a conformance algorithm is presented. Two cases are studied in order to illustrate the effectiveness of our approach.
Orthogonal pulse shape design via semidefinite programming
Authors: T. N. Davidson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In digital communications, orthogonal pulse shapes are often used to represent message symbols for transmission through a channel. The design of such pulse shapes is formulated as a convex semidefinite programming problem, from which a globally optimal pulse shape can be efficiently found using interior point methods. The formulation is used to design filters which achieve the minimal bandwidth for a given filter length, and the minimal filter length for a given bandwidth. The effectiveness of the method is demonstrated by the design of waveforms with substantially improved performance over the 'chip' waveforms specified in the standards for digital mobile telecommunications.
Interactive presentation: Automatic model generation for black box real-time systems
Authors: Thomas Huining Feng, Lynn Wang, Wei Zheng, Sri Kanajan, Sanjit A. Seshia
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Embedded systems are often assembled from black box components. System-level analyses, including verification and timing analysis, typically assume the system description, such as RTL or source code, as an input. There is therefore a need to automatically generate formal models of black box components to facilitate analysis. We propose a new method to generate models of real-time embedded systems based on machine learning from execution traces, under a given hypothesis about the system's model of computation. Our technique is based on a novel formulation of the model generation problem as learning a dependency graph that indicates partial ordering between tasks. Tests based on an industry case study demonstrate that the learning algorithm can scale up and that the deduced system model accurately reflects dependencies between tasks in the original design. These dependencies help us formally prove properties of the system and also extract data dependencies that are not explicitly stated in the specifications of black box components.
Low delay IIR QMF banks with high perceptive quality for speech processing
Authors: T. Kleinmann, A. Lacroix
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

It is well-known that low delay IIR QMF banks induce phase distortions which restrict their suitability for communications, speech processing and audio systems. We describe investigations of the perceptive quality of different IIR QMF bank structures and propose structural means to reduce the subjective perception of phase distortions. The filterbanks are implemented in a special DSP32C signal processor environment enabling the real time processing of sufficiently large speech records.