ppxscal/embedding_network huggingface dataset:
Discrimination and identification of finger joint-angle position using active motion
Authors: Hong Z. Tan, Mandayam A. Srinivasan, Charlotte M. Reed, Nathaniel I. Durlach
Venue: ACM Transactions on Applied Perception (TAP) (2007)

The authors report six experiments on the human ability to discriminate and identify finger joint-angle positions using active motion. The PIP (proximal interphalangeal) joint of the index finger was examined in Exps. 1--3 and the MCP (metacarpophalangeal) joint in Exps. 4--6. In Exp. 1, the just noticeable difference (JND) of PIP joint-angle position was measured when the MCP joint was either fully extended or halfway bent. In Exp. 2, the JND of PIP joint-angle position as a function of PIP joint-angle reference position was measured when the PIP joint was almost fully extended, halfway bent, or almost fully flexed. In Exp. 3, the information transfer of PIP joint-angle position was estimated with the MCP joint in a fully extended position. In Exps. 4--6, the JND and the information transfer of MCP joint-angle position were studied with a similar experimental design. The results show that the JNDs of the PIP joint-angle position were roughly constant (2.5&deg;&minus;2.7&deg;) independent of the PIP joint-angle reference position or the MCP joint-angle position used (Exps. 1 and 2). The JNDs of the MCP joint-angle position, however, increased with the flexion of both the PIP and MCP joints and ranged from 1.7&deg; to 2.7&deg; (Exps. 4 and 5). The information transfer of the PIP and MCP joint-angle position were similar, indicating 3--4 perfectly identifiable joint-angle positions for both joints (Exps. 3 and 6). The results provide the basic data needed for estimating, for example, the resolution of fingertip position during active free motion. They are compared to the results from previous studies on joint position, length, and thickness perception.
Deformation Models for Image Recognition
Authors: Daniel Keysers Thomas Deselaers, Christian Gollan Hermann Ney
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We present the application of different nonlinear image deformation models to the task of image recognition. The deformation models are especially suited for local changes as they often occur in the presence of image object variability. We show that, among the discussed models, there is one approach that combines simplicity of implementation, low-computational complexity, and highly competitive performance across various real-world image recognition tasks. We show experimentally that the model performs very well for four different handwritten digit recognition tasks and for the classification of medical images, thus showing high generalization capacity. In particular, an error rate of 0.54 percent on the MNIST benchmark is achieved, as well as the lowest reported error rate, specifically 12.6 percent, in the 2005 international ImageCLEF evaluation of medical image categorization.
A new adaptive nonlinear multistage parallel interference cancellation for CDMA
Authors: H. Ebrahimizad, H. D. Amindavar, J. Dadkhah
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper presents a new approach to multiuser detection in code division multiple access (CDMA). The proposed detector is an adaptive nonlinear parallel interference cancellation scheme that uses a nonlinear function (hyperbolic tangent) as the decision device and uses the steepest descent method for finding the parameter of this nonlinear function. Numerical simulation results show the superior performance of the proposed method.
Do Programming Languages Affect Productivity? A Case Study Using Data from Open Source Projects
Authors: Daniel P. Delorey, Charles D. Knutson, Scott Chun
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Brooks and others long ago suggested that on average computer programmers write the same number of lines of code in a given amount of time regardless of the programming language used. We examine data collected from the CVS repositories of 9,999 open source projects hosted on SourceForge.net to test this assumption for 10 of the most popular programming languages in use in the open source community. We find that for 24 of the 45 pairwise comparisons, the programming language is a significant factor in determining the rate at which source code is written, even after accounting for variations between programmers and projects.
A criteria-based course and instructor evaluation system: recent experiences in development and utilization
Authors: D. G. Meyer
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper describes the development and utilization of a criteria-based course and instructor evaluation system that has been deployed by the School of Electrical & Computer Engineering at Purdue University. The various forms are described along with the criteria used to evaluate both lecture and lab oriented courses. The software used to analyze the scannable forms and the variety of report formats generated is described along with faculty and student comments about the new evaluation system.
Search Engine Overlaps: Do they agree or disagree?
Authors: John Bailey, Cheng Zhang, David Budgen, Mark Turner, Stuart Charters
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Context: Secondary studies, such as systematic literature reviews and mapping studies, are an essential element of the evidence-based paradigm. A critical part of the review process is the identification of all relevant research. As such, any researcher intending to conduct a secondary review should be aware of the strengths and weakness of the search engines available. Objectives: Analyse the overlap between search engine results for software engineering studies. Methods: Three independent studies were conducted to evaluate the overlap between multiple search engines for different search areas. Results: The findings indicate that very little overlap was found between the search engines. Conclusions of the study: To complete a systematic review, researchers must use multiple search terms and search engines. The lack of overlap might also be caused by inconsistent keyword selection amongst authors.
The LearnLib in FMICS-jETI
Authors: Tiziana Margaria, Harald Raffelt, Bernhard Steffen, Martin Leucker
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

