Search

The rapid development of mobile Internet triggered massive data exchange among multiple sources, which then results in challenges in the efficiency of multi-user data transmission. Spatial coupling multiple access, where different users share the same resource blocks by superimposing data streams with different time offsets, has been proposed to obtain higher spectral efficiency. The optimization of the system can be carried out through for example constellation rotation or power allocation, which mitigates the interferences and distinguishes users/data streams better. The optimization aims for the maximization of the average mutual information between the transmitted data symbols and the received signal. To solve the optimization problem, we employ machine learning based methods to locate the possibly global optimal solution. Simulation results show that the optimization clearly contributes to the performance improvement of the system. [ABSTRACT FROM AUTHOR]

Actionable Patterns are desired knowledge to be mined from large datasets. Action Rules are vital data mining method for gaining actionable knowledge from the datasets. They recommend actions which users can undertake to their advantage, or to accomplish their goal. Meta actions are the sub-actions to the Action Rules, which intends to change the attribute value of an object, under consideration, to attain the desirable value. The essence of this paper is to propose a new optimized and more promising system, in terms of speed and efficiency, for generating meta-actions by implementing Specific Action Rule discovery based on Grabbing strategy (SARGS) algorithm, and to apply that for Sentiment Analysis on Twitter data. We perform a comparative analysis of meta-actions generating algorithmic implementation in Apache Spark driven system, conventional Hadoop driven system and Single node machine using the Twitter social networking data and evaluate the results. We implement corpus based Sentimental Analysis of social networking data, and test the total time taken by the systems and their sub components for the data processing. Results show faster computational time for Spark system compared to Hadoop MapReduce and Single node machine for the meta-action generation methods. [ABSTRACT FROM AUTHOR]

The article presents information about unicode, which are known to be the universal character set. Computers have become an indispensable part of one's life. Until recently, the outdated key character set standard, ASCII was in use. This character set has numerous limitations such as because of its constraint to include only seven of the eight bits in the byte, there is no room in ASCII to expand beyond the characters needed for the English language. Thus, in order to respond to the needs of international customer base, unicode character set is developed. The universal character set has numerous advantage because of the large number of characters that these languages share due to their common origins. These codes have found out a new way to encode languages for computer manipulation. These encoding allows over one million characters to be defined. Such codes covers not only currently used languages but also ancient languages that are studied by historians and scholars. These single character set have many advantages for all languages are particularly evident in libraries where works occur in different scripts.

The article focuses on the so-called symbol intelligence. It mentions that symbol intelligence involves more than the identification of emblems, insignias and tattoos but there is the need for a threat analysis to determine whether the symbol is an indicator of potential threat of violence. It discusses the symbolic methodologies developed by the Symbol Intelligence Group aimed to determine whether particular symbols are representatives of terrorist organizations or specific forms of violence.

Abstract: While pilot symbols facilitate channel estimation, they reduce the transmit energy for data symbols per OFDM symbol under a fixed total transmit power constraint. In this paper, we investigate the effect of the pilot-to-data power ratio (PDPR) on multilevel quadrature amplitude modulation (M-QAM) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems with adaptive modulation in order to provide a basic framework for finding the optimal PDPR in current and emerging standards using MIMO-OFDM. In particular, we derive the optimal PDPR in terms of average symbol error rate (SER) and spectral efficiency according to different receiver types such as zero-forcing (ZF) and minimum mean square error (MMSE). Employing the optimal PDPR results in higher spectral efficiency and lower SER without using any additional resource. [ABSTRACT FROM AUTHOR]

This paper evaluates the role of reprocessability and symbol sets, two of the media capabilities identified in Media Synchronicity Theory, and different recipient characteristics on knowledge transfer. An experimental study manipulating the two specific channel interface characteristics was conducted to test the proposed model. Results indicate that symbol sets have a positive effect on knowledge possessed and knowledge applied. Motivation to learn significantly affected knowledge possessed and knowledge applied, while absorptive capacity was found to only influence knowledge possessed. The hypothesized relationships between reprocessability and knowledge internalization were marginally supported, and future research is suggested to address this issue. [ABSTRACT FROM AUTHOR]

Suspecting that this is no more than a "service platform", it is proposed here to examine the format as the design of an emerging production generically named "IT sign". Considering that one of the elementary assumptions of technological communication is the conquest of space, it is proposed here to understand another aspect: the one in which the synthesis reproduces an experience of compaction of time. Thus it is obtained an experience of time as a projection of space that can be sized in terms of language. [ABSTRACT FROM AUTHOR]

Abstract  We introduce a special class of T-matrices, say, T 1, T 2, T 3, and T 4 satisfying $$ T_1T_4-T_2T_3=(T_1T_2-T_2T_3)' $$ where A′ is the transpose of A, and prove that if there exist base sequences of lengths m  p, m  p, m, m(p odd), and T-matrices of order t of the special kind, there exist T-matrices of order t(2m  p). And we find T -matrices of the special kind of order t for t = 3, 5, 7, 9, 11, 13, 15, which can be used to generate a large family of T-matrices. [ABSTRACT FROM AUTHOR]

