ppxscal/embedding_network huggingface dataset:
Improving Iris-Based Personal Identification Using Maximum Rectangular Region Detection
Authors: Serestina Viriri, Jules-R Tapamo
Venue: Proceedings of the International Conference on Digital Image Processing (2009)

Iris recognition is proving to be one of the most reliable biometric traits for personal identification. In fact, iris patterns have stable, invariant and distinctive features for personal identification. In this paper, we propose a new algorithm that detects the largest non-occluded rectangular part of the iris as region of interest (ROI). Thereafter, a cumulative-sum-based grey change analysis algorithm is applied to the ROI to extract features for recognition. This method could possibly be utilized for partial iris recognition since it relaxes the requirement of using the whole part of the iris to produce an iris template. Preliminary experimental results carried on a CASIA iris database, show that the approach is promisingly effective and efficient.
Automatic parallelization of simulation code for equation-based models with software pipelining and measurements on three platforms
Authors: Håkan Lundvall, Kristian Stavåker, Peter Fritzson, Christoph Kessler
Venue: ACM SIGARCH Computer Architecture News (2009)

In this work we report results from a new integrated method of automatically generating parallel code from Modelica models by combining parallelization at two levels of abstraction. Performing inline expansion of a Runge-Kutta solver combined with fine-grained automatic parallelization of the right-hand side of the resulting equation system opens up new possibilities for generating high performance code, which is becoming increasingly relevant when multi-core computers are becoming commonplace. An implementation, in the form of a backend module for the OpenModelica compiler, has been developed and used for measurements on two architectures: Intel Xeon and SGI Altix 3700 Bx2. This paper also contains some very recent results of a prototype implementation of this parallelization approach on the Cell BE processor architecture.
Feedback-driven requirements engineering: The Heuristic Requirements Assistant
Authors: Eric Knauss, Daniel Lubke, Sebastian Meyer
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

The complexity of today's software systems is constantly increasing. As a result, requirements for these systems become more comprehensive and complicated. In this setting, requirements engineers struggle to capture consistent and complete requirements of high quality. We propose a feedback-centric requirements editor to help analysts controlling the information overload. Our HeRA tool provides analysts with important data from various feedback facilities. The feedback is directly given based on the input to the editor. On the one hand, it is based on heuristic rules, on the other hand, on automatically derived models. Thus, when new requirements are added, the analyst gets important information on how consistent these requirements are with the existing ones.
Characterizing truthful multi-armed bandit mechanisms: extended abstract
Authors: Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We consider a multi-round auction setting motivated by pay-per-click auctions for Internet advertising. In each round the auctioneer selects an advertiser and shows her ad, which is then either clicked or not. An advertiser derives value from clicks; the value of a click is her private information. Initially, neither the auctioneer nor the advertisers have any information about the likelihood of clicks on the advertisements. The auctioneer's goal is to design a (dominant strategies) truthful mechanism that (approximately) maximizes the social welfare. If the advertisers bid their true private values, our problem is equivalent to the multi-armed bandit problem, and thus can be viewed as a strategic version of the latter. In particular, for both problems the quality of an algorithm can be characterized by regret, the difference in social welfare between the algorithm and the benchmark which always selects the same "best" advertisement. We investigate how the design of multi-armed bandit algorithms is affected by the restriction that the resulting mechanism must be truthful. We find that truthful mechanisms have certain strong structural properties -- essentially, they must separate exploration from exploitation -- and they incur much higher regret than the optimal multi-armed bandit algorithms. Moreover, we provide a truthful mechanism which (essentially) matches our lower bound on regret.
Evolving new lexical association measures using genetic programming
Authors: Jan Šnajder, Bojana Dalbelo Bašić, Saša Petrović, Ivan Sikirić
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Automatic extraction of collocations from large corpora has been the focus of many research efforts. Most approaches concentrate on improving and combining known lexical association measures. In this paper, we describe a genetic programming approach for evolving new association measures, which is not limited to any specific language, corpus, or type of collocation. Our preliminary experimental results show that the evolved measures outperform three known association measures.
Cooperative learning to support the lacks of PBL
Authors: Javier Garcia Martin
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

In this paper, we describe the use of some cooperative learning methodology sessions in a Project Based Learning course, in order to cover those topics uncovered by the project.
Detecting mac layer misbehavior and rate adaptation in ieee 802.11 networks: modeling and sprt algorithms
Authors: Hyeong-Ah Choi
Venue:  (2008)

