小喇叭，放飞心情

“小喇叭，嗒嗒响，我们一起去放飞!”这好像是某首儿歌中的歌词，不过今天我们要介绍的iLaba并非货真价实的小喇叭，而是一款非常有意思的音乐播放器。它除了可以播放本机和网络上的歌曲外，还能够从百度和搜刮网站上搜索评下载歌曲，而且还具有和《千千静听》同样的歌词同步显示功能，可以说是提供了搜索、下载和播放一条龙服务。     

“千千静听”轻松听歌17招

1、助千千静昕搜索歌词 千千静听是通过识别MP3标签来在线自动搜索歌词的，可现在网上下载的许多MP3文件的标签信息并不完整或文件名杂乱，这时我们可以右击千千静听播放列表中欲识别文件．选择“文件信息命令”．“从文件名猜测标签”并选择合适的歌曲文件名样式．一般就可以帮助千千静听寻找到合适的歌词了。[第一段]     

千千小细节 静听更省心

对于喜欢听歌的朋友来说,千千静听是一款出色的软件,然而更新到5.3正式版后,却有一些小细节需要注意。下面,就挑出其中几条方便实用的小技巧与大家分享,希望能够事半功倍。     

浪漫生活快乐歌唱

我们在生活中应该怎样叫浪漫?我想,浪漫屋里、粉色灯光下,电脑前、一个唱、一人闭目欣赏……那才叫温馨。一款小小的免费播放器——小喇叭可实现这一梦想。     

Customizable multi-engine search tool with clustering

The dozens of existing search tools and the keyword-based search model have become the main issues of accessing the ever growing WWW. Various ranking algorithms, which are used to evaluate the relevance of documents to the query, have turn out to be impractical. This is because the information given by the user is too few to give good estimation. In this paper, we propose a new idea of searching under the multi-engine search architecture to overcome the problems. These include clustering of the search results and extraction of co-occurrence keywords which with the user's feedback better refines the query in the searching process. Besides, our system also provides the construction of the concept space to gradually customize the search tool to fit the usage for the user at the same time.     

A backtracking search tool for constructing combinatorial test suites

Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.     

Optimizing tool orientations for 5-axis machining by configuration-space search method

This paper presents a methodology and algorithms of optimizing and smoothing the tool orientation control for 5-axis sculptured surface machining. A searching method in the machining configuration space (C-space) is proposed to find the optimal tool orientation by considering the local gouging, rear gouging and global tool collision in machining. Based on the machined surface error analysis, a boundary search method is developed first to find a set of feasible tool orientations in the C-space to eliminate gouging and collision. By using the minimum cusp height as the objective function, we first determine the locally optimal tool orientation in the C-space to minimize the machined surface error. Considering the adjacent part geometry and the alternative feasible tool orientations in the C-space, tool orientations are then globally optimized and smoothed to minimize the dramatic change of tool orientation during machining. The developed method can be used to automate the planning and programming of tool path generation for high performance 5-axis sculptured surface machining. Computer implementation and examples are also provided in the paper.     

The pataphysics of creativity: developing a tool for creative search

We introduce the idea of a new kind of web search tool that uses the literary and philosophical idea of pataphysics as a conceptual framework in order to return creative results. Pataphysics, the science of exceptions and imaginary solutions, can be directly linked to creativity and is therefore very suitable to guide the transformation from relevant into creative search results. To enable pataphysical algorithms within our system we propose the need for a new type of system architecture. We discuss a component-based software architecture that would allow the flexible integration of the new algorithms at any stage or location and the need for an index suitable to handle patadata, data which have been transformed pataphysically. This tool aims to generate surprising, novel and provocative search results rather than relevant ones, in order to inspire a more creative interaction that has applications in both creative work and learning contexts.     

Integrated process planning using tool/process capabilities and heuristic search

