ppxscal/embedding_network huggingface dataset:
Mixing vector estimation in single channel blind source separation of angle modulated signal sources based on cumulant system of equations
Authors: Hao Cheng, Bin Tang, Jingjing Du, Xiaojun Chen, Gaoyi Zhang
Venue: Signal Processing (2009)

Unlike the traditional overdetermined or determined blind source separation (BSS), mixing matrix estimation and source recovery are not always coincident in underdetermined BSS. Aimed at the problem of single channel BSS, which is the extreme situation and most difficult case in underdetermined BSS, this paper proposes a mixing vector estimation algorithm for angle modulated signal sources based on a cumulant system of equations. The principle is that the mixing vector can be estimated by solving a cumulant system of equations derived from the probability density functions of the sources. This algorithm does not require specific information about the sources' modulation types or parameters and can be theoretically applied in conditions with any number of sources, even if their frequencies overlap. Experimental results show the estimation performance.
Communication and processing consideration for alerting systems implemented through mobile sensor networks
Authors: Dan Popescu, Radu Dobrescu, Maximilian Nicolae, Alexandru Iordan
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

At the beginning of the paper it is presented an alerting system architecture based on mobile sensor network. Then it is analyzed the current available radio communication infrastructure which can be used for implementation of alerting systems in conjunction with the alerting systems requirements. Further we shown how the digital signal processor (DSPs) are the best fit for the processing level. We propose some ideas of selection criterion based on this analyze and an implementation of a mobile sensor network with applicability in alerting systems. Built with the purpose of surveillance, data gathering and warning, alert systems could benefit from the increase flexibility offered by a mobile sensor network. In order to ensure a low cost and an extended battery life, for communication between nodes the ZigBee standard was chosen. For the prompt response of the system we design a software kernel with real time operation and implement on DSP architecture.
A semantics for context-oriented programming with layers
Authors: Dave Clarke, Ilya Sergey
Venue: International Workshop on Context-Oriented Programming (2009)

Context-oriented programming (COP) is a new programming approach whereby the context in which expressions evaluate can be adapted as a program runs. COP provides a degree of flexibility beyond object-oriented programming, while arguably retaining more modularity and structure than aspect-oriented programming. Although many languages exploring the context-oriented approach exist, to our knowledge no formal type-sound dynamic semantics of these languages exists. We address this shortcoming by providing a concise syntax-based formal semantics for context-oriented programming with layers, as witnessed by ContextL, ContextJ*, and other languages. Our language is based on Featherweight Java extended with layers and scoped layer activation and deactivation. As layers may introduce methods not appearing in classes, we also give a static type system that ensures that no program gets stuck (i.e., there exists a binding for each dispatched method call).
Binary alternatives to xml encoding
Authors: Nigel Thompson
Venue:  (2008)

XML has become widely adopted as a means of encoding hierarchical self-describing data both for storage and also for communication between systems. As the application of XML has broadened it has become apparent that it has some serious limitation especially when used to encode binary data. Various industry groups and researchers have examined ways to improve XML both generally and when used to encode binary information. This research examines binary encodings as alternatives to XML for both data storage and communications and shows that improvements in both encoded data size and CPU time are possible with no loss of information or ease of use. In every case tested, the binary protocol encodings performed much better than the XML protocol encoding. All of the binary implementations performed better than XML and they all performed better for every data type tested. The improvement in individual performance measurements vaned from about four times to more than a thousand times in one specific case. Of the three binary encodings tested, ASN.1 DER shows clear advantages over the other encodings and clearly offers an alternative to XML where encoded data size and CPU overhead are important especially when the data content is partially or exclusively binary. 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
Localization-oriented coverage based on Bayesian estimation in camera sensor networks
Authors: Liang Liu, Xi Zhang, Huadong Ma
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Target tracking and localization are important applications in camera sensor networks. Although coverage is a very important research topic in wireless sensor networks, and the coverage problem for target detection has been intensively studied, few considers the coverage problem from the perspective of target localization. In this paper, we investigate the coverage problem from the perspective of target localization for camera sensor networks. We first propose a novel localization-oriented sensing model based on the perspective projection of camera. Then, we propose a new notion of Localization-oriented coverage (L-coverage for short). We assume that all camera sensors make the measurements independent of other in the field, and these camera sensors can cooperate to make an accurate estimation for the location of the target. In addition, the relationships among L-coverage, 2-coverage, and the density of camera sensors are also discussed in this paper. The obtained results show that our model can be effectively deployed in many practical scenarios.
A Mobility-Prediction-Based Relay Deployment Framework for Conserving Power in MANETs
Authors: Aravindhan Venkateswaran, Venkatesh Sarangan, Thomas F. La Porta, Raj Acharya
Venue: IEEE Transactions on Mobile Computing (2009)