The FMICS-jETI platform is a collaborative, servicebased demonstrator of tools and techniques for the analysis of industrial critical systems. It is the FMICS Working Group contribution to the Verified Software Initiative. In this paper, we extend the scope of the FMICS-jETI platform to address the integration of heterogeneous and legacy tools and technologies. We show how to integrate 1) CORBA, a language independent standard for the interoperability of heterogeneous functionalities distributed over a network, 2) active model learning technologies, via the LearnLib, as a model extrapolation technique that uses testing to explore a black box system and CORBA as a communication mechanism, and 3) third party applications built on top of the LearnLib, in this case Smyle, a tool that synthesizes design models by learning from examples, that uses the LearnLib as learner core.
Functional limit theorems for the infinite series of OU processes in Hölder norm
Authors: Zhengyan Lin, Kyo-Shin Hwang, Tian Xiao Pang
Venue: Computers Mathematics with Applications (2007)

In this paper, estimating large deviation probabilities for the infinite series of independent OU processes in Holder norm, we obtain functional limit theorems for this process in the Holder norm, which include functional modulus of continuity and functional LIL for the infinite series of independent OU processes in the Holder norm.
Identity-based key agreement protocols from pairings
Authors: L. Chen, Z. Cheng, N. P. Smart
Venue: International Journal of Information Security (2007)

In recent years, a large number of identity- based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this type of protocol has been surprisingly hard to prove, even in the random oracle model. The main issue is that a simulator is not able to deal with reveal queries, because it requires solving either a computational problem or a decisional problem, both of which are generally believed to be hard (i.e., computationally infeasible). The best solution so far for security proofs uses the gap assumption, which means assuming that the existence of a decisional oracle does not change the hardness of the corresponding computational problem. The disadvantage of using this solution to prove security is that such decisional oracles, on which the security proof relies, cannot be performed by any polynomial time algorithm in the real world, because of the hardness of the decisional problem. In this paper we present a method incorporating a built-in decisional function into the protocols. The function transfers a hard decisional problem in the proof to an easy decisional problem. We then discuss the resulting efficiency of the schemes and the relevant security reductions, in the random oracle model, in the context of different pairings one can use. We pay particular attention, unlike most other papers in the area, to the issues which arise when using asymmetric pairings.
A capstone experience-development of a flexible manufacturing system (FMS) using smart distributed sensing system
Authors: S. M. Ramkumar
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper outlines a project involving the development of an FMS in the Manufacturing Engineering Technology Department at the Rochester Institute of Technology (USA). This project is currently in progress and is expected to be completed by May 1998. The most interesting aspect of this project is that it is being done as part of an undergraduate capstone course called process design and a graduate course on FMS. The cell will be implemented using smart distributed system (SDS) from Honeywell Micro Switch. In this system, the various sensors and actuators communicate with the central control computer using field bus technology. This is state-of-the-art technology in computer based data acquisition and control. The hardware and software aspects of the FMS are being developed by a group of fifteen undergraduate students and one graduate student, under the guidance of the author and technical experts from Honeywell Micro Switch. The FMS will consist of two identical milling centers and robots. The parts will be transferred to the various stations on a pallet using a conveyor system. An in-depth coverage of the system architecture and control are provided in the paper. 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
A middleware model supporting time-triggered message-triggered objects for standard Linux systems
Authors: Stephen F. Jenks, Kane Kim, Yuqing Li, Sheng Liu, Liangchen Zheng, Moon H. Kim, Hee-Yong Youn, Kyung Hee Lee, Dong-Myung Seol
Venue: Real-Time Systems (2007)

