Miracle-dz/UniFAR-FTUs huggingface dataset:
Multiple shift second order sequential best rotation algorithm for polynomial matrix EVD

In this paper, we present an improved version of the second order sequential best rotation algorithm (SBR2) for polynomial matrix eigenvalue decomposition of para-Hermitian matrices. The improved algorithm is entitled multiple shift SBR2 (MS-SBR2) which is developed based on the original SBR2 algorithm. It can achieve faster convergence than the original SBR2 algorithm by means of transferring more off-diagonal energy onto the diagonal at each iteration. Its convergence is proved and also demonstrated by means of a numerical example. Furthermore, simulation results are included to compare its convergence characteristics and computational complexity with the original SBR2, sequential matrix diagonalization (SMD) and multiple shift maximum element SMD algorithms.
De-stressed words in Mandarin: drawing parallel with English

In colloquial Standard Mandarin, monosyllabic tonal function words (such as classifiers, prepositions, personal pronouns, etc.), are regularly pronounced as unstressed and phonetically reduced (e.g. tā 他 [thə]), unless they are emphasized ([thaː]). Their unstressed forms play an important role in speech rhythm. This study investigates this group of words. I open the discussion by addressing the general issue of stress in Mandarin, arguing that de-stress might be an essential notion here. English words with weak forms (articles, prepositions, etc.) are then introduced. I establish a similar group of words in Chinese, coining a new term for them: the cliticoids . The strong resemblance between both groups is pointed out. Finally, pedagogical implications of the findings are proposed: the proper handling of the cliticoids may help L2 learners to improve their oral performance.
Packet traffic: a good data source for wireless sensor network modeling and anomaly detection

The wireless sensor network (WSN) has emerged as a promising technology. In WSNs, sensor nodes are distributedly deployed to collect interesting information from the environment. Because of the mission of WSNs, most node-wide as well as network-wide activities are manifested in packet traffic. As a result, packet traffic becomes a good data source for modeling sensor node as well as sensor network behaviors. In this article, the methodology of modeling node and network behavior profiles using packet traffic is exemplified. In addition, node as well as network anomalies are shown to be detectable by monitoring the evolution of node/network behavior profiles.
Brain-Derived Neurotrophic Factor Acutely Inhibits AMPA-Mediated Currents in Developing Sensory Relay Neurons

Brain-derived neurotrophic factor (BDNF) is expressed by many primary sensory neurons that no longer require neurotrophins for survival, indicating that BDNF may be used as a signaling molecule by the afferents themselves. Because many primary afferents also express glutamate, we investigated the possibility that BDNF modulates glutamatergic AMPA responses of newborn second-order sensory relay neurons. Perforated-patch, voltage-clamp recordings were made from dissociated neurons of the brainstem nucleus tractus solitarius (nTS), a region that receives massive primary afferent input from BDNF-containing neurons in the nodose and petrosal cranial sensory ganglia. Electrophysiological analysis was combined in some experiments with anterograde labeling of primary afferent terminals to specifically analyze responses of identified second-order neurons. Our data demonstrate that BDNF strongly inhibits AMPA-mediated currents in a large subset of nTS cells. Specifically, AMPA responses were either completely abolished or markedly inhibited by BDNF in 73% of postnatal day (P0) cells and in 82% of identified P5 second-order sensory relay neurons. This effect of BDNF is mimicked by NT-4, but not NGF, and blocked by the Trk tyrosine kinase inhibitor K252a, consistent with a requirement for TrkB receptor activation. Moreover, analysis of TrkB expression in culture revealed a close correlation between the percentage of nTS neurons in which BDNF inhibits AMPA currents and the percentage of neurons that exhibit TrkB immunoreactivity. These data document a previously undefined mechanism of acute modulation of AMPA responses by BDNF and indicate that BDNF may regulate glutamatergic transmission at primary afferent synapses.
A Cooperating Hybrid Neural-CBR Classifiers for Building On-line Communities

