ppxscal/embedding_network huggingface dataset:
On content-driven search-keyword suggesters for literature digital libraries
Authors: Sulieman A. Bani-Ahmad, Gultekin Ozsoyoglu
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We propose and evaluate a "content-driven search keyword suggester" for keyword-based search in literature digital libraries. Suggesting search keywords at an early stage, i.e., while the user is entering search terms, is helpful for constructing more accurate, less ambiguous, and focused search keywords for queries. Our search keyword suggestion approach is based on an a priori analysis of the publication collection in the digital library at hand, and consists of the following steps. We (i) parse the document collection using the Link Grammar parser, a syntactic parser of English, (ii) group publications based on their "most-specific" research topics, (iii) use the parser output to build a hierarchical structure of simple and compound tokens to be used to suggest search terms, (iv) use TextRank, a text summarization tool, to assign topic-sensitive scores to keywords, and (v) use the identified research-topics to help user aggregate search keywords prior to the actual search query execution. We experimentally show that the proposed framework, which is optimized to work on literature digital libraries, promises a more scalable, high quality, and user-friendly search-keyword suggester when compared to its competitors. We validate our proposal experimentally using a subset of the ACM SIGMOD Anthology digital library as a testbed, and by employing the research-pyramid model to identify the "most-specific" research topics.
Performance based unit loading optimization using particle swarm optimization approach
Authors: Lily D. Li, Jiping Zhou, Yinghuo Yu
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper presents a Particle Swarm Optimization (PSO) based approach for economically dispatching generation load among different generators based on the unit performance. A modified PSO algorithm with preserving feasibility and repairing infeasibility strategies is adopted for handling constraints. A four-unit loading optimization for an Australian power plant is successfully implemented by using the modified PSO algorithm. The result reveals the capability, effectiveness and efficiency of using evolutionary algorithms such as PSO in solving significant industrial problems in the power industry.
A Novel Network Mobility Scheme Using SIP and SCTP for Multimedia Applications
Authors: Fang-Yie Leu, Zhen-Jia Ko
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Wireless networks of future generation are envisioned to be a combination of diverse but complementary access technologies that can give us a convenient wireless environment to access abundance of network resources so as to facilitate and enrich our everyday life. In such environment, seamless mobility support is the basis of providing uninterrupted wireless services to mobile users who roam between or among various wireless access networks. When users are now in a moving transportation carriage, e.g. a train that provides network service, the carriage can be regarded as a network which comprises a set of users and moves from one location to another. Network mobility protocol based on Mobile IPv6 has some fundamental problems, such as header overhead and pinball problem. In this paper, we propose a novel method based on SIP and SCTP for network mobility to solve the MIPv6-NEMO problems. Experimental validation and performance evaluation are also performed.
Parameter Estimation for MIMO Systems with Multiple Frequency Offsets
Authors: Wei Dong, Jiandong Li, Zhuo Lu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

This paper addresses the problem of frequency offsets and channel gains estimation for MIMO system in flat-fading channels. Based on the MUSIC (Multiple Signal Classification) and the ML (maximum likelihood) methods, a new joint estimation algorithm of frequency offsets and channel gains is proposed. The new algorithm has three steps. A subset of frequency offsets is first estimated by the MUSIC algorithm. Then all frequency offsets in the subset are identified by the ML method. Finally channel gains are estimated by the ML estimator. The algorithm is a one-dimensional search scheme and therefore greatly decreases the complexity of the joint ML estimation, which is essentially a multi-dimensional search scheme. The performance of this algorithm is evaluated by Monte Carlo simulations.
Studying the Evolution of Codon Context in Conserved Gene Sequences
Authors: Miguel Pinheiro, José L. Oliveira, Gabriela R. Moura, Manuel A. S. Santos
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Several studies demonstrate that the codon context is an important characteristic in gene primary structure that modulates the translation of mRNA. To better understand these features we developed a software package that uses sequences of Open Reading Frames (ORFs) available in public databases and applies several statistic and visualization methodologies to unveil codon–context patterns, codon usage and others features. In this paper we describe a new method to study the evolution of codon contexts in conserved sequences between species. For this, we associate the codon-context statistic significance with BLASTP and ClustalW metrics. With these results it is possible to reveal important rules in the evolution of codon-pair context.
A Method to Test Component Off-the-Shelf (COTS) Used in Safety Critical Systems
Authors: Hassan Reza, Steve Buettner, Varun Krishna
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper we discuss a method to test Component Off-The-Shelf (COTS) using a hybrid approach based on software fault tree analysis and UML communication diagram. UML communication diagrams can be used to show message passing among components. It can also be used for integration testing. Software fault tree analysis is safely analysis techniques that can be used for modeling safety and dependability aspects of safety critical systems. A simple example is used to show the feasibility of our proposed method.
Analysis of variance for fuzzy data
Authors: Hsien-Chung Wu
Venue: International Journal of Systems Science (2007)

