ppxscal/embedding_network huggingface dataset:
Toward anthropometrics simulation of face rejuvenation and skin cosmetic: Research Articles
Authors: A. Bastanfard, O. Bastanfard, H. Takahashi, M. Nakajima
Venue: Computer Animation and Virtual Worlds (2004)

Facial rejuvenation is the process of reversing the aging effects on the human face digitally. This paper generalizes a new approach for facial rejuvenation in adults image. Applications of facial rejuvenation are widespread. They include face recognition, education, entertainment, telecommunications, Psychology, criminal objects, Cosmetic arts and it can be used as an aid for medical cosmetics surgery and the reconstruction of the face. This paper proposes a novel facial rejuvenation modeling algorithm with two techniques. These techniques discuss the facial deformation based on the face anthropometrics theory and remove wrinkles based on what we called wrinkles inpainting. For example if we have been given a few different faces, we need to be able to compare the difference between the facial characteristics of the youth and the aged, then from there onwards, define a set of outlines which are going to be the basis of the simulation of Face Rejuvenation. The first is the geometric deformation details like skin texture, which differs between the aged and the youth. The second is anthropometrics data change. It was developed in the face anthropometrics measurement theory. Then together with warping technique we map the characteristics to any other particular persons' face in order to generate more expressive and convincing facial rejuvenation. The original contribution and advantage of this paper are that, the proposed methods are simple to implement, reliable, in which they required only one source image without needing to collect a lot of images and their computation are fast for interactive environment. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Professional Engineering and Software Engineering
Authors: Marie Lemay, Ray Barham, Chris Zinck, Paul Bassett, Richard LeBlanc
Venue: Proceedings of the 18th Conference on Software Engineering Education & Training (2005)

The purpose of this panel is to inform attendees about the current state of the accreditation of software engineering programs and licensing for software engineers in Canada and the US. We also intend to stimulate discussion of the more controversial aspects of this topic.
Spotlight: directing users' attention on large displays
Authors: Azam Khan, Justin Matejka, George Fitzmaurice, Gordon Kurtenbach
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We describe a new interaction technique, called a spotlight, for directing the visual attention of an audience when viewing data or presentations on large wall-sized displays. A spotlight is simply a region of the display where the contents are displayed normally while the remainder of the display is somewhat darkened. In this paper we define the behavior of spotlights, show unique affordances of the technique, and discuss design characteristics. We also report on experiments that show the benefit of using the spotlight a large display and standard desktop configuration. Our results suggest that the spotlight is preferred over the standard cursor and outperforms it by a factor of 3.4 on a wall-sized display.
Forwarding indices of folded n-cubes
Authors: Xinmin Hou, Min Xu, Jun-Ming Xu
Venue: Discrete Applied Mathematics (2005)