This paper reports on an ongoing development of an application that aims at identifying communities of use in the context of an organized group of people. The described application, called CoWing consists on mining users bookmark files in order to identify communities that share the same information interests. The system is composed of a set of assistant agents, called WINGS, and a central agent that manages the users organization. A Wing agent observes the user behavior in order to learn the user bookmark classification strategy. A hybrid neural case-based reasoning incremental classifier is used for this purpose. Classification knowledge learned by an agent is then used to identify, for each folder in the local bookmark hierarchy, a community of users that share the same interests in the theme of that folder.
KONTRIBUSI MINAT JURUSAN, KUALITAS LAYANAN INFORMASI KARIR, DAN PEMAHAMAN KARIR TERHADAP KEMAMPUAN MENGAMBIL KEPUTUSAN KARIR

Tujuan penelitian ini menguji secara empiris kontribusi minat jurusan, kualitas layanan informasi karir, dan pemahaman karir terhadap kemampuan mengambil keputusan karir. Penelitian ini menggunakan metode ekspos fakto. Subyek penelitian sebanyak 120 siswa SMK dipilih dengan teknik proporsionale random sampling . Pengumpulan data dengan teknik Skala Likert. Teknik analisis data yang digunakan adalah analisis regresi berganda. Hasil penelitian menunjukkan adanya kontribusi positif dari minat jurusan, kualitas layanan informasi karir, dan pemahaman karir terhadap kemampuan mengambil keputusan karir secara simultan sebesar 67,70% (F= 80.907; p<0.05). Kontribusi secara parsial untuk minat jurusan sebesar 38,70% (t= 4.523; p<0.05), kualitas layanan informasi karir sebesar 18,90% (t= 2.067; p<0.05), serta pemahaman karir sebesar 64,50% (t= 9.098; p<0.05). Besaran kontribusi secara simultan yaitu relatif sedang, sedangkan secara parsial dari setiap variabel yaitu minat jurusan relatif kecil, kualitas layanan informasi karir relatif sangat kecil, dan pemahaman karir relatif sedang The purpose of this study was to test the contribution of subject interest, quality of career information services, and career understanding towards career decision-making capability. The ex-post facto method was implemented in the present study. Subjects were 120 students who were selected using proportional random sampling. Data collection technique were Likert scale. Multiple regression analysis was applied to analysed the data. The result showed that the positive contribution of subject interest, the quality of career information service, and career understanding simultaneously on the career decision-making capability were 67.70% (F = 80 907; p < 0.05). The contribution of subject interest was 38.70% (t = 4,523; p < 0.05), quality of career information service was18.90% (t = 2,067; p < 0.05), and career understanding was 64.50% (t = 9,098, p < 0.05). The contribution level of all predictors on the career decision-making skills were relatively moderate. The level of contribution of subject interest was relatively small, the quality of career information service was very small, and career understanding was moderate
Re-envisioning the Keyboard as a Spatial User Interface

Current screen reader technology presents the content of web pages to users as a one-dimensional stream of data. However, as web pages themselves are two-dimensional, we believe this output method is lossy since it removes the visuospatial relationships between elements. Keyboard surface interaction is a growing field within human computer interaction that studies the repurposing of keyboards for nontraditional applications. We compare a keyboard surface interaction system (Fingers) designed to preserve the visuospatial relationships between web page elements to a traditional screen reader (VoiceOver) to learn which has better interaction effectiveness measured in terms of time spent and interactions per task on four simulated shopping tasks. We find no consistent difference in effectiveness between the two conditions. Participants consistently have more interactions per task with Fingers than with VoiceOver, but it is unclear whether this positively or negatively impacts their time. We find that learning a new mental model of a keyboard is challenging for participants. We suggest further research into the applicability of keyboard surface interaction as an alternative form of web accessibility, but that future studies take a longitudinal nature to help participants learn the mental model required and overcome the novelty effect.
SeRA: A Secure Routing Algorithm Against Sinkhole Attacks for Mobile Wireless Sensor Networks

