ppxscal/embedding_network huggingface dataset:
Robust Face Detection from Complex Scene Using Multi-Experts
Authors: Lin-Lin Huang, Akinobu Shimizu, Hidefumi Kobatake
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, we propose a robust face detection approach by combining multiple experts in both cascade and parallel manner. We design three detection experts which employ different feature representation schemes of local images: 2D Haar wavelet, gradient direction, and Gabor filter. The three features are classified using the sameclassification model, namely, a polynomial neural network (PNN) on reduced feature subspace. The detection experts are used in multiple stages. At each stage, only when the output similarity of face exceeds a threshold, is the succeedimg expert invoked to output a new similarity. To speed up detection, simpler (less time consuming) experts are used in preceeding stages and complex experts are used in suceeding stages. Meanwhile, the output of each expert is combined with the outputs of its preceeding experts to improve detection accuracy. The effectiveness of the multi-expert approach has been demonstrated in experiments on a large number of images.
Meeting the needs of the "user experience" professional
Authors: Richard I. Anderson
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In the business of "User Experience" (UX), collaboration across multiple disciplines is considered to be critical to achieving success. But the increasing number of professional associations and events of relevance to UX practitioners rely much less on collaboration with others in their pursuit of success. This panel reports on obstacles to and opportunities for increasing collaboration among professional organizations, and the effects increased collaboration can have on the service and support provided to the rapidly growing, multidisciplinary UX profession.
Jeeg: temporal constraints for the synchronization of concurrent objects: Research Articles
Authors: Giuseppe Milicia, Vladimiro Sassone
Venue: Concurrency and Computation: Practice Experience (2005)

We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the &lsquo;business&rsquo; and the &lsquo;synchronization&rsquo; code of classes. Synchronization constraints in Jeeg are expressed in a linear temporal logic, which allows one to effectively limit the occurrence of the inheritance anomaly that commonly affects concurrent object-oriented languages. Jeeg is inspired by the current trend in aspect-oriented languages. In a Jeeg program the sequential and concurrent aspects of object behaviors are decoupled: specified separately by the programmer, these are then weaved together by the Jeeg compiler. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Performance and verification
Authors: Boudewijn R. Haverkort, Joost-Pieter Katoen
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Some twentyfive years ago, the field of computer-communication system performance evaluation and the field of formal specification and verification were regarded as completely disjunct. The former field focussed on the quantitative aspects of system behaviour, expressed in measures such as delays, throughputs and loss probabilities, whereas the latter field focussed on the qualitative aspects of system behaviour, expressed in measures (or, properties) such as system liveness, deadlock freeness and safety. Over the years, however, this distinction has shown to be not always useful. In fact, we see a large variety of systems for which the qualitative behaviour cannot be decoupled from the quantitative aspect. Think for instance of communication protocols in an embedded system setting: the qualitative correctness of a protocol, without considering (absolute) timing aspects, is not enough for classifying a protocol as correct. Indeed, only when the protocol behaves as it should, and does so in a timely manner, the protocol can be regarded as correct. Observations of this kind have lead to a variety of integrated approaches toward performance evaluation and verification.
Resource-based interdependencies in value networks for mobile internet services
Authors: Uta Wehn de Montalvo, Els van de Kar, Carleen Maitland
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The advent of new electronic platforms, such as fixed and mobile Internet, is forcing firms from a range of industries to come together in so-called 'value networks' for the provision of innovative services. Firms from different industries have widely varying resources. Our analysis is aimed at specific types of interdependencies, relating the actors own' and others' resource contributions to the value creation involved in bringing the service about. To better understand these interdependencies, we draw on theories about firm resources and inter-organisational relations. We analyse the importance and relevance of different resources in a number of case studies of 'mobile information and entertainment services', in terms of the actors' resources and contributions to value in the provision of such mobile services. In the cross-case comparison, we contrast the power structures in the different value networks and identify similarities and differences in terms of the types of industrial players that assume positions of greater or lesser importance. We conclude with a discussion of the implications for value network research.
Book review: Knowledge Systems Design by John K. Debenham (Prentice Hall, 1989)
Venue: ACM SIGART Bulletin (1990)