As the commercial success of the IEEE 802:11 protocol has made wireless infrastructure widely deployed, user organizations are increasingly eager to discourage new threats to their networks as well as enhance the network performance. An emerging threat to these networks is the intentional misbehavior at the medium access control (MAC) layer. As wireless stations are usually under the control of individual users, a selfish or greedy user may try to gain more bandwidth at the expense of other cooperating users. As an extreme, when a station constantly occupies the wireless medium, a denial-of-service (DoS) attack is launched and the misbehaving station becomes an attacker. Efficient mechanisms are needed to detect such stations misbehaving at the MAC layer. On the other hand, advances in wireless communications research have led to key enabling technologies, and next generation wireless networks are expected to provide reliable, high-bandwidth, and on demand services. As the flexibility of adapting physical layer transmission modes is crucial for realizing broadband wireless communications, multiple transmission rates at the physical (PHY) layer are provided in the standard of the 802:11 protocol. Although this multi-rate capability is critical to the system performance, no dynamic rate adaptation (or control) mechanism is specified in the standards. In this research, we address two key issues critical to the performance of the 802:11 networks. We first address threats posed by DoS attacks against the MAC layer protocol. In our approach, an analytical model depicting greedy behaviors of attackers is developed. In particular, we present a Markov chain model to describe the stochastic trend of a station's behavior cheating on the MAC layer protocol and derive the distribution of inter-delivery times between two consecutive successful transmissions. Based on this inter-delivery time distribution model, we develop a set of algorithms to detect misbehaving stations using the sequential probability ratio test (SPRT) and analyze their performances through simulations. We then focus on the PHY layer's multi-rate capability and develop a rate adaptation scheme that incorporates the SPRT and uses a feedback mechanism to amend rate adaptation decisions. Experimental results obtained through simulations show that our algorithms significantly improve the performance over the existing solutions.Contributions of this dissertation lie in two areas. Firstly, we develop analytical models of various characteristics in the 802:11 network that can be extended to a wider application domain. Secondly, we propose solutions to the two key problems from a statistical perspective fully exploiting the SPRT technique that significantly improve the performance of the 802:11 network over the existing ones.
Maximum volume cuboids for arbitrarily shaped in-situ rock blocks as determined by discontinuity analysis-A genetic algorithm approach
Authors: Erkan ílker, Alparslan Turanboy
Venue: Computers Geosciences (2009)

The block stone industry is one of the main commercial use of rock. The economic potential of any block quarry depends on the recovery rate, which is defined as the total volume of useful rough blocks extractable from a fixed rock volume in relation to the total volume of moved material. The natural fracture system, the rock type(s) and the extraction method used directly influence the recovery rate. The major aims of this study are to establish a theoretical framework for optimising the extraction process in marble quarries for a given fracture system, and for predicting the recovery rate of the excavated blocks. We have developed a new approach by taking into consideration only the fracture structure for maximum block recovery in block quarries. The complete model uses a linear approach based on basic geometric features of discontinuities for 3D models, a tree structure (TS) for individual investigation and finally a genetic algorithm (GA) for the obtained cuboid volume(s). We tested our new model in a selected marble quarry in the town of Iscehisar (AFYONKARAHISAR-TURKEY).
LPIC-1: Linux Professional Institute Certification Study Guide (Exams 101 and 102), 2nd edition
Authors: Roderick W. Smith
Venue:  (2009)

Offering you thorough coverage of the new version of the leading Linux certification from Linux Professional Institute (LPI), this book covers both objectives and materials tested in the two required LPIC-1 exams: LPI 101 and LPI 102. Youll certainly appreciate the clear, concise information on key exam topics, including using Linux command line tools, managing software, configuring hardware, managing files and filesystems, working with the X Window system, administering the system, basic networking, and more.
SiGe and Si Strained-Layer Epitaxy for Silicon Heterostructure Devices, 1st edition
Authors: John D. Cressler
Venue:  (2007)

What seems routine today was not always so. The field of Si-based heterostructures rests solidly on the shoulders of materials scientists and crystal growers, those purveyors of the semiconductor black arts associated with the deposition of pristine films of nanoscale dimensionality onto enormous Si wafers with near infinite precision. We can now grow near-defect free, nanoscale films of Si and SiGe strained-layer epitaxy compatible with conventional high-volume silicon integrated circuit manufacturing. SiGe and Si Strained-Layer Epitaxy for Silicon Heterostructure Devices tells the materials side of the story and details the many advances in the Si-SiGe strained-layer epitaxy for device applications. Drawn from the comprehensive and well-reviewed Silicon Heterostructure Handbook, this volume defines and details the many advances in the Si/SiGe strained-layer epitaxy for device applications. Mining the talents of an international panel of experts, the book covers modern SiGe epitaxial growth techniques, epi defects and dopant diffusion in thin films, stability constraints, and electronic properties of SiGe, strained Si, and Si-C alloys. It includes appendices on topics such as the properties of Si and Ge, the generalized Moll-Ross relations, integral charge-control relations, and sample SiGe HBT compact model parameters. 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
Downloads and citations in Intelligent Systems in Accounting, Finance and Management
Authors: Daniel E. O'Leary
Venue: International Journal of Intelligent Systems in Accounting and Finance Management (2009)