There has been a growing interest in designing mobile systems consisting of special relay nodes whose mobility can be controlled by the underlying network. In this paper, we consider the design of a heterogeneous mobile ad hoc network (MANET) consisting of two kinds of mobile nodes—traditional nodes with limited energy and a few controllable mobile relay nodes with relatively abundant energy resources. We propose a novel relay deployment framework that utilizes mobility prediction and works in tandem with the underlying MANET routing protocol to optimally define the movement of the relay nodes. We present two instances of the relay deployment problem, together with the solutions, to achieve different goals. Instance 1, termed Min-Total, aims to minimize the total energy consumed across all the traditional nodes during data transmission, while instance 2, termed Min-Max, aims to minimize the maximum energy consumed by a traditional node during data transmission. Our solutions also enable the prioritization of individual nodes in the network based on residual energy profiles and contextual significance. We perform an extensive simulation study to understand the trade-offs involved in deploying an increasing fraction of such relay nodes in the network. We also investigate the performance of the proposed framework under different mobility prediction schemes. Results indicate that even when the relay nodes constitute a small fraction of the total nodes in the network, the proposed framework results in significant energy savings. Further, we observed that while both the schemes have their potential advantages, the differences between the two optimization schemes are clearly highlighted in a sparse network.
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra
Authors: Kiavash Kianfar, Yahya Fathi
Venue: Mathematical Programming: Series A and B (2009)

We present a generalization of the mixed integer rounding (MIR) approach for generating valid inequalities for (mixed) integer programming (MIP) problems. For any positive integer n, we develop n facets for a certain (n&#x00a0;+&#x00a0;1)-dimensional single-constraint polyhedron in a sequential manner. We then show that for any n, the last of these facets (which we call the n-step MIR facet) can be used to generate a family of valid inequalities for the feasible set of a general (mixed) IP constraint, which we refer to as the n-step MIR inequalities. The Gomory Mixed Integer Cut and the 2-step MIR inequality of Dash and g&#x00fc;nl&#x00fc;k&#x00a0; (Math Program 105(1):29&#x2013;53, 2006) are the first two families corresponding to n&#x00a0;=&#x00a0;1,2, respectively. The n-step MIR inequalities are easily produced using periodic functions which we refer to as the n-step MIR functions. None of these functions dominates the other on its whole period. Finally, we prove that the n-step MIR inequalities generate two-slope facets for the infinite group polyhedra, and hence are potentially strong.
Kanban system and supermarket: experimental analysis and simulation2
Authors: R. DiMicco, E. Romano, I. C. Santillo
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The scope of this work is the complete re-organization of production flow according to the Lean Thinking philosophy for the industrial applications. The complete re-organization implementation of material flow management has been performed through the supermarket sizing for which the logic of the reintegration kanban has been adopted. Based upon the above considerations, a supermarket design activity was kicked off, taking advantage of the cooperation of Naples University and Six Sigma Department of Whirlpool Europe Naples Factory. The model of the Naples production Factory was fully developed in Arena SW environment. The model was developed having broadly discussed with Subject Matter Experts, Supervisors and Operators, in order to better reproduce the real process working nowadays. Following up the OpEx approach, based upon the ideas of Critical Thinking, Sequential Learning, Inference Space and Degree of Belief of the applicability of a specified process solution, we directed our investigation towards 3 main objectives: finding out the suitable size of the supermarket that could better serve the PULL production with all the relevant constraints of the current Factory available areas, validate the model that should represent the dynamics of the daily production, find out clues and indications about potential production issues, increasing the relevant level of knowledge and then create potential countermeasures, where the findings got from the investigation process match with engineering knowledge.
Personal information privacy protection in e-commerce
Authors: Norjihan Abdul Ghani, Zailani Mohamed Sidek
Venue: WSEAS Transactions on Information Science and Applications (2009)

Today, the world are moving towards e-commerce application in completing their daily jobs. An e-commerce application becomes the preferred medium to complete the day's tasks. Electronic commerce or e-commerce is a potentially growing business for today's market. Basically, online shopping eliminates conventional purchase approach which is labor-intensive and time-consuming. Through cyber space, order can be placed electronically and the product will be produced and shipped with the middleman. The potential for wide-ranging surveillance of all cyber activities presents a serious threat to information privacy. It gives more bad results in personal information privacy. In any e-commerce activities, all personal information should be controlled including their disclosure in order to protect its privacy. This paper discusses how personal information is used in e-commerce application and how it should be controlled.
Trace-based analysis of Wi-Fi scanning strategies
Authors: Hossein Falaki, Srinivasan Keshav
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2009)