sinkhole attacks are particularly harmful against routing in wireless sensor networks in which the intruder attempts to lure all traffic towards itself, with false routing information. It gives serious damage to the network load balancing, as well as other types of attacks to provide a platform. So it is very important to prevent and detect this type of attack. In this paper, we present a secure routing algorithm against sinkholes attacks based on mobile agents designed for mobile wireless sensor networks (MWSN) and show how it can be configured to avoid sinkhole attacks.
Fluxes of lactate into, from, and among gap junction-coupled astrocytes and their interaction with noradrenaline

Lactate is a versatile metabolite with important roles in modulation of brain glucose utilization rate (CMRglc), diagnosis of brain-injured patients, redox- and receptor-mediated signaling, memory, and alteration of gene transcription. Neurons and astrocytes release and accumulate lactate using equilibrative monocarboxylate transporters that carry out net transmembrane transport of lactate only until intra- and extracellular levels reach equilibrium. Astrocytes have much faster lactate uptake than neurons and shuttle more lactate among gap junction-coupled astrocytes than to nearby neurons. Lactate diffusion within syncytia can provide precursors for oxidative metabolism and glutamate synthesis and facilitate its release from endfeet to perivascular space to stimulate blood flow. Lactate efflux from brain during activation underlies the large underestimation of CMRglc with labeled glucose and fall in CMRO2/CMRglc ratio. Receptor-mediated effects of lactate on locus coeruleus neurons include noradrenaline release in cerebral cortex and c-AMP-mediated stimulation of astrocytic gap junctional coupling, thereby enhancing its dispersal and release from brain. Lactate transport is essential for its multifunctional roles.
Cytoskeletal Components of an Invasion Machine—The Apical Complex of Toxoplasma gondii

The apical complex of Toxoplasma gondii is widely believed to serve essential functions in both invasion of its host cells (including human cells), and in replication of the parasite. The understanding of apical complex function, the basis for its novel structure, and the mechanism for its motility are greatly impeded by lack of knowledge of its molecular composition. We have partially purified the conoid/apical complex, identified ~200 proteins that represent 70% of its cytoskeletal protein components, characterized seven novel proteins, and determined the sequence of recruitment of five of these proteins into the cytoskeleton during cell division. Our results provide new markers for the different subcompartments within the apical complex, and revealed previously unknown cellular compartments, which facilitate our understanding of how the invasion machinery is built. Surprisingly, the extreme apical and extreme basal structures of this highly polarized cell originate in the same location and at the same time very early during parasite replication.
Computing Point-to-Point Shortest Paths from External Memory

We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We also develop a memory-efficient implementation of the algorithm that runs on a Pocket PC. It stores graph data in a flash memory card and uses RAM to store information only for the part of the graph visited by the current shortest path computation. The implementation works even on very large graphs, including that of the North America road network, with almost 30 million vertices.
Asymptotics of orthogonal polynomials via the Koosis theorem

The main aim of this short paper is to advertize the Koosis theorem in the mathematical community, especially among those who study orthogonal polynomials. We (try to) do this by proving a new theorem about asymptotics of orthogonal polynomials for which the Koosis theorem seems to be the most natural tool. Namely, we consider the case when a Szeg\"o measure on the unit circumference is perturbed by an arbitrary measure inside the unit disk and an arbitrary Blaschke sequence of point masses outside the unit disk.
SONIK: Efficient In-situ All Item Rank Generation using Bit Operations

Sorting, a classical combinatorial process, forms the bedrock of numerous algorithms with varied applications. A related problem involves efficiently finding the corresponding ranks of all the elements - catering to rank queries, data partitioning and allocation, etc. Although, the element ranks can be subsequently obtained by initially sorting the elements, such procedures involve O(n log n) computations and might not be suitable with large input sizes for hard real-time systems or for applications with data re-ordering constraints. This paper proposes SONIK, a non-comparison linear time and space algorithm using bit operations inspired by radix sort for computing the ranks of all input integer elements, thereby providing implicit sorting. The element ranks are generated in-situ, i.e., directly at the corresponding element position without re-ordering or recourse to any other sorting mechanism.
FAST ALGORITHMS OF FOURIER AND HARTLEY TRANSFORM AND THEIR IMPLEMENTATION IN MATLAB VíTÌZSLAV VESELÝ

