权力迁移与人本精神:算法式新闻分发的技术伦理

以算法技术进行分发的新闻在人们的信息接触中扮演着越来越重要的角色,在满足个性化需求、增大用户黏性的同时,算法式分发新闻也引发了假新闻泛滥、信息偏食、信息茧房、回音室等不良后果,带来争议。作为新兴信息技术的算法究竟是由什么因素所决定的,算法的技术实践与公共信息生产之间的关系该如何处理?本文试图从算法式分发新闻的现状入手,挖掘潜藏在技术黑箱背后的价值理念。

现实理性:一个理解经济行为的框架

该文将人类理性的现实表现作为理解经济行为的框架。该框架强调,主观上人类有效用最大化的追求,但由于感知觉和思维加工能力的缺陷,行为表现经常偏离理论理性。文章从认知心理学的角度介绍Kahneman和Tversky的主要研究成果,包括影响最大的前景理论,其他有关算法式和偏误的研究,以及决策和情绪的关系。文章的最后还介绍对Kahneman和Tversky的批评。

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

Deformation mechanism of cold ring rolling in view of texture evolution predicted by a newly proposed polycrystal plasticity model

An explicit polycrystal plasticity model was proposed to investigate the deformation mechanism of cold ring rolling in view of texture evolution. The model was created by deducing a set of linear incremental controlling equations within the framework of crystal plasticity theory. It was directly solved by a linear algorithm within a two-level procedure so that its efficiency and stability were guaranteed. A subroutine VUMAT for ABAQUS/Explicit was developed to combine this model with the 3D FE model of cold ring rolling. Results indicate that the model is reliable in predictions of stress-strain response and texture evolution in the dynamic complicated forming process; the shear strain in RD of the ring is the critical deformation mode according to the sharp Goss component （{110}？100？） of deformed ring; texture and crystallographic structure of the ring blank do not affect texture type of the deformed ring;texture evolves rapidly at the later stage of rolling, which results in a dramatically increasing deformation of the ring.

INCREMENTAL AUGMENT ALGORITHM BASED ON REDUCED Q-MATRIX

Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.

Clause-based enhancing mode for tableau algorithm for ALCN

As the tableau algorithm would produce a lot of description overlaps when judging the satisfiabilities of concepts（thus wasting much space）,a clause-based enhancing mode designed for the language ALCN is proposed.This enhancing mode constructs a disjunctive normal form on concept expressions and keeps only one conjunctive clause,and then substitutes the obtained succinctest conjunctive clause for sub-concepts set in the labeling of nodes of a completion tree constructed by the tableau algorithm （such a process may be repeated as many times as needed）.Due to the avoidance of tremendous descriptions redundancies caused by applying ∩- and ∪-rules of the ordinary tableau algorithm,this mode greatly improves the spatial performance as a result.An example is given to demonstrate the application of this enhancing mode and its reduction in the cost of space. Results show that the improvement is very outstanding.

HEURISTIC STUDY OF FLOWSHOP SCHEDULING TO MINIMIZE MEAN FLOW TIME WITH LOT TRANSFER CONSIDERED

Lot scheduling problem with idle time transfer between processes to minimize mean flow time is very important because to minimize mean flow time is to minimize work in process. But the problem is NP hard and no polynomial algorithm exists to guarantee optimal solution. Based the analysis the mathematical structure of the problem, the paper presents a new heuristic algorithm. Computer simulation shows that the proposed heuristic algorithm performs well in terms of both quality of solution and execution speed.

PARAMETER IDENTIFICATION OF LUGRE FRICTION MODEL FOR FLIGHT SIMULATION SERVO SYSTEM BASED ON ANT COLONY ALGORITHM

In light of the high nonlinearity of LuGre friction model, a novel method based on ant colony algorithm(ACA) for identifying the friction parameters of flight simulation servo system is proposed. ACA is a parallelized bionic optimization algorithm inspired from the behavior of real ants, and a kind of positive feedback mechanism is adopted in ACA. On the basis of brief introduction of LuGre friction model, a method for identifying the static LuGre friction parameters and the dynamic LuGre friction parameters using ACA is derived. Finally, this new friction parameter identification scheme is applied to a electric-driven flight simulation servo system with high precision. Simulation and application results verify the feasibility and the effectiveness of the scheme. It provides a new way to identify the friction parameters of LuGre model.

