ppxscal/embedding_network huggingface dataset:
Rapid Prototyping of Activity Recognition Applications
Authors: David Bannach, Oliver Amft, Paul Lukowicz
Venue: IEEE Pervasive Computing (2008)

The Context Recognition Network (CRN) Toolbox permits fast implementation of activity and context recognition systems. Using parameterizable and reusable software components, it provides a broad set of online algorithms for multimodal sensor input, signal processing, and pattern recognition. The CRN Toolbox also features mechanisms for distributed processing and support for mobile and wearable devices. Three case studies demonstrate its versatility. In these case studies, the CRN Toolbox supports information flow in hospitals, monitors walking habits to help prevent cardiovascular diseases, and recognizes hand gestures in a car-parking game. This article is part of a special issue on activity-based computing.
Electromagnetic force-assisted imprint technology for fabrication of submicron-structure
Authors: H. Hocheng, T. -T. Wen
Venue: Microelectronic Engineering (2008)

This paper reports a novel imprint technique for fabrication of polymeric submicron-scale structures. In use of electromagnetic force to press the magnetic stamp written with submicron-scale structures into a UV-curable resist on the substrate, the liquid photopolymer can be patterned at room temperature. In this study, an electromagnetic force assisted imprinting facility with UV exposure capacity has been designed, constructed and tested. Under the proper processing conditions, the polymeric submicron-scale structure with feature size of 500nm across a 150mm^2 area can be successfully fabricated. Scanning electron microscopy (SEM) and atomic force (AFM) observations confirm that the submicron-scale polymer structures are produced without defects or distortion and with good pattern fidelity over a large area. This technique shows the potential for efficient fabrication of submicron-scale structures at room temperature and low pressure on large substrates with high productivity at low cost.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks
Authors: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, E. Varvarigos
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this work we examine a task scheduling and data migration problem for Grid Networks, which we refer to as the Data Consolidation (DC) problem. DC arises when a task needs for its execution two or more pieces of data, possibly scattered throughout the Grid Network. In such a case, the scheduler and the data manager must select the data replicas to be used and the site where these will accumulate for the task to be executed. The policies for selecting the data replicas and the data consolidating site comprise the Data Consolidation problem. We propose and experimentally evaluate a number of DC techniques. Our simulation results brace our belief that DC is an important technique for Data Grids since it can substantially improve task delay, network load and other performance related parameters.
A Signature-Based Indexing Method for Efficient Content-Based Retrieval of Relative Temporal Patterns
Authors: Edi Winarko, John F. Roddick
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

A number of algorithms have been proposed for the discovery of temporal patterns. However, since the number of generated patterns can be large, selecting which patterns to analyze can be non-trivial. There is thus a need for algorithms and tools that can assist in the selection of discovered patterns so that subsequent analysis can be performed in an efficient and, ideally, interactive manner. In this paper, we propose a signature-based indexing method, to optimise the storage and retrieval of a large collection of relative temporal patterns.
Universal conveyor: novel active device suitable for analog signal processing
Authors: Radek Sponar, Kamil Vrba, David Kubanek
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Universal Conveyor (UC) is presented as a generally usable active device in analog signal processing. It substitutes all kinds of classical current and voltage conveyors.
Research of a Virtual 3D Study Pattern Based on Constructive Theory in e-Learning
Authors: Xinyu Duan, Ping Jiang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

E-learning is most important by its role in distance teaching, and as supplementary learning material, it's mainly used in higher education area. Paper first introduced the significance of e-Learning and application of constructive theory. In contrast with traditional education, its application possesses broad prospects. Then we made a systematic exposition of interrelated theory basis, discussed a new 3D virtual study pattern. Lastly, it presented two application systems that we developed. One is a virtual audiovideo multimedia teaching center which has good immersion feelings; another is a virtual music appreciation environment which has dynamic interaction performance. Keywords: e-learning; virtual study; constructive theory; entity
Numerical algorithm for solving a stationary transport equation
Authors: Nikos Mastorakis, Olga Martin
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

The paper presents a numerical method, which allows us to replace a boundary problem for a integral-differential equation with a boundary problem for the diffusion equation. Using the variational-differential techniques we determine a functional, which has the minimum value for the solution of the new boundary problem. Using the results of numerical examples, we estimate the error in solutions obtained by this algorithm.
An improved spectral subtraction method for speech enhancement using a perceptual weighting filter
Authors: Radu Mihnea Udrea, Nicolae D. Vizireanu, Silviu Ciochina
Venue: Digital Signal Processing (2008)

