ppxscal/embedding_network huggingface dataset:
An Experimental Study of the Hybridization of Logistic Discriminant Analysis and Multilayer Neural Network for Image Identification
Authors: Akira Asano, Koji Hotta, Takao Hinamoto, Chie Muraki Asano, Megu Ohtaki, Mitsuji Muneyasu
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

A hybridized classification system of the logistic discriminant analysis and the three-layer neural network is proposed. This system is basically a linear discrimination and is assisted by the neural network only for the cases that are difficult to be classified by linear methods. This system presents a simple discrimination structure given by linear methods, and its computational cost is much lower than the exclusive use of the neural network while the misclassification rate is as low as the neural network. The ability of this system is shown experimentally in the case of applying it to image identification problems. The computation time for the learning process is reduced to one-fifth by this method in this experiment, while the misclassification rate remains almost the same.
Dynamic Environment Exploration Using a Virtual White Cane
Authors: D. Yuan, R. Manduchi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The virtual white cane is a range sensing device based on active triangulation, that can measure distances at a rate of 15 measurements/second. A blind person can use this device for sensing the environment, pointing it as if it was a flashlight. Beside measuring distances, this device can detect surface discontinuities, such as the foot of a wall, a step, or a drop-off. This is obtained by analyzing the range data collected as the user swings the device around, tracking planar patches and finding discontinuities. In this paper we briefly describe the range sensing device, and present an online surface tracking algorithm, based on a Jump-Markov model. We show experimental results proving the robustness of the tracking system in real-world conditions.
Layered tetrahedral meshing of thin-walled solids for plastic injection molding FEM
Authors: Soji Yamakawa, Charles Shaw, Kenji Shimada
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

This paper describes a method for creating a well-shaped, layered tetrahedral mesh of a thin-walled solid by adapting the surface triangle sizes to the estimated wall thickness. The primary target application of the method is the finite element analysis of plastic injection molding, in which a layered mesh improves the accuracy of the solution. The edge lengths of the surface triangles must be proportional to the thickness of the domain to create well-shaped tetrahedrons; when the edge lengths are too short or too long, the shape of the tetrahedron tends to become thin or flat. The proposed method creates such a layered tetrahedral mesh in three steps: (1) create a preliminary tetrahedral mesh of the target geometric domain and estimate thickness distribution over the domain; (2) create a non-uniform surface triangular mesh with edge length adapted to the estimated thickness, then create a single-layer tetrahedral mesh using the surface triangular mesh; and (3) subdivide tetrahedrons of the single-layer mesh into multiple layers by applying a subdivision template. The effectiveness of the layered tetrahedral mesh is verified by running some experimental finite element analyses of plastic injection molding.
Automatic performance analysis tools for the Grid: Research Articles
Authors: M. Gerndt
Venue: Concurrency and Computation: Practice Experience (2005)

Applications on Grids require scalable and online performance analysis tools. The execution environment of such applications includes a large number of processors. In addition, some of the resources such as the network will be shared with other applications. This requires applications to adapt dynamically to resource changes. The article presents the requirements of Grid application classes for performance analysis tools. It introduces a new analysis environment currently being developed for teraflop computers within the Peridot project at Technische Universit&auml;t M&uuml;nchen. This environment applies a distributed automatic performance analysis approach. It is based on a formal specification of performance properties in the APART specification language. It uses a hierarchy of analysis agents that obtain performance data from a configurable monitoring system. This scalable design allows performance analysis for large Grid applications. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Distributed Data Streams Indexing using Content-Based Routing Paradigm
Authors: Ahmet Bulut, Ambuj K. Singh, Roman Vitenberg
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In recent years, we have seen a dramatic increase in the use of data-centric distributed systems such as global grid infrastructures, sensor networks, network monitoring, and various publish-subscribe systems. The realization of this potential requires adequate support from middleware that could be used to deploy and support such systems. In this regard, we propose an integrated distributed indexing architecture that supports scalable handling of intense dynamic information flows. The architecture is geared towards providing timely responses to queries of different types while minimizing the use of network and computational resources. The underlying communication framework ensures scalability and load balancing of communication as well as adaptivity in presence of dynamic changes. We elaborate on database and content-based routing methodologies used in the integrated solution as well as non-trivial interaction between them, and thereby provide a valuable feedback to the designers of these techniques. We demonstrate the effectiveness of our architecture with performance results that we obtained using our prototype implementation on top of the Chord system simulator.
Epipolar-plane image analysis by error minimization of synthesized images
Authors: Mikio Shinya, Mikito Notomi, Kouki Minamida, Takafumi Saito
Venue: Systems and Computers in Japan (2005)