The method for imposing imprecise (fuzzy) data upon the traditional ANOVA model is proposed in this article. We transact the h-level sets of fuzzy data for the sake of invoking traditional method of ANOVA for real-valued data. We propose the decision rules that are used to accept or reject the null and alternative hypotheses with the notions of pessimistic degree and optimistic degree by solving optimization problems. Finally, we provide a computational procedure and an example to clarify the discussions in this article.
High aspect ratio micro/nano machining with proton beam writing on aqueous developable - easily stripped negative chemically-amplified resists
Authors: M. Chatzichristidi, E. Valamontes, P. Argitis, I. Raptis, J. A. van Kan, F. Zhang, F. Watt
Venue: Microelectronic Engineering (2008)

Proton beam writing (PBW) is a new direct-writing process that uses a focused beam of MeV protons to pattern resist material at nano dimensions. PBW has the unique ability to maintain a straight path through 50@mm thick resist films, and is suitable for high aspect ratio micro(nano)-machining. TADEP resist is a new promising high aspect ratio chemically-amplified resist that can be developed in aqueous base developer and has the capability of stripping in conventional stripping schemes. By employing PBW on TADEP resist patterns with 280nm linewidth and a thickness of 12@mm have been resolved showing an aspect ratio of 42. Following Ni electroplating of the TADEP features, Ni structures of height 0.8@mm and spacing of 167nm, produced in 2@mm thick TADEP, were demonstrated indicating the easy stripping characteristics of the TADEP resist.
Cooperative body–brain coevolutionary synthesis of mechatronic systems
Authors: Jiachuan Wang, Zhun Fan, Janis p. Terpenny, Erik d. Goodman
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2008)

To support the concurrent design processes of mechatronic subsystems, unified mechatronics modeling and cooperative body–brain coevolutionary synthesis are developed. In this paper, both body-passive physical systems and brain-active control systems can be represented using the bond graph paradigm. Bond graphs are combined with genetic programming to evolve low-level building blocks into systems with high-level functionalities including both topological configurations and parameter settings. Design spaces of coadapted mechatronic subsystems are automatically explored in parallel for overall design optimality. A quarter-car suspension system case study is provided. Compared with conventional design methods, semiactive suspension designs with more creativity and flexibility are achieved through this approach.
Measurement of demolding forces in full wafer thermal nanoimprint
Authors: Vera Trabadelo, Helmut Schift, Santos Merino, Sandro Bellini, Jens Gobrecht
Venue: Microelectronic Engineering (2008)

The Jenoptik HEX03 embossing machine has been used in a slightly modified setup to measure the demolding forces online. We optimized the demolding setup to be able to compare ideal demolding processes with a range of process parameters, i.e. pattern design, structure depth and demolding temperature. The demolding force can be deduced from discontinuities of the force recording; these discontinuities, seen as characteristic ''kinks'' in the force curve, stem from a sudden release of the stamp from the polymer and the subsequent relaxation of the press column. In this research, we demonstrate that these forces are actual demolding forces.
A comment on the completion of fuzzy metric spaces
Authors: Osmo Kaleva
Venue: Fuzzy Sets and Systems (2008)

