ppxscal/embedding_network huggingface dataset:
Illumination Invariant Face Detection Using Classifier Fusion
Authors: Alister Cordiner, Philip Ogunbona, Wanqing Li
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

An approach to the problem of illumination variations in face detection that uses classifier fusion is presented. Multiple face detectors are seperately trained for different illumination environments and their results are combined using a combination rule. To define the illumination environments, the training samples are clustered based on their illumination using unsupervised training. Different methods of clustering the samples and combining the outputs of the classifiers are examined. Experiments with the AR face database show that the proposed method achieves higher accuracy than the traditional monolithic face detection method.
Simulation Research on Impaction between Tramcar and Flexible Bumper
Authors: Wenhai He
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Flexible bumper which is made from wire ropes can be used to head off run-away tramcars in acclivitous shaft of mine. In practice, the flexible bumper joints the traction wire rope of multi-plate energy absorber which can transform the kinetic energy of the tramcars into friction heat. When the tramcars are head off by the flexible bumper, the traction wire rope is stretched. The tension of the traction wire rope is a key parameter for the design of the flexible bumper and the multi-plate energy absorber. A time dependent nonlinear model is developed for analyzing the impaction course between the tramcars and the flexible bumper. It is known that variation of the tension can be divided into four phases which correspond to the motion of the tramcars. The analysis from the nonlinear model shows that the impaction force between the tramcars and the flexible bumper can be reduced because the multi-plate energy absorber is used.
Embedded System Implementation of Sound Localization in Proximal Region
Authors: Nobuyuki Iwanaga, Tomoya Matsumura, Akihiro Yoshida, Wataru Kobayashi, Takao Onoye
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A sound localization method in the proximal region is proposed, which is based on a low-cost 3D sound localization algorithm with the use of head-related transfer functions (HRTFs). The auditory parallax model is applied to the current algorithm so that more accurate HRTFs can be used for sound localization in the proximal region. In addition, head-shadowing effects based on rigid-sphere model are reproduced in the proximal region by means of a second-order IIR filter. A subjective listening test demonstrates the effectiveness of the proposed method. Embedded system implementation of the proposed method is also described claiming that the proposed method improves sound effects in the proximal region only with 5.1% increase of memory capacity and 8.3% of computational costs.
An optimal pollution surveillance schedule generating system (OPGENS)
Authors: Lynn J. McKell, Gordon P. Wright, David G. Olson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In recent years there has been a general increase in concern for the quality of the environment. While this concern has been manifest in many different ways, considerable attention has focused in the area of water pollution because of the following factors: (1) A few shipping accidents have caused spectacular local threats to the environment. (2) Leaks in offshore oil well drilling operations have received widespread news coverage. (3) A rising demand for petroleum products throughout the world complicated by political considerations has produced a corresponding expansion in tanker shipping operations and in offshore oil operations, both of which increase the potential threat of pollution to the ocean environment.
Unambiguous Erasing Morphisms in Free Monoids
Authors: Johannes C. Schneider
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

This paper discusses the fundamental combinatorial question of whether or not, for a given string &alpha;, there exists a morphism &sigma; such that &sigma; is unambiguous with respect to &alpha;, i. e. there exists no other morphism &tau; satisfying &tau;(&alpha;)&thinsp;=&thinsp;&sigma;(&alpha;). While Freydenberger et al. (International Journal of Foundations of Computer Science 17, 2006) characterise those strings for which there exists an unambiguous non-erasing morphism &sigma;, little is known about the unambiguity of erasing morphisms, i.e. morphisms which map symbols onto the empty string. The present paper demonstrates that, in contrast to the main result by Freydenberger et al., the existence of an unambiguous erasing morphisms for a given string can essentially depend on the size of the target alphabet of the morphism. In addition to this, those strings for which there exists an erasing morphism over an infinite target alphabet are characterised, complexity issues are discussed and some sufficient conditions for the (non-)existence of unambiguous erasing morphisms are given.
Testing and analysis of an algorithm for protein structure comparison
Authors: Dobrinka Petrova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

