ppxscal/embedding_network huggingface dataset:
Energy-Efficient Group Key Management Protocols for Hierarchical Sensor Networks
Authors: Biswajit Panja, Sanjay Madria, Bharat Bhargava
Venue: International Journal of Distributed Sensor Networks (2007)

In this paper, we describe a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as arguments. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of associated high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the nodes within a group (intra-cluster), and the other among a group of cluster heads (inter-cluster). The protocol handles freshness of the group key dynamically, and eliminates the involvement of a trusted third party (TTP). We have experimentally analyzed the time and energy consumption in broadcasting partial keys and the group key under two sensor routing protocols (Tiny-AODV and Tiny-Diffusion) by varying the number of nodes and key sizes. The performance study provides the optimum number of partial keys needed for computing the group key to balance the key size for security requirements and the power consumption. The experimental study also concludes that the energy consumption of SPIN [9] increases rapidly as the number of group members increases in comparison to our protocol. Similarly the pre-deployed key approach requires more communication time in comparison with this protocol. We have implemented this protocol using MICA2 motes and repeated most of the experiments which are done in simulation and we found out that the obtained results are very close to the observations made using the simulator.
A Versatile Arterial Training Simulator for Intra-arterial Devices
Authors: G. Pearce, A. Johnson, J. Wolsey, P. Brookfield, M. Burley, J. H. Patrick
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Simulators have been developed for the training of surgeons involving a plethora of surgical procedures. However, in many instances the simulators are large, require designated space and are relatively complex in their mode of operation. We have designed and implemented a versatile simulator that can be used for the training of surgeons to insert intra-arterial devices during operative vascular procedures.
On the security of a digital signature with message recovery using self-certified public key
Authors: Jianhong Zhang, Dan Chen, Yumin Wang
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Self-certified public keys are proposed to eliminate the burden of verifying the public key before using. To alleviate reliance on system authority and strengthen the security of system, Chang et al propose a new digital signature schemes, no redundancy is needed to be embedded in the signed messages in this scheme. Moreover, Chang et al claimed that the schemes are still secure even without the trustworthy system authority, and only the specified recipient can recover the message in his authentication encryption schemes. Unfortunately, In this work, we analyze the security of Chang et al scheme and show that if the system authority is trustless, the scheme is insecure, namely, the system authority can recover the message without the private key of the recipient in Chang' authentication encryption schemes. Finally, we propose an improve scheme to overcome the weakness of Chang et al scheme.
Development of Scheduler for Real Time and Embedded System Domain
Authors: M. V. Panduranga Rao, K. Chandrashekar Shet, R. Balakrishna, K. Roopa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We discuss scheduling techniques to be used for real-time, embedded systems. Though there are several scheduling policies, the preemptive scheduling policy holds promising results. In this research paper, the different approaches to design of a scheduler for real-time Linux kernel are discussed in detail. The comparison of different preemptive scheduling algorithms is performed. Hence, by extracting the positive characteristics of each of these preemptive scheduling policies, a new hierarchical scheduling policy is developed. The proposed hierarchical scheduling for real time and embedded system will be implemented for a prototype system, using C or C++ language. It is expected that the new scheduling algorithm will give better performance with respect to satisfy the needs, such as time, capturing and usage of resources of different applications.
Mathematics by Jannat
Authors: Jannat Jannat
Venue: Ubiquity (2008)

Arrgh!!! Well! If this is your reaction upon hearing the word MATH, you are not alone. You too are part of that ever increasing family which loves to hate it.
An intelligent-agent approach for congestion management in 3G networks
Authors: Soamsiri Chantaraskul, Laurie Cuthbert
Venue: Engineering Applications of Artificial Intelligence (2008)