Better Initial Placement Algorithm for Large-Scale Mixed-Mode Detailed Placement

An algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells IC design.Due to the limitation of computing complexity,an effective and efficient initial placement is very important for detailed placement.Novelty of this algorithm lies in a better solution at initial stage by using network flow method to satisfy row capacity constraint and the thought of linear placement problem(LPP) to resolve overlaps.Moreover,divide and conquer strategy and other simplified methods are adopted to minimize complexity.Experimental results show that the algorithm can get an average of 16% wire length improvement on PAFLO in reasonable CPU time.

Reconstruction of shock wave pressure field based on distributed test system

A new distributed test system composed of multiple test nodes was designed by adopting storage test technology to test shock waves in explosion field. The advantage of the system is the application of sensor lattice whose rise time is microsecond level, which can quickly response to transient shock wave signals. In order to reduce dynamic response error, shock tube is employed to conduct dynamic calibration on the system. The overpressure peak values of the explosion shock wave collected by sensor lattice were used to construct a shock wave pressure field with B-spline interpolation algorithm.

Parallel EOI algorithm with different insertion schemes

A parallel embedding overlapped iterative (EOI) algorithm about classicimplicit equations with asymmetric Saul'yev schemes (CIS-EOI) to solve one-dimensional diffusionequations is discussed to improve the properties of the segment classic implicit iterative (SCII)algorithm. The structure of CIS-EOI method is given and the stability of scheme and convergence ofiteration are proved by matrix method. The property of gradual-approach convergence is alsodiscussed. It has been shown that the convergent rate is faster and the property of gradual-approachconvergence also becomes better with the increasing of the net point in subsystems than with theSCII algorithm. The simulation examples show that the parallel iterative algorithm with a differentinsertion scheme CIS-EOI is more effective.

Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities

This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ＂Error bounds for proximal point subproblems and associated inexact proximal point algorithms＂ published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size,

Limit equilibrium stability analysis of slopes under external loads

Two calculation modes for the effect of external load on slope stability, i.e., mode I in which the external load is thought to act on slope surface, and mode II in which the external load is thought to act on slip surface along the force action line, were considered. Meanwhile, four basic distribution patterns of external load were used, of which complex external loads could be composed. In analysis process, several limit equilibrium methods, such as Swedish method, simplified Bishop method, simplified Janbu method, Spencer method, Morgenstern-Price(M-P) method, Sarma method, and unbalanced thrust method, were also adopted to contrast their differences in slope stability under the external load. According to parametric analysis, some conclusions can be obtained as follows:(1) The external load, with the large magnitude, small inclination angle, and acting position close to the slope toe,has more positive effect on slope stability;(2) The results calculated using modes I and II of external load are similar, indicating that the calculation mode of external load has little influence on slope stability;(3) If different patterns of external loads are equivalent to each other, their slope stability under these external loads are the same, and if not, the external load leads to the better slope stability,as action position of the resultant force for external load is closer to the lower sliding point of slip surface.

Rock burst induced by roof breakage and its prevention

Based on the research on rock burst phenomenon induced by the breakage of thick and hard roof around roadways and working faces in coal mines, a criterion of rock burst induced by roof breakage （RBRB） was proposed and the model was built. Through the model, a method calculating the varied stresses induced by roof breakage in support objects and coal body was proposed and a unified formula was derived for the calculation of stress increment on support objects and coal body under different breaking forms of roof. Whilst the formula for calculating dynamic load was derived by introducing dynamic index Kd. The formula was verified in Huating Mine by stress measurement. According to the formula for stress increment calculating, the sensitivities of dynamic load parameters were further studied. The results show that the thickness and breaking depth of roof, width of support objeet are the sensitive factors. Based on the discussion of the model, six associated effective methods for rock burst prevention are obtained.

Heuristic Genetic Algorithm for Discretization of Continuous Attributes in Rough Set Theory

