ppxscal/embedding_network huggingface dataset:
Scalable Multimedia Group Communications through the Over-Provisioning of Network Resources
Authors: Augusto Neto, Eduardo Cerqueira, Marília Curado, Paulo Mendes, Edmundo Monteiro
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

The efficient management of network resources together with the Quality of Service (QoS) control of real-time multimedia group communication sessions in Next Generation Networks (NGN) is still a challenging research goal. The unified control of the session quality level, distribution tree allocation and network resources in NGN will increase the user satisfaction, reduce operational costs, optimize network resources and maximize the profits of providers. This paper introduces the Multi-user Aggregated Resource Allocation mechanism (MARA), which supports a dynamic control of surplus class-based bandwidth and multicast resources in a scalable way, while assuring the minimal quality level of multimedia group communication sessions. In comparison with existing works, MARA significantly reduces signalling, state and processing overhead. In addition, simulation results present the benefits of MARA by improving the network performance under re-routing conditions.
Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
Authors: B. Collard, F. -X. Standaert, J. -J. Quisquater
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We first present a 9-round linear characteristic with probability $\frac{1}{2}+2^{-50}$ that involves a reduction of the estimated data complexity of the best reported attack by a factor of 16. Then, we investigate the possibility to take advantage of multiple linear approximations for improving the linear cryptanalysis of Serpent. According to the framework of Biryukov et al. from Crypto 2004, we provide estimations of the improved data complexity of such attacks and derive practical cryptanalysis scenarios. For computational reasons, the branch-and-bound search is not guaranteed to be optimal. However, these are the best reported complexities of a linear attack against Serpent.
TS-Neural-Network-Based Maintenance Decision Model for Diesel Engine
Authors: Ying-Kui Gu, Zhen-Yu Yang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

To decrease the influence of fuzzy and uncertain factors on the maintenance decision process of diesel engine, a fuzzy-neural-network-based maintenance decision model for diesel engine is presented in this paper. It can make the maintenance of diesel engine follow the prevention policy and take the technology and economy into account at the same time. In the presented model, the fuzzy logic and neural network is integrated based on the state detection technology of diesel engine. The maintenance decision process of diesel engine is analyzed in detail firstly. Then, the fuzzy neural network model of maintenance decision is established, including an entire network and two module sub-networks, where the improved T-S model is used to simply the structure of neural networks. Finally, an example is given to verify the effective feasibility of the proposed method. By training the network, the deterioration degree of the diesel engine and its parts can be obtained to make the right maintenance decision.
Approach to Data Table Decomposition Based on Rough Set Attribute Selection Measure
Authors: Wenbing Jin
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper proposes a new data table decomposition algorithm to address problems in extracting rules from massive data tables, e.g. low effectiveness, low computing speed and long rule length. With rough set theory, in the perspective of improving classification correctness and sub data table purity, this paper brings up attribute selection measure, and proposes to stop decomposing process to reduce the length of rules. Decompose data table with measures, and finally obtain a rule set with certain supportiveness. The length of obtained rules is short, the effectiveness of decision analysis is high, and it effectively overcomes the impact of noise on rough set data analysis. 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
Performance sensitivity of helicopter global and local optimal harmonic vibration controller
Authors: S. R. Viswamurthy, R. Ganguli
Venue: Computers Mathematics with Applications (2008)

