ppxscal/embedding_network huggingface dataset:
Automatic reconstruction of 3D human motion pose from uncalibrated monocular video sequences based on markerless human motion tracking
Authors: Beiji Zou, Shu Chen, Cao Shi, Umugwaneza Marie Providence
Venue: Pattern Recognition (2009)

We present a method to reconstruct human motion pose from uncalibrated monocular video sequences based on the morphing appearance model matching. The human pose estimation is made by integrated human joint tracking with pose reconstruction in depth-first order. Firstly, the Euler angles of joint are estimated by inverse kinematics based on human skeleton constrain. Then, the coordinates of pixels in the body segments in the scene are determined by forward kinematics, by projecting these pixels in the scene onto the image plane under the assumption of perspective projection to obtain the region of morphing appearance model in the image. Finally, the human motion pose can be reconstructed by histogram matching. The experimental results show that this method can obtain favorable reconstruction results on a number of complex human motion sequences.
A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
Authors: Peerayuth Charnsethikul
Venue: International Journal of Computer Mathematics (2009)

This study proposes an algorithm capable of working in parallel for solving variable statistics with large and sparse linear equations under given right hand side ranges. A comparative study to the direct linear programming method is conducted under a main central processor and up to four parallel processors. The studied results are reported computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally in a case example.
CONCERTO, Conceptual Indexing, Querying and Retrieval of Digital Documents
Authors: Elisa Bertino, Barbara Catania, Bill Black, John McNaught, Fabio Rinaldi, Andrew Brasher, Diana Deavin, Andreas Persidis, Vito Candela, Floriana Esposito, Giovanni Semeraro, Gian Piero Zarri
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, we give a general overview of the European Esprit project CONCERTO (CONCEptual indexing, querying and ReTrieval Of digital documents, P29159, URL: http://concerto.pira.co.uk/). The central idea of CONCERTO is to represent the 'meaning' of digital documents making use of their associated 'conceptual annotations': a conceptual annotation is intended to supply a computer-usable description of the main information elements of the whole document or of a part of it. We will describe the general architecture of the CONCERTO Knowledge Engineering Software Environment (KESE).
Computer-aided documentation
Authors: Saul Rosenberg
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Current standards for high-quality documentation of complex computer systems include many criteria, based on the application and user levels. Important points common to many systems are: targeting to specific user groups; being complete, concise, and structured; containing both tutorials and reference material; being field-tested; and being timely in appearence relative to the software delivery. To achieve these goals, uniform quality standards should be more vigorously applied, the documentation development cycle should be shortened, more documentation/software help should be available on line, and more user interaction should be solicited. For future computer systems, the proposal is made that the documentation be "machine comprehensible." This should be phased in, with the immediate goal being to facilitate user querying for information, and with an ultimate goal of providing a database for "programmer apprentice" artificial-intelligence programs that assist software development. This new functionality will be the result of several trends, including the drastically reduced cost of read-only online random-access storage via video optical disks, the ongoing successes of artificial-intelligence programs when applied to limited application areas, and the ever increasing cost of software programmers.
Designing applied cryptology laboratory modules with free and open source software
Authors: Ed Crowley
Venue: Journal of Computing Sciences in Colleges (2009)

For today's computer professionals, secure data storage and secure data communications are vital competencies. In the current Internet aware environment, effective security necessitates the application of cryptology. Daily, modern businesses rely on cryptographic services such as authentication, non-repudiation, integrity, and confidentiality, to secure their information. Creating relevant applied cryptology laboratory modules can be a challenge. One interesting challenge is the choice of laboratory software. By design, most commercial cryptology software shields the user from operational details. Consequently, most commercial software does not lend itself well to laboratory activities. Fortunately, there are Open Source Cryptographic Toolkits that have worked well in our lab environment. This paper presents the author's experience with the development and evolution of applied cryptography laboratory modules. These laboratory modules utilize Free and Open Source Software (FOSS) exclusively.
Electronics as material: littleBits
Authors: Ayah Bdeir
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

As the democratization of electronics gains more momentum, we are interested in thinking of electronics as material that can be combined with other traditional ones such as paper, cardboard and screws. littleBits is an opensource library of discrete electronic components pre-assembled in tiny circuit boards. By creating simple, intuitive, space-sensitive blocks we attempt to make prototyping with sophisticated electronics a matter of snapping small magnets together. With a growing number of available modules, littleBits aims to move electronics from late stages of the design process to its earliest ones, and from the hands of experts, to those of artists, makers and designers.
Fair and timely scheduling via cooperative polling
Authors: Charles Krasic, Mayukh Saubhasik, Anirban Sinha, Ashvin Goel
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Advances in hardware capacity, especially I/O devices such as cameras and displays, are driving the development of applications like high-definition video conferencing that have tight timing and CPU requirements. Unfortunately, current operating systems do not adequately provide the timing response needed by these applications. In this paper, we present a hierarchical scheduling model that aims to provide these applications with tight timing response, while at the same time preserve the strengths of current schedulers, namely fairness and efficiency. Our approach, called cooperative polling, consists of an application-level event scheduler and a kernel thread scheduler that cooperate to dispatch time-constrained application events accurately and with minimal kernel preemption, while still ensuring rigorously that all applications share resources fairly. Fairness is enforced in a flexible manner, allowing sharing according to a mixture of both traditional resource-centric metrics and new application-centric metrics, the latter being critical to support graceful application-level adaptation in overload. Unlike traditional real-time systems, our model does not require specification or estimation of resource requirements, simplifying its usage dramatically. Our evaluation, using an adaptive video application and a graphics server, shows that our system has event dispatch accuracies that are one to two orders of magnitude smaller than are achieved by existing schedulers. At the same time, our scheduler still maintains fairness and has low overhead.
Skeleton-Based Recognition of Chinese Calligraphic Character Image
Authors: Kai Yu, Jiangqin Wu, Yueting Zhuang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

The large amount of digitized Chinese calligraphic works in existence is a valuable part of the Chinese cultural heritage. But they can hardly be recognized by optical character recognition (OCR) which performs well on machine printed characters against clean background, because there are so different styles of shape complexity characters. So the approaches of automatic Chinese calligraphic character recognition become more and more important. A novel skeletonization algorithm called MFITS (morphology-fused index table skeletonization) is proposed and a skeleton-based Chinese calligraphic character recognition method is proposed too. The experiments show that MFITS can extract skeletons with only a few deformations and the skeleton-based Chinese calligraphic character image recognition method has a good performance.
Government enterprise architectures: present status of Bangladesh and scope of development
Authors: Muhammad Abul Kalam Azad, Md. Ashik Ali Khan, Mahbubul Alam
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

For government to utilize ICT resources and infrastructure most effectively for e-Governance with proper returns on investment, Government should have an appropriate Government Enterprise Architectures (GEA). It is the basic platform on which every application stand. Government is one of the biggest organizations in any country with several ministries, divisions, and departments with a fundamental need to integrate the various e-Governance applications distributed over its various units to offer citizen-friendly services. Therefore, the availability of a common platform on which applications can be easily integrated is imperative. To implement e-Governance effectively, every country should have a Government Enterprise Architecture and by following this architecture every organization of the country will develop their e-Governance applications. The objective of this poster is to identify the basic concepts of GEA and evaluate the potential benefits for Bangladesh.
Handbook of Data-Based Decision Making in Education, 1 edition
Authors: Theodo Kowalski
Venue:  (2008)

Though data-based (evidence-based) decision making has long been normative in science-based professions, it has never been an essential benchmark for effective practice in education. This situation began to radically change with the passage of the No Child Left Behind (NCLB) legislation in 2001. At the heart of this legislation is the belief that educational decision making at all levels should be evidence based to the extent possible. NCLB had (and continues to have) bipartisan political support and, although modifications to the original legislation are sure to occur, the belief in evidence-based decision making isn't likely to fade away. Education has fought long and hard to gain acceptance as a profession and, since professionals by definition use data to shape the decisions they make, education has little choice but to continue moving in this direction. This 42-chapter handbook will be a major contribution to the literature of education. It will be a comprehensive, cross-disciplinary, research-based, and practice-based resource that all educators can turn to as a guide to data-based decision making.
Articulating Software Requirements Comic Book Style
Authors: Amanda M. Williams, Thomas A. Alspaugh
Venue: Proceedings of the 2008 Third International Workshop on Multimedia and Enjoyable Requirements Engineering - Beyond Mere Descriptions and with More Fun and Games (2008)

It is almost a truism that system stakeholders do not fully understand and communicate what they want, often until a system is produced and they see it isn't right. Such an outcome is wasteful, expensive, and unsatisfactory. Working with requirements in comic book style provides affordances, absent or weaker in other requirements forms, that may as- sist stakeholders in surfacing and expressing desires sooner and developers in understanding them and each other. Appropriate incorporation of comic book style artifacts into requirements work, in addition to making it more playful and enjoyable, can contribute to greater stakeholder satisfaction and more effective software development.
Reconfigurable fault-tolerant multicomputer network
Authors: Svetlana P. Kartashev, Steven I. Kartashev
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This paper discusses fault-tolerant reconfigurations of a multicomputer network organized as a binary tree. The paper shows how to reconfigure a binary tree with faulty nonleaves with lost connectivity into a binary tree in which all faulty nodes become leaves or form more complex end-tree structures of higher dimension. In both cases the faulty nodes are disconnected from a reconfigured fault-tolerant tree, which continues to function as a gracefully degraded tree made completely out of fault-free nodes. The reconfiguration techniques developed are based on fine mathematical ideas of shift-register theory; they can be performed with only a single reconfiguration code (called a bias) that is sent concurrently to all fault-free nodes of a tree. The techniques for finding this reconfiguration code are also very simple. For the case in which all faulty nodes become leaves, the required reconfiguration code can be found during the time of one mod-2 addition (one clock period). For the case in which all faulty nodes form an i-dimensional end-tree, the necessary reconfiguration code can be found following a simple process that includes (i-1) mod-2 additions performed sequentially. Once the reconfiguration code is found, it is sent to all fault-free nodes of a binary tree. A fault-tolerant reconfiguration into a gracefully degraded tree with disconnected faulty nodes can be performed during the time of one clock period, since it includes the time of a one-bit shift and mod-2 addition.
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
Authors: Emre Salman, Renatas G. Jakushokas, Eby G. Friedman, Radu M. Secareanu, Olin L. Hartin
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution network of an aggressor circuit are exploited to reduce the overall number of input ports before the substrate extraction process. Specifically, the substrate of an aggressor circuit is partitioned into voltage domains where each domain is represented by a single substrate contact. The remaining ports of the substrate within that domain are ignored to reduce the computational complexity. A linear time algorithm is developed to identify these voltage domains and generate an equivalent contact. A reduction of more than four orders of magnitude in the number of extracted substrate resistances is demonstrated while introducing 20% error in the peak-to-peak value of the substrate noise voltage.
Clustering analysis method based on fuzzy C-means algorithm of PSO and PPSO with application in image data
Authors: Jeng-Ming Yih, Yuan-Horng Lin, Hsiang-Chuan Liu
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

The popular fuzzy c-means algorithm (FCM) converges to a local minimum of the objective function. Hence, different initializations may lead to different results. The important issue is how to avoid getting a bad local minimum value to improve the cluster accuracy. The particle swarm optimization (PSO) is a popular and robust strategy for optimization problems. But the main difficulty in applying PSO to real-world applications is that PSO usually need a large number of fitness evaluations before a satisfying result can be obtained. In this paper, the improved new algorithm, "Fuzzy C-Mean based on Picard iteration and PSO (PPSO-FCM)", is proposed. Two real data sets were applied to prove that the performance of the PPSO-FCM algorithm is better than the conventional FCM algorithm and the PSO-FCM algorithm.
A Web Service Composition Framework Using Integer Programming with Non-functional Objectives and Constraints
Authors: John Jung-Woon Yoo, Soundar Kumara, Dongwon Lee, Seog-Chan Oh
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

In this paper, we propose a Web service composition framework that uses Integer Linear Programming with non-functional objectives and constraints, in addition to the syntactic matching of Web services features. We envision that when Web services are fully deployed and commercialized in the near future, the criteria of Web service composition to achieve objectives will vary depending on users' needs or preferences from the number of Web services to non-functional objectives, such as costs, time, and/or reputation. Such non-functional attributes cannot be readily considered in planning-graph, constraint satisfaction, or propositional satisfiability techniques, which are predominantly logic-based. This paper shows how the proposed Integer Linear Programming framework can be utilized to compose Web services with non-functional attributes. This framework enables our composition software agent to identify the best composition result that satisfies both non-functional requirements as well as functional ones, namely, parameter matching. A preliminary implementation of the proposed idea and further research directions are also discussed.
1-transitive cyclic orderings
Authors: G. Campero-Arena, J. K. Truss
Venue: Journal of Combinatorial Theory Series A (2009)

We give a classification of all the countable 1-transitive cyclic orderings, being those on which the automorphism group acts singly transitively. We also classify all the countable 1-transitive coloured cyclic orderings, where these are countable cyclic orderings in which each point is assigned a member of a set C, thought of as its 'colour', and by '1-transitivity' we now mean that the automorphism group acts singly transitively on each set of points coloured by a fixed colour. We conclude by giving constructions of some uncountable cyclic orderings whose automorphism groups enjoy certain special properties.
MINERVA&infin;: a scalable efficient peer-to-peer search engine
Authors: Sebastian Michel, Peter Triantafillou, Gerhard Weikum
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

The promises inherent in users coming together to form data sharing network communities, bring to the foreground new problems formulated over such dynamic, ever growing, computing, storage, and networking infrastructures. A key open challenge is to harness these highly distributed resources toward the development of an ultra scalable, efficient search engine. From a technical viewpoint, any acceptable solution must fully exploit all available resources dictating the removal of any centralized points of control, which can also readily lead to performance bottlenecks and reliability/availability problems. Equally importantly, however, a highly distributed solution can also facilitate pluralism in informing users about internet content, which is crucial in order to preclude the formation of information-resource monopolies and the biased visibility of content from economically-powerful sources. To meet these challenges, the work described here puts forward MINERVA&infin;, a novel search engine architecture, designed for scalability and efficiency. MINERVA&infin; encompasses a suite of novel algorithms, including algorithms for creating data networks of interest, placing data on network nodes, load balancing, top-k algorithms for retrieving data at query time, and replication algorithms for expediting top-k query processing. We have implemented the proposed architecture and we report on our extensive experiments with real-world, web-crawled, and synthetic data and queries, showcasing the scalability and efficiency traits of MINERVA&infin;.
The power of linkage analysis of a disease-related endophenotype using asymmetrically ascertained sib pairs
Authors: Heejong Sung, Fei Ji, Deborah L. Levy, Steven Matthysse, Nancy Role Mendell
Venue: Computational Statistics Data Analysis (2009)

A linkage study of a qualitative disease endophenotype in a sample of sib pairs, consisting of one disease affected proband and one sibling is considered. The linkage statistic compares marker allele sharing with the proband in siblings with an abnormal endophenotype to siblings with the normal endophenotype. Expressions are derived for the distribution of this linkage statistic, in terms of the recombination fraction and (1) the genetic parameter values (allele frequency and endophenotype and disease penetrance) and (2) the abnormal endophenotype rates in the population and in classes of relatives of disease affected probands. It is then shown that when either the disease or the abnormal endophenotype has additive penetrance, the expressions simplify to a monotonic function of the difference between abnormal endophenotype rates in siblings and in the population. Thought disorder is considered as a putative schizophrenia endophenotype. Forty sets of genetic parameter values that correspond to the known prevalence values for thought disorder in schizophrenic patients, siblings of schizophrenics and the general population are evaluated. For these genetic parameter values, numerical results show that the test statistic has >70% power (@a=0.0001) in general with a sample of 200 or more proband-sibling pairs to detect linkage between a marker (@q=0.01) and a locus pleiotropic for schizophrenia and thought disorder.
Physics of Photonic Devices, 2 edition
Authors: Shun Lien Chuang
Venue: Wiley Series In Pure And Applied Optics (2009)

This fully updated edition includes the latest developments in the growing field of optoelectronics. New topics covered here include a brief history of the invention of semiconductor lasers, the Lorentz dipole model and metal plasmas, matrix optics, surface plasma waveguides, and optical ring resonators. All problem sets have been updated and a new Solutions Manual is available. This is an ideal introduction to the subject for graduate students and professionals alike.
Toward the existence and uniqueness of solutions of second-order fuzzy differential equations
Authors: T. Allahviranloo, N. A. Kiani, M. Barkhordari
Venue: Information Sciences: an International Journal (2009)

In this paper the existence and uniqueness of solutions for second-order fuzzy differential equations with initial conditions under generalized H-differentiability is proved. To this end, the concept of second-order generalized differential equation is defined, which is based on an enlargement of the class of differentiable fuzzy mappings.
Critical Lessons Learned: Evaluation of Commercial Mobile Incident Support Systems
Authors: Jonas Landgren
Venue: Mobile Response: Second International Workshop on Mobile Information Technology for Emergency Response, MobileResponse 2008. Bonn, Germany, May 29-30, 2008, Revised Selected Papers (2009)

This paper reports from a study of two projects concerning the evaluation of commercial mobile incident support systems. Based on data from ethnographic fieldwork and field experiments, key issues and critical lessons learned from these projects are outlined.