End Space Free Alignment Algorithm with Geometric Properties Detection is tested with different cytokines for similarity detection. The results are compared with the work of two protein structure comparison methods with proven quality -- DALI and VAST. Compared values are analyzed and show that the tested algorithm proposes very good results. The tests and the subsequent analysis make possible the parameter optimization of the analyzed algorithm. A new definition for one of the parameters -- distance factor, is made, tested and analyzed.
A synthesizer of inductive assertions
Authors: Steven M. German, Ben Wegbreit
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Mechanical verification of program correctness is desirable and possible. Given a program with complete, correct predicate specifications on the input, output, and each loop, verification of the output predicate is a mechanical process (cf. References 5 and 15 for surveys).
Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
Authors: Jan Jeżabek
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We consider the following scheduling problem: Given a set of unit-length jobs characterized by release times, deadlines and weights an algorithm must pick at most one job for each unit of time with the goal of maximizing the total weight of the chosen jobs. An on-line algorithm is an algorithm which has no information about a job before its release time. In the basic version of this problem it is known that any on-line algorithm is outperformed by an optimal off-line algorithm by a factor of ${{1+\sqrt{5}}\over{2}}-\varepsilon$ on some instance. In this paper we examine the effect of increasing the on-line algorithm's speed --- that is the number of jobs chosen for each unit of time --- and show that no speedup can fully compensate for the lack of complete information. 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
Applying a Video-based Requirements Engineering Technique to an Airport Scenario
Authors: Bernd Bruegge, Oliver Creighton, Maximilian Reiβ, Harald Stangl
Venue: Proceedings of the 2008 Third International Workshop on Multimedia and Enjoyable Requirements Engineering - Beyond Mere Descriptions and with More Fun and Games (2008)

In the development of software-intensive systems, the interaction between customer and supplier is usually text-based. We argue that with agile project management gaining momentum, the inclusion of end-user feedback and a better mutual understanding between customer and supplier on hardware and software design goals becomes increasingly important. We propose the use of video techniques, Video-based Requirements Engineering (VBRE), to support the communication between all stakeholders. The key ingredients of VBRE are user-centric videos and an exploratory environment for creating multi-path scenarios. In this workshop session, the participants will get hands-on experience with VBRE techniques and tools while working on a fictitious airport baggage handling system.
An Algorithm to Construct Greedy Drawings of Triangulations
Authors: Patrizio Angelini, Fabrizio Frati, Luca Grilli
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We show an algorithm to construct greedy drawings of every given triangulation.
The number "6" in planar tilings
Authors: Hao Li
Venue: WSEAS Transactions on Mathematics (2008)

This paper obtains some important properties of planar normal tiling and proves purely combinatorially Grünbaum's Theorem. Moreover, we give the six-neighbor-theorem and definite "relative density" to describe the increase of tiles with some special properties. Finally, Γpm-tilings are classified by their adjacent-types.
Compiling with Continuations
Authors: Andrew W. Appel
Venue:  (2007)

