ppxscal/embedding_network huggingface dataset:
A Component-Based UML Profile to Model Embedded Real-Time Systems Designed by the MDA Approach
Authors: Shourong Lu, Wolfgang A. Halang, Lichen Zhang
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

A component-based UML profile is built to develop embedded real-time systems. To specify the specific characteristics of embedded systems, the Model Driven Architecture (MDA) approach and component-based modeling are employed. Component-based UML models are designed as Platform Independent Models (PIM) to be translated to Platform Specific Models (PSM) for target-platform implementation, which deal with functional and non-functional properties. Taking specific platform features into regard, specific component models result from transformations mapping a platform-independent component model to either the Process and Experiment Automation Real-TimeLanguage (PEARL) or to Function Blocks according to IEC 61131-3 or IEC 61499. Both PIM and PSM are collected in a UML profile which can be used as an application framework in developing embedded real-time systems.
Manifold Learning for Image Denoising
Authors: Rongjie Shi, I-Fan Shen, Wenbin Chen, Su Yang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper presents a novel scheme for image denoising. In spite of the sophistication of recently developed double-density discrete wavelet transforms (double-density DWTs), it still produces artifacts or destroys fine structures by blurring the data. Inspired by recent manifold learning methods, especially the locally linear embedding (LLE), we discover the underlying fact that image patches in noisy and denoised images construct manifolds with similar local geometry in these two distinct spaces. Therefore, we characterize local geometry by measuring how an image patch represented by a feature vector can be reconstructed by its nearest neighbors in feature space. Besides using the training image patches to construct the embedding, we also propose to overlap the target denoised image patches to satisfy local compatibility and smoothness constraints. In our method, double-density DWTs is incorporated with LLE for the purpose of denoising. The experimental results show that our method is flexible with noise type and achieves state-of-the-art performance particularly in terms of preserving the fine structures.
Rare-earth scandate single- and multi-layer thin films as alternative gate oxides for microelectronic applications
Authors: T. Heeg, M. Wagner, J. Schubert, Ch. Buchal, M. Boese, M. Luysberg, E. Cicerrella, J. L. Freeouf
Venue: Microelectronic Engineering (2005)

Thin films of rare-earth scandates (REScO3) as well as multi-layers of scandates and titanates have been prepared using pulsed laser deposition. Epitaxial films were grown on SrRuO3/SrTiO3(100) as well as amorphous films on silicon substrates. The epitaxial films are investigated to measure the physical properties of the crystalline material. Electrical measurements (CV, leakage current) show for example high εr > 20 for the scandates and εr > 35 for the epitaxial and amorphous multi-layer films. A diffusion of the new materials into silicon is not observed.
In two minds? Learner attitudes to bilingualism and the bilingual tandem analyser
Authors: Peter Kapec, Klaus Schwienhorst
Venue: ReCALL (2005)

One of the issues that has been debated in the context of fairly open learning partnerships such as tandem learning has been whether and, if so, how much pedagogical support should be provided. Another issue is how do language learners who have grown accustomed to maximising their learning through comprehensible input and output make the transition to a reciprocal learning partnership where they are supposed to switch between the roles of learner and expert or resource. The three principles behind tandem learning are bilingualism; reciprocity; and learner autonomy. At Trinity College Dublin we have conducted extensive research into tandem learning in object-oriented Multiple User Domains (MOOs) since 1998. Of the three tandem principles, we found that balanced bilingualism, where both languages are used equally in the exchange, is difficult to achieve, particularly though not surprisingly in partnerships where L2 proficiency differs substantially. We think that technology, at least in MOOs, can contribute towards a solution to the problem. The bilingual tandem analyser (BTA) analyses MOO input while users are communicating and gives feedback to learners (and possibly teachers) on bilingualism in the exchange. Here, we discuss what attitudes towards bilingualism learners bring towards the tandem exchange and how they react to the BTA as a tool to monitor and regulate bilingualism: will learners perceive balanced bilingualism as a necessary principle of the partnership; what efforts do they make to keep the balance between the languages; how do they see the BTA: as an instrument of control, directed by the teacher; or do they perceive it as a useful tool to support their tandem exchanges?
ARpm: An Augmented Reality Interface for Polygonal Modeling
Authors: Peter Fiala, Nicoletta Adamo-Villani
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We present a prototype system called ARpm, (Augmented Reality for Polygonal Modeling). Created as a front-end to a commercially available 3D animation program (3D Studio Max), it does not require it's modification through inaccessible software code. Users look through a head mounted display (HMD) and the object being modeled appears as a 3D augmentation in the real world. This object can be manipulated using a tangible interface of marker panels that correspond to the modeling tools in 3D Studio Max, and a wireless pointer device. Unlike virtual reality which brings the user into the virtual world, this system places the 3D model in the user's world while allowing the use of a large range of complex 3D polygonal modeling tools provided by 3D Studio Max.
Simulation as an alternative to linear programming
Authors: Susan L. Solomon
Venue: ACM SIGSIM Simulation Digest (1977)