As computer graphics develops as a field, technology to enable the efficient creation of complex and realistic computer graphics is sought. Here we propose error minimization of synthesized images as a method for automatically creating computer graphics models based on epipolar-plane analysis. Our method involves the restructuring of a computer graphics model so as to minimize the difference between the synthesized and input images. We demonstrate theoretically how this minimization can be efficiently performed via the iterative application of dynamic programming. In addition, conducting experiments using images taken both indoors and outdoors, we are able to show empirically that the method is capable of creating high-fidelity computer graphics models. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 92&ndash;101, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10198
Evaluating a Computational Model of Emotion
Authors: Jonathan Gratch, Stacy Marsella
Venue: Autonomous Agents and Multi-Agent Systems (2005)

Spurred by a range of potential applications, there has been a growing body of research in computational models of human emotion. To advance the development of these models, it is critical that we evaluate them against the phenomena they purport to model. In this paper, we present one method to evaluate an emotion model that compares the behavior of the model against human behavior using a standard clinical instrument for assessing human emotion and coping. We use this method to evaluate the Emotion and Adaptation (EMA) model of emotion Gratch and Marsella. The evaluation highlights strengths of the approach and identifies where the model needs further development.
A Simple Proof of the Jamiołkowski Criterion for Complete Positivity of Linear Maps
Authors: D. Salgado, J. L. Sánchez-Gómez, M. Ferrero
Venue: Open Systems Information Dynamics (2005)

We give a simple direct proof of the Jamio¿kowski criterion to check whether a linear map between matrix algebras is completely positive or not. This proof is more accessible for physicists than other ones found in the literature and provides a systematic method to give any set of Kraus matrices of the Kraus decomposition.
Modelling of e-learning processes: an approach used in Plovdiv e-university
Authors: George Totkov, Elena Somova, Mariana Sokolova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Most of the e-Learning systems don't have means for modelling a learning process and in particular the structure and content of the virtual learning courses. In PeU learning environment virtual courses are designed by using directed graph with nodes of two types: informative (learning materials or groups of them - AND, OR, MORE etc.) and controlling (Join_Split, Repeat, Check_Point, etc.). For the development and editing of courses in PeU, the authors use environment with visual programming elements.
Performance of a possible Grid message infrastructure: Research Articles
Authors: Shrideep Pallickara, Geoffrey Fox, Ahmet Uyar, Hongbin Liu, Xi Rao, David Walker, Beytullah Yildiz
Venue: Concurrency and Computation: Practice Experience (2005)

In this paper we present the results pertaining to the NaradaBrokering middleware infrastructure. NaradaBrokering is designed to run on a large network of cooperating broker nodes. NaradaBrokering capabilities include, among other things, support for a wide variety of transport protocols, Java Message Service compliance, support for routing JXTA interactions, support for audio&sol;video conferencing applications and, finally, support for multiple constraint specification formats such as XPath, SQL and regular expression queries. This paper demonstrates the suitability of NaradaBrokering to a wide variety of applications and scenarios. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Frontiers of tractability for typechecking simple XML transformations
Authors: Wim Martens, Frank Neven
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus on complete algorithms which always produce the correct answer. We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. By restricting schema languages and transformations, we identify several practical settings for which typechecking is in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios can not be enlarged without rendering the typechecking problem intractable. So, the present research sheds light on when to use fast complete algorithms and when to reside to sound but incomplete ones.
Behavior development through task oriented discourse: Research Articles
Authors: John R. Lee, Andrew B. Williams
Venue: Computer Animation and Virtual Worlds (2004)

As digital human animation and simulation systems are coming into widespread use, scenario designers and digital animators must introduce specific tasks, procedures and animation sequences into a digital human's repertoire of capabilities. The parameterized action representation (PAR) architecture allows the animator to introduce dynamic behaviors through natural language instructions. However, this architecture lacks any natural language feedback which would allow the animator to deal with inconsistencies, incompleteness and conflicts within the behavior. In this paper we introduce an extension to a typical PAR architecture that provides that natural language feedback mechanism and define a set of task oriented discourses (TOD) that allow this mechanism to be used in synthesizing and managing behaviors. We demonstrate our behavior development techniques in two applications. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks
Authors: Leszek Gasieniec, Chang Su, Prudence W. H. Wong, Qin Xin
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