The Time-triggered Message-triggered Object (TMO) programming and specification scheme came out of an effort to remove the limitations of conventional object structuring techniques in developing real-time (RT) distributed computing components and composing distributed computing applications out of such components and others. It is a natural and syntactically small but semantically powerful extension of the object oriented (OO) design and implementation techniques which allows the system designer to specify in natural and yet precise forms timing requirements imposed on data and function components of high-level distributed computing objects. TMO Support Middleware (TMOSM) was devised to be an efficient middleware architecture that can be easily adapted to many commercial-off-the-shelf (COTS) hardware + kernel operating system platforms to form efficient TMO execution engines. However, up until 2003, its adaptations were done for Microsoft Windows platforms only. As we have been developing and refining an adaptation of TMOSM to the Linux 2.6 operating system platform in recent years, TMOSM has been refined to possess further improved modularity and portability. This paper presents the refined TMOSM as well as the techniques developed for efficient adaptation of TMOSM to the Linux 2.6 platform.
Discrete polynomial transform representation using binary matrices and flow diagrams
Authors: M. F. Aburdene
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a new method for computing discrete polynomial transforms. The method is shown for the Hermite, binomial, and Laguerre transforms. The new method factors Pascal's matrix into binary matrices. Constructing the flow diagrams for the transform matrices requires only additions and N-2 multipliers for N-point Hermite and binomial transforms, and 2N multipliers for an N-point Laguerre transform. The method involves a three-stage process where stages 1 and 3 are identical for all three transforms.
Unsupervised vector image segmentation by the ICM method
Authors: J. Fwu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We propose an unsupervised vector image segmentation technique that combines the iterated conditional modes (ICM) procedure with an initialization scheme that requires minimal prior knowledge. As is well known, every iterative segmentation procedure needs initialization parameters, which are usually obtained from training data. In the absence of such data, the initialization becomes a critical step towards accurate segmentation because bad initializations can lead to poor performance. Our initialization scheme, referred to as tree structure (TS) initialization, represents a sequence of binary searches and is similar to a method for data compression in coding theory. The scheme does not require any a priori information or initial parameters, except for the number of classes, and therefore is completely data-driven. Computer simulations on multidimensional magnetic resonance (MR) brain images are provided to demonstrate the overall excellent performance of the proposed TS-ICM method.
Reaching pareto-optimality in prisoner's dilemma using conditional joint action learning
Authors: Dipyaman Banerjee, Sandip Sen
Venue: Autonomous Agents and Multi-Agent Systems (2007)

We consider the learning problem faced by two self-interested agents repeatedly playing a general-sum stage game. We assume that the players can observe each other's actions but not the payoffs received by the other player. The concept of Nash Equilibrium in repeated games provides an individually rational solution for playing such games and can be achieved by playing the Nash Equilibrium strategy for the single-shot game in every iteration. Such a strategy, however can sometimes lead to a Pareto-Dominated outcome for games like Prisoner's Dilemma. So we prefer learning strategies that converge to a Pareto-Optimal outcome that also produces a Nash Equilibrium payoff for repeated two-player, n-action general-sum games. The Folk Theorem enable us to identify such outcomes. In this paper, we introduce the Conditional Joint Action Learner (CJAL) which learns the conditional probability of an action taken by the opponent given its own actions and uses it to decide its next course of action. We empirically show that under self-play and if the payoff structure of the Prisoner's Dilemma game satisfies certain conditions, a CJAL learner, using a random exploration strategy followed by a completely greedy exploitation technique, will learn to converge to a Pareto-Optimal solution. We also show that such learning will generate Pareto-Optimal payoffs in a large majority of other two-player general sum games. We compare the performance of CJAL with that of existing algorithms such as WOLF-PHC and JAL on all structurally distinct two-player conflict games with ordinal payoffs.
Orderings of uniquely colorable hypergraphs
Authors: Csilla Bujtás, Zsolt Tuza
Venue: Discrete Applied Mathematics (2007)