It is commonly accepted that general classes of problems are best solved using particular techniques. For example, critical path scheduling problems can often be formulated for solution by linear programming, but this approach would not recommend itself for cost reasons to the vast majority of those having access to a PERT or CPM heuristic package. Likewise, the classic product mix or blending problem which pervades the end-of-chapter exercises following a discussion of linear programming is assumed to be "best" solved using graphical methods or the Simplex algorithm. Simulation might offer a reasonable alternative solution vehicle in many circumstances like these, yet some operations research analysts tend to consider its use only "when all else fails". That is, simulation is the technique of last resort.
Functional and architectural adaptation in pervasive computing environments
Authors: N. C. Narendra, Umesh Bellur, S. K. Nandy, K. Kalapriya
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

Service-oriented computing paradigm encourages the use of dynamic binding of application requirements to the resources needed to fulfill application tasks. Especially in pervasive computing that is characterized by disconnected operation and mobility, the process of using service specifications and dynamic binding becomes critical. For this, adaptation techniques that provide for seamless service composition are needed for user task execution. In this paper we present our approach to enable two kinds of adaptations: functional (due to changes in user requirements) and architectural (due to changes in nonfunctional requirements) in pervasive computing systems. The key features of our approach are to model services as workflows, service handoffs as points of variability, and context detailing for dynamic service provisioning.
Variable Size Population in Parallel Evolutionary Algorithms
Authors: Gabriela F. Minetti, Hugo A. Alfonso
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Considering the population size is a critical parameter to define in evolutionary computation, in this paper an improved parallel evolutionary algorithm that incorporates different mechanisms to adapt the population size to the current status, is presented. Those mechanisms are based on Resizing on Fitness Improvement GA (PRoFIGA) and Variable Population Size (GAVaPS). Results indicate these incorporations are a reasonable choice when refinement in solutions is necessary.
A translation method between 802.15.4 nodes and IPv6 nodes
Authors: Shoichi Sakane, Yosuke Ishii, Katsuhiko Toba, Kenichi Kamada, Nobuo Okabe
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

There are many kinds of control networks based on non- IP, such as BA (Building Automation), FA (Factory Automation) and PA (Process Automation). The IPv6 and wireless technologies are expected to improve those networks. The IEEE 802.15.4 is a candidate for wireless technology in control networks because of its feature, e.g. low power consumption and small implementation. Seamless communication between both technologies is important, though it is not easy for IEEE 802.15.4 packet to carry IPv6 packet due to its limited features. This paper shows a translation method between IPv6 nodes and IEEE 802.15.4 nodes.
Design of UHF RFID Emulators with Applications to RFID Testing and Data Transport
Authors: Rich Redemske, Rich Fletcher
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

The electronic design requirements and applications for a UHF RFID tag emulator are presented. As motivated by present-day industry needs, several implementations of UHF RFID tag emulators are discussed with particular focus given to the use of the emulators as a general-purpose testing tool for RFID system design and on-site measurements. Several noteworthy results of UHF system testing are mentioned. As a longer-term development, the emerging use of UHF RFID protocols for general-purpose wireless data communications is also discussed
Opportunistic Multichannel Aloha for Clustered OFDM Wireless Networks
Authors: Kai Bai, Junshan Zhang
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

We consider multi-access control for the uplink in OFDMA networks. Assuming that subcarriers are grouped into clusters, we investigate multichannel random access based on local channel state information, and propose an opportunistic multichannel Aloha scheme to maximize the system throughput. A key step is to build a mapping from a user's channel state information to its transmission probability and channel allocation. For the sake of comparison, we also characterize the throughput corresponding to the optimal centralized scheduling by using the Extreme- Value Theory of order statistics. We show that the opportunistic multichannel Aloha scheme is asymptotically orderoptimal, in the sense that the only performance loss compared to the optimal centralized scheduling is due to the contention inherent in random access. In addition, we generalize the study to heterogeneous cases. Our findings show that when each user behaves as if it were in homogeneous systems, the proposed scheme can provide proportional fairness among the users.
A topological approach to transductions
Authors: Jean-Éric Pin, Pedro V. Silva
Venue: Theoretical Computer Science (2005)