The exploitation of wideband code division multiple access (W-CDMA) technology in third generation (3G) networks gives an inherent flexibility in managing the system capacity, although radio resource management (RRM), including congestion management, is more complicated. To guarantee the quality of service (QoS) provided to customers, the concept of a ''service level agreement'' (SLA) is introduced and these must be managed by the RRM. This work proposes the application of intelligent agents in SLA-based control in the RRM, essentially for congestion management and demonstrates the ability of intelligent agents to improve and maintain the QoS to meet the required SLA. A particularly novel aspect of this work is the use of learning (case-based reasoning-CBR) to predict the control strategies to be imposed. If there is no congestion, the network operates as provisioned, but, if congestion occurs, it is detected by the agent monitoring process and CBR will be used to provide a suitable policy either by recalling from experience or recalculating the solution from its knowledge. With this approach, the system performance will be monitored at all times and a suitable policy can be applied immediately as the system environment changes, resulting in the QoS being maintained.
Bottom-up context-sensitive algorithms for Bengali parser in natural language processing
Authors: Mohammadr Zaki Hossain Sarker, Shaila Rahman, M. A. Mottalib
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This paper embodies the design of parsing algorithms tangibly for a Bengali parser. To design parsing algorithms a detailed study on linguistics and grammar has been performed. A detailed study also has been made on the various techniques and algorithms of the parsers which have been designed for various languages such as English, Arabic, Hindi, Warlpiri(an Australian language) etc. Finally, Bengali sentences have been analyzed according to Chomskyan grammar. Bottom-up parsing technique and Context-sensitive rules have been used to design parsing algorithms. The designed parser can parse simple declarative sentences for all types of tense i.e., Present, Past, Future and Habitual past tense together with all types of person i.e., First, Second and Third person. The algorithms can maintain the agreement of Person + Class between Verb form and Subject which is available in Bengali sentences. Words are stored into the dictionary (lexicon) together with lexical categories. Using these algorithms it would be possible to parse the Bengali sentences to let the users know whether those sentences are syntactically correct or not.
Polysilicon micro beams buckling with temperature-dependent properties
Authors: M. Shamshirsaz, M. B. Asgari
Venue: Microsystem Technologies (2008)