This paper summarizes the papers downloaded most from the years 2000&ndash;2002 and traces the number of citations from Google Scholar (beta) for those papers at the beginning of 2008. It is found that the number of downloads and citations are highly correlated, suggesting that downloads is a leading indicator of citations, even years into the future. In addition, this paper assesses which of the papers from the journal have been cited most over the history of the journal, using both ISI&ndash;Social Science Citation Index and Google Scholar. It is found that the numbers of citations using both approaches are highly correlated. Copyright &copy; 2009 John Wiley & Sons, Inc.
eHealth Solutions for Healthcare Disparities, 1st edition
Authors: Michael Christopher Gibbons
Venue:  (2007)

Paralleling emerging trends in cyber-health technology, concerns are mounting about racial, ethnic, disparities in health care utilization and outcomes. eHealth Solutions for Health Care Disparities brings these currents together, challenging readers to use, promote, and develop new technology-based methods for closing these gaps. Edited by a leading urban health advocate and featuring 16 expert contributors, the book examines cyber-strategies with the greatest potential toward effective, equitable care, improved service delivery and better health outcomes for all. Chapters go well beyond the possibilities of the Electronic Medical Record to discuss emerging roles for information technology in promoting healthful behavior changes (e.g., nutrition, weight loss, smoking cessation), disease prevention (e.g., cancer, HIV), and healthcare utilization, patient education and medicine compliance). The rise of e-Patients and the transformation of the doctor-patient relationship are also discussed. Opportunities for Web based products and interventions are explored in terms of tracking disparities, improving healthcare utilization and health outcomes, reducing disparities and monitoring trends among patients, whether they have Internet capabilities or not. 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
Depth of field postprocessing for layered scenes using constant-time rectangle spreading
Authors: Todd J. Kosloff, Michael W. Tao, Brian A. Barsky
Venue: Proceedings of Graphics Interface 2009 (2009)

Control over what is in focus and what is not in focus in an image is an important artistic tool. The range of depth in a 3D scene that is imaged in sufficient focus through an optics system, such as a camera lens, is called depth of field. Without depth of field, the entire scene appears completely in sharp focus, leading to an unnatural, overly crisp appearance. Current techniques for rendering depth of field in computer graphics are either slow or suffer from artifacts, or restrict the choice of point spread function (PSF). In this paper, we present a new image filter based on rectangle spreading which is constant time per pixel. When used in a layered depth of field framework, our filter eliminates the intensity leakage and depth discontinuity artifacts that occur in previous methods. We also present several extensions to our rectangle spreading method to allow flexibility in the appearance of the blur through control over the PSF.
Research infrastructures for Human Language Technologies: A vision from France
Authors: Joseph Mariani
Venue: Speech Communication (2009)

The size of the effort in language science and technology has increased over the years, reflecting the complexity of this research area. The role of Language Resources and Language Technology Evaluation is now recognized as being crucial for the development of written and spoken language processing systems. Several initiatives have been taken in this framework, with a pioneering activity in the US starting in the mid 80s. In France, several programs may be reported, such as the Aupelf-Uref Francil network and the Techno-Langue national program. Despite the size of the effort and the success of those actions, they did not provide yet a permanent infrastructure. To be properly covered, the development of Language Technologies would require a better share of efforts between the European Commission and the Member States to address the major challenge of multilingualism in Europe, and worldwide.
Perceptual 3D pose distance estimation by boosting relational geometric features
Authors: Cheng Chen, Yueting Zhuang, Jun Xiao, Zhang Liang
Venue: Computer Animation and Virtual Worlds (2009)

