ppxscal/embedding_network huggingface dataset:
A New Iris Locating Algorithm
Authors: Yong-zeng Shen, Min-jie Zhang, Jie-wei Yue, Hong-min Ye
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Iris recognition is one of effective methods in person identification. Iris locating is the key subject in the process of iris recognition. This paper analyses some limitations of Hough iris locating algorithm, proposes a minimum variance method based on the wavelet analysis to locate the inner boundaries of iris, and uses an improved brightness gradient method to locate the outer boundaries of iris. The result is that the new inner locating method makes good use of the advantages of wavelet analysis, not only simplify the locating algorithm but improve the speed of locating. The new outer locating algorithm decreases the search range effectively and improves the search precision. The experiments of this new iris locating on common iris image show that the minimum variance method based on the wavelet analysis is also get good results.
An Action Research Program to Improve Information Systems Security Compliance across Government Agencies
Authors: Stephen Smith, Rodger Jamieson, Donald Winchester
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information Systems Security (ISSec) compliance is an important aspect of implementing e-government. This paper presents results from an action research project using longitudinal surveys as interventions to enhance understanding and improve security across the whole of the NSW government, in Australia. The ISO Standard AS/NZS ISO/IEC 17799:2001 Information Technology Code of practice for information security management, was used a framework for developing the survey research instrument. The major findings are that this action research program led to an improvement in ISSec compliance by agencies, increased understanding and knowledge as agencies became more aware of ISSec issues, improved agencies ISSec policies and plans, as well as improved business continuity plans. This research is innovative as it is the first time that ISSec has been explored using an action research framework across whole of government.
Requirements and Evaluation Procedures for eVoting
Authors: Melanie Volkamer, Margaret McGaley
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Only the most trivial computer system can be expected to meet its requirements if those requirements are not specified. Despite the widespread use of electronic voting (evoting), no requirements catalogue exists that expresses the requirements for evoting systems with enough precision to be checkable. Nor do existing catalogues take evaluation techniques and certification procedures into account. This paper takes the first step towards the development of a new catalogue with corresponding assessment procedures, concentrating on a strict subset of evoting systems.
Computer-mediated communication in higher education: an exploration of knowledge construction
Authors: Dale S. Niederhauser
Venue:  (2006)