In this paper, we introduce new geometric ad-hoc routing algorithms to route queries in static sensor networks. For single-source-queries routing, we utilise centralised mechanism to accomplish a query using an optimal number of transmissions O(c), where c is the length of the shortest path between the source and the destination.For multiple-source-queries routing, the number of transmissions for each query is bounded by O(c log n), where n is the number of nodes in the network.For both single-source and multiple-source queries, the routing stage is preceded by preprocessing stages requiring O(nD) and O(n^2 D) transmissions, respectively, where D is the diameter of the nework. Our algorithm improves the complexity of the currently best known algorithms in terms of the number of transmissions for each query.The preprocessing is worth-while if it is followed by frequent queries.We could also imagine that there is an extra initial power (say, batteries) available during the preprocessing stage or alternatively the position of the sensors are known in advance and the preprocessing can be done before the sensors are deployed in the field.It also worths mentioning that a lower bound of ¿(c^2 ) transmissions has been proved if preprocessing is not allowed.
Control design for a class of linear 0-controllable discrete systems with constraints
Authors: A. N. Sirotin
Venue: Automation and Remote Control (2005)

Formation of a feedback control for the class of 0-controllable linear stationary systems with constraints is studied.
CRL/Brandeis: description of the Diderot system as used for MUC-5
Authors: Jim Cowie, Louise Guthrie, Wang Jin, Rong Wang, Takahiro Wakao, James Pustejovsky, Scott Waterman
Venue: Proceedings of the 5th conference on Message understanding (1993)

This report describes the major developments over the last six months in completing the Diderot information extraction system for the MUC-5 evaluation.Diderot is an information extraction system built at CRL and Brandeis University over the past two years. It was produced as part of our efforts in the Tipster project. The same overall system architecture has been used for English and Japanese and for the micro-electronics and joint venture domains.The past history of the system is discussed and the operation of its major components described. A summary of scores at the 24 month workshop is given and the performance of the system on the texts selected for the system walkthrough is discussed.
A hierarchy of cameras for 3D photography
Authors: Jan Neumann, Cornelia Fermüller, Yiannis Aloimonos
Venue: Computer Vision and Image Understanding (2004)

The view-independent visualization of 3D scenes is most often based on rendering accurate 3D models or utilizes image-based rendering techniques. To compute the 3D structure of a scene from a moving vision sensor or to use image-based rendering approaches, we need to be able to estimate the motion of the sensor from the recorded image information with high accuracy, a problem that has been well-studied. In this work, we investigate the relationship between camera design and our ability to perform accurate 3D photography, by examining the influence of camera design on the estimation of the motion and structure of a scene from video data. By relating the differential structure of the time varying plenoptic function to different known and new camera designs, we can establish a hierarchy of cameras based upon the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a camera, which we call the full field of view polydioptric camera, for which the motion estimation problem can be solved independently of the depth of the scene which leads to fast and robust algorithms for 3D Photography. In between are multiple view cameras with a large field of view which we have built, as well as omni-directional sensors.
New York University: description of the PROTEUS system as used for MUC-4
Authors: Ralph Grishman, Catherine Macleod, John Sterling
Venue: Proceedings of the 4th conference on Message understanding (1992)

The PROTEUS system which we have used for MUC-4 is largely unchanged from that used for MUC-3. It has three main components: a syntactic analyzer, a semantic analyzer, and a template generator.
Re-presenting collective learning: a generative way forward
Authors: Lachlan Forsyth, Lynette Schaverien
Venue: ACM SIGGROUP Bulletin (2003)