This paperis mainlyintendedas surveyarticleonconstructionof fast algorithms for the computationof the discrete Fourier transform(DFT) and discrete Hartley transform (DHT), all in relation to discrete linear and cyclicconvolutionwhichare fundamentaloperationsin manydataprocessing tasks. The exposition prefers purely algebraic approach to explain the basic ideas in concise but clear manner. The bene(cid:12)ts of author's new algebraic setting of generalized Kronecker product are demonstrated in deriving fast algorithms of Cooley-Tukey type for the computation of multidimensional fastFourierandHartleytransform. Thesealgorithmshavebeenimplemented as FORTRAN MEX-(cid:12)les in MATLAB which makes it easy to use them and evaluatetheirperformance. Comparedwith othercommonlyusedprocedures the results of performance tests exhibit equal or better numerical stability and for most larger transform lengths time e(cid:14)ciency superior to that of the comparative procedures. The results concerning the new algorithm for fast Hartley transform are stated without proofs and will be published elsewhere in more detail.
Ambiguous Loss and Complicated Grief: Understanding the Grief of Parents of the Disappeared in Northern Uganda

In the bereavement literature, prolonged grief, described in the new DSM-5 as persistent complex bereavement disorder, is considered a pathological disorder affecting a small but significant minority of bereaved persons. In the ambiguous loss literature, in contrast, prolonged grief is viewed as inevitably linked to the ambiguity of the bereaved person, and its causes are linked to the ambiguity, such as persistent hope, the absence of cultural and religious rituals to provide meaning to a loss, and the grief being so large as to disenfranchise community members. Based on a literature review and qualitative fieldwork with parents of missing persons in Uganda, this article examines the emotional, social, cultural, and socioeconomic aspects of the ambiguity that relatives of missing persons experience in the aftermath of wartime disappearances. I argue that, in such contexts, explanations of prolonged grief as a pathological disorder cannot be sustained.
A Novel Routing Algorithm for Achieving Static Fault-Tolerance in 2-D Meshes

Interconnection networks encompass a large number of technologies; from chip-to-chip communications to the system area networks (SANS), and in particular as the communication medium for multiprocessors. Interconnection networks offer communication with high reliability, high throughput, and low latency, all being vital factors for closely cooperating units. In the event that the interconnection network fails, the remainder of the system is left disconnected. Thus, it is essential to be able to keep the graceful degradation of reliability in these systems, even in the presence of faulty components. Adaptive fault-tolerant routing algorithms have been the subject of extensive research in recent years. In this paper, this issue is addressed through a new fault-tolerant routing algorithm to prevent static faults in interconnection networks with 2-D mesh topology. The suggested algorithm requires no change to the way packets are routed in the fault-free case, can be easily implemented, does not require the use of routing tables, and is well-suited for use in high-performance systems.
A real-time performance system for virtual theater

The idea of combining virtual reality technology and theatrical tradition to create virtual plays has captured artists' imaginations for some time. Using conventional technology, the use of virtual characters in a theatrical performance often integrates the predefined animations of virtual actors into the theater scene, resulting in a performance that can feel stilted and unresponsive due to its pre-programmed nature. This paper proposes a new system that allows actors to animate virtual characters in real time, resulting in a more flexible and interactive theatrical performance experience. Actors are sequestered at a remote site, invisible to the audience, and are digitized by a motion capture system. Using camera feeds to provide the remote actors with information about the behavior of the live actors and audience in the theater, the remote actors can adapt their virtual counterparts' behavior to react to live events in real-time, giving the illusion to the audience that the virtual characters are responsive to their actions. The system integrates display peripherals, networked cameras, real-time motion capture system, gesture recognition, and a virtual environment development suite (Virtools) to create a true virtual theatrical performance environment. In the paper, we will present the various concepts developed so far and an example of a virtual theatrical performance called Trickster at the Intersection that was presented during Smart Graphics 2010 at Canada's Banff Centre.
Sink equilibria and convergence