Abstract  We will show that associated with the classical 1-system of the elliptic quadric Q −(7, q) are certain infinite families of two-character sets with respect to hyperplanes, and partial ovoids of Q (15, q). [ABSTRACT FROM AUTHOR]

Compiled communication can benefit the parallel application design and performance in several ways such as analyzing the communication pattern to optimize a configurable network for performance improvement or to visualize the communication requirements to study and improve the application design. In this article we present symbolic expression analysis techniques in a MPI parallel compiler. Symbolic expression analysis allows the identification and representation of the communication pattern and also assists in the determination of communication phases in MPI parallel applications at compile-time. We demonstrate that using compiler analysis based on symbolic expression analysis to determine the communication pattern can provide an accurate visualization of the communication requirements. Using information from the compiler to program a circuit switching interconnect in multiprocessor systems has the potential to achieve more efficient communication with lower cost compared to packet/wormhole switching. For example, we demonstrate that our compiler approach provides an average of 2.6 times improvement in message delay over a threshold-based runtime system for our benchmarks with a maximum improvement of 9.7 times. [ABSTRACT FROM AUTHOR]

The threat of DPA attacks is of crucial importance when designing cryptographic hardware. This contribution discusses the DPA-resistant implementation of two eSTREAM finalists using SABL logic styles. Particularly, two Feedback Shift Register (FSR) based stream ciphers, Grain v.1 and Trivium are designed in both BSim3 130nm and typical 350nm technologies and simulated by HSpice software. Circuit simulations and statistical power analysis show that DPA resistivity of SABL implementation of both stream ciphers has a major improvement. The paper presents the tradeoffs involved in the circuit design and the design for performance issues. [ABSTRACT FROM AUTHOR]

The full-complexity soft-input/soft-output (SISO) detector based on the BCJR algorithm for coded partial-response channels has a computational complexity growing exponentially with channel memory length. In this letter, we propose a low-complexity soft-output channel detector based on the Chase decoding algorithm, which was previously applied to decode turbo product codes. At each iteration, the proposed detector forms a candidate list using all possible combinations of bit patterns in the weakest indices based on tentative hard estimates and a priori information fed back from the outer decoder. To demonstrate the performance/complexity tradeoff of the proposed detector, simulation results over rate-8/9 turbo-coded EPR4 and ME2PR4 channels are presented, respectively. It is shown that the proposed detector can significantly reduce the computational complexity with only a small performance loss compared to the BCJR algorithm. [ABSTRACT FROM AUTHOR]

In this paper two symbol-level soft-decision decoding algorithms for Reed-Solomon codes, derived form the Ordered Statistics (OS) and from the Generalized Minimum-Distance (GMD) decoding methods, are presented and analyzed. Both the OS and the GMD algorithms are based on the idea of producing a list of candidate code words, among which the one having the larger likelihood is selected as output. We propose variants of the mentioned algorithms that allow to finely tune the size of the list in order to obtain the desired decoding complexity. The method proposed by Agrawal and Vardy for computing the error probability of the GMD algorithm is extended to our decoding methods. Examples are presented where these algorithms are applied to singly-extended Reed-Solomon codes over GF(16) used as outer codes in a 128-dimensional coded modulation scheme that attains good performance, with manageable decoding complexity. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we construct a new infinite class of two-character sets in and determine their automorphism groups. From this construction arise new infinite classes of two-weight codes and strongly regular graphs, and a new distance-2 ovoid of the split Cayley hexagon of order 4. [Copyright &y& Elsevier]

Abstract: We give a mass formula for self-dual codes over , where p is an odd prime. Using the mass formula, we classify such codes of lengths up to over the ring , over and over . [Copyright &y& Elsevier]

In this paper, we give an explicit p-adic expansion of (Multiple line equation(s) cannot be represented in ASCII text) as a power series in n. The coefficients are values of p-adic q-l-function for q-Euler numbers. [ABSTRACT FROM AUTHOR]

The article discusses the functions and impact of using semiotic systems in teaching mathematics. It provides an overview of the semiotic systems and the rules of sign use. The author explores the three functions of mathematical text with emphasis on its ideational function. He also presents models to illustrate the relationship between semiotic systems and social location or context.

Sending information secretly and communicating covertly have been of great interest for ages. Steganography is one of the main methods for sending the data secretly. Steganography is the art of hiding data in a cover media such as image or audio. In this paper, a new method is proposed for hiding information in digital Unicode texts. In this method, the data is hidden in the ligatures of the text such as "fl" by using Unicode standard features. This method does not make any apparent changes in the original text and have a perfect perceptual transparency. [ABSTRACT FROM AUTHOR]