This book shows how continuation-passing style is used as an intermediate representation to perform optimizations and program transformations. Continuations can be used to compile most programming languages. The method is illustrated in a compiler for the programming language Standard ML. Prior knowledge of ML, however, is not necessary, as the author carefully explains each concept as it arises. This is the first book to show how concepts from the theory of programming languages can be applied to the production of practical optimizing compilers for modern languages like ML. All the details of compiling are covered, including the interface to a runtime system and garbage collector.
e-governance: challenges and opportunities
Authors: Mahbubul Alam, Kawsar Ahmed, Md. Ashraful Islam
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The advent of information and communication technology (ICT) together with the diffusion of the technological advances has resulted in the digital revolution and the emergence of the Information age. The revolution has created an enormous impact on social, political, and cultural livelihood of the masses - taking the whole world into a different era. Bangladesh is one of the developing countries striving strongly for nation building by leveraging ICT. Platforms for interaction amongst the Government, businesses and citizens to ensure easy accessibility of information to all levels of the society could be developed using ICT. e- Governance is the public sector's use of information and communication technologies with the aim of improving information and service delivery, encouraging citizen participation in the decision-making process and making government more accountable, transparent and effective. This paper focuses on the issues and challenges that Bangladesh currently faces in the implementation of e-Governance. Through collaborative networks of public-private partnerships we discuss how the dual problem of infrastructural barriers and weak ICT policies could be addressed. Specifically, we present a design framework to overcome these obstacles.
Provisions for flexibility in the Link&ouml;ping office information system (LOIS)
Authors: Erik Sandewall, Göran Hektor, Anders Ström, Claes Strömberg, Ola Strömfors, Henrik Sörensen, Jaak Urmi
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The Link&ouml;ping Office Information System (LOIS) is an integrated system of facilities for text preparation, data base management, communication by computer, and miscellaneous other services. It is an experimental research system, which is used by researchers and secretaries in our own research group.
Study on Spreading of Virus Infection with SIRS Characteristic in Wireless Sensor Networks
Authors: Zhang Shu-kui, Gong Sheng-rong, Cui Zhi-ming
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In the precondition of the basic connectivity of wireless sensor networks, how to control spreading of the virus infection is the most challenging security problem in a large number of sensor nodes deployed randomly. Existing research results show that network topology is complex and spreading of virus infection heavily. In order to constitute the reasonable immune strategy and control the spreading of virus infection effectively in sensor networks. in this paper, a virus spreading model with average degree constraint was proposed. For this model, With increasing communication radius and constraining node degree, the inconsistency of network topology connectivity and sparseness can be solved. Our scheme can decrease working nodes, guarantee network topology sparseness; the effect of activity nodes-density d, spread efficiency λ on the spreading of virus infection was studied. The theoretical analysis and analog simulation show that there is a critical value in this model based on average degree constraint, and only when the product of spread efficiency and activity nodes-density goes beyond the critical value that the virus infection can spread continuously.
Restricted subset selection
Authors: E. Jack Chen
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper develops procedures for selecting a set of normal populations with unknown means and unknown variances in order that the final subset of selected populations satisfies the following requirements: with probability at least P*, the selected subset will contain a population or "only and all" of those populations whose mean lies less than the distance d* from the smallest mean. The size of the selected subset is random, however, at most m populations will finally be chosen. A restricted subset attempts to exclude populations that are deviated more than d* from the smallest mean. Here P*, d*, and m are users specified parameters. The procedure can be used when the unknown variances across populations are unequal. An experimental performance evaluation demonstrates the validity and efficiency of these restricted subset selection procedures.
The noises' limits of the laser satellite communication system
Authors: Marketa Smejkalova Mazalkova
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

Optical space communications is on the verge of being reality. The paper involves the introduction into laser satellite communication system. The paper includes briefly analysis, optimization, and design and system level development of signal transferring between satellites. Research opportunities in this area include development of laser beam acquisition, tracking and pointing techniques and algorithms, development of computer aided analysis link budget for the free space channel, systems engineering (analysis and design) of optical transmission development of high efficiency flight qualifiable solid-state lasers, fast fine-pointing mirrors high update-rate acquisition and tracking cameras and very low-noise high-quantum efficiency receiver. It is focused on the noises' limits of the optical communication system. The paper solves the problems with noises' limits by various ways. There are mentioned the optical energy output on an aperture's spread of optical detector and incoherent detection of optical carrier wave.
The DLV Project: A Tour from Theory and Research to Applications and Market
Authors: Nicola Leone, Wolfgang Faber
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

DLV is one of the most succesful and widely used ASP systems. It is based on stable model semantics, and supports a powerful language extending Disjunctive Logic Programming with many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. In this paper, we describe the long tour from basic research on languages and semantics, studies on algorithms and complexity, design and implementation of prototypes, up to the realization of a powerful and efficient system, which won the last ASP competition, is employed in industrial applications, and is even ready for marketing and commercial distribution. We report on the experience we got in more than twelve years of work in the DLV project, focusing on most recent developments, industrial applications, trends, and market perspectives.
JWeb: An HDM Environment for Fast Development of Web Applications
Authors: Mario A. Bochicchio, Roberto Paiano, Paolo Paolini
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

JWeb is a development environment for complex WWW applications, based upon the HDM model. JWeb (entirely written in Java) consists of two different parts: the development environment and the execution environment. The development environment allows the definition of the conceptual structure of the application, the creation of a supporting DataBase and the DataBase population. The execution environment allows the running of the application, possibly after some customization operations. We envision three main ways of using JWeb: as a training tool, for students and practitioners; as a fast prototyping tool, to test different design hypothesis, and to come up with a final design; as a tool for fast development and deployment of complex, high quality, Web applications.
An Integrated Approach for Defining Pricing Strategies in Competitive Markets
Authors: Gülfem Isiklar Alptekin, S. Emre Alptekin
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