Discretization based on rough set theory aims to seek the possible minimum number of the cut set without weakening the indiscemibility of the original decision system. Optimization of discretization is an NP-complete problem and the genetic algorithm is an appropriate method to solve it. In order to achieve optimal discretization, first the choice of the initial set of cut set is discussed, because a good initial cut set can enhance the efficiency and quality of the follow-up algorithm. Second, an effective heuristic genetic algorithm for discretization of continuous attributes of the decision table is proposed, which takes the significance of cut dots as heuristic information and introduces a novel operator to maintain the indiscernibility of the original decision system and enhance the local research ability of the algorithm. So the algorithm converges quickly and has global optimizing ability. Finally, the effectiveness of the algorithm is validated through experiment.

A Portable Fall Detection and Alerting System Based on k-NN Algorithm and Remote Medicine

This paper presents information on a portable fall detection and alerting system mainly consisting of a custom vest and a mobile smart phone. A wearable motion detection sensor integrated with tri-axial accelerometer, gyroscope and Bluetooth is built into a custom vest worn by elderly. The vest can capture the reluctant acceleration and angular velocity about the activities of daily living(ADLs) of elderly in real time. The data via Bluetooth is then sent to a mobile smart phone running a fall detection program based on k-NN algorithm. When a fall occurs the phone can alert a family member or health care center through a call or emergent text message using a built in Global Positioning System. The experimental results show that the system discriminates falls from ADLs with a sensitivity of 95%, and a specificity of 96.67%. This system can provide remote monitoring and timely help for the elderly.

Wavelet Transform-Based Distributed Compressed Sensing in Wireless Sensor Networks

Wireless Sensor Networks(WSN) are mainly characterized by a potentially large number of distributed sensor nodes which collectively transmit information about sensed events to the sink.In this paper,we present a Distributed Wavelet Basis Generation(DWBG) algorithm performing at the sink to obtain the distributed wavelet basis in WSN.And on this basis,a Wavelet Transform-based Distributed Compressed Sensing(WTDCS) algorithm is proposed to compress and reconstruct the sensed data with spatial correlation.Finally,we make a detailed analysis of relationship between reconstruction performance and WTDCS algorithm parameters such as the compression ratio,the channel Signal-to-Noise Ratio(SNR),the observation noise power and the correlation decay parameter by simulation.The simulation results show that WTDCS can achieve high performance in terms of energy and reconstruction accuracy,as compared to the conventional distributed wavelet transform algorithm.

Supersymmetric Sawada-Kotera-Ramani Equation: Bilinear Approach

In this paper, using the Hirota＇s bilineax method, we consider the N = 1 supersymmetric Sawada-Kotera- Ramani equation and obtain the Bazcklund transformation of it. Its one- and two-supersoliton solutions axe obtained and N-supersoliton solutions for N ≥ 3 are given under the condition kiξj = kjξi.

Provably Secure General Aggregate Signcryption Scheme in the Random Oracle Model

To reduce the size of certificate chains and the ciphertext size in secure routing protocols, a General Aggregate Signcryption Scheme (GASC) is presented. In GASC, an identity-based signcryption algorithm and an aggregate signature algorithm are combined in a practical and secure manner to form the general aggregate signcryption scheme's schema and concept, and a new secure, efficiently general aggregate signcryption scheme, which allows the aggregation of n distinct signcryptions by n distinct users on n distinct messages, is proposed. First, the correction of the GASC scheme is analyzed. Then, we formally prove the security of GASC in the random oracle models IND-CCA2 and EUF-CMA under the DBDHP assumption and the DLP assumption, respectively. The results show that the GASC scheme is not only secure against any probabilistic polynomial-time IND-GASC-CCA2 and EUF-GASC-CMA adversary in the random oracle models but also efficient in pairing ê computations. In addition, the GASC scheme gives an effective remedy to the key escrow problem, which is an inherent issue in IBC by splitting the private key into two parts, and reduces the communication complexity by eliminating the interaction among the senders (signers) before the signcryption generation.

Scheduling algorithm of dual-armed cluster tools with residency time and reentrant constraints

To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.