This paper is a contribution to the mathematical foundations of the theory of automata. We give a topological characterization of the transductions τ from a monoid M into a monoid N, such that if R is a recognizable subset of N, τ-1(R) is a recognizable subset of M. We impose two conditions on the monoids, which are fullfilled in all cases of practical interest: the monoids must be residually finite and, for every positive integer n, must have only finitely many congruences of index n. Our solution proceeds in two steps. First we show that such a monoid, equipped with the so-called Hall distance, is a metric space whose completion is compact. Next we prove that τ can be lifted to a map τ from M into the set of compact subsets of the completion of N. This latter set, equipped with the Hausdorff metric, is again a compact monoid. Finally, our main result states that τ-1 preserves recognizable sets if and only if τ is continuous.
Web-based Video Editing System for Sharing Clips Collected from Multi-user
Authors: Satoshi Ichimura, Yutaka Matsushita
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Movies edited by amateurs are likely to be a sequence of monotonous scenes, where people record video from a single direction, and use video from a single camcorder when editing video. We developed VideoBlocks, a web-based video editing system. In our system, video clips are collected from multi-users' camcorders via the Internet and shared among the users. The system allows users to easily use other users' video clips, each of which is spontaneously videotaped using different digital video camcorders. VideoBlocks provides the capability to extract the date and time information of the video-recording from the digital video cameras, and automatically synchronize them. Through evaluations of the system, we determined the effectiveness of the system.
The Role and Impact of Assumptions in Software Development, Maintenance and Evolution
Authors: Meir M. Lehman
Venue: Proceedings of the IEEE International Workshop on Software Evolvability (2005)

This paper discusses the gradual invalidation of assumptions explicitly or implicitly embedded in software and shows that this is an inevitable, probably dominant, cause and driver of software evolution. It reasons that such evolution is a natural phenomenon having major safety, reliability and economic impact on computer usage. In the context of growing computer application, the phenomenon and its significance as this technology is ever more widely exploited are becoming increasingly apparent. Many evolution properties identified are also present in the wider context. But as demonstrated in the next section their impact are more profound in the field of software development, application and maintenance than in other fields. The problems that result are increasing. The present paper is restricted to the software areas.
Age differences rendezvousing: reminders for side-stepping
Authors: Martin Colbert
Venue: Personal and Ubiquitous Computing (2005)

