ppxscal/embedding_network huggingface dataset:
Node Selection Algorithm Optimized for Wireless Sensor Network
Authors: Hu Zhang, Huiyan Zhang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The selection of the network nodes and the optimization are very important aspects in wireless sensor networks. In this paper, we introduced briefly the basic principles of the algorithm first, and introduced the GB (Grid-Based) node choice algorithm amply. In succession, the performance for above algorithms was analyzed. Based on performance analysis, some optimizing strategies were put forward. Through relevant simulation experiments, it proved that the optimized algorithm is more accurate and efficiency, the above method would have a certain value ofapplication.
Detecting reliable gene interactions by a hierarchy of Bayesian network classifiers
Authors: Rubén Armañanzas, Iñaki Inza, Pedro Larrañaga
Venue: Computer Methods and Programs in Biomedicine (2008)

The main purpose of a gene interaction network is to map the relationships of the genes that are out of sight when a genomic study is tackled. DNA microarrays allow the measure of gene expression of thousands of genes at the same time. These data constitute the numeric seed for the induction of the gene networks. In this paper, we propose a new approach to build gene networks by means of Bayesian classifiers, variable selection and bootstrap resampling. The interactions induced by the Bayesian classifiers are based both on the expression levels and on the phenotype information of the supervised variable. Feature selection and bootstrap resampling add reliability and robustness to the overall process removing the false positive findings. The consensus among all the induced models produces a hierarchy of dependences and, thus, of variables. Biologists can define the depth level of the model hierarchy so the set of interactions and genes involved can vary from a sparse to a dense set. Experimental results show how these networks perform well on classification tasks. The biological validation matches previous biological findings and opens new hypothesis for future studies.
Shifted declustering: a placement-ideal layout scheme for multi-way replication storage architecture
Authors: Huijun Zhu, Peng Gu, Jun Wang
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Recent years have seen a growing interest in the deployment of sophisticated replication based storage architecture in data-intensive computing. Existing placement-ideal data layout solutions place an emphasis on declustered parity based storage. However, there exist major differences between parity and replication architectures, especially in data layouts. We retrofit the desirable properties of optimal parallelism in parity architectures for replication architectures, and propose a novel placement-ideal data layout ---- shifted declustering for replication based storage. Shifted declustering layout obtains optimal parallelism in a wide range of configurations, and obtains optimal high performance and load balancing in both fault-free and degraded modes. Our theoretical proofs and comprehensive simulation results show that shifted declustering is superiour in performance and load balancing to traditional replication layout schemes such as standard mirroring, chained declustering, group rotational declustering and existing parity layout schemes PRIME and RELPR in reference [4].
Smoothing method for minimizing the sum of the r largest functions
Authors: Shaohua Pan, Suyan He, Xingsi Li
Venue: Optimization Methods Software (2007)

Given a collection [image omitted]  of m functions defined on Ren, we consider the problem of minimizing the sum of the r largest functions of the collection. This problem has significant applications in the science of facility location. In this article, we reformulate this problem as a nonsmooth problem only involving the maximum function max{0, t} and then develop a globally convergent smoothing method for the case that all of gi (x) are convex functions. This method is specifically applied to the collection of Euclidean distance functions defined by location models. Our computational experiments and numerical comparisons with the successful SeDuMi software indicate that the method is very promising and is able to solve problems of dimension n up to 10,000 efficiently.
Error Correcting Sequence and Projective De Bruijn Graph
Authors: Mariko Hagita, Makoto Matsumoto, Fumio Natsu, Yuki Ohtsuka
Venue: Graphs and Combinatorics (2008)

Let X be a finite set of q elements, and n, K, d be integers. A subset C &#x2282; X n is an (n, K, d) error-correcting code, if #(C)&#x00a0;=&#x00a0;K and its minimum distance is d. We define an (n, K, d) error-correcting sequence over X as a periodic sequence {a i } i=0,1,... (a i &#x2208; X) with period K, such that the set of all consecutive n-tuples of this sequence form an (n, K, d) error-correcting code over X. Under a moderate conjecture on the existence of some type of primitive polynomials, we prove that there is a $$(\frac{q^m-1}{q-1}, q^{\frac{q^m-1}{q-1}-m}-1, 3)$$ error correcting sequence, such that its code-set is the q-ary Hamming code $$[\frac{q^m-1}{q-1}, \frac{q^m-1}{q-1}-m, 3]$$ with 0 removed, for q&#x00a0;>&#x00a0;2 being a prime power. For the case q&#x00a0;=&#x00a0;2, under a similar conjecture, we prove that there is a $$(2^m - 2, 2^{2^m-m-2}-1, 3)$$ error-correcting sequence, such that its code-set supplemented with 0 is the subset of the binary Hamming code [2 m &#x00a0;&#x2212;&#x00a0;1, 2 m &#x00a0;&#x2212;&#x00a0;1&#x00a0;&#x2212;&#x00a0;m, 3] obtained by requiring one specified coordinate being 0.
Security Engineering: A Guide to Building Dependable Distributed Systems, 2 edition
Authors: Ross J. Anderson
Venue:  (2008)