The author introduces the book in the reface as one meant for people interested in building expert systems and deductive databases, and in particular for those interested in building maintainable expert systems. He states that the book is not meant for a beginner, but is "designed for the educated, knowledge processing specialist". The book is slanted towards working professionals, rather than academics, a stance which is indicated by his statement in the preface where he states that "[the book] should be of prime interest to those large corporations with a commitment to building a large, integrated, corporate knowledge base".
Incidences of not-too-degenerate hyperplanes
Authors: György Elekes, Csaba D. Tóth
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We present a multi-dimensional generalization of the Szemerédi-Trotter Theorem, and give a sharp bound on the number of incidences of points and not-too-degenerate hyperplanes in three- or higher-dimensional Euclidean spaces. We call a hyperplane not-too-degenerate if at most a constant portion of its incident points lie in a lower dimensional affine subspace.
Kinetic collision detection with fast flight plan changes
Authors: John Hershberger
Venue: Information Processing Letters (2004)

We show how to augment a kinetic data structure for collision detection between translating polygons with the ability to make fast flight plan changes. This allows us to update the KDS after a moving polygon changes its motion in O(log n) time, instead of the Ω(n) worst-case time needed by previous kinetic data structures. The key to our approach is replacing the KDS priority queue by a dynamic convex hull that represents the certificates of the KDS.
WS-GAF: a framework for building Grid applications using Web Services: Research Articles
Authors: Savas Parastatidis, Jim Webber, Paul Watson, Thomas Rischbeck
Venue: Concurrency and Computation: Practice Experience (2005)

This paper presents the motivation and design decisions for the Web Services Grid Application Framework (WS-GAF), which is a mapping of Grid architecture requirements onto the Web Services Architecture. The goal for WS-GAF is to describe a framework for building Grid applications that adheres to the principles of service-oriented architectures and utilizes existing Web Services technologies. The proposed solution addresses issues including stateful interactions, logical resource naming, metadata, and lifetime management. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Multi-bend bus driven floorplanning
Authors: Jill H. Y. Law, Evangeline F. Y. Young
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper, the problem of bus-driven floorplanning is addressed. Given a set of blocks and the bus specification (the width of each bus and the blocks that the bus need to go through), we will generate a floorplan solution such that all the buses go through its blocks, with the area of the floorplan and the total area of the buses minimized. The approach proposed is based on a Simulated Annealing framework. Using the sequence pair representation, we derived the necessary conditions for feasible buses, for which we allow 0-bend, one-bend, or two-bend. Then, we will check whether there are buses that cannot be placed at the same time. Finally, a solution will be generated giving the coordinates of the modules and the buses. Comparing with the results of the algorithm by Xiang et al., the dead space of the floorplan obtained is reduced. Besides, our algorithm can handle buses going through many blocks. For example, if the buses have to go through more than 10 blocks, is not able to generate any solution while our algorithm can still generate solutions of good quality.
Webometrics: an introduction to the special issue
Authors: Mike Thelwall, Liwen Vaughan
Venue: Journal of the American Society for Information Science and Technology (2004)

Webometrics, the quantitative study of Web phenomena, is a field encompassing contributions from information science, computer science, and statistical physics. Its methodology draws especially from bibliometrics. This special issue presents contributions that both push forward the field and illustrate a wide range of webometric approaches.
An analysis of TCP reset behaviour on the internet
Authors: Martin Arlitt, Carey Williamson
Venue: ACM SIGCOMM Computer Communication Review (2005)

This paper presents a one-year study of Internet packet traffic from a large campus network, showing that 15-25% of TCP connections have at least one TCP RST (reset). Similar results have also been observed from measurements of other Internet links. The results in this paper show that reset connections arise from local events such as network outages, attacks, or reconfigurations, as well as from global trends in TCP usage. In particular, we identify application-level Web behaviour as the primary contributor to the global trend in reset TCP connections. The most prevalent anomaly is the absence of the normal connection termination handshake. Instead, connections are often reset by the client. We believe that particular implementations of HTTP/TCP connection management cause this global trend.
HPC Performance Analysis of a Distributed Information Enterprise Simulation
Authors: James P. Hanna, Martin J. Walter, Robert G. Hillman
Venue: Proceedings of the 2004 Users Group Conference (2004)

Simulations of distributed information enterprises using the DIEMS framework were performed on HPC clusters and SMP machines. The simulation results were analyzed with respect to the computation time involved in each process, the number of times processes were executed,the number of simulation rollbacks invoked during each simulation, simulation overhead, and the total wall clock time used to perform the simulation. The analysis identified several performance limitations and bottlenecks. One critical limitation addressed and eliminated was simultaneously mixing a periodic process model with an event driven model causing rollbacks. The second major factor limiting performance on cluster based systems was the cross-node communication. An optimization technique that exploits the knowledge of the publication and subscription paradigm of the information architecture being simulated was developed. This paper describes the simulation analysis, the modifications to the simulation models, the development of an optimization technique, and the impact of the code improvements on simulation performance.
An Update on Software Updates
Authors: David J. Brown
Venue: Queue (2005)