Quality function deployment (QFD) is a customer-oriented decision support tool with cross-functional team members reaching a consensus in developing a new or improved product to increase customer satisfaction. In this paper, we concentrate on showing the strong effect of QFD methodology on customer satisfaction and on the price determination of a product. The end-users demand to the newly developed or existing products depends not only on the quality level and the price of that producer, but also upon those of its competitors. Our proposed pricing model applies game theory as its mathematical base. The equilibrium point of the game gives the best pricing strategy for the producers. We use the QFD methodology to obtain end-user preferences and quality levels of the competitors. Besides, QFD enables the producer to determine on which product technical requirements to concentrate in order to get more market share.
Bandwidth Allocation for Layered Multicasted Video
Authors: Hugh M. Smith, Matt W. Mutka, Eric Torng
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Some type of transmission rate control protocol is required in order to support multicast video applications over the Internet. Previously, researchers have proposed two basic families of control protocols. The first, sender based rate-adaptation, focuses on the sender. The sender uses a single channel to transmit the video signal to all receivers, and the sender adjusts the transmission rate of this single channel based upon network or receiver feedback. The second protocol focuses on the receivers. The sender stripes the video signal across multiple multicast channels, and each receiver selectively adds and drops channels to meet their individual needs.In this paper, we propose a new protocol, Layered Multicast Control Protocol (LMCP), which melds the strengths of the two previous approaches. The sender stripes the video signal across multiple multicast channels, and each receiver selectively adds and drops channels to meet their individual needs. The receivers also send feedback to the sender, and the sender uses this feedback to adjust the transmission rate for each channel. We present and analyze three different algorithms the sender might use for computing the transmission rates for each channel. Our analytical and simulation results show that this protocol achieves essentially optimal bandwidth utilization at the receivers.
Network Science: Theory and Applications
Authors: Ted G. Lewis
Venue:  (2009)

The first comprehensive book on the emerging field of network science, Network Science: Theory and Applications is an exhaustive review of terms, ideas, and practices in the various areas of network science. In addition to introducing theory and application in easy-to-understand, topical chapters, this book describes the historical evolution of network science through the use of illustrations, tables, practice problems with solutions, case studies, and applications to related Java software. Researchers, professionals, and technicians in engineering, computing, and biology will benefit from this overview of new concepts in network science.
Mutation Operators for Spreadsheets
Authors: Robin Abraham, Martin Erwig
Venue: IEEE Transactions on Software Engineering (2009)

Based on (1) research into mutation testing for general purpose programming languages, and (2) spreadsheet errors that have been reported in the literature, we have developed a suite of mutation operators for spreadsheets. We present an evaluation of the mutation adequacy of du-adequate test suites generated by a constraint-based automatic test-case generation system we have developed in previous work. The results of the evaluation suggest additional constraints that can be incorporated into the system to target mutation adequacy. In addition to being useful in mutation testing of spreadsheets, the operators can be used in the evaluation of error-detection tools and also for seeding spreadsheets with errors for empirical studies. We describe two case studies where the suite of mutation operators helped us carry out such empirical evaluations. The main contribution of this paper is a suite of mutation operators for spreadsheets that can be used for carrying out empirical evaluations of spreadsheet tools to indicate ways in which the tools can be improved.
On randomized algorithms for the majority problem
Authors: Demetres Christofides
Venue: Discrete Applied Mathematics (2009)

In the majority problem, we are given n balls coloured black or white and we are allowed to query whether two balls have the same colour or not. The goal is to find a ball of majority colour in the minimum number of queries. The answer is known to be n-B(n) where B(n) is the number of 1's in the binary representation of n. In this paper we study randomized algorithms for determining majority, which are allowed to err with probability at most @e. We show that any such algorithm must have expected running time at least (23-o(1))n. Moreover, we provide a randomized algorithm which shows that this result is best possible. These extend a result of De Marco and Pelc [G. De Marco, A. Pelc, Randomized algorithms for determining the majority on graphs, Combin. Probab. Comput. 15 (2006) 823-834].