A comparison of local and global controllers is conducted for helicopter vibration reduction using actively controlled single/dual trailing-edge flaps. It is found that for high-speed flight conditions, both local and global controllers perform equally well. However, for low-speed flight, local controller gives a marginally better optimal solution compared to the global controller but at the cost of much greater computation time. An objective function containing the hub vibratory loads is minimized using the global controller. The control effort is weighted such that each flap is used to complete authority. A reduction of 73% and 75% in hub vibration is obtained at high-speed flight using single and dual flap configurations, respectively. At low-speed flight, single and dual flap configurations gave 52% and 63% reduction in vibration, respectively. Numerical studies using an aeroelastic simulation show that the vibration control system performs well up to +/-5 degrees error in flap phasing from optimal phase. The control law is insensitive to small perturbations (up to +/-0.3 deg) in the optimal flap harmonics and is fairly insensitive to stiffness and mass changes of the rotor blade as well as noise in the measured hub load data. Dual flap configuration was found to be more insensitive to errors in optimal flap control harmonics than single flap configuration.
Underdetermined Blind Source Separation Using SVM
Authors: Yang Zuyuan, Luo Shiguang, Chen Caiyun
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A novel sparse measure of signal is proposed and the efficient number of sources is estimated by the best confidence limit in this work. The observations are classified by SVM trained through samples which are constructed by direction angle of sources. And columns of the mixing matrix corresponding to clustering centers of each class are obtained based on the sum of samples belong to the same class with different weights which are adjusted adaptively. It gets out of the trap of the initial values which interfere k-mean clustering quite a lot. Furthermore, the online algorithm for estimating basis matrix is proposed for large scale samples. The shortest path method is used to recover the source signals after estimating the mixing matrix. The favorable simulations show the stability and robustness of the algorithms.
The Mathematics of Routing in Massively Dense Ad-Hoc Networks
Authors: Eitan Altman, Pierre Bernhard, Alonso Silva
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from physics have been used recently in order to solve the continuum model. We propose in this paper an alternative modeling and solution approach similar to a model by Beckmann [3] developed more than fifty years ago from the area of road traffic.
Letters: Solving local minima problem with large number of hidden nodes on two-layered feed-forward artificial neural networks
Authors: Bumghi Choi, Ju-Hong Lee, Deok-Hwan Kim
Venue: Neurocomputing (2008)

The gradient descent algorithms like backpropagation (BP) or its variations on multi-layered feed-forward networks are widely used in many applications. However, the most serious problem associated with the BP is local minima problem. Especially, an exceeding number of hidden nodes make the corresponding network deepen the local minima problem. We propose an algorithm which shows stable performance on training despite of the large number of hidden nodes. This algorithm is called separate learning algorithm in which hidden-to-output and input-to-hidden separately trained. Simulations on some benchmark problems have been performed to demonstrate the validity of the proposed method.
Proposal for LDPC Code Design System Using Multi-Objective Optimization and FPGA-Based Emulation
Authors: Yukari Ishida, Hirotaka Nosato, Eiichi Takahashi, Masahiro Murakawa, Isamu Kajitani, Tatsumi Furuya, Tetsuya Higuchi
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

The paper proposes a low density parity check (LDPC) code design system to facilitate the design of communication systems using LDPC codes for error correction. The proposed LDPC code design system has three advantages (utilization of MOGA to search codes, speed enhancement achieved through parallelization and FPGAs, and employment of more precise simulation models) and solves problems encountered when LDPC codes are used in practical applications. Preliminary evaluation results for the proposed system are presented, which demonstrate that the system can function successfully.
A hybrid method for fingerprint image validity and quality computation
Authors: M. S. Altarawneh, W. L. Woo, S. S. Dlay
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Fingerprint based system reliability is critical for image validity and quality. As, good quality images make the system performance more robust. However, it is always very difficult to obtain good quality images in practice and image quality degradation leads to invalid images. A hybrid method for fingerprint image validity calculation is proposed that combines validity check, using statistical weight calculation and Gabor spectrum approach for image quality assessment. The proposed scheme is investigated using a manual validity check survey and is compared with NIST fingerprint image for image quality. Experimental results on FVC2004 and TIMA database show that the proposed method significantly improves false acceptance and true acceptance rates.
Bounded-Delay, Probability-Based Routing in Intermittently Connected Mobile Ad Hoc Networks
Authors: Xianning Li, Xianwei Zhou
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Routing in intermittently connected mobile ad hoc networks (ICMAN) is particularly challenging due to intermittent connectivity and unstable topology. To deal with this problem, researchers have proposed some routing schemes based on message relay. Proposed efforts focus on the tradeoff between average message delivery delay and communication overhead. However, message delivery with a certain probability of bounded delay, rather than average delay, is more practical in real world scenario. In this paper, we introduce a new routing scheme that can guarantee the bounded delivery delay with a certain probability in random way models. We study the relationship between the probability of bounded delivery delay and the chosen nodes for forwarding. In our scheme, each message is labeled with an expected probability of bounded delivery delay. The fields of messages are updated each time message relay happens. The total number of nodes used for delivery depends on the delivery probability and delay. It is designed to provide bounded end-to-end delay with a certain probability compared with other bounded average delay schemes. The simulation results show that our novel scheme requires less resource than epidemic routing, while provides similar performance.
HOPS: A Prototypical Specification Tool for Interactive Systems
Authors: Anke Dittmar, Toralf Hübner, Peter Forbrig
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

