ppxscal/embedding_network huggingface dataset:
Optimization of cellular radio network
Authors: Stanislav Hanus, Ludek Závodny
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

This paper deals with the cellular radio network optimization. It is based on the realized experiment focused on an optimizing the GSM900 network. Bounded area in a rural region with smooth terrain is considered. Dual-slope, two-ray model is used for radio signal propagation modelling. The assigning of radio cannels to base stations and their emitted radio power are optimized. The main contribution of the work lies in detailed analysis of the criterion of optimization. An interesting solution was created by a study of interference analysis and reduction for wireless systems, usable network capacity and of its overload capacity. Method of genetic algorithms is used for solving this problem. Experiment was made in the MatLab environment.
Online Dynamic Graph Drawing
Authors: Yaniv Frishman, Ayellet Tal
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.
Palette and Index Change Technique for Steganoraphy Based on an Indexcolor
Authors: Se-Min Kim, Gil-Je Lee, Kee-Young Yoo
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we propose a new steganographic technique, Palette and Index Change (PIC) for a graycolor image based on 8-bit indexcolor. PIC can hide 3-bits per pixel and has high PSNR. PIC modifies indexes and palette’s colors, and embeds secret data into a graycolor image. In our test, PIC had better quality than in previous schemes, and PIC can be also applied on BMP, GIF and PNG formats that can use an indexcolor since PIC is based on indexcolor.Specially, GIF is one of the most popular image formats,thus PIC is very suitable for the current environment of Internet Web.
Design and evaluation of a 3D video system based on H.264 view coding
Authors: Hari Kalva, Lakis Christodoulou, Liam M. Mayron, Oge Marques, Borko Furht
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Recent advances in video compression and 3D displays have necessitated a further understanding and development of 3D video coding algorithms. The emergence of low cost autostereoscopic displays is expected to drive the growth of 3DTV services. This paper discusses key issues that affect the quality of 3D video experience on autostereoscopic displays. The characteristics of the human visual system can be exploited to compress individual stereo views at different qualities without affecting the perceptual quality of the 3D video. The H.264/AVC video coding algorithm was used to compress each view. We examine the bounds of asymmetric stereo view compression and its relationship to eye-dominance based on a user study. This paper also presents the design and development of a modular video player with stereoscopic and multi-view capabilities including a discussion of useful tools for accelerating the development and enhancing flexibility. The experimental results indicate that eye-dominance influences 3D perception and as a result will impact the coding efficiency of 3D video.
Proceedings of the 13th international workshop on Early Aspects
Venue: International Conference on Software Engineering (2008)

It is our great pleasure to welcome you to the 13th Workshop on Early Aspects -- EA'08. This year's workshop continues its tradition of being the premier forum for identification, modularization, representation and composition of crosscutting concerns during the requirements engineering and architecture derivation activities. This edition of the workshop especially focuses on relating Early Aspects (EA) and Software Product Lines (SPL): it has a mission of stimulating the integration of the work on early development activities for product lines with the work for Early Aspects. The main topics covered by the accepted papers are Early Aspects for Product Lines Applications and New Research and Challenges of Early Aspects. The workshop is intended to be an interactive event, with a large part of the workshop time reserved for group discussions and overall conclusions on the issues raised during the presentations, as well as elicited by the paper reviewers and problems currently being tackled within the larger EA and SPL communities. In addition, the program includes a keynote speech by Daniel M. Berry titled In Requirements Engineering, Everything is an Aspect whereby the speaker invites the proponents and opponents of early aspects to ponder over the nature of aspects in requirements. Finally, the workshop will be concluded with a panel on What Early Aspects can do for Software Product Lines? We hope that the workshop will provide an opportunity for the participants to share ideas with other researchers and practitioners and stimulate further research in the EA and SPL areas, while these proceedings will serve as a valuable reference for both the EA and SPL researchers and developers.
Useful Computer Security
Authors: Elizabeth Churchill, Les Nelson, Diana K. Smetters
Venue: IEEE Internet Computing (2008)

Usability is a growing concern in designing systems and applications that operate securely. Most usability work has focused on improving user interfaces, but security is systemic, and negotiating, instituting, and maintaining real-world security procedures and practices is an organizational and social activity.
A New Probabilistic Approach in Rank Regression with Optimal Bayesian Partitioning
Authors: Carine Hue, Marc Boullé
Venue: The Journal of Machine Learning Research (2007)