This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of end host multicast (EMcast) when the traffic load becomes heavy in a multigroup network with real-time flows constrained by (σ, ρ) regulators. The control algorithm is implemented at the overlay networks and provides more regulations through a novel (σ, ρ, λ) regulator at each group end host who suffers from heavy input traffic. To our knowledge, it is the first work to incorporate traffic regulators into the end host multicast to control heavy traffic output. Our further contributions include a theoretical analysis and a set of results. We prove the existence and calculate the value of the rate threshold ρ* such that for a given set of K groups, when the average rate of traffic entering the group end hosts ρ¯ > ρ*, the ratio of the worst-case multicast delay bound of the proposed (σ, ρ, λ) regulator over the traditional (σ, ρ) regulator is O((Multiple line equation(s) cannot be represented in ASCII text)) for any integer n. We also prove the efficiency of the novel algorithm and regulator in decreasing worst-case delays by conducting computer simulations. [ABSTRACT FROM AUTHOR]

Rational relations are a powerful model used in many domains such as natural language processing. In this article, we propose a new model of finite state automata: multi-tape automata with symbol classes and identity or non-identity constraints. This model generalizes classical multi-tape automata, as well as automata and transducers with extended alphabet. We define this model in terms of a constraint satisfaction problem and discuss a problem occurring when handling the projection operation. Finally, we describe its implementation and results of a performance test. [ABSTRACT FROM AUTHOR]

In this paper the authors propose a method for high-accuracy recognition of large character sets using a new combination of a statistical method and neural networks. In their method, a hierarchical structure that has several neural networks arranged in a line after the statistical method is used. First, recognition using a statistical method is performed, and this represents the final result if the top candidate does not belong to a predefined set of similar characters. If it does, then the input character is discriminated in a neural network which designates the top candidate by determining the similar characters. The results are output as final results. The basic idea of this method is the functional division of a statistical method and neural networks, and the use of a neural network as determined by a statistical method. The results of recognizing 3201 character types including JIS-1 Kanji showed an improvement in the correct recognition rate due to the combined use of a statistical method and neural networks, thereby demonstrating the validity of the authors' approach. © 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(9): 97–107, 2005; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/scj.20330 [ABSTRACT FROM AUTHOR]

This paper is based on ongoing research into the use of Japanese cute (kawaii) character customisation of mobile phones in the Asia-Pacific region. Far from illustrating a form of homogeneous Japanisation in the region, consumers are using kawaii customisation in diverse ways to articulate practices of interiority and exteriority, cultural capital and habitus. The dominance of cute character culture (‘cuteness’ or kawairashisa) as the mode for customising/personalising technologies such as mobile phones is very particular to this region. So what does this form of ‘humanising’ the dehumanised technological spaces say about local nuances and tendencies? How is kawairashisa being transformed through its appropriation outside mobile phones (in the form of hanging doll-like forms) and inside the telephonic and net spaces via ‘email pets’, as the region moves into 3G (third generation) mobile net telephony? And why has there been so little work into analysing cultural adaptations of kawairashisa outside Japan despite its apparent ubiquity? In his seminal work on Japanese global cultural production, Koichi Iwabuchi evokes the notion of Japaneseness as being ‘odourless’ (2002). This paper revises the notion of ‘odourlessness’ Japanese global products in relation to the use of kawairashisa adornments inside and outside mobile net telephonic spaces. By sketching some of the ways in which the kawaii has been theorised and the current research into mobile telephony, this paper seeks to outline a framework for understanding the ubiquitous phenomenon of mobile customisation that is still relatively under-theorised and under-researched. [ABSTRACT FROM AUTHOR]

The last step of the Information Retrieval process is to display the found documents to the user. However, some difficulties might occur at that point. English texts are usually written in the ASCII standard. Unlike the English language, many languages have different character sets, and do not have one standard. This plurality of standards causes problems, especially in a web environment, where one may download a document with an unknown standard. This paper suggests a purely automatic way of finding the standard which was used by the document writer based on the statistical letters distribution in the language. We developed a vector-space-based method that creates frequencies vectors for each letter of the language and then matches a new document's vectors to the pre-computed templates. The algorithm was applied on various types of corpora in Hebrew, Russian and English, and provides an efficient solution to the stated problem in most cases. [ABSTRACT FROM AUTHOR]

In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with |y| ≥ 4 nor cubes xxx. We show that 'cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where '4' is replaced by any integer. This results in an interesting and subtle hierarchy. [ABSTRACT FROM AUTHOR]

The article presents a weather map that depicts the morning hours of January 6, 2010 in Europe. It offers information on how to show the weather patterns in the area involved. It notes that standardized cloud symbols are used to gauge the character of the air masses. Details on the interpretation of the map are also included.

Editorial. Presents information on symbol processing in connectionist systems. Concepts which can be represented by symbols; Concepts of the symbolic, connectionist and subsymbolic hypothesis; Reasons for attempting to perform symbol processing within wholly connectionist systems; Problems with connectionist systems compared with symbolic artificial intelligence systems.

An abstract of the article "Coded data quality for Casemix payment: insights from two external audits," by B. Reid and colleagues is presented.