Professional development is increasingly conceived as a sustained group or community process, often supported by online technologies. Yet despite the enthusiasm for online communities of practice [40], and the innovative educational contexts being developed to support them, the reality of developing and maintaining a critical mass of teacher engagement is proving to be challenging (for example, the Inquiry Learning Forum (ILF) [4]; the Hawaii Networked Learning Communities (HNLC) [37]). Teacher educators and designers of technological learning environments continually strive to maximize the value of teacher engagement in such contexts, yet the conditions under which social learning and collaboration become an appropriate strategy for teachers remain unclear [4; 19]. Furthermore, contemporary research from evolutionary psychology [27] and modeling of cultural transmission [5] suggests the likelihood that professional development in sustained groups would involve subtle yet influential social learning strategies. For example, decisions regarding the adequacy of a particular concept or professional behavior may be influenced by the status of the group member advocating it, the frequency of the behavior in the group, or even which idea or behavior was offered to the group first [1].
Searching the Web by voice
Authors: Alexander Franz, Brian Milch
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Spoken queries are a natural medium for searching the Web in settings where typing on a keyboard is not practical. This paper describes a speech interface to the Google search engine. We present experiments with various statistical language models, concluding that a unigram model with collocations provides the best combination of broad coverage, predictive power, and real-time performance. We also report accuracy results of the prototype system.
An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
Authors: Jiyin Liu, Yun Jiang
Venue: Operations Research (2005)

Hoist scheduling is a typical problem in the operation of electroplating systems. The cyclic scheduling policy is widely used in these systems in industry. Research on hoist scheduling has focused on the cyclic problem to minimize the cycle length. Most previous studies consider the single-hoist case. In practice, however, more than one hoist is often used in an electroplating line. This paper addresses the two-hoist, no-wait cyclic scheduling problem, in which the tank-processing times are constants and, upon completion of processing in a tank, the parts have to be moved to the next tank immediately. Based on the analysis of the problem properties, a polynomial algorithm is developed to obtain an optimal schedule. This algorithm first identifies a set of thresholds, which are special values of the cycle length, so that the feasibility property may change only at these thresholds. Feasibility checking is then carried out on each individual threshold in ascending order. The first feasible threshold found will be the optimal cycle length, and the corresponding feasible schedule is an optimal hoist schedule.
Dynamic channel assignment with cumulative co-channel interference
Authors: Karen Daniels, Kavitha Chandra, Sa Liu, Sumit Widhani
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

This paper studies the problem of centralized dynamic channel assignment (DCA) in wireless cellular systems under space and time-varying channel demand. The objective is to minimize the number of channels required to satisfy demand while also satisfying co-channel interference constraints. Cumulative co-channel interference constraints govern channel reuse, via a threshold decision criterion based on the carrier-to-interference ratio. The paper makes two contributions. First, it provides an empirical bound on the difference between the minimal number of channels required based only on geographic reuse distance versus the cumulative interference case in the context of linearly increasing demand. The bound is characterized using only the reuse distance. It is obtained with an Integer Programming (IP) based strategy that uses channel assignments for one demand state to assign channels for the next state. Geographic locality constraints are applied to limit reassignments. The impact of cumulative interference constraints is observed to be small for small geographic localities. Second, the paper presents a new, fast DCA heuristic that is based on the characteristic channel reuse patterns used by the IP-based strategy. The heuristic and IP-based method yield similar results for the zero blocking condition. The DCA heuristic is applied to the problem of estimating the blocking probabilities of call arrivals modeled by a two state discrete-time Markov chain and uniformly distributed holding times. The blocking performance for an ensemble of spatial load imbalance distributions is uniquely characterized using the heuristic and IP solutions.
Monitoring and Reporting of Fingerprint Image Quality and Match Accuracy for a Large User Application
Authors: Teddy Ko, Rama Krishnan
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

The main objective of this paper is to present the methodology used for measuring and monitoring the quality of fingerprint database and fingerprint match performance of a large user fingerprint identification system. The Department of Homeland Security's (DHS) Biometric Identification System is used as an example for this study. In addition the paper will present lessons learned during system performance testing and independent validation & verification analysis of large scale systems such as DHS's Biometric System and recommend improvements for the current test methodology.
Automatic title generation for spoken broadcast news
Authors: Rong Jin, Alexander G. Hauptmann
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper, we implemented a set of title generation methods using training set of 21190 news stories and evaluated them on an independent test corpus of 1006 broadcast news documents, comparing the results over manual transcription to the results over automatically recognized speech. We use both F1 and the average number of correct title words in the correct order as metric. Overall, the results show that title generation for speech recognized news documents is possible at a level approaching the accuracy of titles generated for perfect text transcriptions.