In this paper, we consider the supervised learning task which consists in predicting the normalized rank of a numerical variable. We introduce a novel probabilistic approach to estimate the posterior distribution of the target rank conditionally to the predictors. We turn this learning task into a model selection problem. For that, we define a 2D partitioning family obtained by discretizing numerical variables and grouping categorical ones and we derive an analytical criterion to select the partition with the highest posterior probability. We show how these partitions can be used to build univariate predictors and multivariate ones under a naive Bayes assumption. We also propose a new evaluation criterion for probabilistic rank estimators. Based on the logarithmic score, we show that such criterion presents the advantage to be minored, which is not the case of the logarithmic score computed for probabilistic value estimator. A first set of experimentations on synthetic data shows the good properties of the proposed criterion and of our partitioning approach. A second set of experimentations on real data shows competitive performance of the univariate and selective naive Bayes rank estimators projected on the value range compared to methods submitted to a recent challenge on probabilistic metric regression tasks. Our approach is applicable for all regression problems with categorical or numerical predictors. It is particularly interesting for those with a high number of predictors as it automatically detects the variables which contain predictive information. It builds pertinent predictors of the normalized rank of the numerical target from one or several predictors. As the criteria selection is regularized by the presence of a prior and a posterior term, it does not suffer from overfitting.
SharC: checking data sharing strategies for multithreaded c
Authors: Zachary Anderson, David Gay, Rob Ennals, Eric Brewer
Venue: ACM SIGPLAN Notices (2008)

Unintended or unmediated data sharing is a frequent cause of insidious bugs in multithreaded programs. We present a tool called SharC (short for Sharing Checker) that allows a user to write lightweight annotations to declare how they believe objects are being shared between threads in their program. SharC uses a combination of static and dynamic analyses to check that the program conforms to this specification. SharC allows any type to have one of five "sharing modes" -- private to the current thread, read-only, shared under the control of a specified lock, intentionally racy, or checked dynamically. The dynamic mode uses run-time checking to verify that objects are either read-only, or only accessed by one thread. This allows us to check programs that would be difficult to check with a purely static system. If the user does not give a type an explicit annotation, then SharC uses a static type-qualifier analysis to infer that it is either private or should be checked dynamically. SharC allows objects to move between different sharing modes at runtime by using reference counting to check that there are no other references to the objects when they change mode. SharC's baseline dynamic analysis can check any C program, but is slow, and will generate false warnings about intentional data sharing. As the user adds more annotations, false warnings are reduced, and performance improves.We have found in practice that very few annotations are needed to describe all sharing and give reasonable performance. We ran SharC on 6 legacy C programs, summing to over 600k lines of code, and found that a total of only 60 simple annotations were needed to remove all false positives and to reduce performance overhead to only 2-14%.
A tele-immersion environment for traditional Japanese crafting system over the Japan Gigabit Network
Authors: Tomoyuki Ishida, Akihiro Miyakawa, Yoshitaka Shibata
Venue: International Journal of Web and Grid Services (2008)

In this paper, we propose a tele-immersion environment for the traditional Japanese crafting system, which uses a highly immersive system based on a Virtual Reality (VR) environment, such as multiple Cave Automatic Virtual Environment (CAVE) distributed at various places in Japan that are interconnected to each other over the ultra-high-speed network (Japan Gigabit Network 2). Using this system, the world of the traditional Japanese crafting environment could be expressed into an augmented virtuality environment that is an integration of cyberspace and the real world. Moreover, human sensibility, called Kansei in Japanese, is reflected in the tele-immersion environment to improve nonverbal communication capability for additional information and provide a new interactive communication capability for remote users such as end users by sharing a common virtual space. A prototype system of the traditional Japanese crafting system is constructed to evaluate the functionality and performance. As a result, the usefulness of our suggested system was verified through the evaluation.
Early, Easy, Inexpensive Diagnosis An Urgent Need for Global TB Control
Authors: Parul Chakrabarti
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

