ppxscal/embedding_network huggingface dataset:
A Real-Time Interactive Verification System for ASIC Design
Authors: Linlin Su, Xiaolin Zhang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The verification takes over 70% of the whole workload in design of digital chips, especially the chips for communications. Practically, the FPGA verification is common used because the simulation verification is low-efficient. But it is not a perfect substitute for the simulation verification. So the method to improve the efficiency of the simulation should be investigated. The verification system proposed in this paper has been used in the verification work of the chips of the Dual-system navigation receiver’s baseband circuit. The verification methods in the system reduce the debug time，which are separating the part of the verification process to avoid the repetition and providing the real-time interactive interface to the designer.
SoNARS: A Social Networks-Based Algorithm for Social Recommender Systems
Authors: Francesca Carmagnola, Fabiana Vernero, Pierluigi Grillo
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

User modeling systems have been influenced by the overspread of Web 2.0 and social networks. New systems aimed at helping people finding information of interest and including "social functions" like social networks, tagging, commenting, inserting content, arose. Such systems are the so-called "social recommender systems". The idea at the base of social recommender systems is that the recommendation of content should follow user's preferences while social network just represents a group of users joined by some kind of voluntary relation and does not reflect any preference. We claim that social network is a very important source of information to profile users. Moving from theories in social psychology which describe influence dynamics among individuals, we state that joining in a network with other people exposes individuals to social dynamics which can influence their attitudes, behaviours and preferences.We present in this paper SoNARS, a new algorithm for recommending content in social recommender systems. SoNARS targets users as members of social networks, suggesting items that reflect the trend of the network itself, based on its structure and on the influence relationships among users.
Expanding Topic-Focus Articulation with Boundary and Accent Assignment Rules for Romanian Sentence
Authors: Neculai Curteanu, Diana Trandabăţ, Mihai Alex Moruz
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

The present paper, maintaining the interest for applying Prague School's Topic-Focus Articulation (TFA) algorithm to Romanian, takes the advantage of an experiment of investigating the intonational focus assignment to the Romanian sentence. Using two lines of research in a previous study, it has been showed that TFA behaves better than an inter-clausal selection procedure for assigning pitch accents to the Background-Kontrast (Topic-Focus) entities, while the Inference Boundary algorithm for computing the Theme-Rheme is more reliable and easier extendable towards boundary and contour tone assignment rules, leading to our novel proposal of Sentence Boundary Assignment Rules (SBAR). The main contributions of this paper are: ( a ) The TFA algorithm applied for Romanian is extended to inter-clause level, and embedded into a discursive approach for computing the Background-Kontrast entities. ( b ) Inference Boundary algorithm, applied to Romanian for clause-level Theme-Rheme span computing, is extended with a set of SBAR rules, which are relying on different Communicative Dynamism (CD) degrees of the clause constituents. ( c ) On each intonational unit, the extended TFA algorithm is further refined, in order to eliminate ambiguities, with a filter derived from Gussenhoven's SAAR (Sentence Accent Assignment Rule). Remarkably, TFA and CD degrees proved again to be resourceful, especially as technical procedures for a new and systematic development of an Information Structure Discourse Theory (ISDT).
LTE for 4G Mobile Broadband: Air Interface Technologies and Performance, 1st edition
Authors: Farooq Khan
Venue:  (2009)