We propose an improved spectral subtraction method for reducing acoustic noise added to speech in noisy environments like helicopter cockpit or car engine. This implementation uses oversubtraction method for spectral subtraction. Residual noise can be masked by exploiting the masking properties of the human auditory system. A psychoacoustically motivated weighting filter was included to eliminate residual musical noise. Simulations showed a better quality with no distortion for the enhanced speech and the musical noise was effectively masked.
Tabu Search Solution for Fuzzy Linear Programming
Authors: M. Hadi Mashinchi, M. Reza Mashinchi, M. Mashinchi
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper, a tabu search (TS) method is proposed to find a global solution for fuzzy linear programming (FLP). Two additional factors, distribution factor (DF) and similarity factor (SF), are also introduced for TS to enhance the searching performance. The application of DF and SF makes the TS to surf in a larger search space and reduces the possibility of re-searching the visited areas. A simulation is done to show the efficiency of the proposed study.
Performance Evaluation of Deadline Monotonic Policy over 802.11 Throughput and Average Service Time
Authors: Inès El Korbi, Leila Azouz Saidane
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Real time applications are characterized by their delay bounds. To satisfy the Quality of Service (QoS) requirements of such flows over wireless communications, we enhance the 802.11 protocol to support the Deadline Monotonic (DM) scheduling policy. Then, we propose to evaluate the performance of DM in terms of saturation throughput and average medium access delay called average service time. Therefore, we develop a Markov chain based analytical model and derive expressions of the average MAC layer service time. Analytical results are validated against simulation results using the ns-2 network simulator [8].
Activity-Based Computing
Authors: Nigel Davies, Daniel P. Siewiorek, Rahul Sukthankar
Venue: IEEE Pervasive Computing (2008)

The articles in this special issue focus on context-aware systems designed to recognize activities. They present underlying technologies for developing activity-aware systems and report on experiences with activity recognition in real-world applications.
Organic Computing - Addressing Complexity by Controlled Self-Organization
Authors: Jürgen Branke, Moez Mnif, Christian Müller-Schloer, Holger Prothmann, Urban Richter, Fabian Rochner, Hartmut Schmeck
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

In the past, the focus of the computer industry has been to improve hardware performance and add more and more features to the software. As a result, more and more appliances surrounding us are equipped with embedded computational power and wireless communication. As such, they become ever more flexible and multifunctional, and almost indispensable in daily life. On the other hand, the resulting systems become increasingly complex and unreliable, posing new challenges to designer and user. Organic Computing (OC) has the vision to address the challenges of complex distributed systems by making them more life-like (organic), i.e. endowing them with abilities such as self-organization, self-configuration, self-repair, or adaptation. The designer's task is simplified, because it is no longer necessary to exactly specify the low-level system behavior in all possible situations that might occur, but instead leaving the system with a certain degree of freedom which allows it to react in an intelligent way to new situations. Also, use ofsuch systems is simplified, as they can be controlled by setting few high-level goals, rather than having to manipulate many low-level parameters with unclear influence. In this paper, we give a general introduction to OC, and propose a generic observer-controller architecture as a framework for designing OC systems. Then, it is shown how to use this architecture at the example of a traffic light controller. The paper concludes with a summary and a discussion of future challenges.
Proceedings of the 4th workshop on Programming languages and operating systems
Venue: Programming Languages and Operating Systems (2007)

This volume contains the proceedings of the Fourth Workshop on Programming Languages and Operating Systems (PLOS 2007). The PLOS workshop series brings together people from the programming language and operating system communities to discuss emerging work at the intersection of these fields. It is a venue for discussing new visions, experiences, problems, and solutions arising from the application of advanced programming and software engineering concepts to operating systems construction, and vice versa. The program committee for PLOS 2007 received nineteen short papers for consideration, and of these, ten were selected for presentation at the workshop. Each submitted paper was assigned to four members of the program committee for review. In total, 76 reviews were written, many of which contained long and detailed comments. Once all the reviews were in, the program committee met by teleconference to decide upon the workshop program. The discussions during the many-hour teleconference were thoughtful and often intense! Papers were evaluated based on technical quality, originality, relevance, and presentation. The PLOS workshops are highly interactive forums where researchers present their work in development, and in return, receive feedback from their peers. As such, the publication of a paper in the PLOS workshop proceedings is not intended to replace future conference publication.
Haplotyping for Disease Association: A Combinatorial Approach
Authors: Giuseppe Lancia, R. Ravi, Romeo Rizzi
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