We argue that in some recent papers discussing the completion of fuzzy metric and fuzzy normed spaces proper credit is not given to earlier works on the subject.
Protein Structure Comparison and Alignment Using Residue Contexts
Authors: Tobias Sayre, Rahul Singh
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We introduce a method for comparing protein structures using the notion of residue contexts based on protein Cα-atom backbones. The residue context is derived from the set of vectors from a given Cα-atom to each other Cα-atom in the molecule. A three-dimensional histogram is generated from these vectors, containing a relative distribution of the other Cα-atoms for each Cα-atom on the backbone for a protein. Histograms are compared using the χ2 test, resulting in the cost for matching any two given Cα-atoms in a pair of protein molecules. An optimal alignment is made using the Smith-Waterman algorithm, and a score is calculated based on the length of the alignment and the RMSD, yielding a best alignment that can be displayed in an interactive user interface. Resulting alignments are compared with alignments generated by CTSS, DALI, and CE, yielding different aligned protein regions.
Enabling Deliberate Design for Energy Management in Pervasive Systems
Authors: Angela Dalton, Carla Ellis, Christine Julien
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper argues for explicit consideration of datafidelity during development of context-aware systems. Increasingthe amount of data captured, stored, and distributed does notalways translate into into increased fidelity, and we can leveragethis to avoid unnecessary energy overhead and increase devicebattery life. We introduce Context-Awareness Fidelity Expression(CAFE) as a framework for deliberately specifying applicationdata fidelity adaptation with the aim of using context-awarenessto reduce energy consumption.
A generic multi-robot coordination strategic layer
Authors: João Certo, Nuno Lau, Luis P. Reis
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Managing a team of heterogeneous robots in a dynamic environment poses a challenging job. In this paper a model for a multi-purpose, real-time, adaptable, strategical coordination layer is presented. Based on previous work developed for the RoboCup Soccer simulation, small-size, middle-size and legged leagues, a generic coordination model was built. As both centralized and distributed environment are handled by the layer, communication was an important factor to consider only introducing a minor overhead. A multi-level hierarchical approach was followed with hybrid methods used to switch between concepts. The model was tested with two strategy instances, RoboCup Rescue Simulation and RoboCup Soccer. Strategies are designed with the help of a graphical tool. Results achieved by the team in RoboCup Rescue and Soccer Simulation competitions demonstrate the usefulness of this approach.
Improved Bounds on the Feedfoward Design of Optical Multiplexers
Authors: Xiaoliang Wang, Xiaohong Jiang, Susumu Horiguchi
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

We focus on the non-conflicting design of a multistage feedforward network with optical bufferless Switch and fiber Delay Lines (SDL) to emulate an N-to-1 output buffered multiplexer supporting variable length bursts. Y. T. Chen et al. [3] presented a sufficient condition (a bound) to guarantee the non-conflicting and FIFO properties in such a design. In this paper, we first point out the upper bound in [3] can not rise infinitely with the increase of the maximum burst length. Then, we develop a framework to construct a case which can be used to achieve a lower bound. Through simulation and performance comparison, we find the new bounds can significantly decrease the hardware cost for constructing such a feedforward SDL multiplexer while still providing the same performance guarantee as that of the old one.
Protein sequence analysis using relational soft clustering algorithms
Authors: Pradipta Maji, Sankar K. Pal
Venue: International Journal of Computer Mathematics (2007)

To recognize functional sites within a protein sequence, the non-numerical attributes of the sequence need encoding prior to using a pattern recognition algorithm. The success of recognition depends on the efficient coding of the biological information contained in the sequence. In this regard, a bio-basis function maps a non-numerical sequence space to a numerical feature space, based on an amino acid mutation matrix. In effect, the biological content in a sequence can be maximally utilized for analysis. One of the important issues for the bio-basis function is how to select a minimum set of bio-bases with maximum information. In this paper, we present two relational soft clustering algorithms, named rough c-medoids and fuzzy-possibilistic c-medoids, to select the most informative bio-bases. While both fuzzy and possibilistic memberships of fuzzy-possibilistic c-medoids avoid the noise sensitivity defect of fuzzy c-medoids and the coincident clusters problem of possibilistic c-medoids, the concept of lower and upper boundaries of rough c-medoids deals with uncertainty, vagueness, and incompleteness in class definition of biological data. The concept of 'degree of resemblance', based on non-gapped pairwise homology alignment score, circumvents the initialization and local minima problems of both c-medoids algorithms. In effect, it enables efficient selection of a minimum set of most informative bio-bases. The effectiveness of the algorithms, along with a comparison with other algorithms, has been demonstrated on HIV (human immunodeficiency virus) protein datasets.
A Six Sigma Support Information System: Process Improvement at a Thai University
Authors: Jaruek Chookittikul, Supphachai Busarathit, Wajee Chookittikul
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper describes the first project at Phetchburi Rajabhat University, Thailand to use Six Sigma DMAIC and SIPOC to improve and control the quality of their graduates. The paper also reports on an information system designed to fulfill the needs of all users, ensuring that process changes identified in this project were successfully implemented and well accepted. The way in which this system encourages students, faculty, staff, and administrators within the School to practice the new, improved processes as automatically as possible is discussed. The initial results from this project, which are very positive, are described.
Low complexity concealment of H.264/AVC encoded video for DVB-H devices
Authors: S. Spinsante, E. Gambi, D. Falcone, S. Morichetti
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