With two million deaths and twelve million new active cases per year and two billion people (one third of the world's population) harboring latent infection, tuberculosis (TB) is a global threat. A fundamental tenet for TB as with any infectious disease is early diagnosis and immediate treatment. For this, development of an early, easy and inexpensive diagnostic tool is a priority for resource-poor countries where the heart of the TB problem lies. Detecting antibodies to the Mycobacterium tuberculosis specific antigens in the body fluids (serodiagnosis) of a TB patient population of a specific region may provide a quick lead and of immense diagnostic potential.
Towards heterogeneous network convergence: policies and middleware architecture for efficient flow assignment, rate allocation and rate control for multimedia applications
Authors: Jatinder Pal Singh, Tansu Alpcan, Xiaoqing Zhu, Piyush Agrawal
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

The convergence in access networks brings forth the challenge of resource allocation for applications with varying utilities over networks with time-varying and heterogeneous characteristics. Owing to an ever increasing demand and popularity, multimedia applications have been a key driving force behind the efforts targeted towards architectures, industrial standards, and polices for convergence. Multimedia applications use protocols and transport dynamics that constrain the manner in which these applications can utilize access networks. In this work, we propose middleware architecture and policies that target optimal rate allocation for multimedia applications by monitoring and stochastically modeling the variation in characteristics of the access networks, using the utilities of the media application when known, and accounting for the constraints imposed by application specific transport mechanisms. The proposed measures leverage our optimal rate allocation, rate control, and interface assignment techniques [17, 6, 24] to achieve enhanced multimedia performance and efficient utilization of the access networks.
Dynamic surface control approach to adaptive robust control of nonlinear systems in semi-strict feedback form
Authors: Zi-Jiang Yang, Toshimasa Nagai, Shunshoku Kanae, Kiyoshi Wada
Venue: International Journal of Systems Science (2007)

This article considers the adaptive robust control of a class of single-input-single-output nonlinear systems in semi-strict feedback form using radial basis function (RBF) networks. It is well known that the standard backstepping design may suffer from "explosion of terms". To overcome this problem, the recently developed dynamic surface control technique which employs a first-order low-pass filter at each step of the backstepping design procedure is generalized to the nonlinear system under study. Our attention is paid to achieve guaranteed transient performance of the adaptive controller. At each step of design, a feedback controller strengthened by nonlinear damping terms to counteract nonlinear uncertainties is designed to guarantee input-to-state practical stability of the corresponding subsystem, and then parameter adaptations are introduced to reduce the ultimate error bound. Furthermore, for the output trajectory tracking problem, it is recommended to adopt the partial adaptation policy to reduce the computational burden due to "curse of dimension" of the RBF networks. Finally, numerical examples are included to verify the results of theoretical analysis.
A framework for energy consumption based design space exploration for wireless sensor nodes
Authors: Sonali Chouhan, M. Balakrishnan, Ranjan Bose
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In wireless sensor networks due to the small transmission distances involved, the computation energy along with the radio energy determines the battery life. Energy consumption of error control codes (ECCs) is a complex function of the energy consumption in computing encoding-decoding, transmitting "redundant" bits and energy saved by coding gain. This paper presents a methodology, which integrates computation and radio energy for searching an energy optimal ECC. Based on this methodology, a design space exploration framework and the energy model of sensor node have been developed. Exploration results show that the energy optimal ECC saves 15-58% node energy for given parameters.
Collapse of non-commutative fuzzy interval logics into point fuzzy logics caused by residuation constraints
Authors: Ladislav J. Kohout, Eunjin Kim
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

This paper continues investigation of systems of fuzzy interval logics based on the Checklist Paradigm semantics of Bandler and Kohout [5] [12]. While the early papers dealt with checklist paradigm based interval systems containing commutative AND and OR, this paper is the third in the series describing the system in which these connective types are non-commutative. While the commutative systems can be sufficiently characterized by an 8-element group of transformations, the non-commutative require the symmetric 16 element group S2×2×2×2. The paper starts with the overview of a non-commutative interval system generated from implication operators based on a measure m2 of Bandler and Kohout by the group transformations provided by the group S2×2×2×2. This system includes the well-known Goguen-Gaines implication operator (PLY) which is not contrapositive. Non-contrapositivity of PLY induces non-commutativity of AND and OR connectives under the group transformations. In this interval system, the non-commutative AND connectives residuate with implication operators only by one-sided residuation, either from the left or from the right. Putting the additional constraint, requiring the residuation both-ways, causes the collapse of an interval system into a point system of fuzzy logic. This collapse is investigated in some detail.
The Lagrange method for the regularization of discrete ill-posed problems
Authors: G. Landi
Venue: Computational Optimization and Applications (2008)

In many science and engineering applications, the discretization of linear ill-posed problems gives rise to large ill-conditioned linear systems with the right-hand side degraded by noise. The solution of such linear systems requires the solution of minimization problems with one quadratic constraint, depending on an estimate of the variance of the noise. This strategy is known as regularization. In this work, we propose a modification of the Lagrange method for the solution of the noise constrained regularization problem. We present the numerical results of test problems, image restoration and medical imaging denoising. Our results indicate that the proposed Lagrange method is effective and efficient in computing good regularized solutions of ill-conditioned linear systems and in computing the corresponding Lagrange multipliers. Moreover, our numerical experiments show that the Lagrange method is computationally convenient. Therefore, the Lagrange method is a promising approach for dealing with ill-posed problems.
Environmental impact studies of chrome rollers used by cotton roller ginning industries and design and development of pollution free chrome less RCF rollers
Authors: Gurumurthy Vijayan Iyer, Nikos E. Mastorakis
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

This paper discusses the pollution caused by Chrome Composite Leather-Clad (CCLC) rollers commonly used in cotton roller ginning industries and suggests an alternative roller material. The CCLC rollers contain about 18000 to 36000 mg/kg (ppm) total chromium of trivalent and hexavalent forms which are toxic and carcinogenic to human health. When the seed-cotton is processed in Double Roller (DR) ginning machines, the lint is contaminated with chromium of about 140 to 1990 ppm as against the safety limits of 0.1 ppm. During the ginning process due to persistent rubbing of leather over stationary knife, chromium particles are carried into the lint such that the spun yarns and cotton by-products contain about 100 to 200 ppm, which according to world environmental standards should not be more than 0.1 ppm. Gin and mill workers are directly exposed to this carcinogenic substance. To offset this problem, pollution-free Rubberized Cotton Fabric (RCF) rollers have been fabricated, used and experimented in roller gins. RCF roller covering is made of multiple layers of fabrics bonded together using white rubber compounding which has a surface finish conducive to high ginning efficiency. This nullifies chromium contamination and pollution during the ginning process. On the basis of the design and development of various rollers with subsequent performance evaluation studies, pollution-free RCF washers/ rollers have been demonstrated with reference to techno-commercial and eco-friendliness in ginneries.
Content-based image retrieval using wavelets
Authors: L. Flores-Pulido, O. Starostenko, D. Flores-Quéchol, J. I. Rodrigues-Flores, Ingrid Kirschning, J. A. Chávez-Aragón
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This paper presents a novel approach for content-based image retrieval (CBIR) that provides the analysis of visual information using wavelet coefficients and similarity metrics. This approach has a better performance than well-known RedNew CBIR system based on image indexing and retrieval using neural networks. A principal goal of this report is precise analysis of the four families of wavelets and three techniques for computing similarity. The best Symlet transform and similarity metrics based on Euclidian distance have been adopted in a proposed system called Image Retrieval by Wavelet Coefficients IRWC. In order to test a proposed system the recall and precision metrics used for evaluating the performance of CBIR facilities have been used on base of the standard COIL-100 image collections. The obtained results show the increment of retrieval efficiency up to 92% without additional increasing a processing time. Therefore a proposed approach may be considered as a good alternative for design of new CBIR systems.
Mining software repositories for comprehensible software fault prediction models
Authors: Olivier Vandecruys, David Martens, Bart Baesens, Christophe Mues, Manu De Backer, Raf Haesen
Venue: Journal of Systems and Software (2008)

Software managers are routinely confronted with software projects that contain errors or inconsistencies and exceed budget and time limits. By mining software repositories with comprehensible data mining techniques, predictive models can be induced that offer software managers the insights they need to tackle these quality and budgeting problems in an efficient way. This paper deals with the role that the Ant Colony Optimization (ACO)-based classification technique AntMiner+ can play as a comprehensible data mining technique to predict erroneous software modules. In an empirical comparison on three real-world public datasets, the rule-based models produced by AntMiner+ are shown to achieve a predictive accuracy that is competitive to that of the models induced by several other included classification techniques, such as C4.5, logistic regression and support vector machines. In addition, we will argue that the intuitiveness and comprehensibility of the AntMiner+ models can be considered superior to the latter models.