ppxscal/embedding_network huggingface dataset:
Ultra-Fast Downloading of Partial Bitstreams through Ethernet
Authors: Pierre Bomel, Jeremie Crenne, Linfeng Ye, Jean-Philippe Diguet, Guy Gogniat
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

In this paper we present a partial bitstreams ultra-fast downloading process through a standard Ethernet network. These Virtex-based and partially reconfigurable systems use a specific data-link level protocol to communicate with remote bistreams servers. Targeted applications cover portable communicating low cost equipments, multi-standards software defined radio, automotive embedded electronics, mobile robotics or even spacecrafts where dynamic reconfiguration of FPGAs reduces the components count: hence the price, the weight, the power consumption, etc... These systems require a local network controller and a very small internal memory to support this specific protocol. Measures, based on real implementations, show that our systems can download partial bistreams with a speed twenty times faster (a sustained rate of 80 Mbits/s over Ethernet 100 Mbit/s) than best known solutions with memory requirements in the range of 10th of KB.
A digital forensics class for students with visual impairments
Authors: Sean J. Geoghegan, Lis D. Geoghegan, Stephanie D. Smith
Venue: Journal of Computing Sciences in Colleges (2009)

The increased use of digital data in all aspects of society, leads to the increased use of digital data as evidence in criminal and civil proceedings. Collection of digital evidence must be performed by individuals with the skills to acquire, preserve, and present digital evidence. Because the tasks are performed almost entirely using computer software, recent advances in adaptive technology increases the viability of digital forensics as a career choice for individuals with visual impairments. This paper describes a digital forensics summer class designed to provide students with visual impairments an opportunity to experience some of the tools and techniques used in the digital forensics profession. Additionally, observations were made regarding the accessibility of the digital forensics tools when used in conjunction with adaptive software and assistive technology. The observations were used to identify potential improvements to the forensics tools to increase the accessibility to users with visual impairments.
Stability of solutions of stochastic functional-differential equations with poisson switchings and entire prehistory
Authors: S. V. Antonyuk, V. K. Yasinsk
Venue: Cybernetics and Systems Analysis (2009)

The Markov properties of the solutions of Ito-Skorokhod stochastic functional-differential equations (SFDEs) with entire prehistory are considered, the concept of a weak infinitesimal operator is introduced for a Markov process that is a solution of an SFDE, and the strong solution of the SFDE is analyzed for stability.
A sensor planning system for automated headlamp lens inspection
Authors: S. Satorres Martínez, J. Gómez Ortega, J. Gámez García, A. Sánchez García
Venue: Expert Systems with Applications: An International Journal (2009)

Usually, the automated systems for quality control based on computer vision have been centered on the design of algorithms for detecting different types of defects. Nevertheless, the issues related to planning suitable sensor poses for the inspection task have received less attention. In addition, the applications where a vision sensor can only sample a portion of a part from a single viewpoint, the sensor planning problem becomes critically important. This is the case of the automated inspection of vehicle headlamp lens, that due to its geometry and dimensions, requires multiple sensor poses to observe the whole part. Moreover, the customer requirements that define the maximum defect size should also be taken into account in the inspection process. This paper presents a vision sensor planning system applied to the quality control of headlamp lenses. The system uses the lens CAD, a vision sensor model and the customer requirements, included through a fuzzy approach, to achieve an optimal set of viewpoints. To compute the number and distribution of the viewpoints, a genetic algorithm is used. Experimental results demonstrate the effectiveness of the sensor planning system on commercial lenses.
The Research of Multiparty Application Modeling Supported Network Architecture Description Method
Authors: Huang Yuan, Shen Jun, Song Jinjing
Venue: International Journal of Distributed Sensor Networks (2009)