This article suggests higher-order processes as a formal framework to model interactive systems and supplies a corresponding prototypical specifi cation tool (HOPS). Processes and their components reflect the recursive nature of interaction. Each component is an independent process itself. Though higher-level processes specify the interaction between their components they do not fully control them. HOPS offers a unified description of behavioral and structural aspects. Structured sets of sub-processes (e.g. hierarchies) serve to represent specific domains of interest within a process. Operations are the smallest units for analyzing and designing behavior. However, they can be unfolded to processes and vice versa. This supports an understanding of interactive systems as open and nonmonotonic systems. Their composition/ decomposition may exhibit unpredictable behavior. It is shown that the approach follows the interaction paradigm more closely than existing modeling approaches in HCI. Possible usage scenarios are given.
Spiral MRI Reconstruction Using Least Square Quantization Table
Authors: Dong Liang, Edmund Y. Lam, George S. Fung, Xin Zhang
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Recently, the authors introduced least square quantization table (LSQT) method to accelerate the direct Fourier transform to reconstruct magnetic resonance images acquired using a spiral trajectory. In this paper, we will discuss the LSQT further in its adaptability, reusability and choice of the number of groups. The experimental results show that the LSQT method has better adaptability for the different reconstruction cases than the equal phase line (EPL) and Kaiser-Bessel gridding methods. Additionally, it can be reused for reconstructing different images of varied sizes.
Programmers are from Mars, customers are from Venus: a practical guide for customers on XP projects
Authors: Angela Martin, James Noble, Robert Biddle
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

Extreme Programming and other Agile methods have a dedicated customer role that acts as the interface between development teams and their clients, sponsors, and end-users. The customer is critical to agile projects, but there is little research, experience, or advice about effective practices required to fill that role. We present a set of patterns describing the key roles on a customer team, and the practices that enable customers to fill those roles. By adopting these roles and practices, customers and development teams can increase the velocity and reliability of their projects, and ensure all participants in a project, not just the developers, can work at a sustainable pace.
Plenary lecture V: real-time in vivo and in situ cellular image processing and characterization: challenges and solutions
Authors: Lin Feng
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

We study the feasibility of 3D virtual histology through real-time in vivo and in situ cellular imaging. A prototype system has been developed based on photodynamic fluorescence signals, confocal endomicroscopy, and FPGA image processing and characterization computing. Experiments in its clinical applications have been conducted, mainly for diagnosis of early-stage mucous cancer. With the fine-grained parallel imaging programs mapped on the FPGA, a stream of focused optical sections of microstructures in the subsurface layers up to 300µm in depth, can be processed online and the extracted features can be visualized seamlessly with the endomicroscopy settings.
An Ontological and Non-monotonic Rule-Based Approach to Label Medical Images
Authors: M. Esposito
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Medical images can nowadays be automatically segmented but a semantic identification of their partsremains an open question. We think an approachbased on the integration of OWL ontologies and SWRLrules can be applied to model medical knowledge andto label medical images. Nevertheless, negation andnon-monotonic operators are not included in SWRLlanguage and so we can not express modeling exceptions, cope with a dynamically changing knowledge and make the closed-world assumption. As a result, we have extended SWRL language to express i) a weak form of Negation as Failure and ii) a nonmonotonic operator for statement removal. Besides, we have realized an ontology-based service that i) exploits and integrates ontologies and rules in a homogenous system, ii) performs both monotonic and nonmonotonic reasoning. Finally, as an application, we have used the Ontology Service to label the brain anatomical structures and to recognize the brain abnormalities due to polymicrogyria.
Development of HMM/Neural Network-Based Medium-Vocabulary Isolated-Word Lithuanian Speech Recognition System
Authors: Mark Filipovič, Antanas Lipeika
Venue: Informatica (2004)