Gigantically comprehensive and carefully researched, Security Engineering makes it clear just how difficult it is to protect information systems from corruption, eavesdropping, unauthorized use, and general malice. Better, Ross Anderson offers a lot of thoughts on how information can be made more secure (though probably not absolutely secure, at least not forever) with the help of both technologies and management strategies. His work makes fascinating reading and will no doubt inspire considerable doubt--fear is probably a better choice of words--in anyone with information to gather, protect, or make decisions about. Be aware: This is absolutely not a book solely about computers, with yet another explanation of Alice and Bob and how they exchange public keys in order to exchange messages in secret. Anderson explores, for example, the ingenious ways in which European truck drivers defeat their vehicles' speed-logging equipment. In another section, he shows how the end of the cold war brought on a decline in defenses against radio-frequency monitoring (radio frequencies can be used to determine, at a distance, what's going on in systems--bank teller machines, say), and how similar technology can be used to reverse-engineer the calculations that go on inside smart cards. In almost 600 pages of riveting detail, Anderson warns us not to be seduced by the latest defensive technologies, never to underestimate human ingenuity, and always use common sense in defending valuables. A terrific read for security professionals and general readers alike. --David Wall Topics covered: How some people go about protecting valuable things (particularly, but not exclusively, information) and how other people go about getting it anyway. Mostly, this takes the form of essays (about, for example, how the U.S. Air Force keeps its nukes out of the wrong hands) and stories (one of which tells of an art thief who defeated the latest technology by hiding in a closet). Sections deal with technologies, policies, psychology, and legal matters.
Hierarchical learning strategy in semantic relation extraction
Authors: GuoDong Zhou, Min Zhang, DongHong Ji, QiaoMing Zhu
Venue: Information Processing and Management: an International Journal (2008)

This paper proposes a novel hierarchical learning strategy to deal with the data sparseness problem in semantic relation extraction by modeling the commonality among related classes. For each class in the hierarchy either manually predefined or automatically clustered, a discriminative function is determined in a top-down way. As the upper-level class normally has much more positive training examples than the lower-level class, the corresponding discriminative function can be determined more reliably and guide the discriminative function learning in the lower-level one more effectively, which otherwise might suffer from limited training data. In this paper, two classifier learning approaches, i.e. the simple perceptron algorithm and the state-of-the-art Support Vector Machines, are applied using the hierarchical learning strategy. Moreover, several kinds of class hierarchies either manually predefined or automatically clustered are explored and compared. Evaluation on the ACE RDC 2003 and 2004 corpora shows that the hierarchical learning strategy much improves the performance on least- and medium-frequent relations.
New soliton and periodic solutions for the fifth-order forms of the Lax and Sawada-Kotera equations
Authors: Abdul-Majid Wazwaz
Venue: International Journal of Computer Mathematics (2007)

We use the modified sine-cosine method and the modified sinh-cosh method to solve the fifth-order nonlinear forms of the Lax equation and the Sawada-Kotera (SK) equation. New soliton and perio-dic solutions are formally derived. The change in the parameters which drastically alters the characteristics of the equation is examined. The generalized Lax and SK equations are investigated to formally derive general solutions that are applicable to all non-zero real parameters.
Keeping narratives of a desktop to enhance continuity of on-going tasks
Authors: Youngjoo Park, Richard Furuta
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We describe a novel interface by which a user can browse, bookmark and retrieve previously used working environments, i.e., desktop status, enabling the retention of the history of use of various sets of information. Significant tasks often require reuse of (sets of) information that was used earlier. Particularly, if a task involves extended interaction, then the task's environment has been through a lot of changes and can get complex. Under the current prevailing desktop-based computing environment, after an interruption to the task users can gain little assistance to get back to the context that they previously worked on. A user thus encounters increased discontinuity in continuing extended tasks.
Fast frequency sweep technique in envelope finite element method with absorbing boundary condition
Authors: Milan Motl, Jaroslav Láčík, Zbynek Raida
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper, we apply the fast frequency sweep technique to the envelope finite element method. This hybridization is used in order to reduce computation time demands. Other advantage of this hybridization is, that it returns lower dispersion error compared to the envelope finite element method. The novel hybridization is used to analyze a two-dimensional model, and the accuracy is compared with the envelope finite element method.
Brief paper: Control of nonstationary LPV systems
Authors: Mazen Farhood, Geir E. Dullerud
Venue: Automatica (Journal of IFAC) (2008)