The multiparty applications pattern of network is going to definitely play an important role on the Internet. However, the traditional research of network architecture almost exclusively uses the “one to one” direct interaction model to describe various kinds of network interactions. The INSA (Interactive Network Services Architecture) reference model and network description language INSADL developed by the Laboratory of Computer Network and Information Integration (Southeast University) have introduced the component-based thought and interactive viewpoint to the research of network architecture. Moreover, INSADL has provided support for the modeling of network multiparty applications to some extent. Nevertheless the modeling requirements of the multiparty applications are much more complicated than those of traditional network applications. The description of complex network interactions involving a non-fixed number of participating entities needs to be supported. It also raised the problem of how to represent the composite entity components, and sometimes the dynamic joining and leaving of entities from interactions should be dealt with. Therefore, INSADL still has some limitations. So we established a new network architecture formal description method on the basis of INSADL's component-based thought to support the depiction of multiparty application. We discussed the detailed modeling schemas for different modeling elements. For entity components, we defined the inheritance relations between component classes by using the “extends” field and set rules for the overriding of grammar units in derived classes. We also introduced the “symbol transformation method” of CSP to simplify the definition of similar processes. Furthermore, the definition production of functions which describe the data processing of entities is given. For the modeling of the interaction connector, we improved the description used by INSADL. We adjusted the production of nonterminal
Getting SW Engineers on Board: Task Modelling with Activity Diagrams
Authors: Jens Brüning, Anke Dittmar, Peter Forbrig, Daniel Reichart
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

This paper argues for a transfer of knowledge and experience gained in task-based design to Software Engineering. A transformation of task models into activity diagrams as part of UML is proposed. By using familiar notations, software engineers might be encouraged to accept task modelling and to pay more attention to users and their tasks. Generally, different presentations of a model can help to increase its acceptance by various stakeholders. The presented approach allows both the visualization of task models as activity diagrams as well as task modelling with activity diagrams. Corresponding tool support is presented which includes the animation of task models. The tool itself was developed in a model-based way.
Guitar man: (an implementation of a rhythm game cooperative musical performance system with actual musical instruments)
Authors: Aram So
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

This study proposes a method for learning musical instruments using computer graphics. The conventional musical instrument learning systems have been considered as simple game controllers or simple score processors. This study produced an education program for this purpose by recognizing pitches in actual musical instruments and designed this program to achieve cooperative musical performances with some other musical instruments using computer graphics. It is necessary to apply a pitch detection algorithm to play some games using actual musical instruments in which the pitch detection method can be largely classified as time and frequency domains. This study used a time domain algorithm to recognize the pitches of guitar and bass guitar among actual musical instruments. In addition, this study analyzed some midi data files in order to publish visual scores and produce background music. The midi data files include time and pitch information for each musical instrument and can be used as background music. A new algorithm was required to visually express the information using the pitch information included in the midi data. Because the scores of the guitar and bass guitar that are the types of string musical instruments should include the flat and string number, it is not possible to publish their scores only using the pitch information. Thus, this study proposes efficient fingering positions based on the pitch information in midi data. The efficient fingering positions are able to produce actual scores used in actual guitars instead of providing simple pitch information applied in the process of some games. Because music inspires delights in certain cooperative musical performances with other musical instruments, this study implemented an on-line cooperative musical performance system using an IOCP model. Each client selects some musical instruments before playing games and plays music with others.
Improving performance by replicating simulations with alternative synchronization approaches
Authors: Zengxiang Li, Wentong Cai, Stephen John Turner, Ke Pan
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Parallel and distributed simulation facilitates the construction of a simulation application (i.e., federation in HLA terminology) with a number of simulation components (federates). Recently, an approach based on active replication technique has been proposed to improve the performance of simulations by exploring software diversity. To guarantee the correctness of the approach, all replicas of the same federate are required to be Piece-Wise-Deterministic (PWD). However, the PWD restriction will not be satisfied if the replicas achieve software diversity by employing different kinds of synchronization approaches. A replication structure is proposed in this paper, which can transparently handle the federate replicas that use either conservative or optimistic synchronization approach. The execution speed of the federation is increased by always choosing the fastest replica to represent the federate in the federation. Besides presenting the implementation details, we also report the experimental results to demonstrate the performance improvement of the replication structure.
A preliminary system for recognizing boredom
Authors: Allison M. Jacobs, Benjamin Fransen, J. Malcolm McCurry, Frederick W.P. Heckel, Alan R. Wagner, J. Gregory Trafton
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

A 3D optical flow tracking system was used to track participants as they watched a series of boring videos. The video stream of the participants was rated for boredom events. Ratings and head position data were combined to predict boredom events.
Optimized Design and Implementation of Three-Phase PLL Based on FPGA
Authors: Yuan Huimei, Sun Hao, Song Yu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