Do you need to get up to speed quickly on LTE? Understand the new technologies of the LTE standard and how they contribute to improvements in system performance with this practical and valuable guide, written by an expert on LTE who was intimately involved in drafting the standard. In addition to a strong grounding in the technical details, you'll also get fascinating insights into why particular technologies were chosen in the development process. Core topics covered include: Network architecture and protocols OFDMA downlink access Low-PAPR SC-FDMA uplink access Transmit diversity and MIMO spatial multiplexing Channel structure and bandwidths Cell search, reference signals and random access Turbo coding with contention-free interleaver Scheduling, link adaptation, hybrid ARQ and power control Uplink and downlink physical control signaling Inter-cell interference mitigation techniques Single-frequency network (SFN) broadcast MIMO spatial channel model Evaluation methodology and system performance With extensive references, a useful discussion of technologies that were not included in the standard, and end-of-chapter summaries that emphasize all the key points, this book is an essential resource for practitioners in the mobile cellular communications industry and for graduate students studying advanced wireless communications. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Harmonic Prediction Control for Time Delay Canceling and its Realization in Distribution Static Synchronous Compensator
Authors: Ruixiang Fan, An Luo, Min Sun, Zhikang Shuai
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper presents a prediction method for obtaining harmonic reference of distribution static synchronous compensator (DSTATCOM) control. It is a new use of adaptive predictive filter based on FIR in DSTATCOM control for harmonic suppression. Not only the time delay is successfully compensated by the prediction method, but also the algorithm is not complex compared with the normal method. Moreover, no additional hardware is needed. Realization based on digital signal processing (DSP) chip and some skills are detailed analyzed in the paper. Simulation and experimental results show the effectiveness of the proposed control.
Application of Kalman Filter Method Based "+ Function in the Landslide Deformation Forecast
Authors: Fumin Lu, Shangqing Wang, Jin Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Before landslides slide partly, the displacement of part monitoring points in the landslide will change according to a discipline, when landslides slide partly, these monitoring points will cause a great displacement in a very short time, it is called as a sudden change displacement, after landslides slide partly, the displacement of these monitoring points will change according to the other discipline. So we can use the definition of “+” function to erect the uniform landslide deformation forecast model.To different landslides and monitoring points at different locations of landslides, because their geographical environment and geological environment are different, their deformation discipline is different, we can preplace some deformation models and let the computer look for the deformation model whose forecast error is least. In order to improve the fitted accuracy and forecast accuracy of the forecast model ulteriorly, parameters of the deformation model whose forecast error is least are looked as status vectors with dynamic noises, Kalman filter model is erected to forecast the deformation of the landslide. Examples of monitoring point B6 and B7 in a landslide verify that the fitted accuracy and forecast accuracy of Kalman filter model is good, the method can be used in the forecast of landslides.
Case Retrieval Reuse Net (CR2N): An Architecture for Reuse of Textual Solutions
Authors: Ibrahim Adeyanju, Nirmalie Wiratunga, Robert Lothian, Somayajulu Sripada, Luc Lamontagne
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

This paper proposes textual reuse as the identification of reusable textual constructs in a retrieved solution text. This is done by annotating a solution text so that reusable sections are identifiable from those that need revision. We present a novel and generic architecture, Case Retrieval Reuse Net (CR2N), that can be used to generate these annotations to denote text content as reusable or not. Obtaining evidence for and against reuse is crucial for annotation accuracy, therefore a comparative evaluation of different evidence gathering techniques is presented. Evaluation on two domains of weather forecast revision and health safety incident reporting shows significantly better accuracy over a retrieve-only system and a comparable reuse technique. This also provides useful insight into the text revision stage.
Parallel Branch and Bound Algorithms on Semi-supervised SVMs
Authors: Ying Zhao, Jian-pei Zhang, Jing Yang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Branch and bound for semi-supervised support vector machines as an exact, globally optimal solution is useful for benchmarking different practical S3VM implementation. But, global optimization can be computationally very demanding. Parallel implementation of the algorithm enables us to reduce computational time significantly and to solve larger problems. Focusing on the time consuming problem of BBS3VM, a novel parallel branch and bound semi-supervised support vector machines (PBBS3VM) is proposed. Experimental results on server dataset show that the proposed algorithm outperforms the classical sequential algorithm in terms of accuracy and greatly reduce the running time using the Linux PCs.
An Agent Based Nonlinear Optimal Model of Water Resources System and Its Solving Method
Authors: Jianshi Zhao, Zhongjing Wang, Xiaohui Lei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

An agent based nonlinear model of water resources system is established at the basin level based on the theory of Complex Adaptive System. In this model, the subsystems of the water resources system, including hydrologic cycle components, agricultural and industrial water use, human living water use, ecosystem water use and water environment are combined by a dynamic connection with inner variables. In the model, every subsystem is described as an optimal model, and genetic arithmetic is used to solving the optimal sub models. Based on the structure of the model and the solving efficiency analysis, a nesting genetic arithmetic is presented to solve this nonlinear optimal model. The model is applied in the Yellow River basin to evaluate the impacts of the West Route of South-to-North Water Transfer Project of China.
On the efficiency of distributed spectrum sensing in ad-hoc cognitive radio networks
Authors: Ioannis Glaropoulos, Viktoria Fodor
Venue: Proceedings of the 2009 ACM workshop on Cognitive radio networks (2009)