Constructivist theories about knowledge construction emphasize that knowledge construction is more powerful and meaningful when it is actively built up by students through engaging in equilibrated exchanges and experiencing cognitive disequilibrium. From this perspective, knowledge construction is thought to be effective in learning environments where intense interactive discussions can take place, deeply held values are shared, and complex issues examined from multiple perspectives (Harasim, 1990). Computer-mediated communication, more specifically computer conferencing systems (CCS), has captured the interest of educators as an ideal tool to create this type of learning environment, featuring active, participative, and reflective learning. This study developed a conceptual framework, based on constructivist learning principles, to examine whether knowledge construction was promoted through computer conferencing in two graduate-level bioethics courses. Data collection focused on CCS transcripts, supplemented by student survey, instructor interviews, field notes, and course documentation. Knowledge construction through computer conferencing was examined from three main constructivist educational principles: (1) active participation---participation analysis was conducted to determine the nature of students' participation in the learning process, (2) peer-to-peer interaction---content analysis for interaction types, intermessage reference analysis, and message map analysis for interaction patterns were conducted, and (3) cognitive conflict resolution---content analysis based on Gunawardena et al. (1997) interaction analysis model framework was conducted to examine whether cognitive conflicts experienced in CCS promoted knowledge construction. The findings of this study revealed that participation in the computer conferencing was moderate; interaction among students usually occurred through confirming or elaborating on the information/statement; and the predominance of computer conference transcripts reflected the first two phases of the knowledge construction process (i.e., sharing and comparing information, and exploration of dissonances among concepts and/or ideas). The results of this study suggest that CCS by itself does not guarantee knowledge construction. The instructor's role in designing computer conferencing as a learning environment is crucial for fostering knowledge construction. This study provided insights into the nature of the knowledge construction process in a CCS environment and recommendations that help utilize computer conferencing technology in educational settings for students to construct knowledge more effectively.
Simultaneous Power Fluctuation and Average Power Minimization during Nano-CMOS Behavioral Synthesis
Authors: Saraju P. Mohanty, Elias Kougianos
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We present minimization methodologies and an algorithm for simultaneous scheduling, binding, and allocation for the reduction of total power and power fluctuation during behavioral synthesis. We consider resources of dual gate oxide thicknesses, dual threshold voltage, and dual power supply. Statistical variations in these parameters are explicitly taken into account by using Monte Carlo simulations to characterize a datapath component library which is then used during behavioral synthesis. The formulated multi-objective cost function is optimized for various resource and time constraints. We present results on several standard benchmarks where we observed significant reduction in total power (as high as 75% without time penalty) and elimination of total power fluctuation (as high as 76% without time penalty). To the best of the authors' knowledge, this is the first-ever behavioral synthesis work addressing fluctuation in total power consumption accounting for gate and subthreshold leakage and dynamic power.
AMP: adaptive multi-stream prefetching in a shared cache
Authors: Binny S. Gill, Luis Angel D. Bathen
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. There are two problems that plague the state-of-the-art sequential prefetching algorithms: (i) cache pollution, which occurs when prefetched data replaces more useful prefetched or demand-paged data, and (ii) prefetch wastage, which happens when prefetched data is evicted from the cache before it can be used. A sequential prefetching algorithm can have a fixed or adaptive degree of prefetch and can be either synchronous (when it can prefetch only on a miss), or asynchronous (when it can also prefetch on a hit). To capture these distinctions we define four classes of prefetching algorithms: Fixed Synchronous (FS), Fixed Asynchronous (FA), Adaptive Synchronous (AS), and Adaptive Asynchronous (AA). We find that the relatively unexplored class of AA algorithms is in fact the most promising for sequential prefetching. We provide a first formal analysis of the criteria necessary for optimal throughput when using an AA algorithm in a cache shared by multiple steady sequential streams. We then provide a simple implementation called AMP, which adapts accordingly leading to near optimal performance for any kind of sequential workload and cache size. Our experimental set-up consisted of an IBM xSeries 345 dual processor server running Linux using five SCSI disks. We observe that AMP convincingly outperforms all the contending members of the FA, FS, and AS classes for any number of streams, and over all cache sizes. As anecdotal evidence, in an experiment with 100 concurrent sequential streams and varying cache sizes, AMP beats the FA, FS, and AS algorithms by 29-172%, 12-24%, and 21-210% respectively while outperforming OBL by a factor of 8. Even for complex workloads like SPC1-Read, AMP is consistently the best performing algorithm. For the SPC2 Video-on-Demand workload, AMP can sustain at least 25% more streams than the next best algorithm. Finally, for a workload consisting of short sequences, where optimality is more elusive, AMP is able to outperform all the other contenders in overall performance.
Foundational Typed Assembly Language with Certified Garbage Collection
Authors: Chunxiao Lin, Andrew McCreight, Zhong Shao, Yiyun Chen, Yu Guo
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Type-directed certifying compilation and typed assembly language (TAL) aim to minimize the trusted computing base of safe languages by directly type-checking low-level ma- chine code. However, the safety of TAL still heavily relies on its safe interaction with the underlying garbage collector. Based on a recent variant of foundational proof-carrying code (FPCC), we introduce a general methodology for com- bining foundational TAL with a certified garbage collector. We demonstrate the practicality of this approach by link- ing a typical TAL with a conservative garbage collector. This includes proving the safety of the collector, the sound- ness of TAL, and the safe interaction between TAL programs and the garbage collector. Our work is fully mechanized in the Coq proof assistant and the certified programs can be shipped immediately as FPCC packages.
Adaptation and Distribution of Pipeline-Based Context-Aware Web Architectures
Authors: Michael Hinz, Stefan Pietschmann, Matthias Umbach, Klaus Meissner
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