The development of Lithuanian HMM/ANN speech recognition system, which combines artificial neural networks (ANNs) and hidden Markov models (HMMs), is described in this paper. A hybrid HMM/ANN architecture was applied in the system. In this architecture, a fully connected three-layer neural network (a multi-layer perceptron) is trained by conventional stochastic back-propagation algorithm to estimate the probability of 115 context-independent phonetic categories and during recognition it is used as a state output probability estimator. The hybrid HMM/ANN speech recognition system based on Mel Frequency Cepstral Coefficients (MFCC) was developed using CSLU Toolkit. The system was tested on the VDU isolated-word Lithuanian speech corpus and evaluated on a speaker-independent &sim;750 distinct isolated-word recognition task. The word recognition accuracy obtained was about 86.7&percnt;.
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Authors: Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, negative results are known. Paillier and Vergnaud [PV05] show that the forgeability of several discrete log based signatures cannot be equivalent to solving the discrete log problem in the standard model, assuming the so-called one-more discrete log assumption and algebraic reductions. They also show, under the same assumptions, that, any security reduction in the Random Oracle Model (ROM) from discrete log to forging a Schnorr signature must lose a factor of at least $\sqrt{q_h}$ in the success probability. Here q h is the number of queries the forger makes to the random oracle. The best known positive result, due to Pointcheval and Stern [PS00], also in the ROM, gives a reduction that loses a factor of q h . In this paper, we improve the negative result from [PV05]. In particular, we show that any algebraic reduction in the ROM from discrete log to forging a Schnorr signature must lose a factor of at least $q_h^{2/3}$, assuming the one-more discrete log assumption. We also hint at certain circumstances (by way of restrictions on the forger) under which this lower bound may be tight. These negative results indicate that huge loss factors may be inevitable in reductions from discrete log to discrete log based signatures.
Waterfront surveillance and trackability
Authors: Yi Li, Wei Hua, Chengen Guo, Haisong Gu, Jinman Kang, Xiangrong Chen
Venue: Machine Vision and Applications (2008)

This paper presents a method for waterfront surveillance system. Unlike traditional approaches that model dynamic water background explicitly, we choose a relaxed background model to extract multiple object hypotheses. The hypotheses are then tracked with probablistic framework. Finally, the hypotheses are classified as positive objects or negative objects based on their trackability. Trackability is described by the stableness and the consistency of their trajectories and their appearances, and the properties of their accumulated templates.
A Semantics for a Query Language over Sensors, Streams and Relations
Authors: Christian Y. Brenninkmeijer, Ixent Galpin, Alvaro A. Fernandes, Norman W. Paton
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

We introduce a query language over sensors, streams and relations and formally describe its semantics. Although the language was specifically designed for sensor network querying, where data is pulled into streams, the semantics contributed in the paper also encompasses the case in which data is pushed onto streams or else lies stored in classical relations. The approach taken is that continuous queries over streams are an extension of classical queries over stored extents. Apart from the fact that query evaluation over streams is reactive, or periodic, the main difference is the conception of windows as an additional collection type with the consequent use of type converter operations to and from streams and windows (which, as bounded collections of tuples, can be operated on in a relational-algebraic setting). The language and the semantics we provide for it advance on previous work in being more comprehensive with respect to the collection types allowed and in being more flexible as to the number and content of the windows contributing to the result at each evaluation event of a continuous query. The formalization advances on previous work in clarifying the implementation onus.
On Security Vulnerabilities of Null Data Frames in IEEE 802.11 Based WLANs
Authors: Wenjun Gu, Zhimin Yang, Can Que, Dong Xuan, Weijia Jia
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Null data frames are a special but important type of frames in IEEE 802.11 based Wireless Local Area Networks (e.g., 802.11 WLANs). They are widely used for power management, channel scanning and association keeping alive. The wide applications of null data frames come from their salient features such as lightweight frame format and implementation flexibility. However, such features can be taken advantage of by malicious attackers to launch a variety of attacks. In this paper, we identify the potential security vulnerabilities in the current applications of null data frames. We then study two types of attacks taking advantage of these vulnerabilities in detail, and evaluate their effectiveness based on extensive experiments. Finally, we point out that our work has broader impact in that similar vulnerabilities exist in many other networks.