When I raised the idea at the Queue editorial advisory board meeting several months ago, it was because I think the way that software is now being delivered to us is quite interesting. Things have changed. Nowadays you much less often expect to "install" whole systems or indeed even individual applications. Instead you've probably become quite used to the idea of accepting ongoing updates to what you already havea behavior of happily receiving incremental changes to your software systems and/or applications by what I like to describe as the process of "bit dripping" from vendors over the Web.
Min-Max Fairness Scheme for Resource Allocation in Cellular Multimedia Networks
Authors: Mohammad Mahfuzul Islam, Manzur Murshed
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper proposes a new method of bandwidth sharing policy which dynamically adjusts the bandwidth among the different services within the cell with changing network traffics. The proposed method, called min-max fairness scheme, exhibits good performances in cellular network applications where bandwidth is at a premium such as in multimedia communications.The improved efficiency of the scheme is achieved by considering the online and the offline services in different ways as well as using a strategy of temporary borrowing the reserved bandwidth for offline services. The scheme distributes the bandwidth among the services as evenly as possible and guarantees the minimum bandwidth to all the services besides maintaining the quality of service at various traffic loads.Simulation results are presented to confirm the superior performance compared with other recent existing schemes.
Neat function algebraic characterizations of logspace and linspace
Authors: Lars Kristiansen
Venue: Computational Complexity (2005)

We characterize complexity classes by function algebras that neither contain bounds nor any kind of variable segregation. The class of languages decidable in logarithmic space is characterized by the closure of a neat class of initial functions (projections and constants) under composition and simultaneous recursion on notation. We give a similar characterization of the class of number-theoretic 0--1 valued functions computable in linear space using simultaneous recursion on natural numbers in place of simultaneous recursion on notation.
A focus on conferences
Authors: Nico Macdonald
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Conferences are still valuable for established attendees and potential new audiences, and the overall audience for events can be increased, helping alleviate competition between professional organisations.In addition professional organisations need to avoid conferences being run-of-the-mill, and taking their audience for granted. They need to widen their primary and secondary audiences by helping potential attendees and presenters find out about events, evaluate those they might attend, and benefit in other ways from participating in; professionalising presentation and documentation; facilitating more controversial discussion; improving media relations (including with informal commentators).Some of the solutions involved re-designing and re-programming events, greater inter-organisational cooperation, technical developments, and greater intelligence when thinking about audiences and stakeholders.
A Localized, Distributed Protocol for Secure Information Exchange in Sensor Networks
Authors: Tassos Dimitriou, Ioannis Krontiris
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We consider the problem of securing communication between sensor nodes in large-scale sensor networks. We propose a distributed, deterministic key management protocol designed to satisfy authentication and confidentiality, without the need of a key distribution center. Our scheme is scalable since every node only needs to hold a small number of keys independent of the network size, and it is resilient against node capture and replication due to the fact that keys are localized; keys that appear in some part of the network are not used again. Another important property of our protocol is that it is optimized for message broadcast; each node shares one pairwise key with all of its immediate neighbors, so only one transition is necessary to broadcast a message. Furthermore, our scheme is suited for data fusion and aggregation processing; if necessary, nodes can "peak" at encrypted data using their cluster key and decide upon forwarding or discarding redundant information. Finally, we describe a mechanism for evicting compromised nodes as well as adding new nodes. A security analysis is discussed and simulation experiments presented.
Protein Explorer: A Petaflops Special-Purpose Computer System for Molecular Dynamics Simulations
Authors: Makoto Taiji, Tetsu Narumi, Yousuke Ohno, Noriyuki Futatsugi, Atsushi Suenaga, Naoki Takada, Akihiko Konagaya
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We are developing the 'Protein Explorer' system, a petaflops special-purpose computer system for molecular dynamics simulations. The Protein Explorer is a PC cluster equipped with special-purpose engines that calculate nonbonded interactions between atoms, which is the most time-consuming part of the simulations. A dedicated LSI 'MDGRAPE-3 chip' performs these force calculations at a speed of 165 gigaflops or higher. The system will have 6,144 MDGRAPE-3 chips to achieve a nominal peak performance of one petaflop. The system will be completed in 2006. In this paper, we describe the project plans and the architecture of the Protein Explorer.
Generalized Zernike or disc polynomials
Authors: Alfred Wünsche
Venue: Journal of Computational and Applied Mathematics (2005)