The suspended electrothermal polysilicon micro beams generate displacements and forces by thermal buckling effects. In the previous electro-thermal and thermo-elastic models of suspended polysilicon micro beams, the thermo-mechanical properties of polysilicon have been considered constant over a wide rang of temperature (20&#x2013;900&#x00b0;C). In reality, the thermo-mechanical properties of polysilicon depend on temperature and change significantly at high temperatures. This paper describes the development and validation of theoretical and Finite element model (FEM) including the temperature dependencies of polysilicon properties such as thermal expansion coefficient and Young&#x2019;s modulus. In the theoretical models, two parts of elastic deflection model and thermal elastic model of micro beams buckling have been established and simulated. Also, temperature dependent buckling of polysilicon micro beam under high temperature has been modeled by Finite element analysis (FEA). Analytical results and numerical results using FEA are compared with experimental data available in literature. Their reasonable agreement validates analytical model and FEM. This validation indicates the importance of including temperature dependencies of polysilicon thermo-mechanical properties such as Coefficient of thermal expansion (CTE) in the previous models.
The effects of pair-programming on individual programming skill
Authors: Grant Braught, L. Martin Eby, Tim Wahls
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Previous studies have reported significant educational benefits from the use of pair-programming, in which two students program together at the same computer. Here, we report the results of a controlled study designed to measure the effects of pair-programming on the development of individual programming ability. Our findings indicate significant improvements in individual programming skill for students with lower SAT scores. Additionally, we found that all students are more likely to complete the course successfully when using pair-programming.
A theory for comparing the expressive power of access control models
Authors: Mahesh V. Tripunitara, Ninghui Li
Venue: Journal of Computer Security (2007)

We present a theory for comparing the expressive power of access control models. The theory is based on simulations that preserve security properties. We perceive access control systems as state-transition systems and present two kinds of simulations, reductions and state-matching reductions. In applying the theory, we highlight four new results and discuss these results in the context of other results that can be inferred or are known. One result indicates that the access matrix scheme due to Harrison, Ruzzo and Ullman is limited in its expressive power when compared with a trust-management scheme, thereby formally establishing a conjecture from the literature. A second result is that a particular RBAC (Role-Based Access Control) scheme, ARBAC97, may be limited in its expressive power, thereby countering claims in the literature that RBAC is more expressive than DAC (Discretionary Access Control). A third result demonstrates that the ability to check for the absence of rights (in addition to the presence of rights) can cause a scheme to be more expressive. A fourth result is that a trust-management scheme is at least as expressive as RBAC with a particular administrative scheme (the URA97 component of ARBAC97).
A New Digital Image Hiding Approach Using Multi-Image Fusion
Authors: Daqi Zhang, Shiru Qu, Baosheng Kang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Using the idea of digital image's information sharing, a new hiding approach for multi-image fusion based on NURBS curve is presented. The approach makes use of a k-order Non-Uniform Rational B-spline curve with weights to hide information of one image into information of n images. These hiding schemes have more fusion parameters to act as the private keys, which can enhance the security and robustness of the hiding image more. Actually, in the whole image sequence, only p+1 public images do work, so the influence on the recovering result can be decreased, which is caused by the pollution of various noises during public images' transmission. Examples show that these schemes can be realized expediently and have some degree of robustness. These hiding approaches can also be used in the field of digital watermarking and other digital application.
An Inter-Classes Obfuscation Method for Java Program
Authors: Xuesong Zhang, Fengling He, Wanli Zuo
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Software is a valuable form of data, representing significant intellectual property, and reverse engineering of software code by competitors may reveal important technological secrets. This problem becomes more serious when facing with the platform independent language—Java byte code. We introduce an inter-classes software obfuscation technique which extracts the codes of some methods in user-defined classes and embeds them into some other object’s methods in the object pool. Since all objects in the object pool are upcast to their common base type, which object’s method will really execute can only be ascertained at runtime. Thus, drastically obscured the program flow. Combined with some enhanced mechanisms, this technique can even resist to dynamic analysis to a certain extent. Experimental result shows that there is little influence to the execution efficiency.
Large scale evolutionary optimization using cooperative coevolution
Authors: Zhenyu Yang, Ke Tang, Xin Yao
Venue: Information Sciences: an International Journal (2008)

Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectiveness and advantages when applied to large and complex problems, e.g., those with high dimensions. Although cooperative coevolution has been proposed as a promising framework for tackling high-dimensional optimization problems, only limited studies were reported by decomposing a high-dimensional problem into single variables (dimensions). Such methods of decomposition often failed to solve nonseparable problems, for which tight interactions exist among different decision variables. In this paper, we propose a new cooperative coevolution framework that is capable of optimizing large scale nonseparable problems. A random grouping scheme and adaptive weighting are introduced in problem decomposition and coevolution. Instead of conventional evolutionary algorithms, a novel differential evolution algorithm is adopted. Theoretical analysis is presented in this paper to show why and how the new framework can be effective for optimizing large nonseparable problems. Extensive computational studies are also carried out to evaluate the performance of newly proposed algorithm on a large number of benchmark functions with up to 1000 dimensions. The results show clearly that our framework and algorithm are effective as well as efficient for large scale evolutionary optimisation problems. We are unaware of any other evolutionary algorithms that can optimize 1000-dimension nonseparable problems as effectively and efficiently as we have done.
Teach with Alice - and have fun!: pre-conference workshop
Authors: Phyllis Tedford
Venue: Journal of Computing Sciences in Colleges (2008)

Alice is an innovative 3-D programming environment used to create animated movies and interactive games or programs. It has been used successfully in over 200 colleges and universities around the country as a tool to teach introductory programming in an environment that is more engaging and less frustrating than traditional introductory courses. Studies have shown that using Alice can improve students' attitudes towards computer science and increase the retention rate and performance of students in computer science programs. This workshop introduces the Alice environment through creating several simple worlds. It also presents information related to the pedagogical aspects of using Alice in the classroom. No prior programming experience is required.
Generalized componentwise stability of non-stationary continuous-time systems with constrained control
Authors: H. Mejhed
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

A time varying control law is proposed for non-stationary linear continuous-time varying systems with non-symmetrical constrained control. Necessary and sufficient conditions for generalized componentwise asymptotic (exponential) stability are given by using the concept of mode-vectors. The asymptotic stability of the origin is also guaranteed. The case of symmetrical constrained control is obtained as a particular case.
Separating distribution-free and mistake-bound learning models over the Boolean domain
Authors: A. Blum
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Two of the most commonly used models in computational learning theory are the distribution-free model, in which examples are chosen from a fixed but arbitrary distribution, and the absolute mistake-bound model, in which examples are presented in order by an adversary. Over the Boolean domain
Towards an I/O tracing framework taxonomy
Authors: Andy Konwinski, John Bent, James Nunez, Meghan Quist
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

There is high demand for I/O tracing in High Performance Computing (HPC). It enables in-depth analysis of distributed applications and file system performance tuning. It also aids distributed application debugging. Finally, it facilitates collaboration within and between government, industrial, and academic institutions by enabling the generation of replayable I/O traces, which can be easily distributed and anonymized as necessary to protect confidential or sensitive information. As a response to this demand for tracing tools, various means of I/O trace generation exist. We first survey the I/O Tracing Framework landscape, exploring three popular such frameworks: LANL-Trace [3], Tracefs [1], and//TRACE [2]. We next develop an I/O Tracing Framework taxonomy. The purpose of this taxonomy is to assist I/O Tracing Framework users in formalizing their tracing requirements, and to provide the developers of I/O Tracing Frameworks a language to categorize the functionality and performance of them. The taxonomy categorizes I/O Tracing Framework features such as the type of data captured, trace replayability, and anonymization. The taxonomy also considers elapsed-time overhead and performance overhead. Finally, we provide a case study in the use of our new taxonomy, revisiting all three I/O Tracing Frameworks explored in our survey, to formally classify the features of each.
The Good and Not So Good of Enforcing Password Composition Rules
Authors: John Campbell, Dale Kleeman, Wanli Ma
Venue: Information Systems Security (2007)

Many systems rely on password composition rules to force users to choose more secure passwords. The findings discussed here are from a study on the enforcement of good password practice in the form of password composition rules. The results show that the enforcement of password composition rules does not discourage users from using meaningful information in passwords. While composition rules reduce password reuse, the overall incidence remains high. Passwords created under these conditions are also perceived to be more difficult to remember. Nevertheless, the enforcement of password composition rules does significantly improve protection against dictionary-based attack.
Biological sequence classification utilizing positive and unlabeled data
Authors: Yuanyuan Xiao, Mark R. Segal
Venue: Bioinformatics (2008)

Motivation: In the genomics setting, an increasingly common data configuration consists of a small set of sequences possessing a targeted property (positive instances) amongst a large set of sequences for which class membership is unknown (unlabeled instances). Traditional two-class classification methods do not effectively handle such data. Results: Here, we develop a novel method, likely positive-iterative classification (LP-IC) for this problem, and contrast its performance with the few existing methods, most of which were devised and utilized in the text classification context. LP-IC employs an iterative classification scheme and introduces a class dispersion measure, adopted from unsupervised clustering approaches, to monitor the model selection process. Using two case studies—prediction of HLA binding, and alternative splicing conservation between human and mouse—we show that LP-IC provides superior performance to existing methodologies in terms of: (i) combined accuracy and precision in positive identification from the unlabeled set; and (ii) predictive performance of the resultant classifiers on independent test data. Contact: mark@biostat.ucsf.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Open Source Pro: Joomla
Authors: Tim,  Jowers
Venue:  (2007)

Explore how Joomla! can help you. Joomla! reigns as the leading Open Source Content Management System in the world and "Open Source Pro: Joomla!" clearly reveals all Joomla! has to offer. Cover topics from building a complete website in a few hours to leveraging powerful add-in components. Customize the templates and styles for your website. Program your own module or component. Components are exposed for implementing Document Management, for Search Engine Optimization, for Discussion Forums, for creating web-based forms, for website statistics, for ecommerce/online storefronts, for Google AdSense integration, and for much, much more. Built-in functionality in Joomla! allows you to quickly publish articles as well as integrate with Google Adsense, integrate banner ads, quickly create menu links on your website, and do so much more. Joomla! gives enterprise class power without the enterprise-sized cost and effort. Make Joomla! work for you. Covers Joomla! 1.0.X and Joomla! 1.5, 2006 release.
Comparison of some tests of fit for the Laplace distribution
Authors: D. J. Best, J. C. W. Rayner, O. Thas
Venue: Computational Statistics Data Analysis (2008)

Tests for the Laplace distribution based on the sample skewness and kurtosis coefficients are shown to be related to components of smooth tests of goodness of fit and are compared with a number of tests including the Anderson-Darling test, a new data-driven smooth test, a new empirical characteristic function based test and a new maximum entropy test. This last would be our slight preference as the test of choice for testing for the Laplace distribution.
More than one tough chordal planar graphs are Hamiltonian
Authors: Thomas Böhme, Jochen Harant, Michal Tkáč
Venue: Journal of Graph Theory (1999)

We prove the result stated in the title. Furthermore, it is proved that for any &epsilon; > 0, there is a 1-tough chordal planar graph G&epsilon; such that the length of a longest cycle of G&epsilon; is less than &epsilon;|V(G&epsilon;)|. &copy; 1999 John Wiley Sons, Inc. J. Graph Theory 32: 405410, 1999
Simulation Studies on the Dynamics of Insulin-glucose in Diabetic Mellitus Patients
Authors: Laleh Kardar, Ali Fallah
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Glucose-insulin interaction in an insulin-dependent diabetic patient has been simulated using an overall model based on pharmacokinetic diagrams of insulin and glucose. Model is capable of predicting the blood glucose and insulin levels, total glucose uptake and the renal glucose excretion. The treatment strategy is based on a four-daily dose of regular insulin, which is applied through a subcutaneous route 30 min prior to each meal.