The number of smartphones in use is overwhelmingly increasing every year. These devices rely on connectivity to the Internet for the majority of their applications. The everincreasing number of deployed 802.11 wireless access points and the relatively high cost of other data services make the case for opportunistic communication using free WiFi hotspots. However, this requires effective management of the WLAN interface, because by design the energy cost of WLAN scanning and interface idle operation is high and energy is a primary resource on mobile devices. We study several heuristic strategies for interface management, and use real-world user traces to evaluate and compare their performance against the optimal algorithm. Trace-based simulations show that simple static scanning with a suitable interval value is very effective for delay-tolerant, background applications.
Evaluation of bus based interconnect mechanisms in clustered VLIW architectures
Authors: Anup Gangwar, M. Balakrishnan, Preeti Ranjan Panda, Anshul Kumar
Venue: International Journal of Parallel Programming (2007)

With new sophisticated compiler technology, it is possible to schedule distant instructions efficiently. As a consequence, the amount of exploitable instruction level parallelism (ILP) in applications has gone up considerably. However, monolithic register file VLIW architectures present scalability problems due to a centralized register file which is far slower than the functional units (FU). Clustered VLIW architectures, with a subset of FUs connected to any RF provide an attractive solution to address this issue. Recent studies with a wide variety of inter-cluster interconnection mechanisms have reported substantial gains in performance (number of cycles) over the most studied RF-to-RF type interconnections. However, these studies have compared only one or two design points in the RF-to-RF interconnects design space. In this paper, we extend the previous reported work. We consider both multicycle and pipelined buses. To obtain realistic bus latencies, we synthesized the various architectures and calculated post-layout clock periods. The results demonstrate that while there is less that 10% variation in interconnect area, the bus based architectures are slower by as much as 400%. Also, neither multicycle or pipelined buses nor increasing the number of buses itself is able to achieve performance comparable to point-to-point type interconnects.
Multiple Mice based collaborative one-to-one learning
Authors: Cristián Infante, Pedro Hidalgo, Miguel Nussbaum, Rosa Alarcón, Andrés Gottlieb
Venue: Computers Education (2009)

Exchange is a collaborative learning application, originally developed for wirelessly interconnected Pocket PCs, that provides support for students and a teacher performing a face-to-face computer supported collaborative learning (CSCL) activity in a Single Input/Single Display (SISD) mode. We extend the application to support a single display groupware (SDG) mode. In this new version, named Exchange-MM, three users each with their own mouse (Multiple Mice) interact on a single display with mediation by a technological network. The original collaborative interaction is maintained. We describe a collaborative learning activity and the software architecture that supports both interaction modes, and also present a usability analysis of the activity conducted with second-grade schoolchildren. The results show that as in SISD mode, in SDG with Multiple Mice (MM) the technological network improves communication, negotiation, interactivity, coordination and appropriability between members of collaborative learning groups.
An implementation of argument based discussion
Authors: Patrizio Barbini, Yining Wu, Martin Caminada
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

With the current demonstrator, we present an implementation of formal argumentation that is not only able to evaluate an argument according to standard argumentation semantics, but is also able to engage in a discussion to defend its answer. This discussion is formal yet natural enough to be applicable in agent-to-agent as well as in agent-to-human settings.
A novel approach for missing data processing based on compounded PSO clustering
Authors: Hung-Pin Chiu, Tsen-Jen Wei, Hsiang-Yi Lee
Venue: WSEAS Transactions on Information Science and Applications (2009)

Incomplete and noisy data significantly distort data mining results. Therefore, taking care of missing values or noisy data becomes extremely crucial in data mining. Recent researches start to exploit data clustering techniques to estimate missing values. Obviously the quality of clustering analysis significantly influences the performance of missing data estimation. It was proven that clustering problem is NP-hard. Particle swarm optimization (PSO) is the recently suggested heuristic search process for solving data clustering problems. In this paper, a compounded PSO (CPSO) clustering approach is proposed for the missing value estimation. Normalization methods are first utilized to filter outliers and prevent some attributes from dominating the clustering result. Then the K-means algorithm and reflex mechanism are combined with the standard PSO clustering so that it can quickly converge to a reasonable good solution. Meanwhile, an iteration-based filling-in value scheme is utilized to guide the searching of CPSO clustering for the optimal estimate values. Effectiveness of the proposed approach is demonstrated on some data sets for four different rates of missing data. The empirical evaluation shows the superiority of CPSO over the well known K-means, PSO, and SOM-based approaches, and it is desirable for solving missing value problems.
A new delay test based on delay defect detection within slack intervals (DDSI)
Authors: Haihua Yan, Adit D. Singh
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