We consider a combinatorial problem derived from haplotyping a population with respect to a genetic disease, either recessive or dominant. Given a set of individuals, partitioned into healthy and diseased, and the corresponding sets of genotypes, we want to infer ``bad'' and ``good'' haplotypes to account for these genotypes and for the disease. Assume e.g. the disease is recessive. Then, the resolving haplotypes must consist of \emph{bad} and \emph{good} haplotypes, so that (i) each genotype belonging to a diseased individual is explained by a pair of bad haplotypes and (ii) each genotype belonging to a healthy individual is explained by a pair of haplotypes of which at least one is good. We prove that the associated decision problem is NP-complete. However, we also prove that there is a simple solution, provided the data satisfy a very weak requirement.
Distributional-based texture classification using non-parametric statistics
Authors: Vasileios K. Pothos, Christos Theoharatos, Evangelos Zygouris, George Economou
Venue: Pattern Analysis Applications (2008)

Texture classification is an important problem in image analysis. In the present study, an efficient strategy for classifying texture images is introduced and examined within a distributional-statistical framework. Our approach incorporates the multivariate Wald&#x2013;Wolfowitz test (WW-test), a non-parametric statistical test that measures the similarity between two different sets of multivariate data, which is utilized here for comparing texture distributions. By summarizing the texture information using standard feature extraction methodologies, the similarity measure provides a comprehensive estimate of the match between different images based on graph theory. The proposed &#x201c;distributional metric&#x201d; is shown to handle efficiently the texture-space dimensionality and the limited sample size drawn from a given image. The experimental results, from the application on a typical texture database, clearly demonstrate the effectiveness of our approach and its superiority over other well-established texture distribution (dis)similarity metrics. In addition, its performance is used to evaluate several approaches for texture representation. Even though the classification results are obtained on grayscale images, a direct extension to color-based ones can be straightforward.
Process evolution to support system of systems engineering
Authors: Jo Ann Lane, Judith S. Dahmann
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

One of the current research areas at the University of Southern California (USC) Center for Systems and Software Engineering (CSSE) is the development of large scale, software intensive systems of systems (SoS). These SoS are a type of Ultra-Large-Scale Software-Intensive System (ULSSIS) that have become increasingly prevalent in both government and commercial sectors. Research activities have focused on cost estimation and risk assessment associated with the development and evolution of these systems. As part of this research, USC CSSE has teamed with others to learn how SoS engineering processes are evolving to support the development of these systems. This paper highlights the findings of these research activities.
Note: 1,2 Conjecture---the multiplicative version
Authors: Joanna Skowronek-Kaziów
Venue: Information Processing Letters (2008)

Let us assign positive integers to the edges and vertices of a simple graph G. We consider the colouring of G obtained by assigning to vertex v the product of its weight and those of its adjacent edges. Can we obtain a proper colouring using only weights 1 and 2 for an arbitrary graph G? We give a positive answer when G is a 3-colourable or complete. We also show that it is enough to use weights 1, 2 and 3 for an arbitrary graph G.
The effects of co-present embodiments on awareness and collaboration in tabletop groupware
Authors: David Pinelle, Miguel Nacenta, Carl Gutwin, Tadeusz Stach
Venue: Proceedings of graphics interface 2008 (2008)