The dynamic generation of context-aware applications for the ubiquitous Web is very time consuming and causes significant server load. Therefore, optimizing the efficiency of the publishing process and reducing server load by dynamically configuring system components are key factors for the commercial success of context-aware Web applications. To meet this challenge, this paper presents a framework that dynamically adjusts the architecture of pipeline-based context-aware Web systems either by adapting or omitting server tasks, distributing load within server clusters, or migrating load to client devices. The system adaptation and distribution are performed according to varying load rates and system context states that are monitored permanently. Furthermore, the paper also presents experiences gained by the implementation of prototypes and illustrates several useful application scenarios that are supported by the proposed mechanisms.
R-K type Landweber method for nonlinear ill-posed problems
Authors: L. Li, B. Han, W. Wang
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper we propose the R-K type Landweber iteration and investigate the convergence of the method for nonlinear ill-posed problem F(x)=y where F:H->H is a nonlinear operator between Hilbert space H. Moreover, for perturbed data with noise level @d we prove that the convergence rate is O(@d^2^/^3) under appropriate conditions. Finally, the numerical performance of this R-K type Landweber iteration for a nonlinear convolution equation is compared with the Landweber iteration.
Continuous monitoring of curriculum via student communications components
Authors: D. Moore
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Developing and maintaining a responsive curriculum along with an aim toward continuous improvement of both the student and the curriculum is a task that must be addressed not only by all engineering programs but by many other programs of study as well. The Electrical and Computer Engineering Department at Rose-Hulman Institute of Technology has developed a process that helps provide the feedback necessary to address these curriculum issues; specifically in terms of written and oral communications, team functioning, and design methodology. The use of an electronic "portfolio" as the repository for student submissions is the starting point for the process. The procedure is designed to allow both a horizontal review (through a particular course) and a vertical review (Sophomore through Senior). The monitoring program focuses on the departmental design sequence involving a one quarter course in each of the Sophomore and Junior years, and a three quarter course in the Senior year. The student teams in each course submit material (in electronic format), material such as: meeting agendas and minutes, memos, interim reports, oral presentation slides (PowerPoint), and final reports. All the material is submitted as part of their regular course requirements. The submitted material is stored and organized to allow any component (team agendas for example) to be reviewed easily both horizontally and vertically using the rubric developed as part of the process. The system is designed to be used by internal or external reviewers. The paper gives a discussion of the process that was developed and the underlying rationalization. Specific examples are presented as well.
Information Retrieval and Digital Library Applications Minitrack Introduction
Authors: Ray R. Larson, Fredric C. Gey
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information retrieval, or "search" has become the central and primary mode for access to internet information. As more and more information becomes available the search technology required to access and retrieve that information becomes complex at the same time it becomes more commonplace. The computer science research field of information retrieval has become more widely known in recent years and has attracted researchers from other areas of computer and information science. Information Retrieval is primarily concerned with effective search in large collections of information ranging in size from small personal collections of information housed on a PC, to multi-terabyte repositories of information such as the National Science Digital Library, and indexes of the entire Web typified by Google and Yahoo.
Design of optimal soft decoding for combined trellis coded quantization/modulation in Rayleigh fading channel
Authors: Kwok-Hung Chei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The well-known Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is used as a minimum mean-squared error (MMSE) decoder for combined trellis-coded quantization and modulation. When the BCJR algorithm is used as decoder, the optimal trellis-coded encoder is derived. Both trellis-coded quantizer and the soft-decoder can be optimized iteratively for minimum overall distortion from transmitter input to receiver output. The optimal encoder/decoder is simulated for Rayleigh fading channel. Significant performance improvement is achieved for both memoryless Gaussian and uniform source, especially for very noisy channel.
Smart office spaces
Authors: Bora A. Akyol, Matt Fredette, Alden W. Jackson, Rajesh Krishnan, David Mankins, Craig Partridge, Nicholas Shectman, Gregory D. Troxel
Venue: Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems (1999)

Imagine a world in which every device has an embedded processor and a high-speed wireless link. Any two devices can talk to each other and you link devices together as needed to get your work done. Devices with embedded processors and wireless links are coming soon. This paper looks at some of the problems we have to overcome to make it possible to link devices together and get work done (rather than cause frustration).
A Precomputed Approach for Real-Time Haptic Interaction with Fluids
Authors: Yoshinori Dobashi, Tsuyoshi Yamamoto, Makoto Sato, Shoichi Hasegawa, Mitsuaki Kato, Tomoyuki Nishita
Venue: IEEE Computer Graphics and Applications (2007)