We investigate generalized Zernike or disc polynomials Pαm,n(z,z*) which are orthogonal 2D polynomials in the unit disc 0 ≤ √zz* < 1 with weights (1 - zz*)α in complex coordinates z ≡ x + iy, z* ≡ x - iy, where α > - 1 is a free parameter. These polynomials can be expressed by Jacobi polynomials of transformed arguments in connection with a simple angle dependence. A limiting procedure α → ∞ leads to Laguerre 2D polynomials Lm,n(z,z*). Furthermore, we introduce the corresponding orthonormalized disc functions. The disc polynomials and disc functions obey two differential equations, a first-order and a second-order one with a certain degree of freedom, and the operators of lowering and raising of the indices are found. These operators can be closed to a Lie algebra su(1,1) ⊕ su(1,1). New generating functions are derived from an operational representation which is alternative to the Rodrigues-type representation. The one-dimensional analogue of the disc polynomials which are orthogonal polynomials in the interval 0 ≤ r ≤ 1 with weight factors (1 - r2)x are ultraspherical or Gegenbauer polynomials in a new standardization. The lowering and raising operators to the corresponding orthonormalized functions form a simple su(1,1) Lie algebra. This is given in the appendix in sketched form.
An Improved Polling Scheme for Voice Support in IEEE 802.11 Wireless Network
Authors: Jun Zheng, Emma Regentova
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, we present a polling scheme which allows for augmenting the support of voice communications in point co-ordination function (PCF) of IEEE 802.11 wireless networks. In this scheme, the Access Point (AP) of the Basic Service Set (BSS) maintains two polling lists, i.e. the talking list and the silence list. Based on the talking status of the stations identified via silence detection, the two lists are dynamically adjusted by the AP. Temporary removal is applied to the stations in the silence list to further upgrade the performance. The conducted study based on simulation has shown that the proposed scheme is able to support more voice stations and has a lower packet loss rate compared to that obtained by four reference polling algorithms.
Skills required for participating in CMC courses: an empirical study
Authors: Zippy Erlich, Iris Erlich-Philip, Judith Gal-Ezer
Venue: Computers Education (2005)

The development of new communication technologies and their applications has opened a broad spectrum of options to promote learning, of which a significant one is CMC - Computer-Mediated Communication. Yet, students use this medium to a relatively small extent. Our premise is that the use of these technologies depends on the level of skills and expertise of the individuals using them. The purpose of this study is to determine whether taking a Computer Literacy and Applications course (CLA) before taking CMC courses has an impact on students' participation in CMC courses and on the effective use of various CMC tools. The sample consisted of 153 students enrolled in CMC courses in the Social Sciences in the Spring 2001/2 and Fall 2002/3 semesters. Participants were divided into two groups: 80 students who had taken CLA, and 73 students who had not. A questionnaire to assess the impact of CLA on participation in CMC courses was administered to the two groups. The results of the study indicate that participation in CMC courses is more intensive in the group that had taken CLA. Based on these findings, we recommend mandating a CLA course, like the one developed at the Open University of Israel (OUI), before taking CMC courses.
University of Pennsylvania: description of the University of Pennsylvania system used for MUC-6
Authors: Breck Baldwin, Mike Collins, Jason Eisner, Adwait Ratnaparkhi, Joseph Rosenzweig, Anoop Sarkar
Venue: Proceedings of the 6th conference on Message understanding (1995)

Breck Baldwin and Jeff Reynar informally began the University of Pennsylvania's MUC-6 coreference effort in January of 1995. For the first few months, tools were built and the system was extended at weekly 'hack sessions.' As more people began attending these meetings and contributing to the project, it grew to include eight graduate students. While the effort was still informal, Mark Wasson, from Lexis-Nexis, became an advisor to the project. In July, the students proposed to the faculty that we formally participate in the coreference task. By that time, we had developed some of the system's infrastructure and had implemented a simplistic coreference resolution system which resolved proper nouns by means of string matching. After much convincing, the faculty agreed at the end of July that we could formally participate in MUC-6. We then began an intensive effort with full-time participation from Baldwin and Reynar, and part-time efforts from the other authors. In August we were given permission from Yael Ravin of IBM's Information Retrieval group to use the IBM Name Extraction Module [3]. We were also given access to a large acronym dictionary which Peter Flynn maintains for a world wide web site in Iceland (http://curia.ucc.ie/info/net/acronyms/acro.html).
Wearable body organs: critical cognition becomes (again) somatic
Authors: Kelly Dobson
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Three factors involved in cognition - the individual, the collective, and the objective reality - are related and investigated through the safe facilitation offered by Wearable Body Organs. Each device is adaptable to its current user and the community it is active in, made by the person and community, becoming another plane of experience. We return to a body based knowledge and communication, and simultaneously breech our once assumed body boundaries.