We introduce the concept of a sink equilibrium. A sink equilibrium is a strongly connected component with no outgoing arcs in the strategy profile graph associated with a game. The strategy profile graph has a vertex set induced by the set of pure strategy profiles; its arc set corresponds to transitions between strategy profiles that occur with nonzero probability. (Here our focus will just be on the special case in which the strategy profile graph is actually a best response graph; that is, its arc set corresponds exactly to best response moves that result from myopic or greedy behaviour). We argue that there is a natural convergence process to sink equilibria in games where agents use pure strategies. This leads to an alternative measure of the social cost of a lack of coordination, the price of sinking, which measures the worst case ratio between the value of a sink equilibrium and the value of the socially optimal solution. We define the value of a sink equilibrium to be the expected social value of the steady state distribution induced by a random walk on that sink. We illustrate the value of this measure in three ways. Firstly, we show that it may more accurately reflects the inefficiency of uncoordinated solutions in competitive games when the use of pure strategies is the norm. In particular, we give an example (a valid-utility game) in which the game converges to solutions which are a factor n worse than socially optimal. The price of sinking is indeed n, but the price of anarchy is close to 1. Secondly, sink equilibria always exist. Thus, even in games in which pure strategy Nash equilibria (PSNE) do not exist, we can still calculate the price of sinking. Thirdly, we show that bounding the price of sinking can have important implications for the speed of convergence to socially good solutions in games where the agents make best response moves in a random order. We present two examples to illustrate our ideas. (i) Unsplittable selfish routing (and weighted congestion games):we prove that the price of sinking for the weighted unsplittable flow version of the selfish routing problem (for bounded-degree polynomial latency functions) is at most O(2/sup 2d/ d/sup 2d + 3/). In comparison, we give instances of these games without any PSNE. Moreover, our proof technique implies fast convergence to socially good (approximate) solutions. This is in contrast to the negative result of Fabrikant, Papadimitriou, and Talwar (2004) showing the existence of exponentially long best-response paths. (ii) Valid-utility games: we show that for valid-utility games the price of sinking is at most n+1; thus the worst case price of sinking in a valid-utility game is between it and n+1. We use our proof to show fast convergence to constant factor approximate solutions in basic-utility games. In addition, we present a hardness result which shows that, in general, there might be states that are exponentially far from any sink equilibrium in valid-utility games. We prove this by showing that the problem of finding a sink equilibrium (or a PSNE) in valid-utility games is PLS-complete.
Relay Performance During Major System Disturbances

Power systems in the United States and abroad experienced several wide-area disturbances in the last 15 years including the largest blackout on August 14, 2003, in the Midwest and Northeast U.S. and Ontario, Canada, which impacted millions of customers. On September 28, 2003, the Italian network was separated from the rest of Europe, and the whole country of Italy fell into darkness. The July 2, 1996, and August 10, 1996, major system disturbances in the western U.S. impacted millions of customers. All of these disturbances caused considerable loss of generation and loads and had a tremendous impact on customers and the economy in general. Typically, these disturbances take place when power systems are heavily loaded, are operated outside their intended design limits, and experience multiple outages within a short period of time. These wide-area disturbances are typically characterized by large power oscillations between neighboring utility systems, low network voltages, and consequent voltage or angular instability. The aim of this paper is to explain which relay systems are most prone to operate during stressed system conditions, and why relay systems operate, to share experiences and lessons learned from the past, and to suggest protection system improvements to lessen the impact of blackouts and hopefully lead us toward their prevention in the future