For a given connected graph G of order n, a routing R is a set of n(n - 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passing through any vertex (resp. edge) in the graph. In this paper, the authors determine the vertex and the edge forwarding indices of a folded n-cube as (n-1)2n-1 +1-((n+l)/2) (n ⌊n+1/2⌋) and 2n-(n,⌊n+1/2⌋),respectively.
New sequential Monte Carlo methods for nonlinear dynamic systems
Authors: Dong Guo, Xiaodong Wang, Rong Chen
Venue: Statistics and Computing (2005)

In this paper we present several new sequential Monte Carlo (SMC) algorithms for online estimation (filtering) of nonlinear dynamic systems. SMC has been shown to be a powerful tool for dealing with complex dynamic systems. It sequentially generates Monte Carlo samples from a proposal distribution, adjusted by a set of importance weight with respect to a target distribution, to facilitate statistical inferences on the characteristic (state) of the system. The key to a successful implementation of SMC in complex problems is the design of an efficient proposal distribution from which the Monte Carlo samples are generated. We propose several such proposal distributions that are efficient yet easy to generate samples from. They are efficient because they tend to utilize both the information in the state process and the observations. They are all Gaussian distributions hence are easy to sample from. The central ideas of the conventional nonlinear filters, such as extended Kalman filter, unscented Kalman filter and the Gaussian quadrature filter, are used to construct these proposal distributions. The effectiveness of the proposed algorithms are demonstrated through two applications--real time target tracking and the multiuser parameter tracking in CDMA communication systems.
A qualitative cross-national study of cultural influences on mobile data service design
Authors: Boreum Choi, Inseong Lee, Jinwoo Kim, Yunsuk Jeon
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

As the use of mobile data services has spread across the globe, the effect of cultural differences on user requirements has become important issue. To date, however, little research has been conducted on the role cultural factors play in the design of mobile data services. This paper proposes a set of critical design attributes for mobile data services that takes cross-cultural differences into account. To determine these attributes, we devised a qualitative method and conducted in-depth long interviews in Korea, Japan, and Finland. We found 52 attributes considered important by mobile data service users, and 11 critical attributes that showed a clear correlation with characteristics of the user's culture. The paper concludes with a discussion of limitations and of implications for developers of mobile data services.
Hierarchical task topology for retrieving information from within a simulated information ecosystem
Authors: Reginald L. Walker
Venue: Journal of Network and Computer Applications (2005)

The design focus of the Tocorime Apicu integrated search engine builds upon new approaches and techniques associated with evolutionary computation to improve the precision and recall mechanisms of existing information retrieval systems within popular search engines. The interactions of the four major components of engines are facilitated through the use of a hierarchical communication topology which partitions the nodes of a distributed computing system into subclusters. The hierarchical conmmunication topology is based on an information ecosystem modeled upon and incorporating the social structure of honeybees, and thus provides mechanisms for the efficient sharing of information.
Dialogue project
Authors: Harry Bunt
Venue: Issue 80 (April 1982) (1982)

Linguistic, logical, and cognitive aspects of man-computer dialogues in natural language form the subject of an interdisciplinary research project at the Institute for Perception Research (IPO), a joint institute of Philips' Research labs and the Eindhoven University of Technology. At present the project group consists of Harry Bunt, Frank Leopold, Herman Muller, Floris van Nes, and Gemme thoe Schwartzenberg.
Advances in meeting recognition
Authors: Alex Waibel, Hua Yu, Martin Westphal, Hagen Soltau, Tanja Schultz, Thomas Schaaf, Yue Pan, Florian Metze, Michael Bett
Venue: Proceedings of the first international conference on Human language technology research (2001)

Speech recognition has advanced considerably, but has been limited almost entirely either to situations in which close speaking microphones are natural and acceptable (telephone, dictation, command&control, etc.) or in which high-quality recordings are ensured. Furthermore, most recognition applications involve controlled recording environments, in which the user turns the recognition event on and off and speaks cooperatively for the purpose of being recognized.
Lack of Invariant Property of the Erlang Loss Model in Case of MAP Input
Authors: Valentina Klimenok, Che Soong Kim, Dmitry Orlovsky, Alexander Dudin
Venue: Queueing Systems: Theory and Applications (2005)

The BMAP/PH/N/0 model with three different disciplines of admission (partial admission, complete rejection, complete admission) is investigated. Loss probability is calculated. Impact of the admission discipline, variation and correlation coefficients of inter-arrival times distribution, and variation of service times distribution on loss probability is analyzed numerically. As by-product, it is shown by means of numerical results that the invariant property of the famous Erlang M/G/N/0 system, which was proven by B. A. Sevastjanov, is absent in case of the MAP input.
Embedding information security curricula in existing programmes
Authors: Krassie Petrova, Anne Philpott, Petteri Kaskenpalo, Jim Buchan
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

There is a need for educators of information technology professionals to monitor the demands of the market and to adjust their programmes and curriculum accordingly. A number of universities and colleges have sought opportunities to extend their programmes to incorporate the fast developing area of information security. The School of Computing and Information Sciences at the Auckland University of Technology offers two programmes in information technology - an undergraduate and a postgraduate one. Information security and information assurance concepts are integrated with the learning objectives of individual courses. This paper provides background information about the school and the existing programmes and describes an information security curriculum development process. The strategies and approaches adopted are justified through consultation with major stakeholders (industry and students). Some of the issues arising form the implementation of the information security curriculum such as the need to invest in resourcing are discussed, and possible future information security curriculum developments are briefly outlined.
Facilitating Reuse in Hardware Models with Enhanced Type Inference
Authors: Manish Vachharajani, Neil Vachharajani, Sharad Malik, David I. August
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

High-level hardware modeling is an essential, yet time-consuming, part of system design. However, effective component-based reuse in hardware modeling languages can reduce model construction time and enable the exploration of more design alternatives, leading to better designs. While component overloading and parametric polymorphism are critical for effective component-base reuse, no existing modeling language supports both. The lack of these features creates overhead for designers that discourages reuse, negating any benefits of reuse. This paper presents a type system which supports both component overloading and parametric polymorphism. It proves that performing type inference for any such system is NP-complete and presents a heuristic that works efficiently in practice. The result is a type system and type inference algorithm that can encourage reuse, reduce design specification time, and lead to better designs.
Geodesic active regions and level set methods for motion estimation and tracking
Authors: Nikos Paragios, Rachid Deriche
Venue: Computer Vision and Image Understanding (2005)

Motion analysis in computer vision is a well-studied problem with numerous applications. In particular, the tasks of optical flow estimation and tracking are of increasing interest. In this paper, we propose a level set approach to address both aspects of motion analysis. Our approach relies on the propagation of smooth interfaces to perform tracking while using an incremental estimation of the motion models. Implicit representations are used to represent moving objects, and capture their motion parameters. Information from different sources like a boundary attraction term, a background subtraction component and a visual consistency constraint are considered. The Euler-Lagrange equations within a gradient descent method lead to a flow that deforms a set of initial curve towards the object boundaries as well an incremental robust estimator of their apparent motion. Partial extension of the proposed framework to address dense motion estimation and the case of moving observer is also presented. Promising results demonstrate the performance of the method.
Unsupervised Image Segmentation Based on the Anisotropic Texture Information
Authors: Lin Cong, Yuheng Sha, Biao Hou, Licheng Jiao
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Based on the anisotropic characteristic of brushlet, a new feature named directional texture histogram in brushlet domain is presented, which represents the local anisotropic information in image. A novel unsupervised image segmentation method via local directional texture histogram in brushlet domain is developed. The segmentation results of synthetic mosaics, aerial photo and synthetic aperture radar (SAR) image show that our method represents better performance and its error probability of the synthetic mosaics is lower than the wavelet-based method.
GlobeDB: autonomic data replication for web applications
Authors: Swaminathan Sivasubramanian, Gustavo Alonso, Guillaume Pierre, Maarten van Steen
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We present GlobeDB, a system for hosting Web applications that performs autonomic replication of application data. GlobeDB offers data-intensive Web applications the benefits of low access latencies and reduced update traffic. The major distinction in our system compared to existing edge computing infrastructures is that the process of distribution and replication of application data is handled by the system automatically with very little manual administration. We show that significant performance gains can be obtained this way. Performance evaluations with the TPC-W benchmark over an emulated wide-area network show that GlobeDB reduces latencies by a factor of 4 compared to non-replicated systems and reduces update traffic by a factor of 6 compared to fully replicated systems.
Memory predecryption: hiding the latency overhead of memory encryption
Authors: Brian Rogers, Yan Solihin, Milos Prvulovic
Venue: ACM SIGARCH Computer Architecture News (2005)

Memory encryption has become a common approach to providing a secure processing environment, but current schemes suffer from extra performance and storage overheads. This paper presents predecryption as a method of providing this security with less overhead by using well-known prefetching techniques to retrieve data from memory and perform decryption before it is needed by the processor. Our results, tested mostly on SPEC 2000 benchmarks, show that using our predecryption scheme can actually result in no increase in execution time despite an extra 128 cycle decryption latency per memory block access.
Book review: Epistemology and Cognition. edited by James H. Fetzer (Studies in Cognitive Systems, Vol. 6) (Kluwer Academic Publishers Dordrecht, 1991)
Venue: ACM SIGART Bulletin (1992)

The book under review collects papers on epistemology and cognition. They originally appeared in one of three special issues of Synthese (No. 82, 83) in 1990. Although they are contributions to these special issues, their contents and impetus vary a lot. The reader will find philosophical investigations, implementation concerns, and discussions of general problems of cognitive science. Therefore, this volume of "Studies in Cognitive Science" is not limited to cognitive science but also relates it to other subjects.
Controlling Inductive Coupling in Wide Global Signal Busses Through Swizzling
Authors: Bassel Soudan
Venue: Analog Integrated Circuits and Signal Processing (2005)

Recent advances in Deep Submicron (DSM) design and manufacturing technologies have brought to the forefront the importance of inductive coupling amongst long interconnect in high performance microprocessors. Inductive coupling has been shown to depend directly on the overlap length between adjacent signal wires, the activity on these wires and the distance separating them. This paper presents a technique--known as swizzling--that exploits the inductive coupling dependence on distance to reduce the effect of any particular attacker on any of its victims. In the swizzling technique, the order of signal wires in global signal busses is continuously re-arranged to move attackers and victims away from each other. This paper shows that this technique significantly reduces the inductive coupling for the most vulnerable wires neighboring the attacker with zero area and routing resource penalty.
A genetic algorithms approach to learning communication and coordination in simulated robots
Authors: Chris Sotzing
Venue: Journal of Computing Sciences in Colleges (2004)

The goal of this project was to develop a genetic algorithms approach for robotic agents to learn to communicate and coordinate with each other, so that the group can learn to be more effective at mapping unfamiliar terrain and locating items within that terrain. 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
Use Case Terminology
Authors: Geri Winters
Venue: IEEE Software (2005)

Here is the first installment of a software engineering glossary of terminology for the use case domain.
Assigning belief scores to names in queries
Authors: Christopher Dozier
Venue: Proceedings of the first international conference on Human language technology research (2001)

Assuming that the goal of a person name query is to find references to a particular person, we argue that one can derive better relevance scores using probabilities derived from a language model of personal names than one can using corpus based occurrence frequencies such as inverse document frequency (idf). We present here a method of calculating person name match probability using a language model derived from a directory of legal professionals. We compare how well name match probability and idf predict search precision of word proximity queries derived from names of legal professionals and major league baseball players. Our results show that name match probability is a better predictor of relevance than idf. We also indicate how rare names with high match probability can be used as virtual tags within a corpus to identify effective collocation features for person names within a professional class.
Partitions of n into t√nparts
Authors: Dan Romik
Venue: European Journal of Combinatorics (2005)

Szekeres proved, using complex analysis, an asymptotic formula for the number of partitions of n into at most k parts. Canfield discovered a simplification of the formula, and proved it without complex analysis. We re-prove the formula, in the asymptotic regime when k is at least a constant times √n, by showing that it is equivalent to a local central limit theorem in Fristedt's model for random partitions. We then apply the formula to derive asymptotics for the number of minimal difference d partitions with a given number of parts. As a corollary, we find (explicitly computable) constants cd, βd, γd, σd such that the number of minimal difference d partitions of n is (1 + o(1))cdn-3/4 exp(βd√n) (a result of Meinardus), almost all of them (fraction a(1 + o(1))) have approximately γd√n parts, and the distribution of the number of parts in a random such partition is asymptotically normal with standard deviation (1 + o(1))σdn1/4. In particular, γ2 = √15 log[(1 + √5)/2]/π.
Watermark Detection Schemes with High Security
Authors: Liu Yongliang, Xiaolin Yang, Hongxun Yao, Tiejun Huang, Wen Gao
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In traditional watermark detection, a prover exposes the secret information that can be used to remove the watermark to the possible dishonest verifier in order to prove a watermark presents in a digital data. This is a significant security risk because a potential attacker is able to remove the watermark once secret information like watermark or embedding key is known. Some of previous schemes proposed as solution haven't achieved desirable result really. Their lacking of security and validity is the most severe problem. In this paper, we propose the watermark detection schemes with high security, which are based on zero knowledge protocol and public-key encryption scheme, for both blind watermark scheme and non-blind watermark scheme. These two schemes provide copyright proving without revealing any information that can be used for removing watermark during the detection process. Both security and validity of watermark detection can be significantly improved using these two schemes.
Embedding JAAS in agent roles to apply local security policies
Authors: Giacomo Cabri, Luca Ferrari, Letizia Leonardi
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Agents are an emerging technology that grants programmers a new way to exploit distributed resources. Roles are a powerful concept that can be used to model agent interactions, allowing agents to dynamically acquire operations to make specific tasks, and enabling separation of concerns and code reusability. Nevertheless roles should be developed taking into account permissions needed for the execution of their operations. The standard Java policy file mechanism does not suffice in this scenario, since a fine grain in managing permissions is required. This paper focuses on how to exploit the Java Authentication and Authorization Service (JAAS) at the role level in order to apply authorization and local policies to Java agents for limiting their operations.
Adapting polyhedral properties from facility to hub location problems
Authors: Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
Venue: Discrete Applied Mathematics (2004)

We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the fields of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapacitated facility location problem to UHL. Using this lifting procedure we derive a new class of facets for UHL which dominates the inequalities in the original formulation. Thus we obtain a new formulation of the UHL whose constraints are all facet-defining.