This paper considers control of nonstationary linear parameter-varying systems, and is motivated by interest in the control of nonlinear systems along prespecified trajectories. In the paper, synthesis conditions are derived for such systems using an operator theoretical framework with the @?"2 induced norm as the performance measure. These conditions are given in terms of structured operator inequalities. In general, evaluating the validity of these conditions is an infinite dimensional convex optimization problem; however, if the initial system is eventually periodic, they reduce to a finite dimensional semi-definite programming problem. The paper concludes with an in-depth example on the control of a two-thruster hovercraft along an eventually periodic trajectory.
Technical note: Validation of ENVISAT (SCIAMACHY) versus Dobson and TOMS atmospheric ozone measurements in Athens, Greece: Input for the upcoming IPY campaign
Authors: C. A. Varotsos, A. P. Cracknell
Venue: International Journal of Remote Sensing (2007)

The intercomparison of the daily column ozone observations obtained by the SCanning Imaging Absorption SpectroMeter for Atmospheric CHartographY (SCIAMACHY), the Total Ozone Mapping Spectrometer (TOMS), and Dobson spectrophotometer over Athens, Greece, during 2002-2006 is attempted here. The results presented will be employed for the validation of the SCIAMACHY instrument, which is flown on the European Space Agency's Environmental satellite (ENVISAT) and provides its daily column ozone observations to the International Polar Year 2007-2008 activity, since 1 March 2007.
Study on Scale Development of Boolean Medicine Data based on the GA and Improved k-NN Algorithm
Authors: Zhen-hua Wang, Zhong-sheng Hou, Ying Gao, Qiang Liu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The medicine data are Boolean ones in many situations, and the scale development based on them has not been solved soundly, especially the items weight problem. The methods combining GA and k-NN algorithm is often introduced to cope with the problem. But the present improved k-NN algorithm do not adapt to the weight determination of scale’s items. A new improve methods named the LO-DFWS-based k-NN algorithm is put forward and presented to reduce the heavy time cost problem of the traditional k-NN, especially for the Boolean data in the paper. The availability of it is demonstrated by the theoretical analysis of the time complexity. And actual data test confirms that the speed is advanced by 2-4 times. The results also show that the new algorithm has a good anti-nose property.
Efficient infrared emission from periodically patterned thin metal films on a Si photonic crystal
Authors: P. Theodoni, P. Bayiati, M. Chatzichristidi, Th. Speliotis, V. Em. Vamvakas, I. Raptis, N. Papanikolaou
Venue: Microelectronic Engineering (2008)

We have fabricated a periodic array of holes with diameters of a few microns on thin metal films on a Si substrate by using lithographic techniques, and demonstrate that the structures show extraordinary transmission in the infrared spectrum. Our structures become efficient narrow-band infrared thermal emitters when the hole pattern is transferred to the Si substrate by dry etching using the metal as a mask. The influence of the geometrical parameters, like the hole depth and diameter, on the emission spectra was considered in order to optimize the optical properties.
Lexical cohesion and term proximity in document ranking
Authors: Olga Vechtomova, Murat Karamuftuoglu
Venue: Information Processing and Management: an International Journal (2008)

We demonstrate effective new methods of document ranking based on lexical cohesive relationships between query terms. The proposed methods rely solely on the lexical relationships between original query terms, and do not involve query expansion or relevance feedback. Two types of lexical cohesive relationship information between query terms are used in document ranking: short-distance collocation relationship between query terms, and long-distance relationship, determined by the collocation of query terms with other words. The methods are evaluated on TREC corpora, and show improvements over baseline systems.
Protocol Family for Optimal and Deterministic Symmetric Key Assignment
Authors: Yi-Hua E. Yang, Joseph D. Touch
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Secure pairwise communications for a group of N nodes can require a large number of keys, O(N^{2}) in the worst case. This work proposes a two-part algorithm for large-scale symmetric key pre-distribution: a key assignment algorithm deterministically assigning O(\log_{2}N) keys to each node, and a key discovery algorithm requiring O(\log_{q}N) computations and inter-node messages to find the appropriate secure keys for a pair-wise communication. The lower bound of O(\log N) complexity is achieved by novel applications of the Maximum-Distance Separable (MDS) codes. Compare to previous works, our scheme is deterministic, efficient, and has good security properties against collusion. Using \left(n,k\right)_{q} Reed-Solomon codes as the MDS codes, we show by analysis that (1) in all practical cases, the lower bound of c\log_{2}N keys per node can be reached within 2 levels of recursions with a multiplicative constant c less than 8; (2) channel resilience against r-collusion is roughly 1-R^{d_{\min}}, with R=1-\left(1-1/q\right)^{2r} and d_{\min}=n-k+1.
Hierarchical routing over dynamic wireless networks
Authors: Dominique Tschopp, Suhas Diggavi, Matthias Grossglauser
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