The key to enhancing perception of the virtual world is improving mechanisms for interacting with that world. Through providing a sense of touch, haptic rendering is one such mechanism. Many methods efficiently display force between rigid objects, but to achieve a truly realistic virtual environment, haptic interaction with fluids is also essential. In the field of computational fluid dynamics, researchers have developed methods to numerically estimate the resistance due to fluids by solving complex partial differential equations, called the Navier-Stokes equations. However, their estimation techniques, although numerically accurate, are prohibitively time-consuming.This becomes a serious problem for haptic rendering, which requires a high frame rate. To address this issue, the authors developed a method for rapidly estimating and displaying forces acting on a rigid virtual object due to water. They provide an overview of their method together with its implementation and two applications: a lure-fishing simulator and a virtual canoe simulator.
Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem
Authors: M. Basseur, F. Seynhaeve, E. Talbi
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Multi-objective optimization using evolutionary algorithms has been extensively studied in the literature. We propose formal methods to solve problems appearing frequently in the design of such algorithms. To evaluate the effectiveness of the introduced mechanisms, we apply them to the flow-shop scheduling problem. We propose a dynamic mutation Pareto genetic algorithm (GA) in which different genetic operators are used simultaneously in an adaptive manner, taking into account the history of the search. We present a diversification mechanism which combines sharing in the objective space as well as in the decision space, in which the size of the niche is automatically calculated. We also propose a hybrid approach which combines the Pareto GA with local search. Finally, we propose two performance indicators to evaluate the effectiveness of the introduced mechanisms.
Energy and Transportation: A Case Study in China
Authors: Rui Chen, Jian Wang
Venue: IEEE Intelligent Systems (2007)

The Chinese government has made a national priority of developing a sustainable, resource- and energy-efficient society. The transportation sector of the Chinese economy is a major energy consumer. A cointegration analysis of its consumption patterns reveals interactions and dependencies among energy sources. Such results can help optimize policies and plans in an economic sector that has significant opportunities for efficiency improvements, including intelligent transportation technologies.
A learning algorithm for adaptive microphone arrays based on mathematical programming methods
Authors: K. Suyama
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper proposes a new learning algorithm for adaptive microphone arrays consisting of multi-channel adaptive linear filters. The algorithm is based on the interior point method, which is a very powerful mathematical programming method. In this algorithm, the learning problem of multi-channel adaptive linear filters is formulated as a quadratic programming (QP) problem with some constraints. The optimal filter coefficients are updated using the analytic center for a feasible region of this QP, and the feasible region is shrunk by a factor dependent on the error energy of learning. Using this strategy, a numerical stability of learning can be ensured. It is shown experimentally that this numerical stability can be always maintained, and that a high quality of target extraction can be achieved.
In-kernel servers on mach 3.0: implementation and performance
Authors: Jay Lepreau, Mike Hibler, Bryan Ford, Jeffrey Law
Venue: Proceedings of the 3rd conference on USENIX MACH III Symposium - Volume 1 (1993)

The advantages in modularity and power of microkernel-based operating systems such as Mach 3.0 are well known. The existing performance problems of these systems, however, are significant. Much of the performance degradation is due to the cost of maintaining separate protection domains, traversing software layers, and using a semantically rich inter-process communication mechanism. An approach that optimizes the common case is to permit merging of protection domains in performance critical applications, while maintaining protection boundaries for debugging or in situations that demand robustness. In our system, client calls to the server are effectively bound either to a simple system call interface, or to a full RPC mechanism, depending on the server's location. The optimization reduces argument copies as well as work done in the control path to handle complex and infrequently encountered message types. In this paper we present a general method of doing this for Mach 3.0 and the results of applying it to the Mach microkernel and the OSF/1 single server. We describe the necessary modifications to the kernel, the single server, and the RPC stub generator. Semantic equivalence, backwards compatibility and common source and binary code are preserved. Performance on micro and macro benchmarks is reported with RPC performance improving by a factor of three, Unix system calls to the server improving between 20% and a factor of two, and 4-13% performance gain on large benchmarks. A breakdown of the times on the RPC path is also presented.
On-chip implementation of a multi-output voltage regulator based on single inductor Buck Converter topology
Authors: Pradipta Patra, Amit Patra, D. Kastha
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents the chip design of a single inductor triple output buck converter with interleaved switched capacitor outputs with only the passive elements being off-chip. Transient overshoots occur in all the output voltages during load transients due to cross regulation effect amongst the coupled outputs. This has been minimized using a priority based novel control technique. The error amplifiers are designed accordingly. The dead band circuitry amongst the output switches have been optimally designed so that the power MOSFET's do not breakdown at the instance when all the output switches are momentarily turned OFF. Moreover, selection of the size of the power switches has been a significant contribution as their stray capacitances are used to hold the voltage across the power switches during dead band condition. The chip has been implemented on 1.5u process following DSL specifications. The post layout simulation results are presented in the paper and they all prove the stable operation of the circuit and the validation of the stated theories.