This paper reports a diary study of the use of mobile telephones for rendezvousing by young adults (aged 18&#x2013;30) and mature adults (aged 31&#x2013;45) in the UK. A number of age differences were found. Specifically, 31&#x2013;45s more frequently: (1) attributed problems rendezvousing to the overrunning of previous activities, and to the spontaneous performance of additional tasks (&#x2018;side-stepping&#x2019;); (2) reported that &#x2018;problem&#x2019; rendezvous resulted in unnecessary sacrifices; and (3) changed plans for the rendezvous. These differences arose, because additional family commitments encouraged 31&#x2013;45s to pack their daily programme of activities more tightly than 18&#x2013;30s. Mobile phones might better target 31&#x2013;45s, if they, for example, enhanced To Do Lists with context-sensitive reminders, in the first instance, reminders triggered by location (GSM network cellID) and logging off from PCs.
Deciding security of protocols against off-line guessing attacks
Authors: Mathieu Baudet
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions.The procedure consists of a constraint solving algorithm for determining satisfiability and equivalence of a class of second-order E-unification problems, where the equational theory E is presented by a convergent subterm rewriting system.To the best of our knowledge, this is the first decidability result to use the generic definition of off-line guessing attacks due to Corin et al. based on static equivalence in the applied pi calculus.
Construction and Implementation of General Linear Methods for Ordinary Differential Equations: A Review
Authors: Z. Jackiewicz
Venue: Journal of Scientific Computing (2005)

It it the purpose of this paper to review the results on the construction and implementation of diagonally implicit multistage integration methods for ordinary differential equations. The systematic approach to the construction of these methods with Runge---Kutta stability is described. The estimation of local discretization error for both explicit and implicit methods is discussed. The other implementations issues such as the construction of continuous extensions, stepsize and order changing strategy, and solving the systems of nonlinear equations which arise in implicit schemes are also addressed. The performance of experimental codes based on these methods is briefly discussed and compared with codes from Matlab ordinary differential equation (ODE) suite. The recent work on general linear methods with inherent Runge---Kutta stability is also briefly discussed
Face Class Code Based Feature Extraction for Face Recognition
Authors: Chunyan Xie, B. V. K. Vijaya Kumar
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In face recognition, the goal is to assign a class label for a test image of a subject from N classes in the database. when binary classifiers are used, the commonly used method is the one-per-class (OPC) i.e., one classifier per subject. A drawback of the OPC method is that when the number of classes is large, it takes very long time to make a classification decision. In place of the computationally-demanding OPC method, we propose a new feature extraction method "Face Class Code" (FCC) based on binary classifiers. For example, correlation filters and support vector machines can be used to generate feature vectors to deal with large number of classes. The FCC method encodes each class label into a binary string, and we design classifiers to discriminate '1' or '0' for each bit in the sequence, to determine the class label. Thus, we will need as few as ⌈log₂(N)⌉ binary classifiers to achieve an N-class recognition problem. This binary coding framework also opens the whole world of error control codes (ECC), which can be used to improve the recognition performance. The proposed method is verified through experiments on the PIE database and the AR database.
Self-regulated Complexity in Neural Networks
Authors: Eyal Hulata, Vladislav Volman, Eshel Ben-Jacob
Venue: Natural Computing: an international journal (2005)

Recordings of spontaneous activity of in vitro neuronal networks reveal various phenomena on different time scales. These include synchronized firing of neurons, bursting events of firing on both cell and network levels, hierarchies of bursting events, etc. These findings suggest that networks' natural dynamics are self-regulated to facilitate different processes on intervals in orders of magnitude ranging from fractions of seconds to hours. Observing these unique structures of recorded time-series give rise to questions regarding the diversity of the basic elements of the sequences, the information storage capacity of a network and the means of implementing calculations.Due to the complex temporal nature of the recordings, the proper methods of characterizing and quantifying these dynamics are on the time---frequency plane. We thus introduce time-series analysis of neuronal network's synchronized bursting events applying the wavelet packet decomposition based on the Haar mother-wavelet. We utilize algorithms for optimal tiling of the time---frequency plane to signify the local and global variations within the sequence. New quantifying observables of regularity and complexity are identified based on both the homogeneity and diversity of the tiling (Hulata et al., 2004, Physical Review Letters 92: 198181---198104 ). These observables are demonstrated while exploring the regularity---complexity plane to fulfill the accepted criteria (yet lacking an operational definition) of Effective Complexity. The presented question regarding the sequences' capacity of information is addressed through applying our observables on recorded sequences, scrambled sequences, artificial sequences produced with similar long-range statistical distributions and on outputs of neuronal models devised to simulate the unique networks' dynamics.
Load Regulation in Mobile Network with Planned Pricing Model based on User Behaviour
Authors: Mustapha Oughdi, Alexandre Caminada, Sid Lamrous, Bertrand Morin
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Mobile network operators face congestion problem which degrades the Quality of Service. Previous studies on telecommunication service pricing show that it is an efficient mean to manage network profitability and traffic regulation. The aim of this work is to propose pricing policy which is able to reduce congestion and increase profitability in mobile networks. In this paper, we investigate several pricing models in mobile networks, and we propose a new model which consists in periodically adjusting the communications prices. The model applies different taxes per period in order to reduce the network load during congested periods and increase the load during off-peak ones. We use probabilistic approach based on utility function to predict user's behaviour that allow us to predict the offered traffic and manage it according to the network capacity.
Good Ideas, through the Looking Glass
Authors: Niklaus Wirth
Venue: Computer (2006)

Computing's history has been driven by many good and original ideas, but a few turned out to be less brilliant than they first appeared to be.
CMSM - A Closed Multi-Source IP Multicast Protocol
Authors: Chen Yue, Wang Na, Li Yufeng, Lan Julong
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

To tackle the high requirement to network infrastructure, lack of scalability, address conflict and security vulnerability problems of IP multicast protocols, this paper introduces CMSM, a novel closed multi-source IP Multicast protocol. It is a lightweight self-configurable multi-source multicast paradigm for the Internet. After being aware of a specific source for a many-to-many group, the hosts and the routers send their JOIN/REQS/LEAVE message towards the source, and a closed hybrid multi-source-multi-receiver CMSM tree used for secure group communication is formed in an open network infrastructure. Non-CMSM routers are bypassed by CMSM tunnels, which eliminates the dependence of multicast-specific routing. Only authorized senders or receivers are allowed to send to or receive from CMSM group and only trusted routers are allowed to be the branch points of CMSM tree. Analyses show that CMSM is high scalability and reachability, and has preferable security features.