An optimized method to design and implement digital three-phase phase-locked loop (PLL) based on FPGA is presented in this paper. The PLL fits in electric power system as well as other fields. At first, principle and basic structure of the PLL including phase discriminator, loop filter and voltage controlled oscillator (VCO) are introduced, then these modules are designed in VHDL language with blocking design method. In order to save logic resource of FPGA, an optimized method called chip area sharing is adopted. At the same time, a new method which combines CORDIC algorithm with look-up table algorithm is put forward in this paper to generate sine function. This new method can both increase calculating speed and guarantee accuracy of results. At last, the design is implemented on Altera’s FPGA chip EP1C12Q240C8. It is verified that the design can save logic resource of FPGA largely, and it is also proved that the PLL can track the variation of frequency and lock the basic phase well.
Reanalysis of a Castor model limit cycle calculation
Authors: Ronald E. Mickens
Venue: Computers Mathematics with Applications (2009)

The Castor equation is a third-order, nonlinear, ordinary differential equation that was derived to model pulsations for stars having oscillatory changes in their radii as reflected through their light output. A detailed study of this model was done by J.P. Cox, based on unpublished notes of J. Castor. The purpose of the current work is to re-examine these calculations and indicate that results different from those of Castor and Cox are obtained by use of a different method. An explanation for this is given.
Design and Implementation of Digital Contents Authoring Tools with Metadata
Authors: Sooduck Chun, Junghoon Shin, Sangjun Lee, Soowon Lee, Kyoung-Su Oh
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The advancement of information technology along with the proliferation of communication and multimedia, have increased the demand of digital contents. Video data of digital contents such as VOD (video on Demand), NOD (News on Demand), Digital Library, IPTV (Internet Protocol Television), and UCC (User Created Contents) are getting more permeated in various application fields. Video data have sequential characteristic besides providing the spatial and temporal information in its 3D format, making searching or browsing ineffective due to long turnaround time.In this paper, we suggest ATVC (Authoring Tool for Video Contents) for solving this issue. ATVC is a video editing tool that detects key frames using visual rhythm and insert metadata such as keywords into key frames via XML tagging. Visual rhythm is applied to map 3D spatial and temporal information to 2D information. Its processing speed is fast because it can get pixel information without IDCT (Inverse Discrete Cosine Transform), and it can classify edit-effects such as cut, wipe, and dissolve. Since XML data save key frame information via XML tag and keyword information, it can furnish object-based retrieval or content-based retrieval.
Stabilizing maximum matching in bipartite networks
Authors: Rachid Hadid, Mehmet Hakan Karaata
Venue: Computing (2009)

A matching $${E_\mathcal{M}}$$of graph G =&#x00a0; (V, E) is a subset of the edges E, such that no vertex in V is incident to more than one edge in $${E_\mathcal{M}}$$. The matching $${E_\mathcal{M}}$$is maximum if there is no matching in G with size strictly larger than the size of $${E_\mathcal{M}}$$. In this paper, we present a distributed stabilizing algorithm for finding maximum matching in bipartite graphs based on the stabilizing PIF algorithm of Cournier et&#x00a0;al. (Proceedings of 21st IEEE international conference on distributed computing systems, 91&#x2013;98, 2001). Since our algorithm is stabilizing, it does not require initialization and withstands transient faults. The complexity of the proposed algorithm is O(d &#x00d7;&#x00a0;n) rounds, where d is the diameter of the communication network and n is the number of nodes in the network. The space complexity is O(log &#x0394; +&#x00a0; log d), where &#x0394; is the largest degree of all the nodes in the communication network. In addition, an optimal version of the proposed algorithm finding maximum matching in linear time is also presented.
Protease substrate site predictors derived from machine learning on multilevel substrate phage display data
Authors: Ching-Tai Chen, Ei-Wen Yang, Hung-Ju Hsu, Yi-Kun Sun, Wen-Lian Hsu, An-Suei Yang
Venue: Bioinformatics (2008)