In this work we evaluate the efficiency of cooperative spectrum sensing to support cognitive radio operation, when sensing is assigned to the cognitive users, randomly located in the area of a primary network. We derive analytic expressions for sensing performance based on the traditional metrics of missed detection and false alarm probabilities, and show the existence of an optimal cooperation range. False alarm and missed detection probabilities, however, do not directly lead to performance degradation in the primary and low utilization in the cognitive system. We propose an interference model taking the cognitive access into account and optimize the sensing parameters in order to maximize the cognitive network capacity while satisfying the primary network interference constraints.
Approximation algorithms for orthogonal packing problems for hypercubes
Authors: Rolf Harren
Venue: Theoretical Computer Science (2009)

Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I={r"1,...,r"n} of d-dimensional rectangular items r"i=(a"i","1,...,a"i","d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into the given space. In the strip packing setting the space Q is given by a strip of bounded basis and unlimited height. The objective is to pack all items into a strip of minimal height. In the knapsack packing setting the given space Q is a single, usually unit sized bin and the items have associated profits p"i. The goal is to maximize the profit of a selection of items that can be packed into the bin. We mainly focus on orthogonal knapsack packing restricted to hypercubes and our main results are a (5/4+@e)-approximation algorithm for two-dimensional hypercube knapsack packing, also known as square packing, and a (1+1/2^d+@e)-approximation algorithm for d-dimensional hypercube knapsack packing. In addition we consider d-dimensional hypercube strip packing in the case of a bounded ratio between the shortest and longest side of the basis of the strip. We derive an asymptotic polynomial time approximation scheme (APTAS) for this problem. Finally, we present an algorithm that packs hypercubes with a total profit of at least (1-@e)OPT into a large bin (the size of the bin depends on @e). This problem is known as hypercube knapsack packing with large resources. A preliminary version was published in Harren [Rolf Harren, Approximating the orthogonal knapsack problem for hypercubes, in: ICALP: Proc. 33rd International Colloquium on Automata, Languages and Programming, 2006, pp. 238-249] but especially for the latter two approximation schemes no details were given due to page limitations.
Detecting Functional Dependence Program Invariants Based on Data Mining
Authors: Shukun Liu, Xiaohua Yang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

With the development of computer science and technology, software has been widely applied in all kinds of business. It has been a very popular and important application system. So the quality of software causes more serious attention than before. Design by program invariant is a very important method which is used to improve quality of software. In this paper, a theory model of dynamically detecting technology of program invariant was built. And a new method of dynamically generating technology of program invariant of functional dependence based on the theory of database was showed. In this way, program invariant of functional dependence can be detected in a nimble way. Experiments have been done and the result demonstrates that the method is obviously reliable and efficient.
A Novel Scheme and Access Architecture for Joint Radio Resource Management in Heterogeneous Networks
Authors: Cui Yang, Xue Yubin, Shang Haiying, Sha Xuejun, Ding Zhe
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, a access architecture for joint radio resource management (JRRM), hierarchical architecture, is given after analyzing advantage and disadvantage of the existing architectures, which is consider as one of architectures the future heterogeneous radio networks most possibly uses .Then a novel scheme is proposed based on this hierarchical architecture and the work flow of it is discussed in detail. The innovation of this scheme is that dynamic spectrum management (DSM) is integrated into the existing JRRM schemes based on predicting traffic in every radio access technology’s(RAT) cells. In order to evaluate performance, a new concept, spectrum utility, is used which reflects degree and efficiency of resources utilization. Compared with the JRRM without DSM, this scheme can improve spectrum utility and reduce blocking rate.
S&D Pattern Deployment at Organizational Level: A Prototype for Remote Healthcare System
Authors: Pierre Busnel, Paul El Khoury, Keqin Li, Ayda Saidane, Nicola Zannone
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The analysis of security incidents and frauds has shown that several vulnerabilities of IT systems are due to loopholes in the policies and procedures adopted by organizations as well as in their structure. Organizations have thus to address security and dependability issues by analyzing their organizational setting. In this paper, we present a methodology to support the deployment of Security & Dependability patterns according to their position in the Enterprise Architecture and the underlying system infrastructures. The methodology discriminates the pattern deployment process between recommendations and guidelines. Recommendations concretize the deployment with refined software and/or hardware related patterns, whereas guidelines specify the organizational patterns in terms of the system-to-be, proposing human-resource and/or policy solutions. To make the discussion more concrete, we illustrate the framework with a case study on an emergency scenario within a remote healthcare system.
Learning efficient parsing
Authors: Gertjan van Noord
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