Traditional pose similarity functions based on joint coordinates or rotations often do not conform to human perception. We propose a new perceptual pose distance: Relational Geometric Distance that accumulates the differences over a set of features that reflects the geometric relations between different body parts. An extensive relational geometric feature pool that contains a large number of potential features is defined, and the features effective for pose similarity estimation are selected using a set of labeled data by Adaboost. The extensive feature pool guarantees that a wide diversity of features is considered, and the boosting ensures that the selected features are optimized when used jointly. Finally, the selected features form a pose distance function that can be used for novel poses. Experiments show that our method outperforms others in emulating human perception in pose similarity. Our method can also adapt to specific motion types and capture the features that are important for pose similarity of a certain motion type. Copyright &copy; 2009 John Wiley & Sons, Ltd. A new distance metric is proposed to estimate the 3D pose similarity in accordance with human perception. The distance metric is composed of geometric features selected from an extensive feature pool by Adaboost. Higher precision (judged by blind human perception) is achieved in the experiments, and the new distance metric gets best performance when adapted to specific motion types.
Orientation selection using modified FCM for competitive code-based palmprint recognition
Authors: Feng Yue, Wangmeng Zuo, David Zhang, Kuanquan Wang
Venue: Pattern Recognition (2009)

Coding-based methods are among the most promising palmprint recognition methods because of their small feature size, fast matching speed and high verification accuracy. The competitive coding scheme, one representative coding-based method, first convolves the palmprint image with a bank of Gabor filters with different orientations and then encodes the dominant orientation into its bitwise representation. Despite the effectiveness of competitive coding, few investigations have been given to study the influence of the number of Gabor filters and the orientation of each Gabor filter. In this paper, based on the statistical orientation distribution and the orientation separation characteristics, we propose a modified fuzzy C-means cluster algorithm to determine the orientation of each Gabor filter. Since the statistical orientation distribution is based on a set of real palmprint images, the proposed method is more suitable for palmprint recognition. Experimental results indicate that the proposed method achieves higher verification accuracy while compared with that of the original competitive coding scheme and several state-of-the-art methods, such as ordinal measure and RLOC. Considering both the computational complexity and the verification accuracy, competitive code with six orientations would be the optimal choice for palmprint recognition.
On Local Region Models and a Statistical Interpretation of the Piecewise Smooth Mumford-Shah Functional
Authors: Thomas Brox, Daniel Cremers
Venue: International Journal of Computer Vision (2009)

The Mumford-Shah functional is a general and quite popular variational model for image segmentation. In particular, it provides the possibility to represent regions by smooth approximations. In this paper, we derive a statistical interpretation of the full (piecewise smooth) Mumford-Shah functional by relating it to recent works on local region statistics. Moreover, we show that this statistical interpretation comes along with several implications. Firstly, one can derive extended versions of the Mumford-Shah functional including more general distribution models. Secondly, it leads to faster implementations. Finally, thanks to the analytical expression of the smooth approximation via Gaussian convolution, the coordinate descent can be replaced by a true gradient descent.
Plenary lecture 2: general ray method for solution of boundary value problems for Laplace type equations: theoretical foundation and applications
Authors: Alexander Grebennikov
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

General Ray (GR) method for solution of the Dirichlet boundary value problems for the Laplace type equation with variable coefficient is proposed. The method is based on reduction of Partial Differential Equation (PDE) to assemblage of Ordinary Differential Equations (ODE) using local traces for considered functions and operators. GR-method presents the solution of the Dirichlet boundary value problem for this type of equations by explicit analytical formulas that use the direct and inverse Radon transform. Proposed version of GR-method is justified theoretically, realized as stable algorithms and program package in MATLAB system. The quality of constructed software is demonstrated by numerical experiments. Applications to the stationary problems of electrodynamics and HEAT TRANSFER thermo conductivity are discussed.
Secure data aggregation in wireless sensor networks: A comprehensive overview
Authors: Suat Ozdemir, Yang Xiao
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Wireless sensor networks often consists of a large number of low-cost sensor nodes that have strictly limited sensing, computation, and communication capabilities. Due to resource restricted sensor nodes, it is important to minimize the amount of data transmission so that the average sensor lifetime and the overall bandwidth utilization are improved. Data aggregation is the process of summarizing and combining sensor data in order to reduce the amount of data transmission in the network. As wireless sensor networks are usually deployed in remote and hostile environments to transmit sensitive information, sensor nodes are prone to node compromise attacks and security issues such as data confidentiality and integrity are extremely important. Hence, wireless sensor network protocols, e.g., data aggregation protocol, must be designed with security in mind. This paper investigates the relationship between security and data aggregation process in wireless sensor networks. A taxonomy of secure data aggregation protocols is given by surveying the current ''state-of-the-art'' work in this area. In addition, based on the existing research, the open research areas and future research directions in secure data aggregation concept are provided.