Motivation: Regulatory proteases modulate proteomic dynamics with a spectrum of specificities against substrate proteins. Predictions of the substrate sites in a proteome for the proteases would facilitate understanding the biological functions of the proteases. High-throughput experiments could generate suitable datasets for machine learning to grasp complex relationships between the substrate sequences and the enzymatic specificities. But the capability in predicting protease substrate sites by integrating the machine learning algorithms with the experimental methodology has yet to be demonstrated. Results: Factor Xa, a key regulatory protease in the blood coagulation system, was used as model system, for which effective substrate site predictors were developed and benchmarked. The predictors were derived from bootstrap aggregation (machine learning) algorithms trained with data obtained from multilevel substrate phage display experiments. The experimental sampling and computational learning on substrate specificities can be generalized to proteases for which the active forms are available for the in vitro experiments. Availability: http://asqa.iis.sinica.edu.tw/fXaWeb/ Contact:hsu@iis.sinica.edu.tw; yangas@gate.sinica.edu.tw Supplementary information:Supplementary data are available at Bioinformatics online.
Parameterized defuzzification with continuous weighted quasi-arithmetic means - An extension
Authors: Xinwang Liu
Venue: Information Sciences: an International Journal (2009)

Parameterized aggregation becomes an attractive idea in many applications. By applying the quasi-arithmetic mean-based defuzzification method and its orness measure, we extend the properties of discrete quasi-arithmetic mean with an orness measure to the case of continuous weighted quasi-arithmetic means, and apply them to the parameterized estimation of fuzzy or random variables. When facing the uncertainty of these variables, the decision maker can obtain the crisp value estimation which is always consistent with his/her preference information. Two families of continuous weighted quasi-arithmetic means with exponential and power function generators are discussed. Combining these conclusions with that of the discrete case, we can understand better the properties of quasi-arithmetic means and extend their possible applications.
Using Context to Disambiguate Communicative Signals
Authors: Mark Maat, Dirk Heylen
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

After perceiving multi-modal behaviour from a user or agent a conversational agent needs to be able to determine what was intended with that behaviour. Contextual variables play an important role in this process. We discuss the concept of context and its role in interpretation, analysing a number of examples. We show how in these cases contextual variables are needed to disambiguate multi-modal behaviours. Finally we present some basic categories in which these contextual variables can be divided.
The Digital Watermarking Method by Using both Patchwork and DCT
Authors: Hiroyuki Kii, Junji Onishi, Shinji Ozawa
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The technique of the digital watermark is proposed as the way of solving the copyright protection problem of the digital contents which accompanies the development of computer network.There are mainly two ways to embed digital watermark. One is in the spatial domain and the other is in the frequency domain. The former is generally weak in the processing of an overwriting, compression, filtering and so on, and the latter is known as the ways which are strong in various attacks. However, when the watermarked image is cropped, it is not possible to detect watermark.Therefore, the purpose of this paper is to propose the digital watermarking method that the watermark can be detected even if a image is cropped, too. This proposed method can be performed by using both patchwork which is statistical technique and DCT.
Satellite Communications Systems Engineering: Atmospheric Effects, Satellite Link Design and System Performance (Wireless Communications and Mobile Computing)
Authors: Louis J. Ippolito
Venue:  (2008)

Provides an invaluable, detailed and up-to-date coverage of atmospheric effects and their impact on satellite communications systems design and performance.Significant progress has been made in the last decade in the understanding and modelling of propagation effects on radio wave propagation in the bands utilized for satellite communications. This book provides a comprehensive description and analysis of all atmospheric effects of concern for todays satellite systems, and the tools necessary to design the links and to evaluate system performance.This book will serve as an excellent reference to communications engineers, wireless network and system engineers, system designers and graduate students in satellite communications and related areas.Key features: Provides the state of the art in communications satellite link design and performance from the practicing engineer perspective concise descriptions, specific procedures and comprehensive solutions Contains the calculations and tools necessary for evaluating system performance Provides a complete evaluation of atmospheric effects, modelling and prediction Focuses on the satellite free-space link as the primary element in the design and performance for satellite communications, and recognizes the importance of free-space considerations such as atmospheric effects, frequency of operation and adaptive mitigation techniques
Anisotropic conforming rectangular elements for elliptic problems of any order
Authors: Shaochun Chen, Yongqin Yang, Shipeng Mao
Venue: Applied Numerical Mathematics (2009)

In this paper two sets of C^N^-^1 conforming rectangular elements for linear elliptic problems of order 2N, N>=1, are presented. One is b"i-(2N-1) element, well known b"i-linear element and b"i-cubic C^1 element (Bogner-Fox-Schmit) correspond to N=1 and N=2, respectively. Another one is b"i-2N element, well known b"i-quadratic element corresponds to N=1. The anisotropic error estimates are proved by the Newton's formulas for Hermite interpolation in two dimension and the special properties of the divided differences with coincident knots presented in this paper.