Most current tabletop groupware systems use direct touch, where people manipulate objects by touching them with a pen or a fingertip. The use of people's real arms and hands provides obvious awareness information, but workspace access is limited by the user's reach. Relative input techniques, where users manipulate a cursor rather than touching objects directly, allow users to reach all areas of the table. However, the only available awareness information comes from the virtual embodiment of the user (e.g., their cursor). This presents designers with a tradeoff: direct-touch techniques have advantages for group awareness; relative input techniques offer additional power but less awareness information. In this paper, we explore this tradeoff, and we explore the design space of virtual embodiments to determine whether factors such as size, realism, and visibility can improve awareness and coordination. We conducted a study in which seven groups carried out a picture-categorizing task using seven techniques: direct touch and relative input with six different virtual embodiments. Our results provide both valuable information to designers of tabletop groupware, and a number of new directions for future research.
A Meta-Model Based Approach to UML Modelling
Authors: Artis Teilans, Arnis Kleins, Uldis Sukovskis, Yury Merkuryev, Ivars Meirans
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper is devoted to a meta-model based approach to UML systems modelling. The approach allows creating a system model by operating with artefacts from the problem domain, followed by generation of a UML model. The discussed approach is illustrated by generating UML models, using Use Case and Activity diagrams of the UML language.
LC ladder filter emulation by structures with current conveyors
Authors: Vít Novotny, Kamil Vrba
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

Active network structures emulating LC ladder structures are presented. Design process based on state variable description is shown in detail. Various types of current and voltage conveyors are used as active network elements so that a number of different topologies were obtained. A new universal circuit device named UCCX containing universal current conveyor UCC and CCII+/- is described and its real properties are evaluated. Selected structures are designed and simulated.
Improvement of SCTP Performance during Handshake Process
Authors: Cheng-Feng Tai, Lin-Huang Chang, Ting-Wei Hou
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Efficiency improvement is important for new transport layer protocols. Stream Control Transmission Protocol (SCTP), proposed by IETF, is to improve the efficiency and security of the transport layer. SCTP is featured by Multi-homing and Multi-streaming. Though the source and destination nodes exchange the available address list after four-way handshake in the initial stage, the quality of each available link is unknown. Hence, the chosen primary path may not be the best path which implies inefficiency. In this paper, we propose a scheme to add two new Chunks which carry the status of each alternative path during the four-way handshake of SCTP. Hence, the path of the best quality will be selected as the primary path. The simulation, by NS2, results show when the best path is selected to transmit data, the throughput could be improved up to 83.3% as compared with the worst case.
Mimicry Attack on Strategy-Based Behavioral Biometric
Authors: Roman V. Yampolskiy
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Biometric security measures are becoming a popular approach to securing computer systems, computer networks, as well as access to workplaces and recreational facilities. Unfortunately biometric systems can be a target of impersonation attacks, making their security questionable. In this paper we concentrate on ways of spoofing behavioral biometrics and analyze the types of spoofing attacks which can be employed against biometric systems. The concept of strategy-based behavioral biometrics is introduced followed by our experimental results from spoofing security systems based on strategy-based biometric technology. Finally an existing methodology is suggested to counteract spoofing attacks against behavior-based biometric systems.
Perfect hashing as an almost perfect subtype test
Authors: Roland Ducournau
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

Subtype tests are an important issue in the implementation of object-oriented programming languages. Many techniques have been proposed, but none of them perfectly fulfills the five requirements that we have identified: constant-time, linear-space, multiple inheritance, dynamic loading and inlining. In this article, we propose a subtyping test implementation that involves a combination of usual hashtables and Cohen's display, which is a well-known technique for single inheritance hierarchies. This novel approach is based on perfect hashing, that is, an optimized and truly constant-time variant of hashing that applies to immutable hashtables. We show that the resulting technique closely meets all five requirements. Furthermore, in the framework of Java-like languages&mdash;characterized by single inheritance of classes and multiple subtyping of interfaces&mdash;perfect hashing also applies to method invocation when the receiver is typed by an interface. The proposed technique is compared to some alternatives, including the proposal by Palacz and Vitek [2003]. Time-efficiency is assessed at the cycle level in the framework of Driesen's pseudo-code and the linear-space criterion is validated by statistical simulation on benchmarks consisting of large-scale class hierarchies.
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Authors: Maarten Löffler, Jack Snoeyink
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

An assumption of nearly all algorithms in computational geometry is that the input points are given precisely, so it is interesting to ask what is the value of imprecise information about points. We show how to preprocess a set of n disjoint unit disks in the plane in O(n log n) time so that if one point per disk is specified with precise coordinates, the Delaunay triangulation can be computed in linear time. From the Delaunay, one can obtain the Gabriel graph and a Euclidean minimum spanning tree; it is interesting to note the roles that these two structures play in our algorithm to quickly compute the Delaunay.