In dynamic networks the topology evolves and routes are maintained by frequent updates, consuming throughput available for data transmission. We ask whether there exist low-overhead schemes for these networks, that produce routes that are within a small constant factor (stretch) of the optimal route-length. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks. For a class of models for wireless network that fulfill some mild conditions on the connectivity and on mobility over the time of interest, we can design distributed routing algorithm that maintain the routes over a changing topology. This scheme needs only node identities and integrates location service along with routing, therefore accounting for the complete overhead. We analyze the worst-case (conservative) overhead and route-quality (stretch) performance of this algorithm for the aforementioned class of models. Our algorithm allows constant stretch routing with a network wide control traffic overhead of O(n log2 n) bits per mobility time step (time-scale of topology change) translating to O(log2 n) overhead per node (with high probability for wireless networks with such mobility model). We can reduce the maximum overhead per node by using a load-balancing technique at the cost of a slightly higher average overhead. Numerics show that these bounds are quite conservative.
Mitigation of TCP-SYN Attacks with Microsoft's Windows XP Service Pack2 (SP2) Software
Authors: Sanjeev Kumar, Einar Petana
Venue: Proceedings of the Seventh International Conference on Networking (2008)

TCP-SYN attack is one of the commonly used DDoS attacks aimed at bringing down a computer system connected to Internet. There has been an increased targeting of Windows end-users and servers. The attackers and intruders are leveraging easily identifiable network blocks to target and exploit Windows end-user servers and computer systems. In order to provide some level of security and protection against security attacks, the Microsoft’s Windows XP operating systems were designed with an additional level of security. The initial Microsoft’s windows XP without service pack2 (SP2) provided windows firewall with some security features. The later version of Microsoft’s windows XP with SP2 intends to provide enhanced security features to prevent and mitigate the adverse effect of security attacks on the host computer systems. In this experimental paper, we set out to conduct real TCP-SYN attacks on computer systems in a controlled lab environment and measure the effectiveness of Microsoft’s windows XP without SP2, and with SP2 in preventing TCP-SYN attacks. The Windows firewall (without SP2) was found to be not effective against the TCP-SYN attacks. However, the later version of Microsoft’s Windows XP with SP2 was found to significantly help mitigate the adverse effect of the TCP SYN attacks on Windows based computer systems.
An initial exploration of the factors influencing retrieval of Web images in Greek queries
Authors: Fotis Lazarinis
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

A number of queries are submitted to the image searching mechanisms of Google, Yahoo and MSN and their results are analyzed. The analysis shows that queries which are in different forms (e.g. upper case and lower case) but have exactly the same content retrieve different images. The paper also presents a tool which takes as input a user query and based on knowledge of the linguistic characteristics of Greek produces different forms of this query. It then submits the new queries to Google and merges the recalled images.
Utilizing phrase based semantic information for term dependency
Authors: Yang Xu, Fan Ding, Bin Wang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Previous work on term dependency has not taken into account semantic information underlying query phrases. In this work, we study the impact of utilizing phrase based concepts for term dependency. We use Wikipedia to separate important and less important term dependencies, and treat them accordingly as features in a linear feature-based retrieval model. We compare our method with a Markov Random Field (MRF) model on four TREC document collections. Our experimental results show that utilizing phrase based concepts improves the retrieval effectiveness of term dependency, and reduces the size of the feature set to large extent.
Grounded evaluation of information visualizations
Authors: Petra Isenberg, Torre Zuk, Christopher Collins, Sheelagh Carpendale
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

We introduce grounded evaluation as a process that attempts to ensure that the evaluation of an information visualization tool is situated within the context of its intended use. We discuss the process and scope of grounded evaluation in general, and then describe how qualitative inquiry may be a beneficial approach as part of this process. We advocate for increased attention to the field of qualitative inquiry early in the information visualization development life cycle, as it tries to achieve a richer understanding by using a more holistic approach considering the interplay between factors that influence visualizations, their development, and their use. We present three case studies in which we successfully used observational techniques to inform our understanding of the visual analytics process in groups, medical diagnostic reasoning, and visualization use among computational linguists.
The complexity of temporal constraint satisfaction problems
Authors: Manuel Bodirsky, Jan Kara
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

A temporal constraint language is a set of relations that has a first-order definition in (b Q,