CAD–CAM integration has involved either design with standard manufacturing features (feature-based design), or interpretation of a solid model based on a set of predetermined feature patterns (automatic feature recognition). Thus existing approaches are limited in application to predefined features, and also disregard the dynamic nature of the process and tool availability in the manufacturing shop floor. To overcome this problem, we develop a process oriented approach to design interpretation, and model the shape producing capabilities of the tools into tool classes. We then interpret the part by matching regions of it with the tool classes directly. In addition, there could be more than one way in which a part can be interpreted, and to obtain an optimal plan, it is necessary for an integrated computer aided process planning system to examine these alternatives. We develop a systematic search algorithm to generate the different interpretations, and a heuristic approach to sequence operations (set-ups/tools) for the features of the interpretations generated. The heuristic operation sequencing algorithm considers features and their manufacturing constraints (precedences) simultaneously, to optimally allocate set-ups and tools for the various features. The modules within the design interpretation and process planner are linked through an abstracted qualitative model of feature interactions. Such an abstract representation is convenient for geometric reasoning tasks associated with planning and design interpretation.     

The theory of planned behaviour applied to search engines as a learning tool

Abstract Search engines have been developed for helping learners to seek online information. Based on theory of planned behaviour approach, this research intends to investigate the behaviour of using search engines as a learning tool. After factor analysis, the results suggest that perceived satisfaction of search engine, search engines as an information retrieval tool, and sharing search experience and information are three significant factors to affect individual behavioural intention to use search engines as a learning tool. In addition, the research elaborates that individual Internet and search engine experiences will affect these three factors. Moreover, the result also offers evidence that today's computers are popular for the application of communication and information retrieval.     

An investigation of user attitudes toward search engines as an information retrieval tool

After the Internet has gained great popularity at homes and schools, there is much information on the Web. Today, one of the primary uses of the Internet is information retrieval from search engines. The main purpose of the current study is to develop and examine an individual attitude model towards search engines as a tool for retrieving information. This model integrates individual computer experience with perceptions. In addition, it also combines perception theories, such as technology acceptance model (TAM) and motivation, in order to understand individual attitudes toward search engines. The results show that individual computer experience, quality of search systems, motivation, and perceptions of technology acceptance are all key factors that affect individual feelings to use search engines as an information retrieval tool.     

Monte Carlo Tree Search as an intelligent search tool in structural design problems

Engineering with Computers - Monte Carlo Tree Search (MCTS) is a search technique that in the last decade emerged as a major breakthrough for Artificial Intelligence applications regarding board-...     

歌词到歌曲转换系统的实现

将文语转换技术与语音修改技术相结合,实现了一个歌词到歌曲的转换系统。首先利用一个文语转换系统将输入的歌词转换为语音,同时从歌曲的MIDI文件中提取歌曲的旋律参数,最后通过旋律控制模型对语音信号的声学特征进行修改,实现由歌词到歌曲的转换。实验结果表明,系统合成的歌曲达到了3.29的平均MOS得分。     

AUSTIN: An open source tool for search based software testing of C programs

ContextDespite the large number of publications on Search-Based Software Testing (SBST), there remain few publicly available tools. This paper introduces AUSTIN, a publicly available open source SBST tool for the C language.¹ The paper is an extension of previous work [1]. It includes a new hill climb algorithm implemented in AUSTIN and an investigation into the effectiveness and efficiency of different pointer handling techniques implemented by AUSTIN’s test data generation algorithms.ObjectiveTo evaluate the different search algorithms implemented within AUSTIN on open source systems with respect to effectiveness and efficiency in achieving branch coverage. Further, to compare AUSTIN against a non-publicly available, state-of-the-art Evolutionary Testing Framework (ETF).MethodFirst, we use example functions from open source benchmarks as well as common data structure implementations to check if the decision procedure for pointer inputs, introduced in this paper, differs in terms of effectiveness and efficiency compared to a simpler alternative that generates random memory graphs. A second empirical study formulates two alternate hypotheses regarding the effectiveness and efficiency of AUSTIN compared to the ETF. These hypotheses are tested using a paired Wilcoxon test.Results and ConclusionThe first study highlights some practical problems with the decision procedure for pointer inputs described in this paper. In particular, if the code under test contains insufficient guard statements to enforce constraints over pointers, then using a constraint solver for pointer inputs may be suboptimal compared to a method that generates random memory graphs. The programs used in the second study do not require any constraint solving for pointer inputs and consist of eight non-trivial, real-world C functions drawn from three embedded automotive software modules. For these functions, AUSTIN is competitive compared to the ETF, achieving an equal or higher branch coverage for six of the functions. In addition, for functions where AUSTIN’s branch coverage is equal or higher, AUSTIN is more efficient than the ETF.