This paper presents a new technique for detecting delay faults by observing the fault effects within slack intervals. Delay faults are detected through a comparison of the circuit outputs captured in the scan flip-flops with those from a matched known good neighboring die on the wafer. These outputs are captured in the flip-flops at multiple capture intervals, each progressively shorter than the nominal switching delay for the logic block. Specially designed test chips were designed and tested to verify the applicability of the methodology. Simulation studies were also conducted to investigate the effectiveness of the technique. The results presented here clearly establish the significant potential of the proposed new delay testing approach.
Web user-session inference by means of clustering techniques
Authors: Andrea Bianco, Gianluca Mardente, Marco Mellia, Maurizio Munafò, Luca Muscariello
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

This paper focuses on the definition and identification of "Web user-sessions", aggregations of several TCP connections generated by the same source host. The identification of a user-session is non trivial. Traditional approaches rely on threshold based mechanisms. However, these techniques are very sensitive to the value chosen for the threshold, which may be difficult to set correctly. By applying clustering techniques, we define a novel methodology to identify Web user-sessions without requiring an a priori definition of threshold values. We define a clustering based approach, we discuss pros and cons of this approach, and we apply it to real traffic traces. The proposed methodology is applied to artificially generated traces to evaluate its benefits against traditional threshold based approaches. We also analyze the characteristics of user-sessions extracted by the clustering methodology from real traces and study their statistical properties. Web user-sessions tend to be Poisson, but correlation may arise during periods of network/hosts anomalous behavior.
IP Fast ReRoute: Lightweight Not-Via
Authors: Gábor Enyedi, Gábor Rétvári, Péter Szilágyi, András Császár
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

In order for IP to become a full-fledged carrier-grade transport technology, a native IP failure-recovery scheme is necessary that can correct failures in the order of milliseconds. IP Fast ReRoute (IPFRR) intends to fill this gap, providing fast, local and proactive handling of failures right in the IP layer. Building on experiences and extensive measurement results collected with a prototype implementation of the prevailing IPFRR technique, Not-via, in this paper we identify high address management burden and computational complexity as the major causes of why commercial IPFRR deployment still lags behind, and we present a lightweight Not-via scheme, which, according to our measurements, improves these issues.
On the Relationship between DNA Periodicity and Local Chromatin Structure
Authors: Sheila M. Reynolds, Jeff A. Bilmes, William Stafford Noble
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

DNA periodicity and its relationship to the formation of nucleosomes has been investigated extensively using autocorrelation and Fourier transform methods. We provide a precise treatment of the mathematical foundation for this type of analysis, and we apply the resulting method to quantify dinucleotide periodicity in several datasets. We begin by demonstrating, via simulation, the sensitivity of our method relative to previous methods. We then provide evidence of pervasive ~10 bp periodicity in S. cerevisiae, with stronger periodicity in sequences associated with positioned nucleosomes. In human, although repeat-masked sequences do not exhibit significant periodicity on average, we find that experimentally determined nucleosome positions show a periodicity of the AA dinucleotide similar to that found in S. cerevisiae. Furthermore, transcription start sites in the human genome are marked by a sharp drop in the 10 bp periodicity of the AA dinucleotide, while occupied CTCF sites are surrounded by a local increase.
Can punctuation marks be used as writer invariants? rough set-based approach to authorship attribution
Authors: Urszula Stanczyk, Krzysztof A. Cyran
Venue: Proceedings of the 2nd conference on European computing conference (2008)

Writer invariant is a stylometric notion corresponding to such unique characteristic that describes the writing style of a person, allowing for distinguishing texts authored by this person from all others and providing means for either discounting or confirming this person as the author of a text of unknown origin. It can be obtained in a variety of techniques usually belonging with either statistical analysis or machine learning methodologies and in this latter category there is included classical rough set theory and its elements. In the paper there is presented rough set-based approach to the problem of authorship attribution that falls within the scope of automated text categorisation.