For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into 'color classes' such that every C@?C meets some class in more than one vertex, and every D@?D has a nonempty intersection with at least two classes. A vertex-orderx"1,x"2,...,x"n on X (n=|X|) is uniquely colorable if the subhypergraph induced by {x"j:1=
Using MATLAB in a graduate electrical engineering optimal control course
Authors: A. Azemi
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Control system design packages like MATLAB, MATRIX/sub x/, Control C, SIMNON, etc. have become essential ingredients of both undergraduate and graduate courses in the systems and controls area. This work describes our experience, at the Great Valley Campus of the Pennsylvania State University and the University of Arkansas, with the use of one of these packages, namely MATLAB with its Control Systems, Robust Control and LMI toolboxes in an optimal control course. In this paper we describe those standard functions of MATLAB and Control Systems Toolbox that are most appropriate for use in an optimal control course. Next, we focus on some special features of MATLAB that can be used to produce interactive simulations, using user interface controls. With the help of interactive simulations, instructors can effectively illustrate the change in system response due to parameter variations. Examples illustrating these features are included. A discussion of how MATLAB helps in reducing the amount of time spent in performing computational homework assignments and the advantages of using graphics user interface control is given. Finally, the general positive student reaction is reported.
A Study of Data Exchange Protocols for the Grid Computing Environment
Authors: Dejiang Jin, Sotirios G. Ziavras
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Efficiently using grid systems faces many challenges. One of them is the efficient exchange of data between distant components exacerbated by the diversity of existing protocols for communicating participants. Some protocols support communications efficiently but require pre-distributing some application-specific information to the participants. This increases the complexity of application development and deployment, and the process becomes cumbersome for large grids with significant diversity of components. Some other protocols can deal well with diversity but suffer from extremely high overheads. We propose a communication protocol based on XML messages that combines the advantages of both kinds of protocols. It explores the self-contain property of XML to satisfy the requirement of easily integrating diverse participants while it uses compressed formats to encode numeric data in an effort to reduce overheads.
Managing Privacy in LBAC Systems
Authors: Claudio Agostino Ardagna, Marco Cremonini, Ernesto Damiani, Sabrina De Capitani di Vimercati, Pierangela Samarati
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

One of the main challenges for privacy-aware location-based systems is to strike a balance between privacy preferences set by users and location accuracy needed by Location-Based Services (LBSs). To this end, two key requirements must be satisfied: the availability of techniques providing for different degrees of user location privacy and the possibility of quantifying such privacy degrees. To address the first requirement, we describe two obfuscation techniques. For the second requirement, we introduce the notion of relevance as the estimator for the degree of location obfuscation. This way, location obfuscation can be adjusted to comply with both user preferences and LBS accuracy requirements.
Multi-object trajectory tracking
Authors: Mei Han, Wei Xu, Hai Tao, Yihong Gong
Venue: Machine Vision and Applications (2007)

The majority of existing tracking algorithms are based on the maximum a posteriori solution of a probabilistic framework using a Hidden Markov Model, where the distribution of the object state at the current time instance is estimated based on current and previous observations. However, this approach is prone to errors caused by distractions such as occlusions, background clutters and multi-object confusions. In this paper, we propose a multiple object tracking algorithm that seeks the optimal state sequence that maximizes the joint multi-object state-observation probability. We call this algorithm trajectory tracking since it estimates the state sequence or &#x201c;trajectory&#x201d; instead of the current state. The algorithm is capable of tracking unknown time-varying number of multiple objects. We also introduce a novel observation model which is composed of the original image, the foreground mask given by background subtraction and the object detection map generated by an object detector. The image provides the object appearance information. The foreground mask enables the likelihood computation to consider the multi-object configuration in its entirety. The detection map consists of pixel-wise object detection scores, which drives the tracking algorithm to perform joint inference on both the number of objects and their configurations efficiently. The proposed algorithm has been implemented and tested extensively in a complete CCTV video surveillance system to monitor entries and detect tailgating and piggy-backing violations at access points for over six months. The system achieved 98.3% precision in event classification. The violation detection rate is 90.4% and the detection precision is 85.2%. The results clearly demonstrate the advantages of the proposed detection based trajectory tracking framework.
Compression of medical volumetric data in a video-codec framework
Authors: Yiu-fai Wong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We propose to use video-codec framework for the compression of volumetric medical images by treating interslice variations as "motion" of the tissues. As compression is necessary for telemedicine and archive, such an approach needs only slight modifications of existing codecs and is able to re-use most of the existing software and hardware. This is our main motivation and we seek modifications of the MPEG codec. An obvious modification is to replace block matching (BM) by more sophisticated methods. Specifically, we use the affine transformation (AT) on triangular patches. We implemented and compared our scheme with a simplified MPEG-1 encoder under identical parameters on a set of MRI images of a human hand. The blockiness is reduced dramatically and structures are better preserved. The images also appear less granular and show improvements of several dB in SNR. We expect further improvements when more features of MPEG codec are incorporated in our ongoing work.