A corpus-based technique is described to improve the efficiency of wide-coverage high-accuracy parsers. By keeping track of the derivation steps which lead to the best parse for a very large collection of sentences, the parser learns which parse steps can be filtered without significant loss in parsing accuracy, but with an important increase in parsing efficiency. An interesting characteristic of our approach is that it is self-learning, in the sense that it uses unannotated corpora.
A model-based approach for merging prioritized knowledge bases in possibilistic logic
Authors: Guilin Qi
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

This paper presents a new approach for merging prioritized knowledge bases in possibilistic logic. Our approach is semantically defined by a model-based merging operator in propositional logic and the merged result of our approach is a normal possibility distribution. We also give an algorithm to obtain the syntactical counterpart of the semantic approach. The logical properties of our approach are considered. Finally, we analyze the computational complexity of our merging approach.
Clustering for Video Retrieval
Authors: Petr Chmelar, Ivana Rudolfova, Jaroslav Zendulka
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

The paper deals with an application of clustering we used as one of data reduction methods included in processing huge amount of video data provided for TRECVid evaluations. The problem we solved by means of clustering was to partition the local feature descriptors space so that thousands of partitions represent visual words, which may be effectively employed in video retrieval using classical information retrieval techniques. It has proved that well-known algorithms as K-means do not work well in this task or their computational complexity is too high. Therefore we developed a simple clustering method (referred to as MLD) that partitions the high-dimensional feature space incrementally in one to two database scans. The paper describes the problem of video retrieval and the role of clustering in the process, the MLD method and experiments focused on comparison with other clustering methods in the video retrieval application context.
An Identity-Based Proxy Signature from Bilinear Pairings
Authors: Huifang Ji, Wenbao Han, Long Zhao, Yongjuan Wang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Currently, ID-based PKC has attracted much attention and got manyachievements. Proxy signature allows an original signer to delegatehis private key to a proxy signer to sign some message on behalf ofthe original signer. We present a ID-based proxy signature in thispaper. The scheme is relatively efficient as there is no pairingcomputation during the Delegation and PSign phases. It is secureagainst existential forgery under adaptive chosen message andidentity attack under the random oracle model. Its security can bereduced to the hardness of CDHP.
Development of Speech Input Method for Interactive VoiceWeb Systems
Authors: Ryuichi Nisimura, Jumpei Miyake, Hideki Kawahara, Toshio Irino
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

We have developed a speech input method called "w3voice" to build practical and handy voice-enabled Web applications. It is constructed using a simple Java applet and CGI programs comprising free software. In our website (http://w3voice.jp/), we have released automatic speech recognition and spoken dialogue applications that are suitable for practical use. The mechanism of voice-based interaction is developed on the basis of raw audio signal transmissions via the POST method and the redirection response of HTTP. The system also aims at organizing a voice database collected from home and office environments over the Internet. The purpose of the work is to observe actual voice interactions of human-machine and human-human. We have succeeded in acquiring 8,412 inputs (47.9 inputs per day) captured by using normal PCs over a period of seven months. The experiments confirmed the user-friendliness of our system in human-machine dialogues with trial users.
Designing Social Commerce Experience in 3D Virtual World
Authors: Zhi-Cong Fang, Hong Cai
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Experience during e-Commerce activities will greatly influence people’s buying behavior. In this paper, thekey points of doing commerce over 3D virtual world arestudied, a systematic method of designing e-commerceexperience in 3D virtual world is designed which is named C2V (Commerce to Virtual Worlds). A commerce scenario isdecomposed into roles and scenes, and then captured byPerformative Structure graph. The Performative Structuregraph is then transformed into rectangular dualization layout through Rectangular Dualization algorithm. By using a real use case (1st World Youth Olympic Game to be hosted by Singapore) to apply the designed method, the feasibility of our new method is proved.
A New Decision-Feedback Equalizer Based on a Mixed Blind Equalization Algorithm
Authors: Wei Rao, Fei Xia, Yuan-yuan Liu, Wen-qun Tan, Hui-jun Xu, Kang-ming Yuan, Jian-bing Liu
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

A new Decision-Feedback Equalizer (DFE) is proposed to overcome Inter-Symbol Interference (ISI) faster in the communication system without the aid of training sequences. Unlike the conventional DFE, the feedforward filter component and the feedback filter component in the proposed DFE operate with Constant Modulus Algorithm (CMA) and Decision-Directed (DD) algorithm respectively. It makes full use of the advantages of the CMA’s “eye-opened” ability and DD’s faster convergence rate ability. Consequently the proposed DFE has the faster convergence rate than the conventional DFE which can improve the performance for the system. Simulations with underwater acoustic channels are presented and the simulation results are shown to prove the efficiency of the proposed DFE.