The DVB-H standard allows broadcasting of audio and video content to mobile terminals that have to face strict requirements concerning computational load and power consumption. Given the already intensive effort required by the decoding of the H.264/AVC video data stream, it is important to implement low complexity strategies for the concealment of the data losses. They are likely to happen, given the error prone nature of the wireless environment. The aim is to provide an acceptable video quality to the final user, without strongly affecting the resources available to the mobile device.
A Novel Derivation Framework For Definite Logic Program
Authors: MengJun Li, ZhouJun Li, HuoWang Chen, Ti Zhou
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Is a closed atom derivable from a definite logic progam? This derivation problem is undecidable. Focused on this problem there exist two categories approaches: the accurate approach that does not guarantee termination, and the terminated abstract approaches. Both approaches have its advantages and disadvantages. We present a novel derivation framework for the definite logic program. A dynamic approach to characterizing termination of fixpoint is presented, then which is used to approximately predict termination of fixpoint in advance. If the fixpoint is predicted termination, we use the non-terminational approach to the derivation problem, otherwise,the terminated abstract approach is used. With this termination predicting approach, we combine the non-termination accurate approaches and the termination abstract approaches together for solving the derivation problem more efficiently. And the experiment results demonstrates the effectiveness of our approach.
Towards breaking the quality curse.: a web-querying approach to web people search.
Authors: Dmitri V. Kalashnikov, Rabia Nuray-Turan, Sharad Mehrotra
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain documents related to several distinct namesakes who have the queried name. The task of disambiguating and finding the webpages related to the specific person of interest is left to the user. Many Web People Search (WePS) approaches have been developed recently that attempt to automate this disambiguation process. Nevertheless, the disambiguation quality of these techniques leaves a major room for improvement. This paper presents a new server-side WePS approach. It is based on collecting co-occurrence information from theWeb and thus it uses theWeb as an external data source. A skyline-based classification technique is developed for classifying the collected co-occurrence information in order to make clustering decisions. The clustering technique is specifically designed to (a) handle the dominance that exists in data and (b) to adapt to a given clustering quality measure. These properties allow the framework to get a major advantage in terms of result quality over all the latest WePS techniques we are aware of, including all the 18 methods covered in the recent WePS competition [2].
A decentralized strategy for genetic scheduling in heterogeneous environments
Authors: George V. Iordache, Marcela S. Boboila, Florin Pop, Corina Stratan, Valentin Cristea
Venue: Multiagent and Grid Systems (2007)

This paper describes a solution to the key problem of ensuring high performance behavior of the Grid, namely the scheduling of activities. It presents a distributed, fault-tolerant, scalable and efficient solution for optimizing task assignment. The scheduler uses a combination of genetic algorithms and lookup services built on a multiagent infrastructure for obtaining a scalable and highly reliable optimization tool. The experiments have been carried out on the MonALISA monitoring environment and its extensions. The results demonstrate very good behavior in comparison with other scheduling approaches.
Combining answer set programming with description logics for the Semantic Web
Authors: Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
Venue: Artificial Intelligence (2008)

We propose a combination of logic programming under the answer set semantics with the description logics SHIF(D) and SHOIN(D), which underly the Web ontology languages OWL Lite and OWL DL, respectively. To this end, we introduce description logic programs (or dl-programs), which consist of a description logic knowledge base L and a finite set P of description logic rules (or dl-rules). Such rules are similar to usual rules in nonmonotonic logic programs, but they may also contain queries to L, possibly under default negation, in their bodies. They allow for building rules on top of ontologies but also, to a limited extent, building ontologies on top of rules. We define a suite of semantics for various classes of dl-programs, which conservatively extend the standard semantics of the respective classes and coincide with it in absence of a description logic knowledge base. More concretely, we generalize positive, stratified, and arbitrary normal logic programs to dl-programs, and define a Herbrand model semantics for them. We show that they have similar properties as ordinary logic programs, and also provide fixpoint characterizations in terms of (iterated) consequence operators. For arbitrary dl-programs, we define answer sets by generalizing Gelfond and Lifschitz's notion of a transform, leading to a strong and a weak answer set semantics, which are based on reductions to the semantics of positive dl-programs and ordinary positive logic programs, respectively. We also show how the weak answer sets can be computed utilizing answer sets of ordinary normal logic programs. Furthermore, we show how some advanced reasoning tasks for the Semantic Web, including different forms of closed-world reasoning and default reasoning, as well as DL-safe rules, can be realized on top of dl-programs. Finally, we give a precise picture of the computational complexity of dl-programs, and we describe efficient algorithms and a prototype implementation of dl-programs which is available on the Web.